Orejas, F., Pino, E., Ehrig, H., Institutions for Logic Programmming, Theoretical Computer Science 173:485-511 (1997). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Algebraic Framework For The Definition Of Compositional.. - Lucio, Orejas, Pino (1994) Self-citation (Orejas Pino) (Correct)
....In particular, if a semantics is fully abstract this guarantees that our notion of program equivalence is the right one for reasoning about implementation, i.e. a program unit could be substituted by another unit implementing the same abstraction if and only if they have the same semantics. In [29], a methodology is presented for the semantic de nition of modular logic programs ensuring compositionality and full abstraction, and it is applied to study several kinds of program units for the class of de nite logic programs. The approach is based on the fact that most modular constructions can ....
....for normal logic programs in terms of model classes that is monotonic in the sense that Mod(P [P 0 ) Mod(P ) for any programs P and P 0 . This is enough for de ning a speci cation frame of normal logic programs equipped with the categorical constructions needed to apply the results in [29] to the class of normal logic programs, obtaining compositional and fully abstract (categorical) semantics for a number of program units [8, 21] In particular, we apply these results to provide a (categorical) semantics of arbitrary program fragments which is compositional and fully abstract with ....
[Article contains additional citation context not shown here]
Orejas, F., Pino, E., Ehrig, H., Institutions for Logic Programmming, Theoretical Computer Science 173:485-511 (1997).
An algebraic framework for the definition of compositional.. - Lucio, al. (1999) Self-citation (Orejas Pino) (Correct)
....In particular, if a semantics is fully abstract this guarantees that our notion of program equivalence is the right one for reasoning about implementation, i.e. a program unit could be substituted by another unit implementing the same abstraction if and only if they have the same semantics. In [31], a methodology is presented for the semantic definition of modular logic programs ensuring compositionality and full abstraction, and it is applied to study several kinds of program units for the class of definite logic programs. The approach is based on the fact that most modular constructions ....
....for normal logic programs in terms of model classes that is monotonic in the sense that Mod(P [ P 0 ) Mod(P ) for any programs P and P 0 . This is enough for defining an specification frame of normal logic programs equipped with the categorical constructions needed to apply the results in [31] to the class of normal logic programs, obtaining compositional and fully abstract (categorical) semantics for a number of program units [7, 23] In particular, we apply these results to provide a (categorical) semantics of arbitrary program fragments which is compositional and fully abstract ....
[Article contains additional citation context not shown here]
Orejas, F., Pino, E., Ehrig, H., Institutions for Logic Programmming, Theoretical Computer Science 173:485-511 (1997).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC