Rewriting logic: Roadmap and bibliography

DOI10.1016/S0304-3975(01)00357-7zbMath1027.68613WikidataQ123905912 ScholiaQ123905912MaRDI QIDQ1615001

José Meseguer, Narciso Martí-Oliet

Publication date: 10 September 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q42: Grammars and rewriting systems

Related Items

Two case studies of semantics execution in Maude: CCS and LOTOS, Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic, A new generic scheme for functional logic programming with constraints, Manipulating algebraic specifications with term-based and graph-based representations, Executable structural operational semantics in Maude, Semantic foundations for generalized rewrite theories

Uses Software

• ELAN
• CafeOBJ
• Maude
• Nuprl
• JPAX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
• An interactive semantics of logic programming
• A semantics preserving actor translation
• Prototyping combination of unification algorithms with the ELAN rule-based programming language
• An approach to declarative programming based on a rewriting logic
• Axiomatizing permutation equivalence
• Relating two categorical models of term rewriting
• A compiler for nondeterministic term rewriting systems
• CPO models for infinite term rewriting
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• Reflective metalogical frameworks
• Conditional rewriting logic: Deduction, models and concurrency
• Labelled transition logic: An outline
• Rewriting logic as a semantic framework for concurrency: a progress report
• Two case studies of semantics execution in Maude: CCS and LOTOS
• Formal methods for industrial applications. Specification and programming the Steam Boiler Control
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Conditional rewriting logic as a unified model of concurrency
• Formal description techniques and protocol specification, testing and verification. FORTE XI/ PSTV XVIII '98. IFIP TC6 WG6. 1 joint international conference on Formal description techniques for distributed systems and communication protocols (FORTE XI) and protocol specification, testing and verification (PSTV XVIII), Paris, France, November 3--6, 1998
• Composable semantic models for actor theories
• Recent trends in algebraic development techniques. 13th international workshop, WADT '98, Lisbon, Portugal, April 2--4, 1998. Proceedings
• Functional programming, concurrency, simulation and automated reasoning. International lecture series 1991-1992, McMaster University, Hamilton, Ontario, Canada
• PARLE 94, Parallel architectures and languages Europe, 6th International PARLE Conference, Athens, Greece, July 4-8, 1994. Proceedings
• Combining symbolic constraint solvers on algebraic domains
• Timed rewriting logic with an application to object-based specification
• Theorem proving modulo
• A causal semantics for CCS via rewriting logic
• ELAN from a rewriting logic point of view
• Maude: specification and programming in rewriting logic
• Reflection in conditional rewriting logic
• Logical foundations of CafeOBJ
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Specification of real-time and hybrid systems in rewriting logic
• A Maude specification of an object-oriented model for telecommunication networks
• Actor theories in rewriting logic
• Equational rules for rewriting logic
• A formal approach to object-oriented software engineering
• Relaxed models for rewriting logic
• Tile formats for located and mobile systems.
• Higher order unification via explicit substitutions
• Specification and proof in membership equational logic
• Algebraic and logic programming. Third international conference, ALP '92, Volterra, Italy, September 2--4, 1992. Proceedings
• HOL-λσ: an intentional first-order expression of higher-order logic
• Interpreting Abstract Interpretations in Membership Equational Logic
• Comparing Meseguer's Rewriting Logic with the Logic CRWL