Bernhard Gramlich

Theor. Comput. Sci., 2012

Realizing Monads in Interaction Nets via Generic Typed Rules.

[BibT_eX]

[DOI]

Eugen Jiresch

Proceedings of the Theory and Applications of Models of Computation, 2012

On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems.

[BibT_eX]

[DOI]

Karl Gmeiner

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

2010

On-demand strategy annotations revisited: An improved on-demand evaluation strategy.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Characterizing and proving operational termination of deterministic conditional term rewriting systems.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2010

Termination of Rewriting with and Automated Synthesis of Forbidden Patterns

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on Strategies in Rewriting, 2010

On (Un)Soundness of Unravelings.

[BibT_eX]

[DOI]

Karl Gmeiner

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009

Extending Context-Sensitivity in Term Rewriting

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, 2009

VMTL-A Modular Termination Laboratory.

[BibT_eX]

[DOI]

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

2008

Transformations of Conditional Rewrite Systems Revisited.

[BibT_eX]

[DOI]

Karl Gmeiner

Proceedings of the Recent Trends in Algebraic Development Techniques, 2008

2007

Termination of Lazy Rewriting Revisited.

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, 2007

2006

A Framework for Timed Concurrent Constraint Programming with External Functions.

[BibT_eX]

[DOI]

María Alpuente

Alicia Villanueva

Proceedings of the Sixth Spanish Conference on Programming and Languages, 2006

Generalizing Newman's Lemma for Left-Linear Rewrite Systems.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005

Reduction strategies in rewriting and programming.

[BibT_eX]

[DOI]

J. Symb. Comput., 2005

2004

Strategic Issues, Problems and Challenges in Inductive Theorem Proving.

[BibT_eX]

[DOI]

Proceedings of the 5th International Workshop on Strategies in Automated Deduction, 2004

2003

Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Reduction Strategies in Rewriting and Programming, 2003

2002

Preface.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming, 2002

Simple termination of context-sensitive rewriting.

[BibT_eX]

[DOI]

Proceedings of the 2002 ACM SIGPLAN Workshop on Rule-Based Programming, 2002

Modular termination of context-sensitive rewriting.

[BibT_eX]

[DOI]

Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Improving On-Demand Strategy Annotations.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2002

Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations.

[BibT_eX]

[DOI]

Reinhard Pichler

Proceedings of the Automated Deduction, 2002

2001

1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface.

[BibT_eX]

[DOI]

Proceedings of the 1st International Workshop on Reduction Strategies in Rewriting and Programming, 2001

On interreduction of semi-complete term rewriting systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Preface: STRATEGIES 2001.

[BibT_eX]

[DOI]

Maria Paola Bonacina

Proceedings of the 4th International Workshop on Strategies in Automated Deduction, 2001

2000

Editorial: Strategies in Automated Deduction.

[BibT_eX]

[DOI]

Hélène Kirchner

Frank Pfenning

Ann. Math. Artif. Intell., 2000

Simplifying termination proofs for rewrite systems by preprocessing.

[BibT_eX]

[DOI]

Proceedings of the 2nd international ACM SIGPLAN conference on on Principles and practice of declarative programming, 2000

1997

Modular aspects of rewrite-based specifications.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

1996

Termination and confluence: properties of structured rewrite systems.

[BibT_eX]

[DOI]

PhD thesis, 1996

On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Confluence of Terminating Conditional Rewrite Systems Revisited.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

On Proving Termination by Innermost Termination.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

Confluence without Termination via Parallel Critical Pairs.

[BibT_eX]

[DOI]

Proceedings of the Trees in Algebra and Programming, 1996

1995

Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1995

Simple termination is difficult.

[BibT_eX]

[DOI]

Aart Middeldorp

Appl. Algebra Eng. Commun. Comput., 1995

1994

A Constructor-Based Approach to Positive/Negative-Conditional Equational Specifications.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

A Note on a Parameterized Version of the Well-Founded Induction Pricible.

[BibT_eX]

Bull. EATCS, 1994

Generalized Sufficient Conditions for Modular Termination of Rewriting.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1994

On Termination and Confluence of Conditional Rewrite Systems.

[BibT_eX]

[DOI]

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

On Notions of Inductive Validity for First-Oder Equational Clauses.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Logic Programming, 4th International Conference, 1994

1992

Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Automated Reasoning, 1992

A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications.

[BibT_eX]

[DOI]

Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

Sufficient Conditions for Modular Termination of Conditional Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

1990

Completion Based Inductive Theorem Proving: An Abstract Framework and its Applications.

[BibT_eX]

Proceedings of the 9th European Conference on Artificial Intelligence, 1990

UNICOM: A Refined Completion Based Inductive Theorem Prover.

[BibT_eX]

[DOI]