Conferences in DBLP
François Bronsard , Uday S. Francois Conditional Rewriting in Focus. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:2-13 [Conf ] Nachum Dershowitz A Maximal-Literal Unit Strategy for Horn Clauses. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:14-25 [Conf ] Jan Willem Klop , Roel C. de Vrijer Extended Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:26-50 [Conf ] Emmanuel Kounalis , Michaël Rusinowitch A Proof System for Conditional Algebraic Specifications. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:51-63 [Conf ] José Meseguer Conditional Rewriting Logic: Deduction, Models and Concurrency. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:64-91 [Conf ] Chilukuri K. Mohan Equivalences of Rewrite Programs. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:92-97 [Conf ] Hong Chen , Jieh Hsiang , Hwa-Chung Kong On Finite Representations of Infinite Sequences of Terms. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:100-114 [Conf ] Yiyun Chen , Michael J. O'Donnell Infinite Terms and Infinite Rewritings. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:115-126 [Conf ] Yiyun Chen , Michael J. O'Donnell Testing Confluence of Nonterminating Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:127-136 [Conf ] Bernard R. Hodgson , Clement F. Kent A Survey of Ordinal Interpretations of Type epsilon0 for Termination of Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:137-142 [Conf ] Hélène Kirchner , Miki Hermann Meta-rule Synthesis from Crossed Rewrite Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:143-154 [Conf ] Siva Anantharaman , Maria Paola Bonacina An Application of Automated Equational Reasoning to Many-valued Logic. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:156-161 [Conf ] Leo Bachmair , Harald Ganzinger Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:162-180 [Conf ] Hubert Bertling Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and Paramodulation. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:181-193 [Conf ] Eddy Bevers , Johan Lewi Proof by Consistency in Conditional Equational Theories. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:194-205 [Conf ] Maria Paola Bonacina , Jieh Hsiang Completion Procedures as Semidecision Procedures. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:206-232 [Conf ] Hervé Devie Linear Completion. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:233-245 [Conf ] Robert Nieuwenhuis , Fernando Orejas Clausal Rewriting. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:246-258 [Conf ] Franco Barbanera Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:260-271 [Conf ] Wadoud Bousdira , Jean-Luc Remy On Sufficient Completeness of Conditional Specifications. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:272-286 [Conf ] N. Lichtenstein , Stéphane Kaplan FPL: Functional Plus Logic Programming: An Integration of the FP and Prolog Languages. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:287-294 [Conf ] Aart Middeldorp Confluence of the Disjoint Union of Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:295-306 [Conf ] Detlef Plump Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:307-317 [Conf ] Hitoshi Aida , Joseph A. Goguen , José Meseguer Compiling Concurrent Rewriting onto the Rewrite Rule Machine. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:320-332 [Conf ] Sergio Antoy Design Strategies for Rewrite Rules. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:333-341 [Conf ] Louis Galbiati , Carolyn L. Talcott A Simplifier for Untyped Lambda Expressions. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:342-353 [Conf ] Marko C. J. D. van Eekelen , Marinus J. Plasmeijer , J. E. W. Smetsers Parallel Graph Rewriting on Loosely Coupled Machine Architectures. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:354-369 [Conf ] Roberto M. Amadio Typed Equivalence, Type Assignment, and Type Containment. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:372-382 [Conf ] Martin C. Emele , Rémi Zajac A Fixed-Point Semantics for Feature Type Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:383-388 [Conf ] John G. Stell Unique-Sort Order-Sorted Theories: A Description as Monad Morphisms. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:389-400 [Conf ] Yong Sun Equational Logics (Birkhoff's Method Revisited). [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:401-406 [Conf ] Uwe Waldmann Compatibility of Order-Sorted Rewrite Rules. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:407-416 [Conf ] G. Aguzzi , U. Modigliani , M. Cecilia Verri An Universal Termination Condition for Solving Goals in Equational Languages. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:418-423 [Conf ] John Darlington , Yike Guo Constrained Equational Deduction. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:424-435 [Conf ] Tobias Nipkow Higher-Order Unification, Polymorphism, and Subsorts (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:436-447 [Conf ] Zhenyu Qian Second-Order Unification in the Presence of Linear Shallow Algebraic Equations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:448-453 [Conf ] Wayne Snyder , Christopher Lynch An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Logic Programming in the Presence of Equality. [Citation Graph (0, 0)][DBLP ] CTRS, 1990, pp:454-461 [Conf ]