A principled approach to programming with nested types in Haskell

Patricia Johann, Neil Ghani

Research output: Contribution to journalArticle

2 Citations (Scopus)
66 Downloads (Pure)

Abstract

Initial algebra semantics is one of the cornerstones of the theory of modern functional programming languages. For each inductive data type, it provides a Church encoding for that type, a build combinator which constructs data of that type, a fold combinator which encapsulates structured recursion over data of that type, and a fold/build rule which optimises modular programs by eliminating from them data constructed using the buildcombinator, and immediately consumed using the foldcombinator, for that type. It has long been thought that initial algebra semantics is not expressive enough to provide a similar foundation for programming with nested types in Haskell. Specifically, the standard folds derived from initial algebra semantics have been considered too weak to capture commonly occurring patterns of recursion over data of nested types in Haskell, and no build combinators or fold/build rules have until now been defined for nested types. This paper shows that standard folds are, in fact, sufficiently expressive for programming with nested types in Haskell. It also defines buildcombinators and fold/build fusion rules for nested types. It thus shows how initial algebra semantics provides a principled, expressive, and elegant foundation for programming with nested types in Haskell.
Original languageEnglish
Pages (from-to)155-189
Number of pages35
JournalHigher-Order and Symbolic Computation
Volume22
Issue number2
DOIs
Publication statusPublished - 30 Jun 2009

    Fingerprint

Keywords

  • initial algebras
  • nested types
  • short cut fusion
  • structured recursion
  • combinators
  • data type
  • functional programming languages
  • fusion rule
  • Haskell
  • modular programs
  • recursions

Cite this