Monadic Corecursion - Definition, Fusion Laws, and Applications (1998)

Cached

Download Links

by Alberto Pardo
Venue:Electronic Notes in Theoretical Computer Science
Citations:5 - 1 self

Documents Related by Co-Citation

91 Shortcut Deforestation in Calculational Form – Akihiko Takano, Erik Meijer - 1995
1312 Monads for functional programming – Philip Wadler - 1995
326 Theorems for free! – Philip Wadler - 1989
95 Bananas in Space: Extending Fold and Unfold to Exponential Types – Erik Meijer, Graham Hutton - 1995
93 Polytypic programming – Patrik Jansson - 2000
403 Deforestation: Transforming programs to eliminate trees – Philip Wadler - 1990
299 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
2 Chakravarty et al. The Haskell 98 Foreign Function Interface 1.0, An Addendum to the Haskell 98 Report, 2003. Available online at http://www.haskell. org/definition – Manuel - 2000
2 Proof methods for corecursive programs, submitted – Jeremy Gibbons, Graham Hutton - 2000
36 Free Theorems in the Presence of seq – Patricia Johann, Janis Voigtländer - 2004
13 The Generic Approximation Lemma – Graham Hutton, Jeremy Gibbons - 2001
283 Why functional programming matters – John Hughes - 1989
20 A Static Semantics for Haskell – Karl-Filip Faxen - 1998
309 QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs – Koen Claessen, John Hughes - 2000
25 Polytypic Data Conversion Programs – Patrik Jansson, Johan Jeuring - 2001
137 Scrap Your Boilerplate: A Practical Design Pattern for Generic Programming – Ralf Lämmel, Simon Peyton Jones - 2003
5 Tree Transducer Composition as Deforestation Method for Functional Programs – Armin Kühnemann, Janis Voigtländer - 2001
2 The Universality of Higher-Order Attributed Tree Transducers – Thomas Noll, Heiko Vogler - 1999
1 Universal Algebra for Computer Scientists, volume 25 – W Wechsler - 1992