Conditional and Typed Rewriting Systems

1. Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved

   • Franco Barbanera

   Pages 259-271

2. On sufficient completeness of conditional specifications

   • Wadoud Bousdira, Jean-Luc Rémy

   Pages 272-286

3. FPL : Functional plus logic programming an integration of the FP and Prolog languages

   • N. Lichtenstein, S. Kaplan

   Pages 287-294

4. Confluence of the disjoint union of conditional term rewriting systems

   • Aart Middeldorp

   Pages 295-306

5. Implementing term rewriting by graph reduction: Termination of combined systems

   • Detlef Plump

   Pages 307-317

6. Compiling concurrent rewriting onto the Rewrite Rule Machine

   • Hitoshi Aida, Joseph Goguen, José Meseguer

   Pages 319-332

7. Design strategies for rewrite rules

   • Sergio Antoy

   Pages 333-341

8. A simplifier for untyped lambda expressions

   • Louis Galbiati, Carolyn Talcott

   Pages 342-353

9. Parallel graph rewriting on loosely coupled machine architectures

   • M. C. J. D. van Fekelen, M. J. Plasmeijer, J. E. W. Smetsers

   Pages 354-369

10. Typed equivalence, type assignment, and type containment

    • Roberto M. Amadio

    Pages 371-382

11. A fixed-point semantics for feature type systems

    • Martin Emele, Rémi Zajac

    Pages 383-388

12. Unique-sort order-sorted theories : A description as monad morphisms

    • John G. Stell

    Pages 389-400

13. Equational logics (birkhoff's method revisited)

    • Yong Sun

    Pages 401-406

14. Compatibility of order-sorted rewrite rules

    • Uwe Waldmann

    Pages 407-416

15. An universal termination condition for solving goals in equational languages

    • G. Aguzzi, U. Modigliani, M. C. Verri

    Pages 417-423

16. Constrained equational deduction

    • John Darlington, Yike Guo

    Pages 424-435

17. Higher-order unification, polymorphism, and subsorts

    • Tobias Nipkow

    Pages 436-447

18. Second-order unification in the presence of linear shallow algebraic equations

    • Zhenyu Qian

    Pages 448-453

19. An inference system for horn clause logic with equality

    • Wayne Snyder, Christopher Lynch

    Pages 454-461

20. Back Matter

    PDF

In recent years, extensions of rewriting techniques that go beyond the traditional untyped algebraic rewriting framework have been investigated and developed. Among these extensions, conditional and typed systems are particularly important, as are higher-order systems, graph rewriting systems, etc. The international CTRS (Conditional and Typed Rewriting Systems) workshops are intended to offer a forum for researchers on such extensions of rewriting techniques. This volume presents the proceedings of the second CTRS workshop, which contributed to discussion and evaluation of new directions of research. (The proceedings of the first CTRS workshop are in Lecture Notes in Computer Science, Vol. 308.) Several important directions for extensions of rewriting techniques were stressed, which are reflected in the organization of the chapters in this volume: - Theory of conditional and Horn clause systems, - Infinite terms, non-terminating systems, and termination, - Extension of Knuth-Bendix completion, - Combined systems, combined languages and modularity, - Architecture, compilers and parallel computation, - Basic frameworks for typed and order-sorted systems, - Extension of unification and narrowing techniques.

• Automated Deduction
• Automatisches Schließen
• Parallel Architecture
• Parallel Computing
• Parallele Architekturen
• Paralleles Rechnen
• Parallelverarbeitung (EDV)
• Programmiersprache
• Programming Languages
• Rechnerarchitektur
• Resolution
• Term Rewriting Systems
• logic
• programming
• semantics

Policies and ethics