Lambda Calculus

Erwin Engeler
Additional contact information
Erwin Engeler: ETH-Zentrum, Mathematikdepartment

Chapter § 4 in Foundations of Mathematics, 1993, pp 89-93 from Springer

Abstract: Abstract Let us remind ourselves once again what “combinatory algebra” means: for each term t(x 1,…, x n) there exists an element T in D A , so that for arbitrary M 1,…,M n ∈ D A we have $$ T{M_1}{M_2} \ldots {M_n} = t\left( {{M_1}, \ldots {M_n}} \right); $$ the algorithmic rule becomes a concrete object. It lies in the nature of the subject, that by applications we always pass from a term t to an object T.

Date: 1993
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-78052-3_13

Ordering information: This item can be ordered from
http://www.springer.com/9783642780523

DOI: 10.1007/978-3-642-78052-3_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().