Composing Programs in a Rewriting Logic for Declarative Programming
| dc.creator | Molina, Juan M. | |
| dc.creator | Pimentel, Ernesto | |
| dc.date | 2002-03-04 | |
| dc.date.accessioned | 2026-07-26T00:00:38Z | |
| dc.description | Constructor-Based Conditional Rewriting Logic is a general framework for integrating first-order functional and logic programming which gives an algebraic semantics for non-deterministic functional-logic programs. In the context of this formalism, we introduce a simple notion of program module as an open program which can be extended together with several mechanisms to combine them. These mechanisms are based on a reduced set of operations. However, the high expressiveness of these operations enable us to model typical constructs for program modularization like hiding, export/import, genericity/instantiation, and inheritance in a simple way. We also deal with the semantic aspects of the proposal by introducing an immediate consequence operator, and studying several alternative semantics for a program module, based on this operator, in the line of logic programming: the operator itself, its least fixpoint (the least model of the module), the set of its pre-fixpoints (term models of the module), and some other variations in order to find a compositional and fully abstract semantics wrt the set of operations and a natural notion of observability. | |
| dc.description | 47 pages. A shorter version (33 pages) will appear in the Journal of Theory and Practice of Logic Programming | |
| dc.identifier | https://arxiv.org/abs/cs/0203006 | |
| dc.identifier | http://arxiv.org/abs/cs/0203006 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/103324 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Programming Languages | |
| dc.subject | D.3.2;D.3.3;F.3.2;F.3.3;F.4.1 | |
| dc.title | Composing Programs in a Rewriting Logic for Declarative Programming | |
| dc.type | text |