Laurence Puel

According to our database, Laurence Puel authored at least 10 papers between 1984 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1999

lambda-Calculi with Explicit Substitutions Preserving Strong Normalization.

Maria C. F. Ferreira, Delia Kesner, Laurence Puel

Appl. Algebra Eng. Commun. Comput., 1999

1998

Reducing AC-Termination to Termination.

Maria C. F. Ferreira, Delia Kesner, Laurence Puel

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1996

Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization.

Maria C. F. Ferreira, Delia Kesner, Laurence Puel

Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996

1993

Optimal Solutions to Pattern Matching Problems.

Laurence Puel, Ascánder Suárez

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols.

Catherine Delor, Laurence Puel

Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

A Typed Pattern Calculus

Val Tannen, Delia Kesner, Laurence Puel

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1990

Compiling Pattern Matching by Term Decomposition.

Laurence Puel, Ascánder Suárez

Proceedings of the 1990 ACM Conference on LISP and Functional Programming, 1990

1989

Using Unavoidable Set of Trees to Generalize Kruskal's Theorem.

Laurence Puel

J. Symb. Comput., 1989

Embedding with Patterns and Associated Recursive Path Ordering.

Laurence Puel

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

1984

Proofs in the Final Algebra.

Laurence Puel

Proceedings of the CAAP'84, 1984