Introduction to combinatory logic

Cambridge [Eng.]: University Press. Edited by B. Lercher & J. P. Seldin (1972)
  Copy   BIBTEX

Abstract

Introduction Combinatory logic deals with a class of formal systems designed for studying certain primitive ways in which functions can be combined to form ...

Categories

Keywords

Reprint years

Call number

QA9.H525

ISBN(s)

0521096979   9780521096973

DOI

10.2307/2273051

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,486

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

Introduction to combinatory logic.Sören Stenlund - 1971 - Uppsala,: Uppsala universitetet, Filosofiska föreningen och Filosofiska institutionen.
J. R. Hindley, B. Lercher, and J. P. Seldin. Introduction to combinatory logic. London Mathematical Society lecture note series, no. 7, Cambridge at the University Press, London and New York1972, 170 pp. [REVIEW]Henk Barendregt - 1973 - Journal of Symbolic Logic 38 (3):518.
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.
Roger Hindley. Axioms for strong reduction in combinatory logic. The journal of symbolic logic, vol. 32 , pp. 224–236. - Bruce Lercher. The decidability of Hindley's axioms for strong reduction. The journal of symbolic logic, vol. 32 , pp. 237–239. [REVIEW]Haskell B. Curry - 1971 - Journal of Symbolic Logic 36 (1):171-172.
The Church-Rosser Property in Symmetric Combinatory Logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536 - 556.
Studies in Illative Combinatory Logic.J. P. Seldin - 1968 - V.R.B. Offsetdrukkerij.
Illative combinatory logic without equality as a primitive predicate.M. W. Bunder - 1982 - Notre Dame Journal of Formal Logic 23 (1):62-70.
Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic.M. W. Bunder & W. J. M. Dekkers - 2005 - Notre Dame Journal of Formal Logic 46 (2):181-205.
A property which guarantees termination in weak combinatory logic and subtree replacement systems.Alberto Pettorossi - 1981 - Notre Dame Journal of Formal Logic 22 (4):344-356.
Strong reduction and normal form in combinatory logic.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):213-223.

Analytics

Added to PP
2009-01-28

Downloads
68 (#325,891)

6 months
3 (#1,096,948)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Lambda‐Calculus Models and Extensionality.R. Hindley & G. Longo - 1980 - Mathematical Logic Quarterly 26 (19-21):289-310.
Pairing Without Conventional Restraints.Henk Barendregt - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (19-22):289-306.
Pairing Without Conventional Restraints.Henk Barendregt - 1974 - Mathematical Logic Quarterly 20 (19‐22):289-306.
The Axiomatic Characterization of Functions.B. Schweizer & A. Sklar - 1977 - Mathematical Logic Quarterly 23 (25-26):373-382.
The Axiomatic Characterization of Functions.B. Schweizer & A. Sklar - 1976 - Mathematical Logic Quarterly 23 (25‐26):373-382.

View all 10 citations / Add more citations

References found in this work

No references found.

Add more references