default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. CTRS 1990: Montreal, Canada
- Stéphane Kaplan, Mitsuhiro Okada:
Conditional and Typed Rewriting Systems, 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990, Proceedings. Lecture Notes in Computer Science 516, Springer 1991, ISBN 3-540-54317-1
Theory of Condtional and Horn Clause Systems
- François Bronsard, Uday S. Francois:
Conditional Rewriting in Focus. 2-13 - Nachum Dershowitz:
A Maximal-Literal Unit Strategy for Horn Clauses. 14-25 - Jan Willem Klop, Roel C. de Vrijer:
Extended Term Rewriting Systems. 26-50 - Emmanuel Kounalis, Michaël Rusinowitch:
A Proof System for Conditional Algebraic Specifications. 51-63 - José Meseguer:
Conditional Rewriting Logic: Deduction, Models and Concurrency. 64-91 - Chilukuri K. Mohan:
Equivalences of Rewrite Programs. 92-97
Infinite Terms, Non-Terminating Systems, and Termination
- Hong Chen, Jieh Hsiang, Hwa-Chung Kong:
On Finite Representations of Infinite Sequences of Terms. 100-114 - Yiyun Chen, Michael J. O'Donnell:
Infinite Terms and Infinite Rewritings. 115-126 - Yiyun Chen, Michael J. O'Donnell:
Testing Confluence of Nonterminating Rewriting Systems. 127-136 - Bernard R. Hodgson, Clement F. Kent:
A Survey of Ordinal Interpretations of Type epsilon0for Termination of Rewriting Systems. 137-142 - Hélène Kirchner, Miki Hermann:
Meta-rule Synthesis from Crossed Rewrite Systems. 143-154
Extension of Knuth-Bendix Completion
- Siva Anantharaman, Maria Paola Bonacina
:
An Application of Automated Equational Reasoning to Many-valued Logic. 156-161 - Leo Bachmair, Harald Ganzinger:
Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract). 162-180 - Hubert Bertling:
Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and Paramodulation. 181-193 - Eddy Bevers, Johan Lewi:
Proof by Consistency in Conditional Equational Theories. 194-205 - Maria Paola Bonacina, Jieh Hsiang:
Completion Procedures as Semidecision Procedures. 206-232 - Hervé Devie:
Linear Completion. 233-245 - Robert Nieuwenhuis, Fernando Orejas:
Clausal Rewriting. 246-258
Combined Systems, Combined Languages and Modularity
- Franco Barbanera:
Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved. 260-271 - Wadoud Bousdira, Jean-Luc Rémy:
On Sufficient Completeness of Conditional Specifications. 272-286 - N. Lichtenstein, Stéphane Kaplan:
FPL: Functional Plus Logic Programming: An Integration of the FP and Prolog Languages. 287-294 - Aart Middeldorp:
Confluence of the Disjoint Union of Conditional Term Rewriting Systems. 295-306 - Detlef Plump:
Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems. 307-317
Architecture, Compilers and Parallel Computation
- Hitoshi Aida, Joseph A. Goguen, José Meseguer:
Compiling Concurrent Rewriting onto the Rewrite Rule Machine. 320-332 - Sergio Antoy:
Design Strategies for Rewrite Rules. 333-341 - Louis Galbiati, Carolyn L. Talcott:
A Simplifier for Untyped Lambda Expressions. 342-353 - Marko C. J. D. van Eekelen, Marinus J. Plasmeijer, J. E. W. Smetsers:
Parallel Graph Rewriting on Loosely Coupled Machine Architectures. 354-369
Basic Frameworks for Typed and Order-Sorted Systems
- Roberto M. Amadio:
Typed Equivalence, Type Assignment, and Type Containment. 372-382 - Martin C. Emele, Rémi Zajac:
A Fixed-Point Semantics for Feature Type Systems. 383-388 - John G. Stell:
Unique-Sort Order-Sorted Theories: A Description as Monad Morphisms. 389-400 - Yong Sun:
Equational Logics (Birkhoff's Method Revisited). 401-406 - Uwe Waldmann:
Compatibility of Order-Sorted Rewrite Rules. 407-416
Extension of Unification and Narrowing Techniques
- Gianni Aguzzi, U. Modigliani, M. Cecilia Verri:
An Universal Termination Condition for Solving Goals in Equational Languages. 418-423 - John Darlington, Yike Guo:
Constrained Equational Deduction. 424-435 - Tobias Nipkow:
Higher-Order Unification, Polymorphism, and Subsorts (Extended Abstract). 436-447 - Zhenyu Qian:
Second-Order Unification in the Presence of Linear Shallow Algebraic Equations (Extended Abstract). 448-453 - 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. 454-461
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-03-27 20:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
