An algebraic semantics approach to the effective resolution of type equations
- 31 December 1986
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 45, 293-351
- https://doi.org/10.1016/0304-3975(86)90047-2
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Login: a logic programming language with built-in inheritanceThe Journal of Logic Programming, 1986
- Data representation and lexical calculiInformation Processing & Management, 1984
- What IS-A Is and Isn't: An Analysis of Taxonomic Links in Semantic NetworksComputer, 1983
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- On the Semantics of “Data Type”SIAM Journal on Computing, 1979
- Logic and semantic networksCommunications of the ACM, 1979
- Minimal and Optimal Computations of Recursive ProgramsJournal of the ACM, 1979
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977