Back to Search
Start Over
Imperative abstractions for functional actions
- Source :
-
Journal of Logic & Algebraic Programming . Nov2010, Vol. 79 Issue 8, p768-793. 26p. - Publication Year :
- 2010
-
Abstract
- Abstract: We elaborate our relational model of non-strict, imperative computations. The theory is extended to support infinite data structures. To facilitate their use in programs, we extend the programming language by concepts such as procedures, parameters, partial application, algebraic data types, pattern matching and list comprehensions. For each concept, we provide a relational semantics. Abstraction is further improved by programming patterns such as fold, unfold and divide-and-conquer. To support program reasoning, we prove laws such as fold–map fusion, otherwise known from functional programming languages. We give examples to show the use of our concepts in programs. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15678326
- Volume :
- 79
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- Journal of Logic & Algebraic Programming
- Publication Type :
- Academic Journal
- Accession number :
- 54100411
- Full Text :
- https://doi.org/10.1016/j.jlap.2010.07.015