See this document in CiteSeerX!

Optimizing Pattern Matching (2001)  (Make Corrections)  (2 citations)
Fabrice Le Fessant, Luc Maranget
International Conference on Functional Programming



  Home/Search   Context   Related

 
View or download:
pauillac.inria.fr/~mara...optpat.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cristal.inria.fr/~fpott...english (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present improvements to the backtracking technique of pattern-matching compilation. Several optimizations are introduced, such as commutation of patterns, use of exhaustiveness information, and control ow optimization through the use of labeled static exceptions and context information. These optimizations have been integrated in the ObjectiveCaml compiler. They have shown good results in increasing the speed of pattern-matching intensive programs, without increasing nal code size. (Update)

Cited by:   More
Synchronous Dataflow Pattern Matching - Hamon (2004)   (Correct)
Basic Pattern Matching Calculi: Syntax, Reduction, Confluence, and .. - Kahl (2003)   (Correct)

Active bibliography (related documents):   More   All
0.4:   A Parallel Functional Language Compiler for Message-Passing.. - Junaidu (1998)   (Correct)
0.3:   Adaptive Pattern Matching - Sekar, Ramesh (1992)   (Correct)
0.3:   Tree Automata and Pattern Matching - Hosoya, Pierce (2000)   (Correct)

Similar documents based on text:   More   All
0.7:   An Implementation of Complete, Asynchronous.. - Le Fessant, Piumarta, .. (1998)   (Correct)
0.5:   JoCaml: a Language for Concurrent Distributed and.. - Fournet, Le..   (Correct)
0.5:   Adaptable and Mobile-Aware Distributed Objects - Baggio (1999)   (Correct)

BibTeX entry:   (Update)

Fabrice Le Fessant and Luc Maranget. Optimizing pattern matching. In Xavier Leroy, editor, ICFP 2001, International Conference on Functional Programming, pages 26--37. ACM, September 2001. http://citeseer.ist.psu.edu/lefessant01optimizing.html   More

@inproceedings{ lefessant01optimizing,
    author = "Fabrice Le Fessant and Luc Maranget",
    title = "Optimizing Pattern Matching",
    booktitle = "International Conference on Functional Programming",
    pages = "26-37",
    year = "2001",
    url = "citeseer.ist.psu.edu/lefessant01optimizing.html" }
Citations (may not include all citations):
232   Constant propagation with conditional branches (context) - Wegman, Zadeck - 1985
82   Partial dead code elimination - Knoop, uthing et al. - 1994
47   Department of Computer Science (context) - Harper, MacQueen et al. - 1986
42   Compiling a functional language - Cardelli - 1984
34   Compiling pattern matching (context) - Augustsson - 1985
25   Compiling pattern matching by term decomposition - Puel, Su - 1993
18   Producing good code for the case statement (context) - Bernstein - 1985
18   Adaptive pattern matching - Sekar, Ramesh et al. - 1992
17   Interprocedural conditional branch elimination - Gupta, Soffa - 1997
13   Implementation of lazy pattern matching algorithms (context) - Laville - 1988
11   Generating a pattern matching compiler by partial evaluation (context) - rgensen - 1990
7   Two techniques for compiling lazy pattern matching - Maranget - 1994
7   Tree pattern matching for ML (context) - Baudinet, MacQueen - 1985
5   With Damien Doligez (context) - Leroy - 2000
5   Compiling lazy pattern matching - Maranget - 1992
5   ML pattern match compilation and partial evaluation - Sestoft - 1996
5   Compiler code generation for multiway branch statements as a.. (context) - Spuler - 1994
1   Objective-caml: Winner of the rst and second prizes of the p.. (context) - Caml'R - 2000
1   machine-independent peephole optimizer (context) - Fraser - 1979
1   When do match-compilation heuristics matter (context) - Scott, Ramsey - 2000
1   Compilation of pattern matching (context) - Wadler - 1987

Documents on the same site (http://cristal.inria.fr/~fpottier/biblio/english.html):   More
Satisfying Subtype Inequalities in Polynomial Space - Frey (1997)   (Correct)
The SLam Calculus: Programming with Secrecy and Integrity - Heintze, Riecke (1998)   (Correct)
Subtyping-Constraint-Based Type Inference With Conditional.. - Pottier (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC