๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Enumeration operators and modular logic programming

โœ Scribed by Melvin Fitting

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
756 KB
Volume
4
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

โœฆ Synopsis

An operational

and a minimal model semantics for logic programming modules is introduced.

It is shown that this semantics corresponds to the recursion theoretic notion of enumeration operator. Basic operations on modules, such as composition and recursion, are discussed. The adequacy of these operations is established by showing that all logic programming can be done, in principle, by combining certain elementary modules using these basic operations. a

๐Ÿ“œ SIMILAR VOLUMES

Semantics, Modularity, and Rewriting Log
Semantics, Modularity, and Rewriting Logic
โœ Peter D. Mosses ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 872 KB

A complete formal semantic description of a practical programming language (such as Java) is likely to be a lengthy document, regardless of which semantic framework is being used. Good modularity of the description is important to the person(s) developing it, to facilitate reuse, change, and extensi