( en | de | ru )

 

Disambiguation of "Lescanne, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
Characterizing strong normalization in a language with control operators.

, , and . PPDP, page 155-166. ACM, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Pierre Venet

Pierre Nyabyenda

Pierre Gottschlich

Pierre Mattern

Pierre Mangold

 

Other publications of authors with the same name

Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution., , and . PLILP, volume 1140 of Lecture Notes in Computer Science, page 393-407. Springer, (1996)Mechanizing common knowledge logic using COQ.. Ann. Math. Artif. Intell., 48 (1-2): 15-43 (2006)Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status.. CAAP, page 181-194. Cambridge University Press, (1984)Counting Environments and Closures., and . FSCD, volume 108 of LIPIcs, page 11:1-11:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Strong Normalization of Explicit Substitution Calculi (Short Note)., and . J. Funct. Log. Program., (2000)Manipulation d'arbres syntaxiques et contruction de programmes., and . CLAAP, page 208-224. Université de Lille 1, (1980)Rewrite Orderings and Termination of Rewrite Systems.. MFCS, volume 520 of Lecture Notes in Computer Science, page 17-27. Springer, (1991)Bubbles are rational. CoRR, (2013)Combinatorics of $$łambda$$-terms: a natural approach., , , and . J. Log. Comput., 27 (8): 2611-2630 (2017)NARROWER: A New Algorithm for Unification and Its Application to Logic Programming., , , and . RTA, volume 202 of Lecture Notes in Computer Science, page 141-157. Springer, (1985)