A Partial Type Checking Algorithm for Type: Type

Authors:
Andreas Abel;Thorsten Altenkirch
Affiliations:
Institut für Informatik, Ludwigs-Maximilians-Universität München, Oettingenstraíe 67, D-80538 München, Germany;School of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, United Kingdom
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 7
Cited 0

An algorithm for type-checking dependent types

Science of Computer Programming - Special issue on mathematics of program construction
Cayenne—a language with dependent types

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
An Implementation of Type: Type

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Domain-free pure type systems

Journal of Functional Programming
Remarks on the equational theory of non-normalizing pure type systems

Journal of Functional Programming
Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Justifying algorithms for βη-conversion

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze a partial type checking algorithm for the inconsistent domain-free pure type system Type:Type (@l@?). 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.