Compiling Lazy Pattern Matching (1992)

Cached

Download Links

by Luc Maranget
Venue:In Proc. of the 1992 conference on Lisp and Functional Programming
Citations:11 - 4 self

Documents Related by Co-Citation

82 Compiling pattern matching – L Augustsson - 1985
65 Compiling a Functional Language – Luca Cardelli - 1984
23 Compiling Pattern Matching by Term Decomposition – Laurence Puel, Ascander Suarez - 1989
12 Comparison of priority rules in pattern matching and term rewriting – A Laville - 1991
39 Efficient compilation of pattern-matching – P Wadler - 1987
608 The Definition of Standard ML (Revised – R Milner, M Tofte, R Harper, D MacQueen - 1997
1566 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
225 Report on the programming language Haskell: A non-strict, purely functional language – Paul Hudak, Philip Wadler, Arvind Brian, Boutel Jon Fairbairn, Joseph Fasel, Kevin Hammond, John Hughes, Thomas Johnsson, Dick Kieburtz, Rishiyur Nikhil, Simon Peyton Jones, Mike Reeve, David Wise, Jonathan Young - 1992
940 A theory of type polymorphism in programming – Robin Milner - 1978
8 When Do Match-Compilation Heuristics Matter? – Kevin Scott, Norman Ramsey - 2000
11 Implementation of lazy pattern matching algorithms – Alain Laville - 1988
398 LCF considered as a programming language – G Plotkin - 1977
11 ML pattern match compilation and partial evaluation – Peter Sestoft - 1996
35 Call by need computations in non-ambiguous linear term rewriting systems – G Huet, J-J Lévy - 1979
102 98: A non-strict, purely functional language. http://www.haskell.org – Simon L Peyton Jones, John Hughes - 1999
620 Compiling with Continuations – A W Appel - 1992
4 Symbolic Execution of Formal Machine Descriptions – J D Oakley - 1979
4 Register Allocation and Phase Interactions in Retargetable Optimizing Compilers – Manuel Enrique Benitez - 1994
6 Techniques for Fast Instruction Cache Performance Evaluation – David B. Whalley - 1993