(Enter summary)
Abstract: This paper provides a complete solution to that second challenge. In particular, the well-known (and size-efficient) pattern matching compilation technique using backtracking automata is here introduced for the first time into the world of lazy pattern matching. (Update)
Context of citations to this paper: More
.... 13 7 Related Work The pattern match compilation techniques used in functional language compilers [BM85, PS90, Aug85, Wad87, Ler91, Mar94] are complementary to our pattern optimization technique. The goal of pattern match compilers is to generate lower level code for a good order...
.... The combination of tree automata with failures is the basis for the current implementations of most common functional languages [Mar94, Ler90] The pattern matching of the SL system follows this approach, but the support of semantic notions and the non determinism of...
Cited by: More
Basic Pattern Matching Calculi: Syntax, Reduction, Confluence, and .. - Kahl (2003)
(Correct)
Optimizing Pattern Matching - Le Fessant, Maranget (2001)
(Correct)
From Syntactic Theories to Interpreters: A Specification.. - Xiao, Ariola, Mauny (2000)
(Correct)
Similar documents (at the sentence level):
36.4%: Two Techniques for Compiling Lazy Pattern Matching - Maranget (1994)
(Correct)
5.5%: Compiling Lazy Pattern Matching - Maranget (1992)
(Correct)
Active bibliography (related documents): More All
0.3: A Needed Narrowing Strategy - Antoy, Echahed, Hanus (1994)
(Correct)
0.2: First Class Patterns - Tullsen (2000)
(Correct)
0.2: ML pattern match compilation and partial evaluation - Sestoft (1996)
(Correct)
Similar documents based on text: More All
0.2: Compiling Pattern Matching by Term Decomposition - Puel, Suarez (1989)
(Correct)
0.1: H E V E A User Documentation - Version Luc Maranget
(Correct)
0.1: Termination of Term Rewriting: Interpretation and Type Elimination - Zantema (1994)
(Correct)
Related documents from co-citation: More All
4: Compiling pattern matching (context) - Augustsson - 1985
4: Compiling pattern matching by term decomposition
- Puel, Su'arez - 1989
3: The ZINC experiment: an economical implementation of the ML language
- Leroy - 1990
BibTeX entry: (Update)
L. Maranget. Two techniques for compiling lazy pattern matching. Research report 2385, INRIA, 1994. http://citeseer.ist.psu.edu/article/maranget94two.html More
@techreport{ maranget94two,
author = "Luc Maranget",
title = "Two Techniques for Compiling Lazy Pattern Matching",
number = "2385",
year = "1994",
url = "citeseer.ist.psu.edu/article/maranget94two.html" }
Citations (may not include all citations):
306
LCF considered as a programming language (context) - Plotkin - 1977
257
Report on the programming language haskell (context) - Hudak, Peyton et al. - 1992
178
Standard ML of New Jersey
- Appel, MacQueen - 1991
103
The denition of Standard ML (context) - Harper, Milner et al. - 1991
81
The ZINC experiment: an economical implementation of the ML ..
- Leroy - 1990
36
Call by need computations in non-ambiguous linear term rewri.. (context) - Huet, evy - 1991
34
Compiling pattern matching (context) - Augustsson - 1985
25
Compiling pattern matching by term decomposition
- Puel, Su - 1993
23
The CAML reference manual (context) - Weis - 1990
16
GAML: A parallel implementation of lazy ML
- Maranget - 1991
13
categorical combinators (context) - Curien - 1986
11
Domaines concrets (context) - Kahn, Plotkin - 1978
10
The Caml Light system (context) - Leroy - 1995
10
Comparison of priority rules in pattern matching and term re.. (context) - Laville - 1991
7
Tree pattern matching for ML (context) - Baudinet, MacQueen - 1986
6
cient compilation for lazy evaluation (context) - Johnsson - 1984
4
cient compilation of pattern matching (context) - Wadler - 1987
3
The specicity rule for lazy pattern matching in ambiguous te.. (context) - Kennaway - 1990
1
Compiling lazy patern matching (context) - Maranget
1
A survey of some syntactic results in the lambda-calculus (context) - Berry, evy - 1979
1
Adaptive patter matching (context) - Sekar, Ramesh et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pauillac.inria.fr/publioscope.html): More
Optimal Derivations in Weak Lambda-calculi and in Orthogonal.. - Maranget (1991)
(Correct)
Functional Back-Ends within the Lambda-Sigma Calculus - Hardin, Maranget, Pagano (1996)
(Correct)
Compiling Join-Patterns - Maranget, Le Fessant (1998)
(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