AbstractWe analyze a partial type checking algorithm for the inconsistent domain-free pure type system Type:Type (λ⁎). We show that the algorithm is sound and partially complete using a coinductive specification of algorithmic equality. This entails that the algorithm will only diverge due to the presence of diverging computations, in particular it will terminate for all typeable terms
Only can totally defined functions be introduced in conventional dependently typed systems and such ...
Definitional equality, a.k.a conversion,for a type theory with a decidable type checking is the simp...
AbstractWe consider here a number of variations on System F that are predicative second-order system...
We present an approach to support partiality in type-level computation without compromising expressi...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
AbstractWe present a simple type-checker for a language with dependent types and let expressions, wi...
This work is licensed under a Creative Commons Attribution 4.0 International License.Functional prog...
AbstractIn this paper we define a type inference semi-algorithm for singly sorted pure type systems....
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
Type theory should be able to handle its own meta-theory, both to justify its foundational claims an...
Partial types for the λ-calculus were introduced by >Thatte in 1988 as a means of typing objects tha...
AbstractAs a partial solution to the problem of combining static and dynamic typing in a language wi...
We describe a derivational approach to proving the equivalence of different representations of a typ...
AbstractAn algorithm to decide the emptiness of a regular type expression with set operators given a...
International audienceThere are two usual ways to describe equality in a dependent typing system, on...
Only can totally defined functions be introduced in conventional dependently typed systems and such ...
Definitional equality, a.k.a conversion,for a type theory with a decidable type checking is the simp...
AbstractWe consider here a number of variations on System F that are predicative second-order system...
We present an approach to support partiality in type-level computation without compromising expressi...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
AbstractWe present a simple type-checker for a language with dependent types and let expressions, wi...
This work is licensed under a Creative Commons Attribution 4.0 International License.Functional prog...
AbstractIn this paper we define a type inference semi-algorithm for singly sorted pure type systems....
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
Type theory should be able to handle its own meta-theory, both to justify its foundational claims an...
Partial types for the λ-calculus were introduced by >Thatte in 1988 as a means of typing objects tha...
AbstractAs a partial solution to the problem of combining static and dynamic typing in a language wi...
We describe a derivational approach to proving the equivalence of different representations of a typ...
AbstractAn algorithm to decide the emptiness of a regular type expression with set operators given a...
International audienceThere are two usual ways to describe equality in a dependent typing system, on...
Only can totally defined functions be introduced in conventional dependently typed systems and such ...
Definitional equality, a.k.a conversion,for a type theory with a decidable type checking is the simp...
AbstractWe consider here a number of variations on System F that are predicative second-order system...
DOI
Add to ORKG