scientific article

zbMath0966.68147MaRDI QIDQ2703692

Mark-Oliver Stehr

Publication date: 7 May 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

rewriting logic

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (10)

Executable structural operational semantics in Maude ⋮ Unnamed Item ⋮ A \(\rho\)-calculus of explicit constraint application ⋮ Session-based concurrency in Maude: executable semantics and type checking ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Programming and symbolic computation in Maude ⋮ A rewriting logic approach to operational semantics ⋮ Executable rewriting logic semantics of Orc and formal analysis of Orc programs ⋮ A Rewriting Logic Approach to Operational Semantics (Extended Abstract)

Uses Software

• Maude
• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An abstract framework for environment machines
• The calculus of constructions
• Conditional rewriting logic as a unified model of concurrency
• Higher order unification via explicit substitutions
• Specification and proof in membership equational logic
• λν, a calculus of explicit substitutions which preserves strong normalisation
• A consistent extension of the lambda-calculus as a base for functional programming languages
• Confluence properties of weak and strong calculi of explicit substitutions
• Relating the   - and  s-styles of explicit substitutions
• Explicit substitutions

This page was built for publication: