| 1999 |
|---|
| 12 | EE | Maria C. F. Ferreira,
Delia Kesner,
Laurence Puel:
lambda-Calculi with Explicit Substitutions Preserving Strong Normalization.
Appl. Algebra Eng. Commun. Comput. 9(4): 333-371 (1999) |
| 1998 |
|---|
| 11 | EE | Maria C. F. Ferreira,
Delia Kesner,
Laurence Puel:
Reducing AC-Termination to Termination.
MFCS 1998: 239-247 |
| 1996 |
|---|
| 10 | | Maria C. F. Ferreira,
Delia Kesner,
Laurence Puel:
Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization.
ALP 1996: 284-298 |
| 9 | | Delia Kesner,
Laurence Puel,
Val Tannen:
A Typed Pattern Calculus.
Inf. Comput. 124(1): 32-61 (1996) |
| 1993 |
|---|
| 8 | | Val Tannen,
Delia Kesner,
Laurence Puel:
A Typed Pattern Calculus
LICS 1993: 262-274 |
| 7 | | Catherine Delor,
Laurence Puel:
Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols.
RTA 1993: 389-404 |
| 6 | | Laurence Puel,
Ascánder Suárez:
Optimal Solutions to Pattern Matching Problems.
TAPSOFT 1993: 501-518 |
| 5 | | Laurence Puel,
Ascánder Suárez:
Compiling Pattern Matching by Term Decomposition.
J. Symb. Comput. 15(1): 1-26 (1993) |
| 1990 |
|---|
| 4 | EE | Laurence Puel,
Ascánder Suárez:
Compiling Pattern Matching by Term Decomposition.
LISP and Functional Programming 1990: 273-281 |
| 1989 |
|---|
| 3 | | Laurence Puel:
Embedding with Patterns and Associated Recursive Path Ordering.
RTA 1989: 371-387 |
| 2 | | Laurence Puel:
Using Unavoidable Set of Trees to Generalize Kruskal's Theorem.
J. Symb. Comput. 8(4): 335-382 (1989) |
| 1984 |
|---|
| 1 | | Laurence Puel:
Proofs in the Final Algebra.
CAAP 1984: 227-242 |
