Abstract
AbstractA categorical structure suitable for interpreting polymorphic lambda calculus (PLC) is defined, providing an algebraic semantics for PLC which is sound and complete. In fact, there is an equivalence between the theories and the categories. Also presented is a definitional extension of PLC including “subtypes”, for example, equality subtypes, together with a construction providing models of the extended language, and a context for Girard's extension of the Dialectica interpretation.
Publisher
Cambridge University Press (CUP)
Reference24 articles.
1. Semantics for classical AUTOMATH and related systems
2. Abstract families and the adjoint functor theorems
3. Data Types as Lattices
4. The „Dialectica” Interpretation and Categories
5. Girard J.-Y. [1972], Interprétation fonctionnelle et élimination des coupures de l'arithmétique d'ordre supérieur, Thèse de Doctorat d'État, Université Paris-VII, Paris. (Much of this is summarised in Girard [1971], [1973].)
Cited by
81 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献