Results 1 
2 of
2
Typechecking Injective Pure Type Systems
, 1993
"... Injective Pure Type Systems form a large class of Pure Type Systems for which one can compute by purely syntactic means two sorts elmt(\GammajM ) and sort(\GammajM ), where \Gamma is a pseudocontext and M is a pseudoterm, and such that for every sort s, \Gamma ` M : A \Gamma ` A : s ) elmt(\Gamm ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Injective Pure Type Systems form a large class of Pure Type Systems for which one can compute by purely syntactic means two sorts elmt(\GammajM ) and sort(\GammajM ), where \Gamma is a pseudocontext and M is a pseudoterm, and such that for every sort s, \Gamma ` M : A \Gamma ` A : s ) elmt(\GammajM ) = s \Gamma ` M : s ) sort(\GammajM ) = s By eliminating the problematic clause in the (abstraction) rule in favor of constraints over elmt(:j:) and sort(:j:), we provide a sound and complete typechecking algorithm for injective Pure Type Systems. In addition, we prove Expansion Postponement for a variant of injective Pure Type Systems where the problematic clause in the (abstraction) rule is replaced in favor of constraints over elmt(:j:) and sort(:j:). 1
Existence and uniqueness of normal forms in pure type systems with βηconversion
 Proceedings of CSL'98, volume 1584 of Lecture Notes in Computer Science
, 1999
"... Pure Type Systems (PTS fi s) provide a parametric framework for typedcalculi `a la Church [1, 2, 10, 11]. One important aspect of PTS fi s is to feature a definitional equality based on ficonversion. In some instances however, one desires a stronger ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Pure Type Systems (PTS fi s) provide a parametric framework for typedcalculi `a la Church [1, 2, 10, 11]. One important aspect of PTS fi s is to feature a definitional equality based on ficonversion. In some instances however, one desires a stronger