TY - CHAP

T1 - Programming Language Concepts

T2 - The Lambda Calculus Approach

AU - Fokkinga, Maarten M.

PY - 1987

Y1 - 1987

N2 - The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathematics, but mainly used to study the concepts of algorithm and effective computability. Recently, the Lambda Calculus and related systems acquire attention from Computer Science for another reason too: several important programming language concepts can be explained elegantly and can be studied successfully in the framework of the Lambda Calculi. We show this mainly by means of examples. We address ourselves to interested computer scientists who have no prior knowledge of the Lambda Calculus. The concepts discussed include: parameterization, definitions, recursion, elementary and composite data types, typing, abstract types, control of visibility and life-time, and modules.

AB - The Lambda Calculus is a formal system, originally intended as a tool in the foundation of mathematics, but mainly used to study the concepts of algorithm and effective computability. Recently, the Lambda Calculus and related systems acquire attention from Computer Science for another reason too: several important programming language concepts can be explained elegantly and can be studied successfully in the framework of the Lambda Calculi. We show this mainly by means of examples. We address ourselves to interested computer scientists who have no prior knowledge of the Lambda Calculus. The concepts discussed include: parameterization, definitions, recursion, elementary and composite data types, typing, abstract types, control of visibility and life-time, and modules.

M3 - Chapter

SN - 90-6196-326-5

T3 - CWI Tract

SP - 129

EP - 162

BT - Essays on concepts, formalisms, and tools

A2 - Asveld, P.R.J.

A2 - Nijholt, A.

PB - Centre for Mathematics and Computer Science

CY - Amsterdam, The Netherlands

ER -