Laurence Puel

12 papers A* 1B 1Journal 4Unranked 6
YearRankTypeTitle / Venue / Authors
1999 J jnl
lambda-Calculi with Explicit Substitutions Preserving Strong Normalization.
Appl. Algebra Eng. Commun. Comput.
Maria C. F. Ferreira, Delia Kesner, Laurence Puel
1998 B conf
Reducing AC-Termination to Termination.
MFCS
Maria C. F. Ferreira, Delia Kesner, Laurence Puel
1996 J jnl
A Typed Pattern Calculus.
Inf. Comput.
Delia Kesner, Laurence Puel, Val Tannen
1996 — conf
Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization.
ALP
Maria C. F. Ferreira, Delia Kesner, Laurence Puel
1993 A* conf
A Typed Pattern Calculus
LICS
Val Tannen, Delia Kesner, Laurence Puel
1993 J jnl
Compiling Pattern Matching by Term Decomposition.
J. Symb. Comput.
Laurence Puel, Ascánder Suárez
1993 — conf
Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols.
RTA
Catherine Delor, Laurence Puel
1993 — conf
Optimal Solutions to Pattern Matching Problems.
TAPSOFT
Laurence Puel, Ascánder Suárez
1990 — conf
Compiling Pattern Matching by Term Decomposition.
LISP and Functional Programming
Laurence Puel, Ascánder Suárez
1989 — conf
Embedding with Patterns and Associated Recursive Path Ordering.
RTA
Laurence Puel
1989 J jnl
Using Unavoidable Set of Trees to Generalize Kruskal's Theorem.
J. Symb. Comput.
Laurence Puel
1984 — conf
Proofs in the Final Algebra.
CAAP
Laurence Puel