Yoshihito Toyama

Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

2017

Improving Rewriting Induction Approach for Proving Ground Confluence.

[BibT_eX]

[DOI]

Yuta Kimura

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems.

[BibT_eX]

[DOI]

Kentaro Kikuchi

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

2016

Critical Pair Analysis in Nominal Rewriting.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Symbolic Computation in Software Science, 2016

Normalisation by Random Descent.

[BibT_eX]

[DOI]

Vincent van Oostrom

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Ground Confluence Prover based on Rewriting Induction.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

2015

Confluence of Orthogonal Nominal Rewriting Systems Revisited.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Correctness of Context-Moving Transformations for Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

2014

Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams.

[BibT_eX]

[DOI]

Kazumasa Uchida

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2012

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

2010

Program Transformation Templates for Tupling Based on Term Rewriting.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2010

2009

Proving Confluence of Term Rewriting Systems Automatically.

[BibT_eX]

[DOI]

Junichi Yoshida

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008

Automatic Construction of Program Transformation Templates.

[BibT_eX]

[DOI]

Inf. Media Technol., 2008

Modular Church-Rosser Modulo: The Complete Picture.

[BibT_eX]

[DOI]

Jean-Pierre Jouannaud

Int. J. Softw. Informatics, 2008

Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2007

Program Transformation by Templates: A Rewriting Framework.

[BibT_eX]

[DOI]

Inf. Media Technol., 2007

2006

Elimination Transformations for Associative-Commutative Rewriting Systems.

[BibT_eX]

[DOI]

Keiichirou Kusakari

Masaki Nakamura

J. Autom. Reason., 2006

2005

Confluent Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Program transformation by templates based on term rewriting.

[BibT_eX]

[DOI]

Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

Reduction Strategies for Left-Linear Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Processes, 2005

2004

Preface.

[BibT_eX]

[DOI]

Sergio Antoy

Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, 2004

Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

Inductive Theorems for Higher-Order Rewriting.

[BibT_eX]

[DOI]

Toshiyuki Yamada

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

2002

Decidability for Left-Linear Growing Term Rewriting Systems.

[BibT_eX]

[DOI]

Takashi Nagaya

Inf. Comput., 2002

2000

New Challenges for Compuational Models.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

1999

Decidability for Left-Linaer Growing Term Rewriting Systems.

[BibT_eX]

[DOI]

Takashi Nagaya

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

Argument Filtering Transformation.

[BibT_eX]

[DOI]

Keiichirou Kusakari

Masaki Nakamura

Proceedings of the Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29, 1999

1998

Semantics and Strong Sequentiality of Priority Term Rewriting Systems.

[BibT_eX]

[DOI]

Masahiko Sakai

Theor. Comput. Sci., 1998

Termination Transformation by Tree Lifting Ordering.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

1997

Persistency of Confluence.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1997

On Composable Properties of Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

1995

Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems.

[BibT_eX]

[DOI]

Hendrik Pieter Barendregt

Jan Willem Klop

J. ACM, 1995

1994

Modularity of Confluence: A Simplified Proof.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems.

[BibT_eX]

[DOI]

Michio Oyamaguchi

Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

1993

Completeness of Combinations of Constructor Systems.

[BibT_eX]

[DOI]

Aart Middeldorp

J. Symb. Comput., 1993

1992

Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991

How to Prove Equivalence of Term Rewriting Systems Without Induction.

[BibT_eX]

Theor. Comput. Sci., 1991

1989

Fast Knuth-Bendix Completion with a Term Rewriting System Compiler.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-.

[BibT_eX]

[DOI]

Hendrik Pieter Barendregt

Jan Willem Klop

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

1987

On the Church-Rosser property for the direct sum of term rewriting systems.

[BibT_eX]

[DOI]

J. ACM, 1987

Counterexamples to Termination for the Direct Sum of Term Rewriting Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Confluent Term Rewriting Systems with Membership Conditions.

[BibT_eX]

[DOI]

Proceedings of the Conditional Term Rewriting Systems, 1987

1984

On Equivalence Transformations for Term Rewriting Systems.

[BibT_eX]

[DOI]