REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS

DOI10.1142/S0129054101000412zbMath1319.68125OpenAlexW2106561528MaRDI QIDQ5249248

Peter Borovanský, Claude Kirchner, Christophe Ringeissen, Hélène Kirchner

Publication date: 30 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054101000412

zbMATH Keywords

matchingstrategyterm rewritingrewriting logicrewriting calculusrewrite-based language

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (25)

Rewriting logic: Roadmap and bibliography ⋮ Controlled Term Rewriting ⋮ Crystal: Integrating structured queries into a tactic language ⋮ Simulating and model checking membrane systems using strategies in Maude ⋮ Metalevel transformation of strategies ⋮ Rewriting Strategies and Strategic Rewrite Programs ⋮ Parameterized strategies specification in Maude ⋮ Twenty years of rewriting logic ⋮ Strategy based semantics for mobility with time and access permissions ⋮ Typed generic traversal with term rewriting strategies ⋮ The Maude strategy language ⋮ A symbolic transformation language and its application to a multiscale method ⋮ Unnamed Item ⋮ Strategies, model checking and branching-time properties in Maude ⋮ Recognizing Strategies ⋮ A Port Graph Calculus for Autonomic Computing and Invariant Verification ⋮ Strategy-Based Proof Calculus for Membrane Systems ⋮ A Rewriting Semantics for Maude Strategies ⋮ A lightweight approach to datatype-generic rewriting ⋮ A Higher-Order Graph Calculus for Autonomic Computing ⋮ Generic type-preserving traversal strategies ⋮ Compact Normalisation Trace via Lazy Rewriting ⋮ Deduction, Strategies, and Rewriting ⋮ Programmed Strategies for Program Verification ⋮ ELAN from a rewriting logic point of view

Cites Work

• A higher-order implementation of rewriting
• Conditional rewriting logic as a unified model of concurrency
• The foundation of a generic theorem prover

This page was built for publication: REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS