From post

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.

 

Другие публикации лиц с тем же именем

Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution., , и . PLILP, том 1140 из Lecture Notes in Computer Science, стр. 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, стр. 181-194. Cambridge University Press, (1984)Counting Environments and Closures., и . FSCD, том 108 из LIPIcs, стр. 11:1-11:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Strong Normalization of Explicit Substitution Calculi (Short Note)., и . J. Funct. Log. Program., (2000)Manipulation d'arbres syntaxiques et contruction de programmes., и . CLAAP, стр. 208-224. Université de Lille 1, (1980)Rewrite Orderings and Termination of Rewrite Systems.. MFCS, том 520 из Lecture Notes in Computer Science, стр. 17-27. Springer, (1991)Bubbles are rational. CoRR, (2013)Combinatorics of $$łambda$$-terms: a natural approach., , , и . J. Log. Comput., 27 (8): 2611-2630 (2017)NARROWER: A New Algorithm for Unification and Its Application to Logic Programming., , , и . RTA, том 202 из Lecture Notes in Computer Science, стр. 141-157. Springer, (1985)