Author of the publication

Dummy Elimination: Making Termination Easier.

, and . FCT, volume 965 of Lecture Notes in Computer Science, page 243-252. Springer, (1995)

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

Dummy Elimination in Equational Rewriting.. RTA, volume 1103 of Lecture Notes in Computer Science, page 78-92. Springer, (1996)Dummy Elimination: Making Termination Easier., and . FCT, volume 965 of Lecture Notes in Computer Science, page 243-252. Springer, (1995)Reducing AC-Termination to Termination., , and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 239-247. Springer, (1998)Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization., , and . ALP, volume 1139 of Lecture Notes in Computer Science, page 284-298. Springer, (1996)Well-foundedness of Term Orderings., and . CTRS, volume 968 of Lecture Notes in Computer Science, page 106-123. Springer, (1994)Syntactical Analysis of Total Termination., and . ALP, volume 850 of Lecture Notes in Computer Science, page 204-222. Springer, (1994)lambda-Calculi with Explicit Substitutions Preserving Strong Normalization., , and . Appl. Algebra Eng. Commun. Comput., 9 (4): 333-371 (1999)Total termination of term rewriting., and . Appl. Algebra Eng. Commun. Comput., 7 (2): 133-162 (1996)Total Termination of Term Rewriting., and . RTA, volume 690 of Lecture Notes in Computer Science, page 213-227. Springer, (1993)Context-Sensitive AC-Rewriting., and . RTA, volume 1631 of Lecture Notes in Computer Science, page 286-300. Springer, (1999)