Abstract
In this paper, an extension of Pure Type Systems (PTS’s) with definitions is presented. We prove this extension preserves many of the properties of PTS’s. The main result is a proof that for many PTS’s, including the Calculus of Constructions, this extension preserves strong normalisation.
Cite
CITATION STYLE
APA
Severi, P., & Poll, E. (1994). Pure type systems with definitions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 813 LNCS, pp. 316–328). Springer Verlag. https://doi.org/10.1007/3-540-58140-5_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free