A Partial Type Checking Algorithm for Type:Type

https://doi.org/10.1016/j.entcs.2011.02.013Get rights and content
Under a Creative Commons license
open access

Abstract

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.

Keywords

Dependent Types
Pure Type Systems
Type Checking
Type:Type

Cited by (0)

1

Research supported by FP6 IST coordination action TYPES (510996).

2

Research supported by EPSRC grant Observational Equality For Dependently Typed Programming (EP/C512022/1)