Sciweavers

8 search results - page 1 / 2
» A Bidirectional Refinement Type System for LF
Sort
View
ENTCS
2008
116views more  ENTCS 2008»
13 years 4 months ago
A Bidirectional Refinement Type System for LF
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
William Lovas, Frank Pfenning
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 4 months ago
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
William Lovas, Frank Pfenning
ENTCS
2008
92views more  ENTCS 2008»
13 years 4 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
ENTCS
2002
91views more  ENTCS 2002»
13 years 4 months ago
Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...
Brigitte Pientka
CORR
2012
Springer
212views Education» more  CORR 2012»
12 years 15 days ago
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...