Horn clause programs with polymorphic types: Semantics and resolution (Q1177936)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 22507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Horn clause programs with polymorphic types: Semantics and resolution |
scientific article; zbMATH DE number 22507 |
Statements
Horn clause programs with polymorphic types: Semantics and resolution (English)
0 references
26 June 1992
0 references
A Horn clause logic where functions and predicates are declared with polymorphic types is presented. The semantics models for polymorphic Horn clause programs are defined. Deduction and resolution methods for typed logic programs are presented. For several classes of programs, optimizations of the resolution procedure are given. It is shown that higher-order programming techniques can be applied in the framework.
0 references
polymorphic types
0 references
semantics
0 references
resolution
0 references
0.7978838682174683
0 references
0.794586718082428
0 references
0.7836256623268127
0 references
0.767899751663208
0 references
