Pottinger, Garrel The Church-Rosser theorem for the typed lambda-calculus with pairing pairing. (English) Zbl 0476.03026 Notre Dame J. Formal Logic 22, 264-268 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 12 Documents MSC: 03B40 Combinatory logic and lambda calculus Keywords:Church-Rosser theorem; typed and type-free combinatory systems; typed lambda-calculus with pairing and projection constants Citations:Zbl 0423.03009 PDF BibTeX XML Cite \textit{G. Pottinger}, Notre Dame J. Formal Logic 22, 264--268 (1981; Zbl 0476.03026) Full Text: DOI OpenURL