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.
|Number of pages||21|
|Publication status||Published - Aug 1991|
|Event||5th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA 1991) - Cambridge, MA, USA|
Duration: 26 Aug 1991 → 30 Aug 1991
|Conference||5th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA 1991)|
|Period||26/08/91 → 30/08/91|
|Other||26-30 Aug 1991|