Programming Language Concepts - The Lambda Calculus Approach


Fokkinga, Maarten M. (1987) Programming Language Concepts - The Lambda Calculus Approach. In: P.R.J. Asveld & A. Nijholt (Eds.), Essays on concepts, formalisms, and tools. CWI Tract, 42 . CWI, Amsterdam, The Netherlands, pp. 129-162. ISBN 9789061963264

open access
Abstract: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.
Item Type:Book Section
Additional information:Imported from EWI/DB PMS [db-utwente:inbo:0000003419]
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page