Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

by: Erik Meijer, Maarten Fokkinga, Ross Paterson

edited by: J Hughes

Vol. 523 (1991), pp. 124-144.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

rgrig, jrw, tautologico, MattOConnor, rahul, ergodique, kavabean, damaru, pintman, croys, roi, msakai, lomeo, scis0000001, brothers, calvins, armintroy, dhag, Porges, conal, cdiggins, SRL (group), SRG_at_UCD (group), complogic (group), mmarcus, jimburton, Lambda the Ultimate (group), namin, dvgb, jkominek, pedagand

Find related articles with these CiteULike tags

algebra, apl, calculational, category, category-theory, coding, computation, deforestation, fold, folding, func, functional, functional-programming, haskell, higher-order, higher-order-functions, lambda-calculus, language, languages, math, no-tag, plt, programming, programminglanguagetheory, theory, types

Abstract

We 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...

@incollection{citeulike:333370, abstract = {We 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...}, address = {Berlin}, author = {Meijer, Erik and Fokkinga, Maarten and Paterson, Ross }, booktitle = {Proceedings 5th ACM Conf.\ on Functional Programming Languages and Computer Architecture, {FPCA}'91, Cambridge, {MA}, {USA}, 26--30 Aug 1991}, citeulike-article-id = {333370}, editor = {Hughes, J. }, keywords = {plt, programminglanguagetheory}, pages = {124--144}, posted-at = {2007-07-02 08:34:07}, priority = {5}, publisher = {Springer-Verlag}, title = {Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire}, url = {http://citeseer.ist.psu.edu/meijer91functional.html}, volume = {523}, year = {1991} }

RIS record

TY - CHAP ID - citeulike:333370 L3 - citeulike-article-id:333370 TI - Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire T2 - Proceedings 5th ACM Conf.\ on Functional Programming Languages and Computer Architecture, {FPCA}'91, Cambridge, {MA}, {USA}, 26--30 Aug 1991 VL - 523 SP - 124 EP - 144 AD - Berlin PB - Springer-Verlag N2 - We 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... KW - plt KW - programminglanguagetheory AU - Meijer, Erik AU - Fokkinga, Maarten AU - Paterson, Ross A2 - Hughes, J PY - 1991/// UR - http://citeseer.ist.psu.edu/meijer91functional.html ER -

RIS BibTeX