Nils Dallmeyer (2016):
Design and implementation of a test suite for exploring space improvements in a call-by-need functional language with polymorphic types.
Msc. thesis.
Institut für Informatik, J.W.Goethe-University Frankfurt.
Andrew Gill, John Launchbury & Simon L. Peyton Jones (1993):
A Short Cut to Deforestation.
In: Proc. Conference on Functional Programming Languages and Computer Architecture,
FPCA '93.
ACM,
New York, NY, USA,
pp. 223–232,
doi:10.1145/165180.165214.
Jörgen Gustavsson (2001):
Space-Safe Transformations and Usage Analysis for Call-by-Need Languages.
PhD thesis.
Department of Computing Science, Chalmers University of Technology and Göteborg University.
Jörgen Gustavsson & David Sands (1999):
A Foundation for Space-Safe Transformations of Call-by-Need Programs.
Electronic Notes in Theoretical Computer Science 26,
pp. 69 – 86.
HOOTS '99, Higher Order Operational Techniques in Semantics,
doi:10.1016/S1571-0661(05)80284-1.
Jörgen Gustavsson & David Sands (2001):
Possibilities and Limitations of Call-by-need Space Improvement.
In: Proc. Sixth ACM SIGPLAN International Conference on Functional Programming,
ICFP '01.
ACM,
New York, NY, USA,
pp. 265–276,
doi:10.1145/507635.507667.
Patricia Johann & Janis Voigtländer (2006):
The Impact of Seq on Free Theorems-Based Program Transformations.
Fundam. Inf. 69(1-2),
pp. 63–102.
Andrew Moran & David Sands (1999):
Improvement in a Lazy Context: An Operational Theory for Call-by-need.
In: Proc. 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '99.
ACM,
New York, NY, USA,
pp. 43–56,
doi:10.1145/292540.292547.
David Sands (1991):
Operational Theories of Improvement in Functional Languages (Extended Abstract).
In: Proc. Fourth Glasgow Workshop on Functional Programming.
Springer-Verlag,
pp. 298–311,
doi:10.1007/978-1-4471-3196-0_24.
David Sands (1995):
A Naïve Time Analysis and its Theory of Cost Equivalence.
Journal of Logic and Computation 5,
pp. 495–541,
doi:10.1093/logcom/5.4.495.
David Sands (1995):
Total Correctness by Local Improvement in Program Transformation.
In: Proc. 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '95.
ACM,
New York, NY, USA,
pp. 221–232,
doi:10.1145/199448.199485.
Manfred Schmidt-Schauß & David Sabel (2014):
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report).
In: M. Schmidt-Schauß, M.Sakai, D. Sabel & Y. Chiba: WPTE 2014,
OASICS 40.
Schloss Dagstuhl,
pp. 63–74,
doi:10.4230/OASIcs.WPTE.2014.63.
Manfred Schmidt-Schauß & David Sabel (2015):
Improvements in a Functional Core Language with Call-By-Need Operational Semantics.
Frank report 55.
Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main.
Available at http://www.ki.informatik.uni-frankfurt.de/papers/frank.
Manfred Schmidt-Schauß & David Sabel (2015):
Improvements in a functional core language with call-by-need operational semantics.
In: Moreno Falaschi & Elvira Albert: Proc. 17th International Symposium on Principles and Practice of Declarative Programming.
ACM,
pp. 220–231,
doi:10.1145/2790449.2790512.
Manfred Schmidt-Schauß & David Sabel (2015):
Sharing-Aware Improvements in a Call-by-Need Functional Core Language.
In: Ralf Lämmel: Proceedings of IFL,
IFL '15.
ACM,
New York, NY, USA,
pp. 6:1–6:12,
doi:10.1145/2897336.2897343.
Manfred Schmidt-Schauß, David Sabel & Marko Schütz (2008):
Safety of Nöcker's Strictness Analysis.
J. Funct. Program. 18(4),
pp. 503–551,
doi:10.1017/S0956796807006624.
Peter Sestoft (1997):
Deriving a Lazy Abstract Machine.
J. Funct. Program. 7(3),
pp. 231–264,
doi:10.1017/S0956796897002712.
Josef Svenningsson (2002):
Shortcut Fusion for Accumulating Parameters & Zip-like Functions.
In: Proc. Seventh ACM SIGPLAN International Conference on Functional Programming,
ICFP '02.
ACM,
New York, NY, USA,
pp. 124–132,
doi:10.1145/581478.581491.
eptcs@eptcs.org