Readscheme.org
Haskell Bibliography Home
Language Design
Monads
XML and the Web
Generic Programming
Applications
Compiler Technology
GUI Programming
Parallel Programming
Recent Additions
Search...

Compiler Technology

  • Johan Agat. "Types for Register Allocation". IFL'97. LNCS-1467. 1997. Available online: ps. Bibtex citation.
  • Johan Agat. "A Typed Functional language for Expressing Register Utilisation". Masters Thesis. Chalmers University. October 1998. Available online: ps. Bibtex citation.
  • Adam Bakewell. "Using Term Graph Rewriting Models to Analyse Relative Space Efficiency". TERMGRAPH 2002 International Workshop on Term Graph Rewriting. October 2002. Bibtex citation.
  • Adam Bakewell. "An Operational Theory of Relative Space Efficiency". PhD. Thesis. University of York. December 2001. Available online: ps. Bibtex citation.
  • Adam Bakewell. "Looking for leaks". Space 2001 Workshop. January 2001. Available online: ps. Bibtex citation.
  • Adam Bakewell. "A Model for Comparing the Space Usage of Lazy Evaluators". Proc. 2nd ACM Conference on Principles and Practice of Declarative Programming Languages PPDP '00. September 2000. Available online: ps. Bibtex citation.
  • Adam Bakewell. "A Space Semantics for Core Haskell". Proc. 2000 Haskell Workshop. September 2001. Available online: ps. Bibtex citation.
  • Adam Bakewell. "A Space Semantics for Core Haskell". York University. 2000. Available online: ps. Bibtex citation.
  • Adam Bakewell. "The Space Usage Problem: An Evaluation Kit for Graph-Reduction Semantics". 2nd Scottish Functional Programming Workshop. 2000. Available online: ps. Bibtex citation.
  • Manuel M. T. Chakravarty. "C -> Haskell, or Yet Another Interfacing Tool (Revised Version)". Implementation of Functional Languages, 11th. International Workshop (IFL'99). LNCS 1868. 2000. Available online: ps. Bibtex citation.
  • Koen Claessen, John Hughes. "Testing Monadic Code with QuickCheck". Haskell Workshop 2002. October 2002. Available online: ps. Bibtex citation.
  • Kei Davis. "Projection-Based Program Analysis". PhD. Thesis. Glasgow University. 1994. Available online: ps. Bibtex citation.
  • Kei Davis. "PERs from Projections for Binding-time Analysis". Journal of Lisp and Symbolic Computation (LASC). 8. 3. October 1995. Available online: ps. Bibtex citation.
  • Kei Davis. "PERs from Projections for Binding-time Analysis". 1994 ACM Conference on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '94). 1994. Bibtex citation.
  • Kei Davis. "Projection-based Termination Analysis". Functional Programming: Proceedings of the 1993 Glasgow Workshop. July 1993. Available online: ps. Bibtex citation.
  • Kei Davis. "Higher-order Binding-time Analysis". Partial Evaluation and Semantics-Based Program Manipulation (PEPM '93). 1993. Available online: ps. Bibtex citation.
  • Kei Davis. "Analysing Functions by Projection-based Backward Abstraction". Functional Programming: Proceedings of the 1992 Glasgow Workshop. July 1992. Available online: ps. Bibtex citation.
  • Kei Davis. "A Note on the Choice of Domains for Projection-Based Program Analysis". Functional Programming: Proceedings of the 1991 Glasgow Workshop. August 1991. Available online: ps. Bibtex citation.
  • Kei Davis. "Strictness Analysis in 4D". 1990 Glasgow Workshop on Functional Programming. August 1990. Available online: ps. Bibtex citation.
  • Kei Davis and Philip Wadler. "Strictness Analysis: Proved and Improved". 1989 Glasgow Workshop on Functional Programming. August 1989. Available online: ps. Bibtex citation.
  • Karl-Filip Faxén. "Optimizing Lazy Functional Programs Using Flow-Inference". Workshop on Types for Program Analysis (TPA-95). 1995. Available online: ps. Bibtex citation.
  • Karl-Filip Faxén. "Optimizing Lazy Functional Programs Using Flow-Inference". Second International Symposium on Static Analysis (SAS-95). 1995. Available online: ps. Bibtex citation.
  • Karl-Filip Faxén. "Flow Inference, Code Generation, and Garbage Collection for Lazy Functional Languages". Masters Thesis. 1996. Available online: ps. Bibtex citation.
  • Karl-Filip Faxén. "Polyvariance, Polymorphism, and Flow Analysis". 5th LOMAPS Workshop. June 1996. Available online: ps. Bibtex citation.
  • Karl-Filip Faxén. "Analysing, Transforming and Compiling Lazy Functional Programs". PhD. Thesis. June 1997. Available online: ps. Bibtex citation.
  • Karl-Filip Faxén. "Representation Analysis for Coercion Placement". Implementation of Declarative Languages workshop. September 1999. Available online: ps. Bibtex citation.
  • Karl-Filip Faxén. "The Costs and Benefits of Cloning in a Lazy Functional Language". Scottish Functional Programming Workshop. July 2000. Available online: ps. Bibtex citation.
  • Karl-Filip Faxén. "Cheap Eagerness: Speculative Evaluation in a Lazy Functional Language". ICFP 2000. September 2000. Available online: ps. Bibtex citation.
  • Karl-Filip Faxén. "Dynamic Cheap Eagerness". Implementation of Functional Languages Workshop. September 2001. Available online: ps. Bibtex citation.
  • Henrik Nilsson and Jan Sparud. "The Evaluation Dependence Tree as a Basis for Lazy Functional Debugging". Journal of Automated Software Engineering. 4. 2. 1997. Available online: ps. Bibtex citation.
  • Amr Sabry and Jan Sparud. "Debugging Reactive Systems in Haskell". Haskell Workshop'97. 1997. Available online: ps. Bibtex citation.
  • Jan Sparud. "A Transformational Approach to Debugging Lazy Functional Programs". Masters Thesis. Chalmers University. 1996. Available online: ps. Bibtex citation.
  • Jan Sparud and Henrik Nilsson. "The Architecture of a Debugger for Lazy Functional Languages". AADEBUG '95. 1995. Available online: ps. Bibtex citation.
  • Jan Sparud. "Towards a Haskell Debugger". Chalmers DofCs annual Winter-meeting. 1994. Available online: ps. Bibtex citation.
  • Mark Tullsen and Paul Hudak. "Shifting Expression Procedures Into Reverse". Workshop on Partial Evaluation and Semantics-Based Program Manipulation. January 1999. Available online: ps. Bibtex citation.
  • Mark Tullsen and Paul Hudak. "An Intermediate Meta-language for Program Transformation". Yale University. YALEU/DCS/RR-1154. June 1998. Available online: ps. Bibtex citation.
  • Mark Tullsen. "Compiling Haskell to Java". Yale University. YALEU/DCS/RR-1204. May 1996. Available online: ps. Bibtex citation.
  • Mark Tullsen. "PATH, a Program Transformation System for Haskell". PhD. Thesis. Yale University. May 2002. Available online: ps. Bibtex citation.
  • Keith Wansbrough. "Simple Polymorphic Usage Analysis". PhD. Thesis. University of Cambridge. March 2002. Available online: abstract. Bibtex citation.
  • Noel Winstanley. "A Type-Sensitive Preprocessor for Haskell". Glasgow Functional Programming Workshop. 1997. Available online: ps pdf. Bibtex citation.
  • Jan-Willem Maessen. "Eager Haskell: Resource-bounded Execution Yields Efficient Iteration". Haskell Workshop 2002. October 2002. Available online: ps pdf. Bibtex citation.
  • Jan-Willem Maessen. "Hybrid Eager and Lazy Evaluation for Efficient Compilation of Haskell". PhD. Thesis. Massachusetts Institute of Technology. June 2002. Available online: ps pdf. Bibtex citation.
  • Robert Ennals and Simon Peyton Jones. "Optimistic Evaluation: a fast evaluation strategy for non-strict programs". PLDI 2003. November 2003. Available online: ps. Bibtex citation.
  • Koen Claessen and Colin Runciman. "Testing and Tracing Lazy Functional Programs". Summer School and Workshop on Advanced Functional Programming. August 2002. Available online: ps. Bibtex citation.
  • Urban Boquist. "Code Optimisation Techniques for Lazy Functional Languages". PhD. Thesis. Chalmers University of Technology. April 1999. Available online: ps code. Bibtex citation.
  • Urban Boquist. "Interprocedural Register Allocation for Lazy Functional Languages". Masters Thesis. Chalmers University of Technology. Available online: ps. Bibtex citation.
  • Urban Boquist. "Interprocedural Register Allocation for Lazy Functional Languages". Proceedings of the 1995 Conference on Functional Programming Languages and Computer Architecture. June 1995. Available online: ps. Bibtex citation.
  • Urban Boquist and Thomas Johnsson. "The GRIN Project: A Highly Optimising Back End For Lazy Functional Languages". 8th International Workshop on Implementation of Functional Languages. LNCS 1268. September 1996. Available online: ps. Bibtex citation.
  • Simon Peyton Jones, Andrew Tolmach and Tony Hoare. "Playing by the rules: rewriting as a practical optimisation technique in GHC". ICFP'01. 2001. Available online: ps. Bibtex citation.
  • Simon Peyton Jones and Norman Ramsey. "Featherweight concurrency in a portable assembly language". 2001. Available online: ps. Bibtex citation.
  • Simon Peyton Jones and Simon Marlow. "Secrets of the Glasgow Haskell Compiler inliner". Journal of Functional Programming. February 2001. Available online: ps. Bibtex citation.
  • Jason Smith, Nigel Perry and Erik Meijer. "Mondrian for .NET". DDJ. 2002. Available online: pdf. Bibtex citation.
  • Nigel Perry and Erik Meijer. "Implementing Functional Languages on Object-Oriented Virtual Machines". 2001. Available online: pdf. Bibtex citation.
  • Thorsten Brehm. "A Toolkit for Multi-View Tracing of Haskell Programs". Masters Thesis. RWTH Aachen. 2001. Available online: ps. Bibtex citation.
  • Malcolm Wallace, Olaf Chitil, Thorsten Brehm and Colin Runciman. "Multiple-View Tracing for Haskell: a New Hat". Proceedings of the Haskell Workshop 2001. 2001. Available online: ps. Bibtex citation.
  • Olaf Chitil, Colin Runciman and Malcolm Wallace. "Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs". Proceedings of the 12th International Workshop on Implementation of Functional Languages. LNCS 2011. September 2000. Available online: ps. Bibtex citation.
  • Jan Sparud. "Tracing and Debugging Lazy Functional Computations". PhD. Thesis. 1999. Available online: ps. Bibtex citation.
  • Jan Sparud and Colin Runciman. "Tracing Lazy Functional Computations Using Redex Trails". PLILP'97. 1997. Available online: ps. Bibtex citation.
  • Jan Sparud and Colin Runciman. "Complete and Partial Redex Trails of Functional Computations". IFL'97. 1997. Available online: ps. Bibtex citation.
  • Eleni Spiliopoulou. "The Brisk Machine: the Next Step in the Execution of Functional Languages". Proceedings of Festival Workshop in Foundations and Computations, FC'00. July 2000. Available online: ps. Bibtex citation.
  • Eleni Spiliopoulou. "Concurrent and Distributed Functional Systems". PhD. Thesis. University of Bristol. September 1999. Available online: pdf. Bibtex citation.
  • Ian Holyer and Eleni Spiliopoulou. "The Brisk Machine: A Simplified STG Machine". University of Bristol. Technical Report CSTR-98-003. March 1998. Available online: pdf. Bibtex citation.
  • Ian Holyer and Eleni Spiliopoulou. "The Brisk Machine: A Simplified STG Machine". Implementation of Functional Languages, 9th International Workshop, IFL'97. LNCS 1467. September 1997. Available online: pdf. Bibtex citation.
  • Alastair Penney. "Augmenting Trace-based Functional Debugging". PhD. Thesis. University of Bristol. September 1999. Available online: pdf. Bibtex citation.
  • Koen Claessen and John Hughes. "QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs". ICFP 2000. 2000. Available online: ps. Bibtex citation.
  • Clem Baker-Finch, Kevin Glynn and Simon Peyton Jones. "Constructed Product Result Analysis for Haskell". Journal of Functional Programming. 2000. Available online: ps. Bibtex citation.
  • Norman Ramsey and Simon Peyton Jones. "A Single Intermediate Language That Supports Multiple Implementations of Exceptions". PLDI 2000. 2000. Available online: ps. Bibtex citation.
  • Keith Wansbrough and Simon Peyton Jones. "Simple Usage Polymorphism". Workshop on Types In Compilation 2000. 2000. Available online: ps. Bibtex citation.
  • Andy Cheadle, Tony Field, Simon Marlow, Simon Peyton Jones and Lyndon Whilea. "Non-stop Haskell". ICFP 2000. 2000. Available online: ps. Bibtex citation.
  • Eric van Wyk, Oege de Moor and Simon Peyton Jones. "Aspect-oriented compilers". GCSE'99 - Generative and Component-Based Software Engineering. 1999. Available online: ps. Bibtex citation.
  • Simon Peyton Jones, Norman Ramsey and Fermin Reig. "C--: a portable assembly language that supports garbage collection". PPDP'99. 1999. Available online: ps. Bibtex citation.
  • Simon Peyton Jones, Simon Marlow and Conal Elliott. "Stretching the storage manager: weak pointers and stable names in Haskell". IFL'99. 1999. Available online: ps. Bibtex citation.
  • Simon Peyton Jones and Simon Marlow. "Secrets of the Glasgow Haskell Compiler inliner". Workshop on Implementing Declarative Languages. 1999. Available online: ps pdf. Bibtex citation.
  • Simon Marlow and Simon Peyton Jones. "The New GHC/Hugs Runtime System". 1999. Available online: ps. Bibtex citation.
  • Keith Wansbrough and Simon Peyton Jones. "Once Upon a Polymorphic Type". Twenty-sixth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. January 1999. Available online: ps. Bibtex citation.
  • Keith Wansbrough and Simon Peyton Jones. "Once Upon a Polymorphic Type". 1999. Available online: ps. Bibtex citation.
  • Simon Peyton Jones, J Launchbury, MB Shields and AP Tolmach. "Bridging the gulf: a common intermediate language for ML and Haskell". POPL98. 1998. Available online: ps. Bibtex citation.
  • Simon Peyton Jones and A Santos. "A transformation-based optimiser for Haskell". Science of Computer Programming. 32(1-3). September 1998. Available online: ps. Bibtex citation.
  • PM Sansom and Simon Peyton Jones. "Formally-based profiling for higher-order functional languages". ACM Transactions on Programming Languages and Systems. 19(2). March 1997. Available online: ps. Bibtex citation.
  • Simon Peyton Jones and E Meijer. "Henk: a typed intermediate language". Proceedings of the Types in Compilation Workshop. June 1997. Available online: ps. Bibtex citation.
  • Simon Peyton Jones. "Compiling Haskell by program transformation: a report from the trenches". Proc European Symposium on Programming (ESOP'96). LNCS 1058. January 1996. Available online: ps. Bibtex citation.
  • Simon Peyton Jones, WD Partain and A Santos. "Let-floating: moving bindings to give faster programs". Proc International Conference on Functional Programming (ICFP'96). May 1996. Available online: ps. Bibtex citation.
  • A Gill. "Cheap deforestation for non-strict functional languages". PhD. Thesis. University of Glasgow. January 1996. Available online: ps. Bibtex citation.
  • A Santos. "Compilation by transformation in non-strict functional languages". PhD. Thesis. University of Glasgow. September 1995. Available online: ps. Bibtex citation.
  • P Sansom and Simon Peyton Jones. "Time and space profiling for non-strict functional languages". 22nd ACM Symposium on Principles of Programming Languages (POPL'95). January 1995. Available online: ps. Bibtex citation.
  • P Sansom. "Execution profiling for non-strict functional languages". PhD. Thesis. University of Glasgow. November 1994. Available online: ps. Bibtex citation.
  • A Gill, Simon Peyton Jones and J Launchbury. "A short cut to deforestation". Proc Functional Programming Languages and Computer Architecture (FPCA'93). June 1993. Available online: ps. Bibtex citation.
  • Simon Peyton Jones and WD Partain. "Measuring the effectiveness of a simple strictness analyser". Functional Programming Glasgow, Workshops in Computing, 1993. 1993. Available online: ps. Bibtex citation.
  • Simon Peyton Jones, CV Hall, K Hammond, WD Partain and PL Wadler. "The Glasgow Haskell compiler: a technical overview". Proceedings of Joint Framework for Information Technology Technical Conference. March 1993. Available online: ps. Bibtex citation.
  • P Sansom and Simon Peyton Jones. "Generational garbage collection for Haskell". Proc Functional Programming Languages and Computer Architecture (FPCA'93). June 1993. Available online: ps. Bibtex citation.
  • Simon Peyton Jones. "Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine". Journal of Functional Programming. 2(2). April 1992. Available online: ps. Bibtex citation.
  • Simon Peyton Jones and J Launchbury. "Unboxed values as first class citizens". Functional Programming Languages and Computer Architecture (FPCA'91). LNCS 523. September 1991. Available online: ps. Bibtex citation.
  • Simon Peyton Jones and D Lester. "A modular fully-lazy lambda lifter in Haskell". Software Practice and Experience. 21(5). May 1991. Available online: ps. Bibtex citation.
  • David N. Turner, Philip Wadler and Christian Mossin. "Once upon a type". 7'th International Conference on Functional Programming and Computer Architecture. June 1995. Available online: ps. Bibtex citation.
  • David N. Turner, Philip Wadler and Christian Mossin. "Once upon a type". 1995. Available online: ps. Bibtex citation.
  • Philip Wadler. "Deforestation: transforming programs to eliminate trees". Theoretical Computer Science, (Special issue of selected papers from 2'nd European Symposium on Programming). 73. 1990. Available online: ps. Bibtex citation.
  • Philip Wadler. "Strictness analysis aids time analysis". 15'th ACM Symposium on Principles of Programming Languages. January 1988. Available online: ps. Bibtex citation.
  • Philip Wadler and R.J.M. Hughes. "Projections for strictness analysis". 3'rd International Conference on Functional Programming Languages and Computer Architecture. September 1987. Available online: ps. Bibtex citation.
  • Philip Wadler. "Strictness analysis on non-flat domains (by abstract interpretation over finite domains)". Abstract Interpretation. 1987. Available online: ps. Bibtex citation.
  • Philip Wadler. "Fixing some space leaks with a garbage collector". Software Practice and Experience. 17(9). September 1987. Available online: ps. Bibtex citation.
  • Mark P. Jones. "Hugs 1.3, The Haskell User's Gofer System: User Manual". Department of Computer Science, University of Nottingham. Technical Report NOTTCS-TR-96-2. August 1996. Available online: pdf ps. Bibtex citation.
  • Mark P. Jones. "Dictionary-free Overloading by Partial Evaluation". ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation. June 1994. Available online: pdf ps. Bibtex citation.
  • Mark P. Jones. "Dictionary-free Overloading by Partial Evaluation". Yale University. 1994. Available online: pdf ps. Bibtex citation.
  • Mark P. Jones. "Typing Haskell in Haskell". Proceedings of the 1999 Haskell Workshop. October 1999. Available online: ps pdf html. Bibtex citation.
  • Mark P. Jones. "The implementation of the Gofer functional programming system". Yale University. Research Report YALEU/DCS/RR-1030. May 1994. Available online: pdf ps. Bibtex citation.
  • John Peterson and Mark P. Jones. "Implementing Type Classes". Proceedings of ACM SIGPLAN Symposium on Programming Language Design and Implementation. June 1993. Available online: ps. Bibtex citation.
  • Mark P. Jones. "Computing with lattices: An application of type classes". Journal of Functional Programming. 2 (4). October 1992. Bibtex citation.
  • Erik Meijer and Koen Claessen. "The design and Implementation of Mondrian". Haskell Workshop 1997. 1997. Available online: ps. Bibtex citation.
  • Koen Claessen. "Graphs in compilation". ICFP '97. 1997. Available online: ps. Bibtex citation.
  • Colin Runciman and Niklas Rojemo. "New Dimensions in Heap Profiling". York University. YCS-95-256. 1995. Available online: ps. Bibtex citation.
  • David Wakeling and Alan Dix. "Optimising Partial Applications in TIM". York University. YCS-93-215. 1993. Available online: ps. Bibtex citation.
  • Colin Runciman and David Wakeling. "Heap Profiling of Lazy Functional Programs". York University. YCS-92-172. 1992. Available online: ps. Bibtex citation.
  • Erik Meijer and Ross Paterson. "Down With Lambda-Lifting". Available online: pdf. Bibtex citation.
  • Jörgen Gustavsson. "Space-Safe Transformations and Usage Analysis for Call-by-Need Languages". PhD. Thesis. May 2001. Available online: ps. Bibtex citation.
  • Jörgen Gustavsson and David Sands. "Possibilities and Limitations of Call-by-Need Space Improvement". Proceedings of the International Conference on Functional Programming. September 2001. Available online: ps. Bibtex citation.
  • Jörgen Gustavsson and Josef Svenningsson. "Constraint Abstractions". Proceedings of Symposium on Programs as Data Objects II. volume 2053 of Lecture Notes in Computer Science. May 2001. Available online: ps. Bibtex citation.
  • Jörgen Gustavsson and Josef Svenningsson. "A Usage Analysis with Bounded Polymorphism and Subtyping". Proceedings of Workshop on Implementation of Functional Languages. volume 2011 of Lecture Notes in Computer Science. September 2000. Available online: ps. Bibtex citation.
  • Jörgen Gustavsson and David Sands. "A Foundation for Space-Safe Transformations of Call-by-Need Programs". Proceedings of Workshop on Higher Order Operational Techniques in Semantics. volume 26 of Electronic Notes in Theoretical Computer Science. September 1999. Available online: ps. Bibtex citation.
  • Jörgen Gustavsson. "A Type Based Sharing Analysis for Update Avoidance and Optimisation". Masters Thesis. May 1999. Available online: ps. Bibtex citation.
  • Jörgen Gustavsson. "A Type Based Sharing Analysis for Update Avoidance and Optimisation". Proceedings of the International Conference on Functional Programming. September 1998. Available online: ps. Bibtex citation.

Last modified: Saturday, December 24th, 2005 12:22:39am
HTML generated using WebIt!.