( en | de | ru )

 

Disambiguation of "Sakabe, Toshiki"

Author of the publication

copydeleteadd this publication to your clipboard
Unifying the Knuth-Bendix, recursive path and polynomial orders.

, , and . PPDP, page 181-192. ACM, (2013)

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.

No persons found for author name Sakabe, Toshiki
add a person with the name Sakabe, Toshiki
 

Other publications of authors with the same name

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs., , and . WFLP, volume 6816 of Lecture Notes in Computer Science, page 138-155. Springer, (2011)Specification of Abstract Data Types with Partially Defined Operations., , and . ICSE, page 218-224. IEEE Computer Society, (1982)A unified ordering for termination proving., , and . Sci. Comput. Program., (2015)Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity., , and . RTA, volume 10 of LIPIcs, page 267-282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting., , and . IEICE Trans. Inf. Syst., 88-D (12): 2715-2726 (2005)Narrowing-based simulation of term rewriting systems with extra variables., , and . WFLP, volume 86 of Electronic Notes in Theoretical Computer Science, page 52-69. Elsevier, (2003)A Unified Ordering for Termination Proving., , and . CoRR, (2014)Unifying the Knuth-Bendix, recursive path and polynomial orders., , and . PPDP, page 181-192. ACM, (2013)A formal description of monitors by CCS., , and . Syst. Comput. Jpn., 23 (1): 1-14 (1992)Algebraic specification and automatic generation of compilers., , and . Syst. Comput. Jpn., 23 (2): 1-13 (1992)