A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance

Details A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance

2011-02-11

arxiv.org/abs/1102.2405v3

LMCS 7 (2:4) 2011

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-7(2:4)2011

We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluation algorithm. We prove completeness and soundness of the algorithm; and get as a corollary the injectivity of type constructors. Then we give the definition of a correct and complete type-checking algorithm for terms in normal form. We extend the results to proof-irrelevant propositions.

Affiliated with

Also associated with

No associations

Rating

A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-632717