Rewrite systems on a lattice of types

DOI10.1007/BF00264228zbMath0575.68043OpenAlexW2086827683MaRDI QIDQ1064065

A. J. J. Dick, R. J. Cunningham

Publication date: 1985

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264228

zbMATH Keywords

partial algebrasdecision proceduresequational theoriesdata typesunification algorithmlattice- structured polymorphismmodification of the Knuth-Bendix completion algorithmstatic partiality

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) Data structures (68P05) Equational classes, universal algebra in model theory (03C05) Partial algebras (08A55)

Related Items (3)

Equational completion in order-sorted algebras ⋮ Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations ⋮ Generator induction in order sorted algebras

Cites Work

• On theories with a combinatorial definition of 'equivalence'
• A Search Technique for Clause Interconnectivity Graphs
• Data Types as Lattices
• Abstract data types and software validation
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rewrite systems on a lattice of types