@MISC{Barthe93type-checkinginjective, author = {Gilles Barthe}, title = {Type-checking Injective Pure Type Systems}, year = {1993} }

Bookmark

OpenURL

Abstract

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 pseudo-context and M is a pseudo-term, 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 type-checking 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