Warnings for pattern matching

Journal of Functional Programming

Volumn 17, Issue 3, 2007, Pages 387-421

  Maranget, Luc ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HASKELL; SIMPLE ALGORITHM;

PATTERN MATCHING; SEMANTICS;

ALGORITHMS;

EID: 34249892818     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796807006223     Document Type: Article

References (18)

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