Monadic augment and generalised short cut fusion

Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monadic programming paradigm by investigating the extent to which monadic computations can be optimised by using generalisations of short cut fusion to eliminate monadic structures whose sole purpose is to "glue together" monadic program components. We make several contributions. First, we show that every inductive type has an associated build combinator and an associated short cut fusion rule. Second, we introduce the notion of an inductive monad to describe those monads that give rise to inductive types, and we give examples of such monads which are widely used in functional programming. Third, we generalise the standard augment combinators and cata/augment fusion rules for algebraic data types to types induced by inductive monads. This allows us to give the first cata/augment rules for some common dat...

• Type: Conference
• Year: 2005
• Where: ICFP
• Authors: Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene
• Keywords: ICFP 2005, Inductive Monads, Monadic Programming Paradigm, Programming Languages, Short Cut Fusion