Retrieving library identifiers via equational matching of types
Author:
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 603-617
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Unification in a combination of arbitrary disjoint equational theoriesJournal of Symbolic Computation, 1989
- Unification theoryJournal of Symbolic Computation, 1989
- Retrieving re-usable software components by polymorphic type1989
- The Chalmers Lazy-ML CompilerThe Computer Journal, 1989
- Using types as search keys in function libraries1989
- Complete sets of unifiers and matchers in equational theoriesTheoretical Computer Science, 1986
- The category of finite sets and Cartesian closed categoriesJournal of Mathematical Sciences, 1983
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978