Add to ORKGA lambda-free logical framework: uses only canonical forms β-short, η-long forms does not use
Abstract — We present a second-order λ-calculus with coercion constraints that generalizes a previou...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
We contribute to the syntactic study of F less-than-or-equal-to, a variant of second order lambda-ca...
We show how coercive subtyping may be added to a lambda-free logical framework, by constructing the ...
We show how coercive subtyping may be added to a lambda-free logical framework, by constructing the ...
We show how coercive subtyping may be added to a lambda-free logical framework, by constructing the ...
We present the definition of the logical framework TF, the Type Framework. TF is a lambda-free logi...
Abstract. We investigate how to add coercive structural subtyping to a type system for simply-typed ...
We present a second-order lambda-calculus with coercion constraints that generalizes a previous exte...
A coding for a (type-free) lambda term M is a lambda term pMq in normal form such that M (and its pa...
The constraint language for lambda structures (CLLS) is a description language for lambda terms. CLL...
We present Plastic, an implementation of LF with Coercive Subtyping, and focus on its implementation...
International audienceThere are several ways to formally represent families of data, such as lambda ...
In this paper, we introduce a General Logical Framework, called GLF, for defining Logical Frameworks...
International audienceThe constraint language for lambda structures (CLLS) is a description language...
Abstract — We present a second-order λ-calculus with coercion constraints that generalizes a previou...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
We contribute to the syntactic study of F less-than-or-equal-to, a variant of second order lambda-ca...
We show how coercive subtyping may be added to a lambda-free logical framework, by constructing the ...
We show how coercive subtyping may be added to a lambda-free logical framework, by constructing the ...
We show how coercive subtyping may be added to a lambda-free logical framework, by constructing the ...
We present the definition of the logical framework TF, the Type Framework. TF is a lambda-free logi...
Abstract. We investigate how to add coercive structural subtyping to a type system for simply-typed ...
We present a second-order lambda-calculus with coercion constraints that generalizes a previous exte...
A coding for a (type-free) lambda term M is a lambda term pMq in normal form such that M (and its pa...
The constraint language for lambda structures (CLLS) is a description language for lambda terms. CLL...
We present Plastic, an implementation of LF with Coercive Subtyping, and focus on its implementation...
International audienceThere are several ways to formally represent families of data, such as lambda ...
In this paper, we introduce a General Logical Framework, called GLF, for defining Logical Frameworks...
International audienceThe constraint language for lambda structures (CLLS) is a description language...
Abstract — We present a second-order λ-calculus with coercion constraints that generalizes a previou...
Decidability of definitional equality and conversion of terms into canonical form play a central rol...
We contribute to the syntactic study of F less-than-or-equal-to, a variant of second order lambda-ca...