论文信息 - A Partial Type Checking Algorithm for Type: Type

A Partial Type Checking Algorithm for Type: Type

We 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.

Thorsten Altenkirch | Andreas Abel

[1] Healfdene Goguen. A typed operational semantics for type theory , 1994 .

[2] Thierry Coquand,et al. Remarks on the equational theory of non-normalizing pure type systems , 2006, J. Funct. Program..

[3] Andrew D. Gordon. A Tutorial on Co-induction and Functional Programming , 1994, Functional Programming.

[4] Thorsten Altenkirch,et al. ΠΣ : A Core Language for Dependently Typed Programming , 2008 .

[5] Morten Heine Sørensen,et al. Domain-free pure type systems , 2000, J. Funct. Program..

[6] Thierry Coquand,et al. An Implementation of Type: Type , 2000, TYPES.

[7] Thierry Coquand,et al. Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory , 2008 .

[8] Robert Pollack. The theory of LEGO , 1995 .

[9] Thierry Coquand,et al. An Algorithm for Type-Checking Dependent Types , 1996, Sci. Comput. Program..

[10] Lennart Augustsson,et al. Cayenne—a language with dependent types , 1998, ICFP '98.