Order-Sorted Equational Computation
- 1 January 1989
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Operational semantics for order-sorted algebraPublished by Springer Nature ,2005
- An algebraic semantics approach to the effective resolution of type equationsTheoretical Computer Science, 1986
- Login: a logic programming language with built-in inheritanceThe Journal of Logic Programming, 1986
- Complete sets of unifiers and matchers in equational theoriesTheoretical Computer Science, 1986
- Rewrite systems on a lattice of typesActa Informatica, 1985
- Conditional rewrite rulesTheoretical Computer Science, 1984
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Partial abstract typesActa Informatica, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Untersuchungen zur mehrsortigen QuantorenlogikMathematische Annalen, 1962