Horn clause programs with polymorphic types: semantics and resolution
- 21 October 1991
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 89 (1), 63-106
- https://doi.org/10.1016/0304-3975(90)90107-s
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Feature analysis of Turbo PrologACM SIGPLAN Notices, 1987
- Login: a logic programming language with built-in inheritanceThe Journal of Logic Programming, 1986
- A polymorphic type system for prologArtificial Intelligence, 1984
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- A unification algorithm for typedTheoretical Computer Science, 1975
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940