Narrowing-based Simulation of Term Rewriting Systems with Extra Variables and its Termination Proof

Narrowing-based Simulation of Term Rewriting Systems with Extra Variables and its Termination Proof

Bibliographic Details
Main Authors:	Nishida, Naoki, Sakai, Masahiko, Sakabe, Toshiki
Language:	en
Published:	2003
Online Access:	http://hdl.handle.net/2237/9247

Similar Items

Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems
by: UCHIYAMA, Keita, et al.
Published: (2007)

Partial Inversion of Constructor Term Rewriting Systems
by: Nishida, Naoki, et al.
Published: (2005)

Generation of Inverse Term Rewriting Systems for Pure Treeless Functions
by: Nishida, Naoki, et al.
Published: (2001)

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
by: Uchiyama, Keita, et al.
Published: (2007)

An Extension of the Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
by: SAKAI, Masahiko, et al.
Published: (2001)

Confluence of Length Preserving String Rewriting Systems is Undecidable
by: WANG, Yi, et al.
Published: (2007)

SOFTWARE VERIFICATION BASED ON TRANSFORMATION FROM PROCEDURAL PROGRAMS TO REWRITE SYSTEMS
by: Nishida, Naoki, et al.
Published: (2006)

Transformation for Refining Unraveled Conditional Term Rewriting Systems
by: Nishida, Naoki, et al.
Published: (2007)

Convergent Term Rewriting Systems for Inverse Computation of Injective Functions
by: Nishida, Naoki, et al.
Published: (2007)

Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting
by: KUSAKARI, Keiichirou, et al.
Published: (2005)

Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
by: Ryota Nakayama, et al.
Published: (2017-01-01)

Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction
by: Shinnosuke Mizutani, et al.
Published: (2018-02-01)

On Non-looping Term Rewriting
by: Wang, Yi, et al.
Published: (2006)

Transformational approach to inverse computation in term rewriting
by: Nishida, Naoki
Published: (2004)

On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems
by: Yoshiaki Kanazawa, et al.
Published: (2019-02-01)

Left-Incompatible Term Rewriting Systems and Functional Strategy
by: SAKAI, Masahiko
Published: (1997)

On Proving Termination of Higher-Order Rewrite Systems by Dependency Pair Technique
by: Sakai, Masahiko, et al.
Published: (2002)

On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
by: SAKAI, Masahiko, et al.
Published: (2005)

Termination of Narrowing: Automated Proofs and Modularity Properties
by: Iborra López, José
Published: (2013)

On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
by: Sakai, Masahiko, et al.
Published: (2001)

Termination and applications of term rewriting systems
by: Mohamed, Hanan A.
Published: (1989)

Innermost Reductions Find All Normal Forms on Right-Linear Terminating Overlay TRSs
by: Sakai, Masahiko, et al.
Published: (2003)

The Weighted Path Order for Termination of Term Rewriting
by: 山田, 晃久, et al.
Published: (2014)

Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Technique
by: SAKAI, Masahiko, et al.
Published: (2009)

Termination of canonical context-sensitive rewriting and productivity of rewrite systems
by: Salvador Lucas
Published: (2015-12-01)

Term Graph Rewriting and Parallel Term Rewriting
by: Andrea Corradini, et al.
Published: (2011-02-01)

Rewriting and Well-Definedness within a Proof System
by: Issam Maamria, et al.
Published: (2010-12-01)

String diagram rewriting : applications in category and proof theory
by: Acclavio, Matteo
Published: (2016)

Undecidable Properties on Length-Two String Rewriting Systems
by: Sakai, Masahiko, et al.
Published: (2007)

Non-simplifying Graph Rewriting Termination
by: Bruno Guillaume, et al.
Published: (2013-02-01)

Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting
by: 草刈, 圭一朗, et al.
Published: (2007)

Descendants and Head Normalization of Higher-Order Rewrite Systems
by: Kasuya, Hideto, et al.
Published: (2002)

構成子項書換え系の逆計算プログラムの生成
by: 西田, 直樹, et al.
Published: (2005)

Termination of Rewriting with and Automated Synthesis of Forbidden Patterns
by: Bernhard Gramlich, et al.
Published: (2010-12-01)

An Improved Recursive Decomposition Ordering for Higher-Order Rewrite Systems
by: IWAMI, Munehiro, et al.
Published: (1998)

On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms
by: Naoki Nishida, et al.
Published: (2013-11-01)

A Comparative Analysis of Implants Presenting Different Diameters: Extra-Narrow, Narrow and Conventional
by: Henrique Tuzzolo Neto, et al.
Published: (2020-04-01)

Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems
by: Naohi Eguchi
Published: (2015-05-01)

A narrowing procedure for inductive proof in theories with constructors
by: CAI, YAI-XING, et al.
Published: (1988)

Extending Context-Sensitivity in Term Rewriting
by: Bernhard Gramlich, et al.
Published: (2010-01-01)

Cannot write session to /tmp/vufind_sessions/sess_gb2ve5q5mqivs9uisikihsv77u