スポンサーリンク
Graduate School of Information Science, Nagoya Univ. | 論文
- Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
- 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
- 2P466 A study of a reaction-diffusion-convection system by using cellular automaton model(50. Non-equilibrium and complex system,Poster Session,Abstract,Meeting Program of EABS & BSJ 2006)
- 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)