Optimizing pattern matching
暂无分享,去创建一个
[1] Christopher W. Fraser. A compact, machine-independent peephole optimizer , 1979, POPL '79.
[2] Luc Maranget,et al. Two Techniques for Compiling Lazy Pattern Matching , 1994 .
[3] Alain Laville. Implementation of Lazy Pattern Matching Algorithms , 1988, ESOP.
[4] Robert L. Bernstein. Producing good code for the case statement , 1985, Softw. Pract. Exp..
[5] Jesper Jørgensen,et al. Generating a Pattern Matching Compiler by Partial Evaluation , 1990, Functional Programming.
[6] Luca Cardelli,et al. Compiling a functional language , 1984, LFP '84.
[7] Mark N. Wegman,et al. Constant propagation with conditional branches , 1985, POPL.
[8] Peter Sestoft,et al. MK Pattern Match Compilation and Partial Evaluation , 1996, Dagstuhl Seminar on Partial Evaluation.
[9] Laurence Puel,et al. Compiling Pattern Matching by Term Decomposition , 1993, J. Symb. Comput..
[10] Rajiv Gupta,et al. Interprocedural conditional branch elimination , 1997, PLDI '97.
[11] Robin Milner,et al. Standard ML: Report ECS-LFCS-86-2 , 1986 .
[12] Luc Maranget,et al. Compiling lazy pattern matching , 1992, LFP '92.
[13] Bernhard Steffen,et al. Partial dead code elimination , 1994, PLDI '94.
[14] Lennart Augustsson,et al. Compiling Pattern Matching , 1985, FPCA.
[15] I. V. Ramakrishnan,et al. Adaptive Pattern Matching , 1992, SIAM J. Comput..
[16] Norman Ramsey,et al. When Do Match-compilation Heuristics Matter? , 2000 .