References
- [1]
-
Augustsson, L.
Compiling pattern matching.
In Functional Programming Languages and Computer Architecture.
1985.
- [2]
-
Baudinet, M., and MacQueen, D.
Tree pattern matching for ML,.
unpublished paper, Dec. 1985.
- [3]
-
Bernstein, R. L.
Producing good code for the case statement.
Software—Practice and Experience 15, 10 (Oct. 1985),
1021–1024.
- [4]
-
Bodík, R., Gupta, R., and Soffa, M. L.
Interprocedural conditional branch elimination.
In Conference on Programming Language Design and Implementation
(PLDI) (1997).
- [5]
-
Cardelli, L.
Compiling a functional language.
In Conference Record of the 1984 ACM Symposium on Lisp and
Functional Programming (Aug. 1984), ACM, pp. 208–217.
- [6]
-
Fraser, C. W.
A compact, machine-independent peephole optimizer.
In Symposium on Principles of Programming Languages (1979).
- [7]
-
Harper, R. W., MacQueen, D. B., and Milner, R.
Standard ML.
Report ECS-LFCS-86-2, Department of Computer Science, University of
Edinburgh, Edinburgh, UK, 1986.
Also CSR-209-86.
- [8]
-
Jřrgensen, J.
Generating a pattern matching compiler by partial evaluation.
In Glasgow Workshop on Functional Programming, Ullapool
(1990).
- [9]
-
Knoop, J., Rüthing, O., and Steffen, B.
Partial dead code elimination.
In Conference on Programming Language Design and
Implementation (1994).
- [10]
-
Laville, A.
Implementation of lazy pattern matching algorithms.
In ESOP'88 (1988), H. Ganzinger, Ed., vol. 300, pp. 298–316.
- [11]
-
Leroy, X.
The objective caml system: Documentation and user's manual, 2000.
With Damien Doligez, Jacques Garrigue, Didier Rémy, and Jrôme
Vouillon. Available from http://caml.inria.fr.
- [12]
-
Maranget, L.
Compiling lazy pattern matching.
In Proc. of the 1992 conference on Lisp and Functional
Programming (1992), ACM Press.
- [13]
-
Maranget, L.
Two techniques for compiling lazy pattern matching.
Research Report 2385, INRIA Rocquencourt, Oct. 1994.
- [14]
-
PLClub, and Caml'R Us.
Objective-caml: Winner of the first and second prizes of the p
rogramming contest, Sept. 2000.
ACM SIGPLAN International Conference on Functional Programming (ICFP
'2000).
- [15]
-
Puel, L., and Suárez, A.
Compiling pattern matching by term decomposition.
Journal of Symbolic Computation 15, 1 (Jan. 1993), 1–26.
- [16]
-
Scott, K., and Ramsey, N.
When do match-compilation heuristics matter?
Tech. Rep. CS-2000-13, Department of Computer Science, University of
Virginia, May 2000.
- [17]
-
Sekar, R. C., Ramesh, R., and Ramakrishnan, I. V.
Adaptive pattern matching.
In Automata, Languages and Programming, 19th International
Colloquium (1992), vol. LNCS 623.
- [18]
-
Sestoft, P.
ML pattern match compilation and partial evaluation.
Lecture Notes in Computer Science 1110 (1996), 446–??
- [19]
-
Spuler, D. A.
Compiler code generation for multiway branch statements as a static
search problem.
Tech. Rep. 94/3, Department of Computer Science, James Cook
University, 1994.
- [20]
-
Wadler, P.
Compilation of pattern matching.
In The Implementation of Functional Programming Languages,
S. L. Peyton Jones, Ed. Prentice-Hall International, 1987, ch. 7.
- [21]
-
Wegman, M., and Zadeck, F. K.
Constant propagation with conditional branches.
In Symposium on Principles of Programming Languages (1985).