Highlights of the history of the lambda-calculus

Authors:
J. Barkley Rosser
Affiliations:
-
Venue:
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Year:
1982

Citing 5
Cited 2

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Correspondence between ALGOL 60 and Church's Lambda-notation: part I

Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Combinatory programming

Combinatory programming

A mechanical proof of the Church-Rosser theorem

Journal of the ACM (JACM)
Conception, evolution, and application of functional programming languages

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper discusses about History of lambda-calculus. The lambda-calculus originated in order to study functions more carefully. It was observed by Frege in 1893 (see van Heijenoort 1967, p.355) that it suffices to restrict attention to functions of a single argument.