|
64
|
A Semantic Model of Reference Counting and its Abstraction
– Paul Hudak
- 1986
|
|
19
|
Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates
– A. V. S. Sastry, William D. CLinger, Zena Ariola
- 1993
|
|
16
|
Path Analysis and the Optimization of Non-strict Functional Languages
– A Bloss
- 1989
|
|
15
|
Copy elimination in functional languages
– K. Gopinath, John L. Hennessy
- 1989
|
|
12
|
Set Constraints for Destructive Array Update Optimization
– Mitchell Wand, William D. Clinger
- 1999
|
|
71
|
Single-threaded polymorphic lambda calculus
– Juan Guzman, Paul Hudak
- 1990
|
|
15
|
Path semantics
– A Bloss, P Hudak
- 1988
|
|
12
|
How to Make Destructive Updates Less Destructive
– Martin Odersky
- 1991
|
|
121
|
Linear Types Can Change the World!
– Philip Wadler
- 1990
|
|
3
|
Avoiding copying in functional and logic programming languages
– P Hudak, A Bloss
- 1985
|
|
267
|
Control-Flow Analysis of Higher-Order Languages
– Olin Shivers
- 1991
|
|
40
|
The aggregate update problem in functional programming systems
– P Hudak, A Bloss
- 1985
|
|
60
|
The Complexity of Set Constraints
– Alexander Aiken, Dexter Kozen, Moshe Vardi, Ed Wimmers
- 1993
|
|
94
|
How to Declare an Imperative
– Philip Wadler
- 1995
|
|
109
|
Bisimilarity as a theory of functional programming
– A Gordon
- 1995
|
|
10
|
Hugs 98 User Manual
– M Jones, J Peterson
- 1999
|
|
22
|
Parametricity and Unboxing with Unpointed Types
– John Launchbury, Ross Paterson
- 1996
|
|
82
|
Polymorphic type inference
– Daniel Leivant
- 1983
|
|
39
|
Set theoretical models of lambda calculus: Theories, expansions and isomorphisms
– G Longo
- 1983
|
