Continuous normalization for the lambda-calculus and Gödel’s T

&
Annals of Pure and Applied Logic 133 (1-3):39-72 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2004.10.003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

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

Continuous normalization for the lambda-calculus and Gödel’s T.Klaus Aehlig & Felix Joachimski - 2005 - Annals of Pure and Applied Logic 133 (1-3):39-71.
A strong normalization result for classical logic.Franco Barbanera & Stefano Berardi - 1995 - Annals of Pure and Applied Logic 76 (2):99-116.
Normal functors, power series and lambda-calculus.Jean-Yves Girard - 1988 - Annals of Pure and Applied Logic 37 (2):129.
Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms.Giuseppe Longo - 1983 - Annals of Pure and Applied Logic 24 (2):153.
Some results on extensionality in lambda calculus.Benedetto Intrigila & Richard Statman - 2005 - Annals of Pure and Applied Logic 132 (2-3):109-125.
The λ μ T -calculus.Herman Geuvers, Robbert Krebbers & James McKinna - 2013 - Annals of Pure and Applied Logic 164 (6):676-701.
Strong normalization of a symmetric lambda calculus for second-order classical logic.Yoriyuki Yamagata - 2002 - Archive for Mathematical Logic 41 (1):91-99.
J. Longley The sequentially realizable functionals 1 ZM Ariola and S. Blom Skew confluence and the lambda calculus with letrec 95.W. Gasarch, G. R. Hird, D. Lippe, G. Wu, A. Dow, J. Zhou & G. Japaridze - 2002 - Annals of Pure and Applied Logic 117 (1-3):169-201.
Scattered toposes.Leo Esakia, Mamuka Jibladze & Dito Pataraia - 2000 - Annals of Pure and Applied Logic 103 (1-3):97-107.
Inductive types and type constraints in the second-order lambda calculus.Nax Paul Mendler - 1991 - Annals of Pure and Applied Logic 51 (1-2):159-172.

Analytics

Added to PP
2014-03-06

Downloads
3 (#1,729,579)

6 months
8 (#415,230)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the computational complexity of cut-reduction.Klaus Aehlig & Arnold Beckmann - 2010 - Annals of Pure and Applied Logic 161 (6):711-736.

Add more citations

References found in this work

Notation systems for infinitary derivations.Wilfried Buchholz - 1991 - Archive for Mathematical Logic 30 (5-6):277-296.
Exact Bounds for lengths of reductions in typed λ-calculus.Arnold Beckmann - 2001 - Journal of Symbolic Logic 66 (3):1277-1285.
Finite notations for infinite terms.Helmut Schwichtenberg - 1998 - Annals of Pure and Applied Logic 94 (1-3):201-222.

View all 6 references / Add more references