Programming Language Concepts: The Lambda Calculus Approach

Maarten M. Fokkinga

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

143 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationEssays on concepts, formalisms, and tools
Subtitle of host publicationA collection of papers dedicated to Leo A.M. Verbeek
EditorsP.R.J. Asveld, A. Nijholt
Place of PublicationAmsterdam, The Netherlands
PublisherCentre for Mathematics and Computer Science
Pages129-162
Number of pages34
ISBN (Print)90-6196-326-5
Publication statusPublished - 1987

Publication series

NameCWI Tract
PublisherCWI (Centrum voor Wiskunde en Informatica)
Volume42

Fingerprint Dive into the research topics of 'Programming Language Concepts: The Lambda Calculus Approach'. Together they form a unique fingerprint.

Cite this