Adobe PDF
(524.69 kB)
| Title Details: | |
|
Logic and functional programming |
|
| Authors: |
Stefaneas, Petros Koletsos, Georgios |
| Reviewer: |
Dimitrakopoulos, Konstantinos |
| Description: | |
| Abstract: |
Introduction to lambda calculus. The concept of a function in terms of intension and extension. Abstraction and application. Connection with functional programming and the Lisp language. Beta-reduction and eta-reduction. Weak and strong normalization. The Church–Rosser theorem and the uniqueness of normal form. Computation strategies: call by value and call by name. The leftmost redex reduction strategy. The theorem of developments. Lambda calculus as a general programming framework. Programming in lambda calculus. Church numerals and programs for elementary functions. Representability of all recursive functions. Expressiveness results. Functional programming and the general theory of untyped lambda calculus.
|
| Type: |
Chapter |
| Creation Date: | 2015 |
| Item Details: | |
| License: |
http://creativecommons.org/licenses/by-nc-nd/3.0/gr |
| Handle | http://hdl.handle.net/11419/4528 |
| Bibliographic Reference: | Stefaneas, P., & Koletsos, G. (2015). Logic and functional programming [Chapter]. In Stefaneas, P., & Koletsos, G. 2015. Applications of logic in computer science [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/4528 |
| Language: |
Greek |
| Is Part of: |
Applications of logic in computer science |
| Number of pages |
23 |
| Publication Origin: |
Kallipos, Open Academic Editions |