Programming with Equations
From MaRDI portal
Cited in
(21)- Reductions in tree replacement systems
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
- A class of confluent term rewriting systems and unification
- Implementing first-order rewriting with constructor systems
- Full abstraction and limiting completeness in equational languages
- Schematization of infinite sets of rewrite rules generated by divergent completion processes
- Integrating code generation and peephole optimization
- Computing all subtree repeats in ordered trees
- From LCF to Isabelle/HOL
- Automatic functional correctness proofs for functional search trees
- An optimal algorithm for computing all subtree repeats in trees
- scientific article; zbMATH DE number 3926235 (Why is no real title available?)
- Implementation of an interpreter for abstract equations
- Curvature computations on surfaces in n-space
- On constructing 2-3 trees
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
- Classes of equational programs that compile into efficient machine code
- Generalization of final algebra semantics by relativization
- Transformations and confluence for rewrite systems
- More efficient bottom-up multi-pattern matching in trees
- Equational completion in order-sorted algebras
This page was built for publication: Programming with Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3939197)