Possibilities and limitations of call-by-need space improvement (2001)

Cached

Download Links

by Jörgen Gustavsson
Venue:In Proceedings of the sixth ACM SIGPLAN International Conference on Functional Programming
Citations:6 - 0 self

Active Bibliography

18 A Foundation for Space-Safe Transformations of Call-by-Need Programs – Jörgen Gustavsson , David Sands - 1999
40 Improvement in a Lazy Context: An Operational Theory for Call-By-Need – Andrew Moran, David Sands - 1999
20 Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language – Andrew Moran, David Sands, Magnus Carlsson - 2003
Towards a Scalable Update Avoidance Analysis – Jörgen Gustavsson, Josef Svenningsson - 2000
15 A Usage Analysis With Bounded Usage Polymorphism and Subtyping – Jörgen Gustavsson, Josef Svenningsson - 2000
32 Compilation by Transformation in Non-Strict Functional Languages – André L. de M. Santos - 1995
17 From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages – David Sands - 1997
Author manuscript, published in "Higher Order and Symbolic Computation (2007)" Explaining the lazy Krivine machine using explicit substitution and addresses – Frédéric Lang - 2007
7 FUNDIO: A Lambda-Calculus with a letrec, case, Constructors, and an IO-Interface: Approaching a Theory of unsafePerformIO – Manfred Schmidt-Schauß - 2003
In submission Modular, Higher-Order Cardinality Analysis in Theory and Practice – unknown authors
In submission Higher-Order Cardinality Analysis Extended version – Ilya Sergey, Dimitrios Vytiniotis, Simon Peyton Jones
In submission Modular, Higher-Order Cardinality Analysis in Theory and Practice Extended version – unknown authors
In submission Modular, Higher-Order Cardinality Analysis in Theory and Practice Extended version – Ilya Sergey, Dimitrios Vytiniotis, Simon Peyton Jones
6 Flattening is an Improvement – James Riely, Jan Prins - 2000
1 Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri - 2009
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri (Hossein) - 2009
38 Once Upon a Polymorphic Type – Keith Wansbrough, Simon Peyton Jones - 1998
6 Formal Efficiency Analysis for Tree Transducer Composition – Janis Voigtländer - 2004
20 Optimizing Lazy Functional Programs Using Flow Inference – Karl-Filip Faxen - 1995