Abstract
AbstractProgramming languages often come with type systems. Some of these are simple, others are sophisticated. As a stylistic representation of types in programming languages several versions of typed lambda calculus are studied. During the last 20 years many of these systems have appeared, so there is some need of classification. Working towards a taxonomy, Barendregt (1991) gives a fine-structure of the theory of constructions (Coquand and Huet 1988) in the form of a canonical cube of eight type systems ordered by inclusion. Berardi (1988) and Terlouw (1988) have independently generalized the method of constructing systems in the λ-cube. Moreover, Berardi (1988, 1990) showed that the generalized type systems are flexible enough to describe many logical systems. In that way the well-knownpropositions-as-typesinterpretation obtains a nice canonical form.
Publisher
Cambridge University Press (CUP)
Reference43 articles.
1. The calculus of constructions
2. On understanding types, data abstraction, and polymorphism
3. Barendregt H. P. and Dekkers W. 1990. Typed lambda calculi.
4. Barendsen E. 1989. Representation of Logic, Data Types and Recursive Functions in Typed Lambda Calculi. Masters thesis, University of Nijmegen, Netherlands.
Cited by
103 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Normalizable Types;Proceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development;2024-08-28
2. Internalizing Indistinguishability with Dependent Types;Proceedings of the ACM on Programming Languages;2024-01-05
3. Some Remarks About Dependent Type Theory;The French School of Programming;2023-10-11
4. An intuitionistic set-theoretical model of fully dependent CC;Mathematical Structures in Computer Science;2023-01
5. A Sound Definitional Interpreter for a Simply Typed Functional Language;Axioms;2022-12-30