Implementation of an interpreter for abstract equations

DOI10.1002/spe.4380151205zbMath0591.68010OpenAlexW2165368330MaRDI QIDQ3719790

Michael J. O'Donnell, Robert Strandh, Christoph M. Hoffmann

Publication date: 1985

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.4380151205

zbMATH Keywords

lazy evaluationsemanticslogic programminginterpreter for abstract equationslogical semantics of equationstable-driven pattern matching

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items (4)

A refinement of strong sequentiality for term rewriting with constructors ⋮ Sequentiality in orthogonal term rewriting systems ⋮ PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES ⋮ On the correspondence between two classes of reduction systems

Cites Work

• Unnamed Item
• Pattern Matching in Trees
• Programming with Equations
• Efficient string matching
• Algorithm = logic + control

This page was built for publication: Implementation of an interpreter for abstract equations