Horn clause programs with polymorphic types: Semantics and resolution
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 225-240
- https://doi.org/10.1007/3-540-50940-2_38
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Constraint logic programmingPublished by Association for Computing Machinery (ACM) ,1987
- 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
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- A unification algorithm for typed -calculusTheoretical 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