scientific article; zbMATH DE number 1231543
From MaRDI portal
zbMath0912.68096MaRDI QIDQ4222859
José Meseguer, Narciso Martí-Oliet
Publication date: 20 December 1998
Full work available at URL: http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume4.htm#mm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Rewriting logic: Roadmap and bibliography, Structured theories and institutions, Relating two categorical models of term rewriting, A compiler for nondeterministic term rewriting systems, A probabilistic approximate logic for neuro-symbolic learning and reasoning, Two Decades of Maude, Rewriting Strategies and Strategic Rewrite Programs, Weak Bisimulation as a Congruence in MSOS, Strategy based semantics for mobility with time and access permissions, Unnamed Item, Unnamed Item, Unnamed Item, Maude as a Platform for Designing and Implementing Deep Inference Systems, The tccp Interpreter, Translating Stochastic CLS into Maude, The control layer in open mechanized reasoning systems: Annotations and tactics, A rewriting logic approach to operational semantics, Term Sequent Logic, Propositional compositions of partial predicates, Coding Mobile Synchronizing Petri Nets into Rewriting Logic, Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description), A causal semantics for CCS via rewriting logic, Maude: specification and programming in rewriting logic, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Equational rules for rewriting logic, Symbolic computation in Maude: some tapas
Uses Software
Cites Work
- Linear logic
- Order-sorted unification
- A calculus of communicating systems
- Conditional rewriting logic as a unified model of concurrency
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- A unification algorithm for typed \(\bar\lambda\)-calculus
- Computational aspects of an order-sorted logic with term declarations
- Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
- The foundation of a generic theorem prover
- Specification and proof in membership equational logic
- Theory of Formal Systems. (AM-47)
- An Efficient Unification Algorithm
- FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
- A framework for defining logics
- Institutions: abstract model theory for specification and programming
- Explicit substitutions
- 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
