Hindley Roger. Axioms for strong reduction in combinatory logic

Journal of Symbolic Logic 36 (1):171-172 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271572

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Axioms for strong reduction in combinatory logic.Roger Hindley - 1967 - Journal of Symbolic Logic 32 (2):224-236.
A solution to Curry and Hindley’s problem on combinatory strong reduction.Pierluigi Minari - 2009 - Archive for Mathematical Logic 48 (2):159-184.
Combinatory logic. Haskell B. Curry, J. Roger Hindley, and Jonathan P. Seldin. Combinatory logic. Volume II. Studies in logic and the foundations of mathematics, vol. 65. North-Holland Publishing Company, Amsterdam and London 1972, XIV + 520 pp. [REVIEW]Henk Barendregt - 1977 - Journal of Symbolic Logic 42 (1):109-110.
Strong Reduction of Combinatory Calculus with Streams.Koji Nakazawa & Hiroto Naya - 2015 - Studia Logica 103 (2):375-387.
Introduction to combinatory logic.J. Roger Hindley - 1972 - Cambridge [Eng.]: University Press. Edited by B. Lercher & J. P. Seldin.
To H.B. Curry: essays on combinatory logic, lambda calculus, and formalism.Haskell B. Curry, J. Roger Hindley & J. P. Seldin (eds.) - 1980 - New York: Academic Press.
Review: Haskell B. Curry, J. Roger Hindley, Jonathan P. Seldin, Combinatory Logic. [REVIEW]Henk Barendregt - 1977 - Journal of Symbolic Logic 42 (1):109-110.
The decidability of Hindley's axioms for strong reduction.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):237-239.
Introduction to Combinators and (Lambda) Calculus.J. Roger Hindley - 1986 - New York: Cambridge University Press. Edited by J. P. Seldin.
Combinatory Reductions and Lambda Reductions Compared.Roger Hindley - 1977 - Mathematical Logic Quarterly 23 (7‐12):169-180.
On adding (ξ) to weak equality in combinatory logic.Martin W. Bunder, J. Roger Hindley & Jonathan P. Seldin - 1989 - Journal of Symbolic Logic 54 (2):590-607.
Normal Forms in Combinatory Logic.Patricia Johann - 1994 - Notre Dame Journal of Formal Logic 35 (4):573-594.
Analytic combinatory calculi and the elimination of transitivity.Pierluigi Minari - 2004 - Archive for Mathematical Logic 43 (2):159-191.
Combinatory logic.Haskell Brooks Curry - 1958 - Amsterdam,: North-Holland Pub. Co..
Strong reduction and normal form in combinatory logic.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):213-223.

Analytics

Added to PP
2016-06-30

Downloads
8 (#1,283,306)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references