Course Literature
Eifl
- Andre Santos. Compilation by Transformation in Non-Strict Functional Languages. http://citeseer.ist.psu.edu/santos95compilation.html, 1995. University of Glasgow.
- Andrew Gill, John Launchbury and Simon Peyton Jones. A Short Cut to Deforestation (alternative link). Functional Programming and Computer Architecture pp. 223-232, 1993.
- Andrew Tolmach. An External Representation for the GHC Core Language (Draft for GHC5.02). http://www.haskell.org/ghc/documentation.html, 2001.
- Andy Cheadle, Tony Field, Simon Marlow, Simon Peyton Jones and Lyndon While. Non-stop Haskell (alternative link). ACM SIGPLAN Notices 35(9) pp. 257-267, 2000.
- Andy Cheadle, Tony Field, Simon Marlow, Simon Peyton Jones and Lyndon While. Exploring the Barrier to Entry: Incremental Generational Garbage Collection for Haskell (alternative link). International Symposium on Memory Management, 2004.
- Anindya Banerjee, Nevin Heintze and Jon G. Riecke. Design and Correctness of Program Transformations Based On Control-Flow Analysis. Lecture Notes in Computer Science 2215() pp. 420-, 2001.
- Atze Dijkstra and Doaitse Swierstra. Lazy Functional Parser Combinators in Java (alternative link). Proceedings of 1st Workshop on Multiparadigm Programming with Object-Oriented Languages (MPOOL), 2001. John von Neumann Institute for Computing.
- Atze Dijkstra and Doaitse Swierstra. Typing Haskell with an Attribute Grammar (Part I). http://www.cs.uu.nl/research/techreps/UU-CS-2004-037.html, 2004. Department of Computer Science, Utrecht University.
- Byron Cook and John Launchbury. Disposable Memo Functions. ACM SIGPLAN Notices 38(2) pp. 310-, 1997.
- D.A. Turner. A New Implementation Technique for Applicative Languages. Software Practice and Experience 9() pp. 31-49, 1979.
- Daan Leijen. The Abroad – A Functional Approach to Software Components, PhD? Thesis. http://www.cs.uu.nl/~daan/download/papers/phd-thesis.pdf, 2003. Utrecht University, Institute of Information and Computing Sciences.
- John Hughes. Super Combinators - A New Implementation Method for Applicative Languages. Proceedings of the 1982 ACM Symposium on Lisp and Functional Programming pp. 1-10, 1982.
- John Launchbury. A natural semantics for lazy evaluation (alternative link). Principles of Programming Languages pp. 144-154, 1993.
- Karl-Filip Faxen. Optimizing Lazy Functional Programs Using Flow Inference. Static Analysis Symposium pp. 136-153, 1995.
- Markus Mohnen. Optimising the Memory Management of Higherorder Functional Programs (alternative link). http://citeseer.ist.psu.edu/651726.html(http://citeseer.ist.psu.edu/rd/41381762%2C651726%2C1%2C0%2CDownload/http%3AqSqqSqwww-i2.informatik.rwth-aachen.deqSqStaffqSqFormerqSqmohnenqSqPUBLICATIONSqSqdiss.ps.gz), 1997.
- Olaf Chitil. Type-Inference Based Short Cut Deforestation (nearly) without Inlining (alternative link). http://citeseer.ist.psu.edu/234763.html(http://www.cs.kent.ac.uk/pubs/1999/1910/content.pdf), ??.
- Olaf Chitil. Type inference builds a short cut to deforestation (alternative link). ICFP pp. 249-260, 1999.
- P.W. Trinder, K. Hammond, J.S. Mattson, A.S. Partridge and Simon Peyton Jones. GUM: a portable parallel implementation of Haskell (alternative link). Programming Language Design and Implementation pp. 79-88, 1996.
- Peter Sestoft. Deriving a lazy abstract machine. Journal of Functional Programming 7(3), 1997.
- Philip Koopman and Peter Lee. A Fresh Look at Combinator Graph Reduction (Or, Having a TIGRE by the Tail) (alternative link). Proceedings of the SIGPLAN '87 symposium on Interpreters and interpretive techniques pp. 110-119, 1989.
- Remi Douence and Pascal Fradet. A Taxonomy of Functional Language Implementations Part I: Call by Value. http://citeseer.ist.psu.edu/274870.html, 1996. Institut National de Recherche en Informatique et en Automatique.
- Remi Douence and Pascal Fradet. A Taxonomy of Functional Language Implementations Part II : Call-by-Name, Call-by-Need and Graph Reduction. http://citeseer.ist.psu.edu/douence96taxonomy.html, 1996. Institut National de Recherche en Informatique et en Automatique.
- Remi Douence and Pascal Fradet. A Systematic Study of Functional Language Implementations. ACM TOPLAS 20(2) pp. 344-387, 1998.
- Rinus Plasmeijer and M.J. van Eekelen. Functional Programming and Parallel Graph Rewriting. http://www.cs.kun.nl/~clean/contents/Addison__Wesley_book/addison__wesley_book.html, 1993. Addison-Wesley.
- Simon L. Peyton Jones. The Implementation of Functional Programming Languages. 1987. Prentice Hall.
- Simon L. Peyton-Jones. Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine. Journal of Functional Programming 2(2) pp. 127-202, 1992. Department of Computer Science, University of Glasgow.
- Simon Marlow and Simon Peyton Jones. The New GHC/Hugs Runtime System. http://citeseer.ist.psu.edu/marlow98new.html, 1998.
- Simon Marlow and Simon Peyton Jones. How to make a fast curry: push/enter vs eval/apply. ICFP, 2004.
- Simon Peyton Jones and Andre Santos. Compilation by Transformation in the Glasgow Haskell Compiler. Functional Programming pp. 184-204, 1994. Springer-Verlag.
- Simon Peyton Jones and Andre Santos. A transformation-based optimiser for Haskell. Science of Computer Programming 32(1-3), 3-47 1998.
- Simon Peyton Jones and Simon Marlow. Secrets of the Glasgow Haskell Compiler inliner (alternative link). Journal of Functional Programming () pp. 393-434, 2002.
- Simon Peyton Jones, Cordy Hall, Kevin Hammond, Will Partain and Phil Wadler. The Glasgow Haskell compiler: a technical overview. Proc. UK Joint Framework for Information Technology (JFIT) Technical Conference, 1992.
- Simon Peyton Jones, Simon Marlow and Conal Elliott. Stretching the storage manager: weak pointers and stable names in Haskell. Implementation of Functional Languages pp. 37-58, 1999.
- Simon Peyton Jones. Compiling Haskell by program transformation: a report from the trenches. European Symposium On Programming pp. 18-44, 1996.
- Urban Boquist and Thomas Johnsson. The GRIN Project: A Highly Optimising Back End For Lazy Functional Languages. Selected papers from the 8th International Workshop on Implementation of Functional Languages, 1996.
- Urban Boquist. Code Optimisation Techniques for Lazy Functional Languages, PhD? Thesis. http://www.cs.chalmers.se/~boquist/phd/index.html, 1999. Chalmers University of Technology.
- Xavier Leroy. The ZINC experiment: an economical implementation of the ML language. http://citeseer.ist.psu.edu/leroy90zinc.html, 1990. INRIA-Rocquencourt.