A pragmatic reconstruction of λProlog
✍ Scribed by Catherine Belleannée; Pascal Brisset; Olivier Ridoux
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 294 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0743-1066
No coin nor oath required. For personal study only.
✦ Synopsis
kProlog is a logic programming language in which hereditary Harrop formulas generalize Horn formulas, and simply typed k-terms generalize Prolog terms. One may wonder if these extensions are simultaneously required, and if useful subsets of kProlog can be de®ned, at least for pedagogical purposes. We answer this question by exhibiting a network of necessity links between the new features of kProlog. The starting point of the network is the demand for programming by structural induction on k-terms, and the necessity links give a rationale for such a programming style.
📜 SIMILAR VOLUMES
A constructive rationalization of PROLOG is presented, covering the logical form of definite clause programs and the role of negative (goal) clauses. This view is developed from the idea, taken from set theory, that a constructive theory can be obtained if classical reasoning is confined to a constr
Within the framework of the Faddeev equations we demonstrate that a Ah -EN interaction that gives a Ah scattering length comparable to the nn scattering length, and the binding energy of \*,, 'jHe as an aAA -aEN system, produces a final-state interaction peak in the neutron spectrum for the reaction