Sakai Masahiko | Graduate School Of Information Science Nagoya Univ.

スポンサーリンク

概要

関連著者

もっと見る

著作論文

Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes
Recognizability of Redexes for Higher-Order Rewrite Systems
Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques
Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes
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
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
Confluence of Length Preserving String Rewriting Systems is Undecidable
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

もっと見る

スポンサーリンク