Typed Lambda calculi. S. Abramsky et AL

In S. Abramsky, D. Gabbay & T. Maibaurn (eds.), Handbook of Logic in Computer Science. Oxford University Press. pp. 117--309 (1992)
  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: 91,202

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

Linear realizability and full completeness for typed lambda-calculi.Samson Abramsky & Marina Lenisa - 2005 - Annals of Pure and Applied Logic 134 (2-3):122-168.
Strong Normalizability of Typed Lambda-Calculi for Substructural Logics.Motohiko Mouri & Norihiro Kamide - 2008 - Logica Universalis 2 (2):189-207.
Lambda Calculi: A Guide for the Perplexed.Chris Hankin - 1994 - Oxford University Press.
Remarks on isomorphisms in typed lambda calculi with empty and sum types.Marcelo Fiore, Roberto Di Cosmo & Vincent Balat - 2006 - Annals of Pure and Applied Logic 141 (1):35-50.
Lambda Calculus and Intuitionistic Linear Logic.Simona Ronchi Della Rocca & Luca Roversi - 1997 - Studia Logica 59 (3):417-448.
Typed lambda calculus.Henk P. Barendregt, Wil Dekkers & Richard Statman - 1977 - In Jon Barwise & H. Jerome Keisler (eds.), Handbook of Mathematical Logic. North-Holland Pub. Co.. pp. 1091--1132.
Domains and lambda-calculi.Roberto M. Amadio - 1998 - New York: Cambridge University Press. Edited by P.-L. Curien.
Lectures on the Curry-Howard isomorphism.Morten Heine Sørensen - 2007 - Boston: Elsevier. Edited by Paweł Urzyczyn.
On proof terms and embeddings of classical substructural logics.Ken-Etsu Fujita - 1998 - Studia Logica 61 (2):199-221.
Suggestion for Einstein-Podolsky-Rosen experiments using reactions likee^ + e^ - to Lambda bar Lambda to pi ^ - ppi ^ + bar p.Nils A. Törnqvist - 1981 - Foundations of Physics 11 (1-2):171-177.
Computational Semantics, Type Theory, and Functional Programming.Jan van Eijck - unknown
A Gitik iteration with nearly Easton factoring.William J. Mitchell - 2003 - Journal of Symbolic Logic 68 (2):481-502.
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.
Decomposable Ultrafilters and Possible Cofinalities.Paolo Lipparini - 2008 - Notre Dame Journal of Formal Logic 49 (3):307-312.

Analytics

Added to PP
2014-01-27

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Being Positive About Negative Facts.Mark Jago & Stephen Barker - 2012 - Philosophy and Phenomenological Research 85 (1):117-138.
Proof normalization modulo.Gilles Dowek & Benjamin Werner - 2003 - Journal of Symbolic Logic 68 (4):1289-1316.
Combinatory logic with polymorphic types.William R. Stirton - 2022 - Archive for Mathematical Logic 61 (3):317-343.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references