Sakabe Toshiki | Graduate School Of Information Science Nagoya University

スポンサーリンク

概要

関連著者

もっと見る

著作論文

Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs
Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting
Characterizing Inductive Theorems by Extensional Initial Models in a Higher-Order Equational Logic
Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems
Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems

スポンサーリンク