Skip to main content
Conference Proceedings

Combinators and lambda-calculus, a short outline

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1986) 242 LNCS 104-122
DOI: 10.1007/3-540-17184-3_42
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article introduces the basic ideas of combinatory logic and lambda-calculus, to serve as background for the other papers in this volume. Typed and untyped systems are covered.

Cite

CITATION STYLE

APA

Roger Hindley, J. (1986). Combinators and lambda-calculus, a short outline. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 242 LNCS, pp. 104–122). Springer Verlag. https://doi.org/10.1007/3-540-17184-3_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free