Author of the publication

Church-Rosser Properties of Weakly Terminating Term Rewriting Systems.

, , and . IJCAI, page 909-915. William Kaufmann, (1983)

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.

 

Other publications of authors with the same name

Completion of a Set of Rules Modulo a Set of Equations., and . POPL, page 83-92. ACM Press, (1984)Termination of rewriting under strategies., and . ACM Trans. Comput. Log., 10 (2): 10:1-10:52 (2009)Implementing Computational Systems with Constraints., , and . PPCP, page 156-165. (1993)A Functional View of Rewriting and Strategies for a Semantics of ELAN., , and . Fuji International Symposium on Functional and Logic Programming, page 143-166. World Scientific, Singapore, (1998)Church-Rosser Properties of Weakly Terminating Term Rewriting Systems., , and . IJCAI, page 909-915. William Kaufmann, (1983)A Compiler for Rewrite Programs in Associative-Commutative Theories., and . PLILP/ALP, volume 1490 of Lecture Notes in Computer Science, page 230-249. Springer, (1998)A Proof of Weak Termination Providing the Right Way to Terminate., , and . ICTAC, volume 3407 of Lecture Notes in Computer Science, page 356-371. Springer, (2004)Meta-rule Synthesis from Crossed Rewrite Systems., and . CTRS, volume 516 of Lecture Notes in Computer Science, page 143-154. Springer, (1990)Some Extensions of Rewriting.. Term Rewriting, volume 909 of Lecture Notes in Computer Science, page 54-73. Springer, (1993)Strategic port graph rewriting: an interactive modelling framework., , and . Math. Struct. Comput. Sci., 29 (5): 615-662 (2019)