Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Erik Meijer, J. Hughes (Editor), M.M. Fokkinga, Ross Paterson

Research output: Contribution to conferencePaperpeer-review

360 Citations (Scopus)
28560 Downloads (Pure)

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.
Original languageEnglish
Pages124-144
Number of pages21
DOIs
Publication statusPublished - Aug 1991
Event5th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA 1991) - Cambridge, MA, USA
Duration: 26 Aug 199130 Aug 1991

Conference

Conference5th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA 1991)
Period26/08/9130/08/91
Other26-30 Aug 1991

Keywords

  • EWI-7281
  • IR-56289

Fingerprint

Dive into the research topics of 'Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire'. Together they form a unique fingerprint.

Cite this