Programming with Equations

DOI10.1145/357153.357158zbMath0481.68008OpenAlexW2036748304MaRDI QIDQ3939197

Michael J. O'Donnell, Christoph M. Hoffmann

Publication date: 1982

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/357153.357158

zbMATH Keywords

term-rewriting systemsequational programsinterpretersnonprocedural languagesautomatically transform a set of equations into an efficient program

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (21)

Reductions in tree replacement systems ⋮ Generalization of final algebra semantics by relativization ⋮ Transforming strongly sequential rewrite systems with constructors for efficient parallel execution ⋮ Classes of equational programs that compile into efficient machine code ⋮ Implementation of an interpreter for abstract equations ⋮ Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study ⋮ A class of confluent term rewriting systems and unification ⋮ Curvature computations on surfaces in $n$-space ⋮ Implementing first-order rewriting with constructor systems ⋮ Full abstraction and limiting completeness in equational languages ⋮ An optimal algorithm for computing all subtree repeats in trees ⋮ Computing all subtree repeats in ordered trees ⋮ Equational completion in order-sorted algebras ⋮ On constructing 2-3 trees ⋮ Transformations and confluence for rewrite systems ⋮ More efficient bottom-up multi-pattern matching in trees ⋮ Unnamed Item ⋮ From LCF to Isabelle/HOL ⋮ Schematization of infinite sets of rewrite rules generated by divergent completion processes ⋮ Automatic Functional Correctness Proofs for Functional Search Trees ⋮ Integrating code generation and peephole optimization

This page was built for publication: Programming with Equations