Functional programming with bananas, lenses, envelopes and barbed wire

  • Erik Meijer
  • Maarten Fokkinga
  • Ross Paterson
Conference paper

DOI: 10.1007/3540543961_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 523)
Cite this paper as:
Meijer E., Fokkinga M., Paterson R. (1991) Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes J. (eds) Functional Programming Languages and Computer Architecture. FPCA 1991. Lecture Notes in Computer Science, vol 523. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Erik Meijer
    • 1
  • Maarten Fokkinga
    • 2
  • Ross Paterson
    • 3
  1. 1.Department of InformaticsUniversity of NijmegenNijmegen
  2. 2.CWIAmsterdam & University of TwenteThe Netherlands
  3. 3.Imperial CollegeLondon

Personalised recommendations