Laurence Puel

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	1999
j4		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
c8		Maria C. F. Ferreira, Delia Kesner, Laurence Puel: Reducing AC-Termination to Termination. MFCS 1998: 239-247
	1996
j3		Delia Kesner, Laurence Puel, Val Tannen: A Typed Pattern Calculus. Inf. Comput. 124(1): 32-61 (1996)
c7		Maria C. F. Ferreira, Delia Kesner, Laurence Puel: Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization. ALP 1996: 284-298
	1993
j2		Laurence Puel, Ascánder Suárez: Compiling Pattern Matching by Term Decomposition. J. Symb. Comput. 15(1): 1-26 (1993)
c6		Val Tannen, Delia Kesner, Laurence Puel: A Typed Pattern Calculus. LICS 1993: 262-274
c5		Catherine Delor, Laurence Puel: Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols. RTA 1993: 389-404
c4		Laurence Puel, Ascánder Suárez: Optimal Solutions to Pattern Matching Problems. TAPSOFT 1993: 501-518
	1990
c3		Laurence Puel, Ascánder Suárez: Compiling Pattern Matching by Term Decomposition. LISP and Functional Programming 1990: 273-281
	1989
j1		Laurence Puel: Using Unavoidable Set of Trees to Generalize Kruskal's Theorem. J. Symb. Comput. 8(4): 335-382 (1989)
c2		Laurence Puel: Embedding with Patterns and Associated Recursive Path Ordering. RTA 1989: 371-387
	1984
c1		Laurence Puel: Proofs in the Final Algebra. CAAP 1984: 227-242

Coauthor Index

1	Catherine Delor	[c5]
2	Maria C. F. Ferreira	[j4] [c8] [c7]
3	Delia Kesner	[j4] [c8] [j3] [c7] [c6]
4	Ascánder Suárez	[j2] [c4] [c3]
5	Val Tannen (Valeriu Breazu, Val Breazu-Tannen)	[j3] [c6]

Last update Wed May 22 11:43:06 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page