Monadic augment and generalised short cut fusion (2005)

by Neil Ghani , Patricia Johann
Venue:Journal of Functional Programming
Citations:15 - 7 self

Documents Related by Co-Citation

193 A Short Cut to Deforestation – Andrew Gill, John Launchbury, Simon L Peyton Jones - 1993
326 Theorems for free! – Philip Wadler - 1989
64 Cheap Deforestation for Non-strict Functional Languages – Andrew John Gill, Andrew John Gill - 1996
17 A generalization of short-cut fusion and its correctness proof – P Johann
91 Shortcut Deforestation in Calculational Form – Akihiko Takano, Erik Meijer - 1995
49 Merging Monads and Folds for Functional Programming – Erik Meijer, Johan Jeuring - 1995
14 Fusion of Recursive Programs with Computational Effects – Alberto Pardo - 2000
8 Initial algebra semantics is enough – Patricia Johann, Neil Ghani - 2007
477 Categories for the Working Mathematician – S MacLane - 1971
42 Shortcut Fusion for Accumulating Parameters Zip-like Functions – Josef Svenningsson - 2002
3 Using Monads to Fuse Recursive Programs (Extended Abstract) – Claus Jürgensen - 2002
9 A shortcut fusion rule for circular program calculation – J P Fernandes, A Pardo, J Saraiva - 2007
730 Notions of Computation and Monads – Eugenio Moggi - 1991
22 Foundations for structured programming with GADTs – Patricia Johann - 2008
36 Free Theorems in the Presence of seq – Patricia Johann, Janis Voigtländer - 2004
365 Types, abstraction and parametric polymorphism – J C Reynolds - 1983
4 Disciplined, efficient, generalised folds for nested datatypes – Clare Martin, Jeremy Gibbons, Ian Bayley
6 Structured Recursion for Non-uniform Data-types – P Blampied - 2000
4 Generic Operations on Nested Datatypes – Ian Bayley - 2001