Categorical semantics for higher order polymorphic lambda calculus
Journal of Symbolic Logic 52 (4):969-989 (1987)
| Abstract | A 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 | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJerzy Kotas & N. C. A. Costa (1979). A New Formulation of Discussive Logic. Studia Logica 38 (4):429 - 445.
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
J. Roger Hindley (1986). Introduction to Combinators and [Lambda]-Calculus. Cambridge University Press.
Pierre-Louis Curien (1989). Alpha-Conversion, Conditions on Variables and Categorical Logic. Studia Logica 48 (3):319 - 360.
Chris Hankin (1994). Lambda Calculi: A Guide for the Perplexed. Oxford University Press.
Robert E. Byerly (1982). Recursion Theory and the Lambda-Calculus. Journal of Symbolic Logic 47 (1):67-83.
H. P. Barendregt (1984). The Lambda Calculus: Its Syntax and Semantics. Sole Distributors for the U.S.A. And Canada, Elsevier Science Pub. Co..
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads2 ( #232,684 of 549,753 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
