Z. M. Ariola
M. Felleisen
J. Maraist
M. Odersky
P. Wadler
1995
A call-by-need lambda calculus
POPL'95
ACM Press
San Francisco, California
233–246
10.1145/199448.199507
Adam Bakewell
Colin Runciman
2000
A model for comparing the space usage of lazy evaluators
PPDP
151–162
10.1145/351268.351287
Richard Bird
2014
Thinking functionally with Haskell
Cambridge University Press
Cambridge, UK
10.1017/CBO9781316092415
Haskell Community
2016
Haskell, an advanced, purely functional programming language
www.haskell.org
Nils Dallmeyer
Manfred Schmidt-Schauß
2016
An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages
Horatiu Cirstea
Santiago Escobar
Proc. 3rd WPTE@FSCD
EPTCS
235
78–92
10.4204/EPTCS.235.6
Jörgen Gustavsson
David Sands
1999
A Foundation for Space-Safe Transformations of Call-by-Need Programs
Electr. Notes Theor. Comput. Sci.
26
69–86
10.1016/S1571-0661(05)80284-1
Jörgen Gustavsson
David Sands
2001
Possibilities and Limitations of Call-by-Need Space Improvement
265–276
10.1145/507635.507667
Jennifer Hackett
Graham Hutton
2014
Worker/wrapper/makes it/faster
ICFP '14
95–107
10.1145/2628136.2628142
Patricia Johann
Janis Voigtländer
2006
The Impact of seq on Free Theorems-Based Program Transformations
Fundamenta Informaticae
69
1–2
63–102
Simon Marlow
2010
Haskell 2010 – Language Report
www.haskell.org/onlinereport/haskell2010/
A. K. D. Moran
D. Sands
1999
Improvement in a Lazy Context: An operational theory for call-by-need
POPL 1999
ACM Press
43–56
10.1145/292540.292547
Andrew K. D. Moran
David Sands
Magnus Carlsson
1999
Erratic Fudgets: A semantic theory for an embedded coordination language
Coordination '99
Lecture Notes in Comput. Sci.
1594
Springer-Verlag
85–102
10.1007/3-540-48919-3_8
Simon Peyton Jones
Simon Marlow
2002
Secrets of the Glasgow Haskell Compiler inliner
Journal of Functional Programming
12
4+5
393–434
10.1017/S0956796802004331
Simon L. Peyton Jones
André L. M. Santos
1998
A Transformation-Based Optimiser for Haskell
Science of Computer Programming
32
1–3
3–47
10.1016/S0167-6423(97)00029-4
Manfred Schmidt-Schauß
Nils Dallmeyer
2017
Space Improvements and Equivalences in a Polymorphically Typed Functional Core Language: Context Lemmas and Proofs
Frank report
57
Institut für Informatik, Goethe-Universität Frankfurt am Main
http://www.ki.cs.uni-frankfurt.de/papers/frank/
Manfred Schmidt-Schauß
David Sabel
2014
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
M. Schmidt-Schauß
M.Sakai
D. Sabel
Y. Chiba
WPTE 2014
OASICS
40
Schloss Dagstuhl
63–74
10.4230/OASIcs.WPTE.2014.63
Manfred Schmidt-Schauß
David Sabel
2015
Improvements in a Functional Core Language with Call-By-Need Operational Semantics
Elvira Albert
Proc. PPDP '15
ACM
New York, NY, USA
220–231
10.1145/2790449.27905125
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, Goethe-Universität Frankfurt am Main
http://www.ki.cs.uni-frankfurt.de/papers/frank/
Manfred Schmidt-Schauß
David Sabel
2015
Sharing Decorations for Improvements in a Functional Core Language with Call-By-Need Operational Semantics
Frank report
56
Institut für Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main
http://www.ki.cs.uni-frankfurt.de/papers/frank/
Manfred Schmidt-Schauß
Marko Schütz
David Sabel
2008
Safety of Nöcker's Strictness Analysis
J. Funct. Programming
18
04
503–551
10.1017/S0956796807006624
Neil Sculthorpe
Andrew Farmer
Andy Gill
2013
The HERMIT in the Tree: Mechanizing Program Transformations in the GHC Core Language
Proceedings of the 24th Symposium on Implementation and Application of Functional Languages
Lecture Notes in Computer Science
8241
86–103
10.1007/978-3-642-41582-1_6
Peter Sestoft
1997
Deriving a Lazy Abstract Machine
J. Funct. Program.
7
3
231–264
10.1017/S0956796897002712