Adobe PDF (2.59 MB)
Title Details:
The Internals of Functional Programming
Authors: Stamatopoulos, Panagiotis
Reviewer: Rontogiannis, Panagiotis
Subject: MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > PROGRAMMING LANGUAGES
MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > INTELLIGENT SYSTEMS > BASIC KNOWLEDGE REPRESENTATION AND REASONING
MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > PROGRAMMING LANGUAGES > LOGIC PROGRAMMING
Description:
Abstract:
In this chapter, lambda calculus is introduced, a mathematical system that forms the foundation of all modern functional programming languages. The chapter provides a brief description of combinators, which are built-in functions in lambda calculus that can also be expressed as lambda abstractions. It also examines the two standard reduction sequences in lambda calculus: beta reduction and normal reduction, and presents the Church-Rosser theorems. Finally, the chapter demonstrates how lambda expressions in lambda calculus can be represented as graphs and how a reduction process can be applied to these graphs to simplify them.
Linguistic Editors: Xifara, Foteini
Technical Editors: Papavasileiou, Spyridon
Graphic Editors: Papavasileiou, Spyridon
Type: Chapter
Creation Date: 2015
Item Details:
License: http://creativecommons.org/licenses/by-nc-nd/3.0/gr
Handle http://hdl.handle.net/11419/3598
Bibliographic Reference: Stamatopoulos, P. (2015). The Internals of Functional Programming [Chapter]. In Stamatopoulos, P. 2015. Logic and Functional Programming [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/3598
Language: Greek
Is Part of: Logic and Functional Programming
Publication Origin: Kallipos, Open Academic Editions