Standard normalization for infinite typed terms

Bulletin of the Section of Logic 37 (1):11-18 (2008)
  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,682

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

Strong Normalizability of Typed Lambda-Calculi for Substructural Logics.Motohiko Mouri & Norihiro Kamide - 2008 - Logica Universalis 2 (2):189-207.
Strong normalization for typed terms with surjective pairing.A. S. Troelstra - 1986 - Notre Dame Journal of Formal Logic 27 (4):547-550.
Short proofs of normalization for the simply- typed λ-calculus, permutative conversions and Gödel's T.Felix Joachimski & Ralph Matthes - 2003 - Archive for Mathematical Logic 42 (1):59-87.
A reduction rule for Peirce formula.Sachio Hirokawa, Yuichi Komori & Izumi Takeuti - 1996 - Studia Logica 56 (3):419 - 426.
On proof terms and embeddings of classical substructural logics.Ken-Etsu Fujita - 1998 - Studia Logica 61 (2):199-221.
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.
Identity of proofs based on normalization and generality.Kosta Došen - 2003 - Bulletin of Symbolic Logic 9 (4):477-503.
A completeness result for the simply typed λμ-calculus.Karim Nour & Khelifa Saber - 2010 - Annals of Pure and Applied Logic 161 (1):109-118.
Typed lambda-calculus in classical Zermelo-Frænkel set theory.Jean-Louis Krivine - 2001 - Archive for Mathematical Logic 40 (3):189-205.
Taming the Infinite. [REVIEW]Michael Potter - 1996 - British Journal for the Philosophy of Science 47 (4):609-619.
Church-Rosser theorem for typed functional systems.George Koletsos - 1985 - Journal of Symbolic Logic 50 (3):782-790.
Infinite set unification with application to categorial grammar.Jacek Marciniec - 1997 - Studia Logica 58 (3):339-355.
Computational Semantics, Type Theory, and Functional Programming.Jan van Eijck - unknown

Analytics

Added to PP
2013-12-26

Downloads
15 (#966,573)

6 months
1 (#1,501,182)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references