Build, augment and destroy. Universally (2004)

Cached

Download Links

by Neil Ghani , Tarmo Uustalu , Varmo Vene
Venue:In Asian Symposium on Programming Languages, Proceedings
Citations:4 - 3 self

Documents Related by Co-Citation

49 Merging Monads and Folds for Functional Programming – Erik Meijer, Johan Jeuring - 1995
14 Fusion of Recursive Programs with Computational Effects – Alberto Pardo - 2000
730 Notions of Computation and Monads – Eugenio Moggi - 1991
193 A Short Cut to Deforestation – Andrew Gill, John Launchbury, Simon L Peyton Jones - 1993
9 A shortcut fusion rule for circular program calculation – J P Fernandes, A Pardo, J Saraiva - 2007
2 Personal communication, and message 1192 from the TYPES mailing list archive – T Altenkirch, P Levy, M Hasagawa - 2008
16 Two applications of analytic functors – R Hasegawa - 2002
3 Using Monads to Fuse Recursive Programs (Extended Abstract) – Claus Jürgensen - 2002
15 Monadic augment and generalised short cut fusion – Neil Ghani, Patricia Johann - 2005
61 Containers - constructing strictly positive types, Theoretical Computer Science 342 (2005) 3–27, applied Semantics: Selected Topics – M Abott, T Altenkirch, N Ghani
2 98 Language and Libraries: The Revised Report – S L - 2003
84 Algebraic Data Types and Program Transformation – G Malcolm - 1990
8 Initial algebra semantics is enough – Patricia Johann, Neil Ghani - 2007
22 Foundations for structured programming with GADTs – Patricia Johann - 2008
7 Asymptotic Improvement of Computations over Free Monads – Janis Voigtländer, Technische Universität Dresden - 2008
1 Using monads to fuse recursive programs (extended abstract). citeseer.ist.psu.edu/543861.html – C Juergensen
1 Zip fusion with hyperfunctions. citeseer.ist.psu.edu/launchbury00zip.html – J Launchbury, S Krstic, T Sauerwein
1 Playing by the rules: Rewriting as an optimization technique – S Peyton Jones, A Tolmach, T Hoare - 2001
1 Zip fusion with hyperfunctions. Available at www.cse.ogi.edu/∼krstic – J Launchbury, S Krstic, T Sauerwein - 2000