|
76
|
A transformation-based optimiser for Haskell
– Simon L. Peyton Jones, André L.M. Santos
- 1998
|
|
375
|
Deforestation: Transforming programs to eliminate trees
– Philip Wadler
- 1990
|
|
15
|
Measuring the Effectiveness of a Simple Strictness Analyser
– Simon Peyton Jones, Will Partain
- 1993
|
|
47
|
Let-Floating: Moving Bindings to Give Faster Programs
– Simon Peyton Jones, Will Partain, et al.
- 1997
|
|
515
|
D.: Implementation of Functional Programming Languages
– Peyton Jones, S Lester
- 1987
|
|
595
|
Compiling with Continuations
– Andrew Appel
- 1992
|
|
62
|
Compiling Lazy Functional Languages
– T Johnsson
- 1987
|
|
997
|
The Lambda Calculus: its Syntax and Semantics
– H P Barendregt
- 1984
|
|
31
|
Expressing and reasoning about non-deterministic functional programs
– J Hughes, J O'Donnel
- 1989
|
|
41
|
Non-determinism in functional languages
– Harald Søndergaard, Peter Sestoft
- 1992
|
|
94
|
Unboxed values as first class citizens in a non-strict functional language
– Simon L Peyton Jones, John Launchbury
- 1991
|
|
5
|
Optimizing Eden by Transformation
– Cristóbal Pareja, Ricardo Peña, Fernando Rubio, O Rubio, Clara Segura
- 2000
|
|
77
|
Once Upon a Type
– David Turner, Philip Wadler, Christian Mossin
- 1995
|
|
68
|
GUM: a portable parallel implementation of Haskell
– P.W. Trinder, K. Hammond, J.S. Mattson Jr., A.S. Partridge, S.L. Peyton Jones
- 1996
|
|
33
|
Once Upon a Polymorphic Type
– Keith Wansbrough, Simon Peyton Jones
- 1998
|
|
36
|
Strictness analysis for higher order functions
– G L Burn, C L Hankin, S Abramsky
- 1986
|
|
252
|
Compiling polymorphism using intensional type analysis
– Robert Harper, Greg Morrisett
- 1995
|
|
163
|
Unboxed Objects and Polymorphic Typing
– Xavier Leroy
- 1992
|
|
235
|
The Essence of Compiling with Continuations
– Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen
- 1993
|
