|
84
|
Shortcut Deforestation in Calculational Form
– Akihiko Takano, Erik Meijer
- 1995
|
|
1224
|
Introduction to functional programming
– Philip Wadler
- 1995
|
|
292
|
Theorems for free!
– Philip Wadler
- 1989
|
|
84
|
Bananas in Space: Extending Fold and Unfold to Exponential Types
– Erik Meijer, Graham Hutton
- 1995
|
|
86
|
Polytypic programming
– Patrik Jansson, Patrik Jansson
- 1996
|
|
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
|
|
18
|
A Static Semantics for Haskell
– Karl-Filip Faxen
- 1998
|
|
10
|
The Generic Approximation Lemma
– Graham Hutton, Jeremy Gibbons
- 2001
|
|
33
|
Free Theorems in the Presence of seq
– Patricia Johann, Janis Voigtländer
- 2004
|
|
252
|
QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs
– Koen Claessen, John Hughes
- 2000
|
|
23
|
Polytypic Data Conversion Programs
– Patrik Jansson, Johan Jeuring
- 2001
|
|
265
|
Why functional programming matters
– John Hughes
- 1989
|
|
108
|
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
|
|
4
|
C.: Trees, transducers and transformations
– W Rounds
- 1968
|
|
20
|
Composition of functions with accumulating parameters
– Janis Voigtländer, Armin Kühnemann
- 2004
|
