The Church-Rosser theorem for the typed $\lambda$-calculus with surjective pairing

Notre Dame Journal of Formal Logic 22 (3):264-268 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,880

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Strong normalization for typed terms with surjective pairing.A. S. Troelstra - 1986 - Notre Dame Journal of Formal Logic 27 (4):547-550.
Term-Space Semantics of Typed Lambda Calculus.Ryo Kashima, Naosuke Matsuda & Takao Yuyama - 2020 - Notre Dame Journal of Formal Logic 61 (4):591-600.
The Church Rosser theorem for strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (4):299-302.
Weak typed Böhm theorem on IMLL.Satoshi Matsuoka - 2007 - Annals of Pure and Applied Logic 145 (1):37-90.
Lambda-calculus terms that reduce to themselves.Bruce Lercher - 1976 - Notre Dame Journal of Formal Logic 17 (2):291-292.
Variable binding term operators in $\lambda $-calculus.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (4):876-878.
Coherence in category theory and the Church-Rosser property.C. Barry Jay - 1991 - Notre Dame Journal of Formal Logic 33 (1):140-143.

Analytics

Added to PP
2010-08-24

Downloads
26 (#863,747)

6 months
10 (#436,689)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Consistency of a $\lambda$ -theory with $n$ -tuples and easy term.Ying Jiang - 1995 - Archive for Mathematical Logic 34 (2):79-96.

Add more citations

References found in this work

No references found.

Add more references