Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
- 9 November 1992
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 105 (2) , 217-273
- https://doi.org/10.1016/0304-3975(92)90302-v
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Remarks on remarks on many-sorted equational logicACM SIGPLAN Notices, 1987
- Extensions and foundations of object-oriented programmingACM SIGPLAN Notices, 1986
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- Equality, types, modules, and (why not?) generics for logic programmingThe Journal of Logic Programming, 1984
- Order completion monadsAlgebra universalis, 1983
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1981
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- Algebras with a Scheme of OperatorsMathematische Nachrichten, 1963
- On the Structure of Abstract AlgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1935