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.
supported by the Dutch organization for scientific research (NWO).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H.P. Barendregt. Lambda calculi with types. In D. M. Gabbai, S. Abramsky, and T. S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 1. Oxford University Press, 1992.
Thierry Coquand and Gérard Huet. The Calculus of Constructions. Information and Computation, 76:95–120, 1988.
Thierry Coquand. Une Theorie des Constructions. PhD thesis, Université Paris VII, 1985.
Thierry Coquand. An analysis of Girard's paradox. In Logic in Computer Science, pages 227–236. IEEE, 1986.
N.G. de Bruijn. A survey of the project AUTOMATH. In J.P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, pages 579–606. Academic Press, 1980.
Roel de Vrijer. A direct proof of the finite developments theorem. Journal of Symbolic Logic, 50(2):339–343, 1985.
G. Dowek et al. The Coq proof assistant version 5.6, users guide. Rapport de Recherche 134, INRIA, 1991.
J.-Y. Girard. Interprétation fonctionelle et élimination des coupures de l'arithmétique d'ordre supérieur. PhD thesis, Université Paris VII, 1972.
Herman Geuvers and Mark-Jan Nederhof. A modular proof of strong normalisation for the Calculus of Constructions. Journal of Functional Programming, 1(2):155–189, 1991.
Leen Helmink. Goal directed proof construction in type theory. In Procs. of the first Workshop on Logical Frameworks. Cambridge University Press, 1991.
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143–184, 1993.
Zhaohui Luo and Robert Pollack. LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211, LFCS-University of Edinburgh, 1992.
Z. Luo. ECC, the Extended Calculus of Constructions. In Logic in Computer Science, pages 386–395. IEEE, 1989.
John C. Reynolds. Towards a theory of type structure. In Programming Symposium: Colloque sur la Programmation, volume 19 of LNCS, pages 408–425. Springer, 1974.
Paula Severi and Erik Poll. Pure type systems with definitions. Computing Science Note (93/24), Eindhoven University of Technology, 1993.
D. T. van Daalen. The Language Theory of Automath. PhD thesis, Eindhoven University of Technology, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Severi, P., Poll, E. (1994). Pure Type Systems with definitions. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_30
Download citation
DOI: https://doi.org/10.1007/3-540-58140-5_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58140-6
Online ISBN: 978-3-540-48442-4
eBook Packages: Springer Book Archive