Typed lambda calculus

, &
In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 1091--1132 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,758

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Lambda Calculi: A Guide for the Perplexed.Chris Hankin - 1994 - Oxford University Press.
Strong Normalizability of Typed Lambda-Calculi for Substructural Logics.Motohiko Mouri & Norihiro Kamide - 2008 - Logica Universalis 2 (2):189-207.
On proof terms and embeddings of classical substructural logics.Ken-Etsu Fujita - 1998 - Studia Logica 61 (2):199-221.
The lambda calculus: its syntax and semantics.Hendrik Pieter Barendregt - 1981 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Lambda calculus with types.H. P. Barendregt - 2013 - New York: Cambridge University Press. Edited by Wil Dekkers & Richard Statman.
Ordinals and ordinal functions representable in the simply typed lambda calculus.N. Danner - 1999 - Annals of Pure and Applied Logic 97 (1-3):179-201.
Topological Representation of the Lambda-Calculus.Steve Awodey - 2000 - Mathematical Structures in Computer Science 10 (1):81-96.
Kripke-style models for typed lambda calculus.John C. Mitchell & Eugenio Moggi - 1991 - Annals of Pure and Applied Logic 51 (1-2):99-124.
The judgement calculus for intuitionistic linear logic: Proof theory and semantics.Silvio Valentini - 1992 - Mathematical Logic Quarterly 38 (1):39-58.
Proofs of the normalization and Church-Rosser theorems for the typed $\lambda$-calculus.Garrel Pottinger - 1978 - Notre Dame Journal of Formal Logic 19 (3):445-451.
The Church-Rosser theorem for the typed $\lambda$-calculus with surjective pairing.Garrel Pottinger - 1981 - Notre Dame Journal of Formal Logic 22 (3):264-268.
Variable-free formalization of the Curry-Howard theory.William Tait - manuscript
$lambdamu$-Calculus and Bohm's Theorem.Rene David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
The impact of the lambda calculus in logic and computer science.Henk Barendregt - 1997 - Bulletin of Symbolic Logic 3 (2):181-215.
A modern elaboration of the ramified theory of types.Twan Laan & Rob Nederpelt - 1996 - Studia Logica 57 (2-3):243 - 278.

Analytics

Added to PP
2014-01-27

Downloads
25 (#650,061)

6 months
1 (#1,507,095)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Numeration Models of λ‐Calculus.Akira Kanda - 1985 - Mathematical Logic Quarterly 31 (14-18):209-220.
Classes of Numeration Models of λ‐Calculus.Akira Kanda - 1986 - Mathematical Logic Quarterly 32 (19‐24):315-322.
Classes of Numeration Models of λ-Calculus.Akira Kanda - 1986 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (19-24):315-322.
Numeration Models of λ‐Calculus.Akira Kanda - 1985 - Mathematical Logic Quarterly 31 (14‐18):209-220.

Add more citations

References found in this work

Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.
A formulation of the simple theory of types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (2):56-68.
Combinatory logic.Haskell Brooks Curry - 1958 - Amsterdam,: North-Holland Pub. Co..
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
Interpretation of analysis by means of constructive functionals of finite types.Georg Kreisel - 1959 - In A. Heyting (ed.), Constructivity in mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 101--128.

View all 29 references / Add more references