![]() |
CiteULike | ![]() |
tautologico's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wireedited by: J. HughesIn Proceedings 5th ACM Conf.\ on Functional Programming Languages and Computer Architecture, {FPCA}'91, Cambridge, {MA}, {USA}, 26--30 Aug 1991, Vol. 523 (1991), pp. 124-144.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe develop a calculus for lazy functional programming based on recursion operators associated with data type definitions. For these operators we derive various algebraic laws that are useful in deriving and manipulating programs. We shall show that all example functions in Bird and Wadler's "Introduction to Functional Programming" can be expressed using these operators. 1 Introduction Among the many styles and methodologies for the construction of computer programs the Squiggol style in our...
BibTeX record
RIS record