The following pages link to Programming with Equations (Q3939197):
Displaying 21 items.
- Transformations and confluence for rewrite systems (Q672232) (← links)
- More efficient bottom-up multi-pattern matching in trees (Q685356) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- Reductions in tree replacement systems (Q1082092) (← links)
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study (Q1100879) (← links)
- A class of confluent term rewriting systems and unification (Q1101209) (← links)
- Implementing first-order rewriting with constructor systems (Q1112601) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Integrating code generation and peephole optimization (Q1822527) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- From LCF to Isabelle/HOL (Q2280211) (← links)
- Automatic Functional Correctness Proofs for Functional Search Trees (Q2829265) (← links)
- An optimal algorithm for computing all subtree repeats in trees (Q2955638) (← links)
- (Q3700828) (← links)
- Implementation of an interpreter for abstract equations (Q3719790) (← links)
- Curvature computations on surfaces in $n$-space (Q3989245) (← links)
- On constructing 2-3 trees (Q4625161) (← links)
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution (Q5055735) (← links)
- Classes of equational programs that compile into efficient machine code (Q5055738) (← links)
- Generalization of final algebra semantics by relativization (Q5887520) (← links)