Elements of programming linguistics. Part I, The lambda calculus and its implementation

The lambda calculus is used as an introduction to programming language concepts, particularly the concepts of functional programming. Both interpreted and compiled implementations of an extended lambda calculus are discussed. They can be adopted to implementations of Pascal and Lisp. It is shown that traditional stack-based run-time structures can be directly derived from the reduction rules of the lambda calculus. (Author)