Abstract data type systems
- 27 February 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 173 (2) , 349-391
- https://doi.org/10.1016/s0304-3975(96)00161-2
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Combining first and higher order rewrite systems with type assignment systemsPublished by Springer Nature ,2006
- Type inference problems: A surveyPublished by Springer Nature ,2005
- Operational semantics for order-sorted algebraPublished by Springer Nature ,2005
- Inductive definitions in the system Coq rules and propertiesPublished by Springer Nature ,2005
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Modular termination of term rewriting systems revisitedPublished by Springer Nature ,1995
- Programming with equalities, subsorts, overloading, and parametrization in OBJThe Journal of Logic Programming, 1992
- Polymorphic rewriting conserves algebraic strong normalizationTheoretical Computer Science, 1991
- Unification in Boolean Rings and Abelian GroupsJournal of Symbolic Computation, 1989
- On the Church-Rosser property for the direct sum of term rewriting systemsJournal of the ACM, 1987