The type theory ¿P corresponds to the logical framework LF. In this paper we present ¿H, a variant of ¿P where convertibility is not implemented by means of the customary conversion rule, but instead type conversions are made explicit in the terms. This means that the time to type check a ¿H term is proportional to the size of the term itself. We define an erasure map from ¿H to ¿P, and show that through this map the type theory ¿H corresponds exactly to ¿P: any ¿H judgment will be erased to a ¿P judgment, and conversely each ¿P judgment can be lifted to a ¿H judgment. We also show a version of subject reduction: if two ¿H terms are provably convertible then their types are also provably convertible
The Edinburgh Logical Framework LF was introduced both as a general theory of logics and as a metala...
In this paper, we present an existing and formalized type theory (UTT) as a logical framework. We co...
We propose a refinement of the type theory underlying the LF logical framework by a form of subtypes...
The type theory ¿P corresponds to the logical framework LF. In this paper we present ¿H, a variant o...
AbstractThe type theory λP corresponds to the logical framework LF. In this paper we present λH, a v...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
We define type theory with explicit conversions. When type checking a term in normal type theory, th...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
We present a variant of the linear logical framework LLF that avoids the restriction that well-typed...
... In this paper we present a new, type-directed equivalence algorithm for the LF type theory that ...
this paper we present a new, type-directed equivalence algorithm for the LF type theory that overcom...
Abstract. Refinement types sharpen systems of simple and dependent types by offering expressive mean...
The Edinburgh Logical Framework LF was introduced both as a general theory of logics and as a metala...
In this paper, we present an existing and formalized type theory (UTT) as a logical framework. We co...
We propose a refinement of the type theory underlying the LF logical framework by a form of subtypes...
The type theory ¿P corresponds to the logical framework LF. In this paper we present ¿H, a variant o...
AbstractThe type theory λP corresponds to the logical framework LF. In this paper we present λH, a v...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
We define type theory with explicit conversions. When type checking a term in normal type theory, th...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
We present a variant of the linear logical framework LLF that avoids the restriction that well-typed...
... In this paper we present a new, type-directed equivalence algorithm for the LF type theory that ...
this paper we present a new, type-directed equivalence algorithm for the LF type theory that overcom...
Abstract. Refinement types sharpen systems of simple and dependent types by offering expressive mean...
The Edinburgh Logical Framework LF was introduced both as a general theory of logics and as a metala...
In this paper, we present an existing and formalized type theory (UTT) as a logical framework. We co...
We propose a refinement of the type theory underlying the LF logical framework by a form of subtypes...