Optimizing pattern matching

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2001, Pages 26-37

  Le Fessant, F ^a   Maranget, L ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; MATRIX ALGEBRA; OPTIMIZATION; PROGRAM COMPILERS; XML;

BACKTRACKING TECHNIQUE; OBJECTIVE-CAML COMPILER;

PATTERN MATCHING;

EID: 0034776388     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/507635.507641     Document Type: Conference Paper

References (21)

1. Compiling pattern matching
2. Tree pattern matching for ML
3. Producing good code for the case statement
4. Interprocedural conditional branch elimination
5. Compiling a functional language
6. A compact, machine-independent peephole optimizer
7. Standard ML
8. Generating a pattern matching compiler by partial evaluation
9. Partial dead code elimination
10. Implementation of lazy pattern matching algorithms
11. The objective caml system: Documentation and user's manual
12. Compiling lazy pattern matching
13. Two techniques for compiling lazy pattern matching
14. Objective-caml: Winner of the first and second prizes of the programming contest
15. Compiling pattern matching by term decomposition
16. When do match-compilation heuristics matter?
17. Adaptive pattern matching
18. ML pattern match compilation and partial evaluation
19. Compiler code generation for multiway branch statements as a static search problem
20. Compilation of pattern matching
21. Constant propagation with conditional branches