ML pattern match compilation and partial evaluation (1996)

by Peter Sestoft
Citations:11 - 1 self

Documents Related by Co-Citation

81 Compiling pattern matching – L Augustsson - 1985
65 Compiling a Functional Language – Luca Cardelli - 1984
22 Adaptive Pattern Matching – R. C. Sekar, Bellcore Rm A, R. Ramesh, I. V. Ramakrishnan - 1992
137 Pattern matching in trees – C M Hoffmann, M J O’Donnell - 1982
38 Efficient compilation of pattern matching – P Wadler
23 Compiling Pattern Matching by Term Decomposition – Laurence Puel, Ascander Suarez - 1989
11 Compiling Lazy Pattern Matching – Luc Maranget - 1992
4 Combining Semantics with Non-Standard Interpreter Hierarchies – Sergei Abramov, Robert Glück - 2000
17 On the generation of specializers – R Gluck - 1994
2 Mechanical Proof of the Optimality of a Partial Evaluator – Sebastian C. Skalberg - 1999
19 On Jones-optimal specialization for strongly typed languages – Henning Makholm - 2000
21 Tag Elimination and Jones-Optimality – Walid Taha, Henning Makholm, John Hughes
27 The structure of a self-applicable partial evaluator – P Sestoft
22 Partial evaluation, self-application, and types – N D Jones
13 On the partial computation principle – A P Ershov - 1977
50 Generalized partial computation – Y Futamura, K Nogi - 1987
26 Generating Transformers for Deforestation and Supercompilation – Robert Glück, Jesper Jørgensen - 1994
33 Challenging problems in partial evaluation and mixed computation – Neil D Jones - 1988
173 Partial Evaluation of Computation Process - An Approach to a Compiler-Compiler – Yoshihiko Futamura - 1999