|
169
|
A Natural Semantics for Lazy Evaluation
– John Launchbury
- 1993
|
|
57
|
Deriving a Lazy Abstract Machine
– Peter Sestoft
- 1997
|
|
166
|
Parameter-Passing and the Lambda Calculus
– Erik Crank, Matthias Felleisen
- 1991
|
|
47
|
Let-Floating: Moving Bindings to Give Faster Programs
– Simon Peyton Jones, Will Partain, et al.
- 1997
|
|
76
|
A transformation-based optimiser for Haskell
– Simon L. Peyton Jones, André L.M. Santos
- 1998
|
|
997
|
The Lambda Calculus: its Syntax and Semantics
– H P Barendregt
- 1984
|
|
20
|
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language
– Andrew Moran, David Sands, Magnus Carlsson
- 2003
|
|
55
|
Total Correctness by Local Improvement in the Transformation of Functional Programs
– David Sands
- 1996
|
|
102
|
Proving congruence of bisimulation in functional programming languages
– Douglas J. Howe
- 1996
|
|
77
|
Once Upon a Type
– David Turner, Philip Wadler, Christian Mossin
- 1995
|
|
31
|
Relational Reasoning about Functions and Nondeterminism
– Søren Bøgh Lassen, Søren Bøgh Lassen
- 1998
|
|
108
|
Equivalence in Functional Languages with Effects
– Ian Mason, Carolyn Talcott
- 1991
|
|
375
|
Deforestation: Transforming programs to eliminate trees
– Philip Wadler
- 1990
|
|
11
|
Call-by-name, call-by-need, and McCarthy’s Amb
– A Moran
- 1998
|
|
237
|
The Revised Report on the Syntactic Theories of Sequential Control and State
– Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb
- 1992
|
|
40
|
A Naïve Time Analysis and its Theory of Cost Equivalence
– David Sands
- 1995
|
|
41
|
Non-determinism in functional languages
– Harald Søndergaard, Peter Sestoft
- 1992
|
|
9
|
Improvement Theory and its Applications
– David Sands
- 1997
|
|
12
|
A non-deterministic call-by-need lambda calculus
– Arne Kutzner, Manfred Schmidt-Schauß
- 1998
|
