A kernel language for abstract data types and modules.
Proc. of the international symposium on Semantics of data types
The semantics of second order polymorphic lambda calculus.
Proc. of the international symposium on Semantics of data types
Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
The system F of variable types, fifteen years later
Theoretical Computer Science
Initiality, induction, and computability
Algebraic methods in semantics
Empty types in polymorphic lambda calculus
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Information and Computation - Semantics of Data Types
Models and equality for logical programming
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
On functors expressible in the polymorphic lambda calculus
Logical foundations of functional programming
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
The Semantics of CLEAR, A Specification Language
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Polymorphism is Set Theoretic, Constructively
Category Theory and Computer Science
An investigation of a programming language with a polymorphic type structure.
An investigation of a programming language with a polymorphic type structure.
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
| Hi-index | 0.00 |
A new general notion of model for the polymorphic lambda calculus based on the simple idea of a universe, is proposed. Although impossible in nonconstructive set theory, the notion is unproblematic for constructive sets, yields completeness and initiality theorems, and can be used to unify and relate many different notions of model that have been proposed in the literature, including those that extend the basic calculus with additional features such as fixpoints or a type of all types. Moreover, the polymorphic lambda calculus and Martin-Löf type theory are related by a map of logics. A categorical and initial model semantics is given for the basic calculus and for richer calculi that extend the basic one with fixpoints or with a type of all types.