Research indexBook chapter
Chapter 14: Lambda Calculus
Kogge
Society for Industrial and Applied Mathematics eBooks1 Jan 2022
NobleIDark:/48914/w1/20260525/50CFB3A1DOI10.1137/1.9781611977295.ch14
Chapter 14: Lambda Calculus
Kogge · Society for Industrial and Applied Mathematics eBooks · 2022 · Subscription
NobleIDark:/48914/w1/20260525/50CFB3A1DOI10.1137/1.9781611977295.ch14
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
All the previous models have assumed that computation is defined in an imperative fashion; each step is choreographed in a precise order with the next. Lambda calculus is the first of a more declarative set of models where this is not the case. In a declarative model the problem to be solved is defined in terms of identifying when a solution has been found and allowing the underlying system to determine which computational steps are done when. The “functions” that perform the computation become “first class objects” in their own right and may be computed just as any other data object may be.