Previous Up Next

References

Aitken [1992]
W. Aitken. SML/NJ Match Compiler Notes. http://www.smlnj.org/compiler-notes/matchcomp.ps, 1992.
Appel and MacQueen [1991]
A. W. Appel and D. B. MacQueen. Standard ML of New Jersey. In International Symposium on Programming Language Implementation and Logic Programming. Springer-Verlag, 1991. Lecture Notes in Computer Science 583.
Augustsson [1985]
L. Augustsson. Compiling Pattern Matching. In Functional Programming Languages and Computer Architecture. Springer-Verlag, 1985. Lecture Notes in Computer Science 201.
Baudinet and MacQueen [1985]
M. Baudinet and D. B. MacQueen. Tree Pattern Matching for ML. http://www.smlnj.org/compiler-notes/85-note-baudinet.ps, 1985.
Garrigue [2004]
J. Garrigue. Typing Deep Pattern-Matching in Presence of Polymorphic Variants. In JSSST Workshop on Programming and Programming Languages, Gamagori, Japan, 2004.
Harper et al. [1991]
R. W. Harper, R. Milner, and M. Tofte. The Definition of Standard ML. The MIT Press, 1991.
Hudak et al. [1998]
P. Hudak, S. L. Peyton Jones, and et al. Haskell 98, A Non-Strict, Purely Functionnal Language. http://www.haskell.org/onlinereport/, 1998.
Huet and Lévy [1991]
G. Huet and J.-J Lévy. Call by Need Computations in Non-Ambiguous Linear Term Rewriting Systems. In J.-L. Lassez and G. D Plotkin, editors, Computational Logic, Essays in Honor of Alan Robinson. The MIT Press, 1991.
Kahn and Plotkin [1978]
G. Kahn and G. D. Plotkin. Domaines concrets. Technical Report 336, IRIA Laboria, 1978. (In French).
Laville [1991]
A. Laville. Comparison of Priority Rules in Pattern Matching and Term Rewriting. Journal of Symbolic Computations, 11 (4): 321–348, April 1991.
Le Fessant and Maranget [2001]
F. Le Fessant and L. Maranget. Optimizing Pattern Matching. In International Conference on Functional Programming. ACM press, 2001.
Leroy et al. [2003]
X. Leroy, D. Doligez, and et al. The Objective Caml Language (version 3.07). http://caml.inria.fr, 2003.
Maranget [1992]
L. Maranget. Compiling Lazy Pattern Matching. In Lisp and Functional Programming. ACM press, 1992.
Pettersson [1992]
M. Pettersson. A Term Pattern-Match Compiler Inspired by Finite Automata Theory. In Workshop on Compiler Construction. Springer-Verlag, 1992. Lecture Notes in Computer Science 641.
Peyton Jones et al. [1993]
S. L. Peyton Jones, C. V. Hall, K. Hammond, W. Partain, and P. Wadler. The Glasgow Haskell Compiler: a Technical Overview. In UK Joint Framework for Information Technology (JFIT) Technical Conference, 1993. http://www.haskell.org/ghc/.
Sekar et al. [1992]
R.C. Sekar, R. Ramesh, and I. V Ramakrishnan. Adaptive Pattern Matching. In International Colloquium on Automata Languages and Programming. Springer-Verlag, 1992. Lecture Notes in Computer Science 623.
Sestoft [1996]
P. Sestoft. ML Pattern Match Compilation and Partial Evaluation. In Dagstuhl Seminar on Partial Evaluation. Springer-Verlag, 1996. Lecture Notes in Computer Science 1110.
Wadler [1987]
Philip Wadler. Efficient Compilation of Pattern Matching. In Peyton Jones, S. L., The Implementation of Functional Programming Languages, chapter 6. Prentice-Hall, 1987.

Previous Up Next