Conferences in DBLP
Yuri Matiyasevich On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Massimo Marchiori Modularity of Completeness Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Steinbach Automatic Termination Proofs With Transformation Orderings. [Citation Graph (0, 0)][DBLP ] Conf ] Olav Lysne , Javier Piris A Termination Ordering for Higher Order Rewrite System. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Zantema , Alfons Geser A Complete Characterization of Termination of Op 1q -> 1r Os . [Citation Graph (0, 0)][DBLP ] Conf ] Robert Nieuwenhuis On Narrowing, Refutation Proofs and Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Masahito Kurihara , Hisashi Kondo , Azuma Ohuchi Completion for Multiple Reduction Orderings. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Schmid , Roland Fettig Towards an Efficient Construction of Test Sets for Deciding Ground Reducability. [Citation Graph (0, 0)][DBLP ] Conf ] Mark E. Stickel Term Rewriting in Contemporary Resolution Theorem Proving (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Asperti delta o!Epsilon = 1 - Optimizing Optimal lambda -Calculus Implementations.Citation Graph (0, 0)][DBLP ] Conf ] Peter Graf Substitution Tree Indexing. [Citation Graph (0, 0)][DBLP ] Conf ] Ilies Alouini Concurrent Garbage Collection for Concurrent Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] J. F. Th. Kamperman , H. R. Walters Lazy Rewriting and Eager Machinery. [Citation Graph (0, 0)][DBLP ] Conf ] Siva Anantharaman , Gilles Richard A Rewrite Mechanism for Logic Programs with Negation. [Citation Graph (0, 0)][DBLP ] Conf ] Taro Suzuki , Aart Middeldorp , Tetsuo Ida Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Gehrke Problems in Rewriting Applied to Categorical Concepts by the Example of a Computational Comonad. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Corradini , Fabio Gadducci , Ugo Montanari Relating Two Categorial Models of Term Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Kahrs Towards a Domain Theory for Termination Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Tobias Nipkow Higher-Order Rewrite Systems (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Richard Kennaway , Jan Willem Klop , M. Ronan Sleep , Fer-Jan de Vries Infinitary Lambda Calculi and Böhm Models. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Kuper Proving the Genericity Lemma by Leftmost Reduction is Simple. [Citation Graph (0, 0)][DBLP ] Conf ] Steffen van Bakel , Maribel Fernández (Head-) Normalization of Typeable Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Lescanne , Jocelyne Rouyer-Degli Explicit Substitutions with de Bruijn's Levels. [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Boulton A Restricted Form on Higher-Order Rewriting Applied to an HDL Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] H. R. Walters , Hans Zantema Rewrite Systems for Integer Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] Habib Abdulrab , Marianne Maksimenko General Solution of Systems of Linear Diophantine Equations and Inequations. [Citation Graph (0, 0)][DBLP ] Conf ] Franz Baader , Klaus U. Schulz Combination of Constraint Solving Techniques: An Algebraic POint of View. [Citation Graph (0, 0)][DBLP ] Conf ] Friedrich Otto , Paliath Narendran , Daniel J. Dougherty Some Independent Results for Equational Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Burghardt Regular Substitution Sets: A Means of Controlling E-Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Avenhaus , Jörg Denzinger , Matthias Fuchs DISCOUNT: A SYstem for Distributed Equational Deduction. [Citation Graph (0, 0)][DBLP ] Conf ] Françoise Bellegarde ASTRE: Towards a Fully Automated Program Transformation System. [Citation Graph (0, 0)][DBLP ] Conf ] Reinhard Bündgen , Manfred Göbel , Wolfgang Küchlin Parallel ReDuX -> PaReDuX. [Citation Graph (0, 0)][DBLP ] Conf ] Ta Chen , Siva Anantharaman STORM: A MAny-to-One Associative-Commutative Matcher. [Citation Graph (0, 0)][DBLP ] Conf ] Jacques Chazarain , Serge Muller LEMMA: A System for Automated Synthesis of Recursive Programs in Equational Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Giesl Generating Polynomial Orderings for Termination Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] M. Randall Holmes Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2. [Citation Graph (0, 0)][DBLP ] Conf ] Hélène Kirchner , Pierre-Etienne Moreau Prototyping Completion with Constraints Using Computational Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Paccanaro Guiding Term Reduction Through a Neural Network: Some Prelimanary Results for the Group Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Mark E. Stickel , Hantao Zhang Studying Quasigroup Identities by Rewriting Techniques: Problems and First Results. [Citation Graph (0, 0)][DBLP ] Conf ] Nachum Dershowitz , Jean-Pierre Jouannaud , Jan Willem Klop Problems in Rewriting III. [Citation Graph (0, 0)][DBLP ] Conf ] 