Kusakari Keiichirou | Graduate School Of Information Science Nagoya Univ.

スポンサーリンク

概要

関連著者

もっと見る

著作論文

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
Argument Filterings and Usable Rules in Higher-order Rewrite Systems
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
A Higher-Order Knuth-Bendix Procedure and Its Applications
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
Higher-Order Path Orders Based on Computability(Foundations of Computer Science)
Static Dependecy Pair Method in Rewriting Systems for Functional Programs with Product, Algebraic Data, and ML-Polymorphic Types
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

もっと見る

スポンサーリンク