Using big-step and small-step semantics in Maude to perform declarative debugging

DOI10.1007/978-3-319-07151-0_4zbMATH Open1416.68044OpenAlexW170948064MaRDI QIDQ5170702FDOQ5170702

Authors: Adrián Riesco 

Publication date: 24 July 2014

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07151-0_4

Recommendations

• Declarative Debugging of Rewriting Logic Specifications
• Enhancing the debugging of Maude specifications
• A complete declarative debugger for Maude
• A declarative debugger for Maude functional modules
• Declarative Debugging of Membership Equational Logic Specifications

zbMATH Keywords

Maudebig-step semanticssmall-step semanticsdeclarative debugging

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Cited In (4)

• A core Erlang semantics for declarative debugging
• Title not available (Why is that?)
• Title not available (Why is that?)
• Built-in variant generation and unification, and their applications in Maude 2.7

Uses Software

• Maude

This page was built for publication: Using big-step and small-step semantics in Maude to perform declarative debugging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170702)