Horn clause programs with polymorphic types: Semantics and resolution

DOI10.1016/0304-3975(90)90107-SzbMath0741.68029OpenAlexW1980166798MaRDI QIDQ1177936

Michael Hanus

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90107-s

zbMATH Keywords

semanticsresolutionpolymorphic types

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (7)

Logic programs with polymorphic types: A condition for static type checking ⋮ Horn clause programs with polymorphic types: Semantics and resolution ⋮ Relating the implementation techniques of functional and functional logic languages ⋮ Specification and correctness proof of a WAM extension with abstract type constraints ⋮ Towards a Type Discipline for Answer Set Programming ⋮ Refinement of a typed WAM extension by polymorphic order-sorted types ⋮ PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polymorphic type system for Prolog
• The undecidability of the second-order unification problem
• Horn clause programs with polymorphic types: Semantics and resolution
• A unification algorithm for typed \(\overline\lambda\)-calculus
• Linear unification
• On specifications, theories, and models with higher types
• Login: a logic programming language with built-in inheritance
• An Efficient Unification Algorithm
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• A Machine-Oriented Logic Based on the Resolution Principle
• A type system for logic programs

This page was built for publication: Horn clause programs with polymorphic types: Semantics and resolution