M. Alpuente, M. Falaschi, and G. Vidal. Compositional Analysis for Equational Horn Programs. In G. Levi and M. Rodrguez-Artalejo, editors, Proc. of Fifth Int'l Conf. on Algebraic and Logic Programming, ALP'94, volume 850 of Lecture Notes in Computer Science, pages 77--94. Springer-Verlag, Berlin, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Compositional Semantic Basis for the Analysis of.. - Alpuente, Falaschi.. (1996) (2 citations) (Correct)
....equation set to be solved. Section 6 formulates an incremental analyzer for equational constraints and presents some encouraging results from the implementation of the analyzer. Section 7 concludes. The proofs of the theorems are given in Appendix A. A preliminary version of this paper appeared in [5]. We briefly recall some known results about equations, conditional rewrite systems and equational unification. For full definitions refer to [11, 25] Throughout this paper, will denote a countably infinite set of variables and 6 denotes a set of function symbols, each with a fixed associated ....
M. Alpuente, M. Falaschi, and G. Vidal. Compositional Analysis for Equational Horn Programs. In G. Levi and M. Rodr'iguez-Artalejo, editors, , volume 850 of , pages 77--94. Springer-Verlag, Berlin, 1994.
A Compositional Semantic Basis for the Analysis of.. - Alpuente, Falaschi.. (1996) (2 citations) Self-citation (Alpuente Falaschi Vidal) (Correct)
No context found.
M. Alpuente, M. Falaschi, and G. Vidal. Compositional Analysis for Equational Horn Programs. In G. Levi and M. Rodrguez-Artalejo, editors, Proc. of Fifth Int'l Conf. on Algebraic and Logic Programming, ALP'94, volume 850 of Lecture Notes in Computer Science, pages 77--94. Springer-Verlag, Berlin, 1994.
A Compositional Semantics for - Conditional Term Rewriting Self-citation (Alpuente Falaschi Vidal) (Correct)
No context found.
M. Alpuente, M. Falaschi, and G. Vidal. Compositional Analysis for Equational Horn Programs. In G. Levi and M. Rodrguez-Artalejo, editors, Proc. Fourth Int'l Conf. on Algebraic and Logic Programming ALP'94, Madrid (Spain), Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
A Comositional Semantics for Conditional Term Rewriting Systems - Alpuente, al. Self-citation (Alpuente) (Correct)
....P T T T V V V 2 Preliminaries 1.1 Related work 1.2 Plan of the paper computed answer substitutions (ca) basic program union. In other words, we prove that contains the information necessary to describe the behaviour of a program compositionally w.r.t. union in terms of computed answers. [3] shows that computations and analysis of equational logic programs can be performed incrementally, by using the notion of AND compositionality, that is, compositionality w.r.t. the conjunction of equations in a goal or in the condition of a clause. We do not consider AND compositionality in this ....
....programs can be performed incrementally, by using the notion of AND compositionality, that is, compositionality w.r.t. the conjunction of equations in a goal or in the condition of a clause. We do not consider AND compositionality in this paper, and the results here are orthogonal to those in [3]. Starting with Dershowitz [9] several authors have studied modular aspects of term rewriting systems regarding the question of whether or not certain properties (such as confluence or termination) are preserved under composition of modules (e.g. 23,26] All these works focus mainly on ....
[Article contains additional citation context not shown here]
M. Alpuente, M. Falaschi, and G. Vidal. Compositional Analysis for Equational Horn Programs. In G. Levi and M. Rodr'iguez-Artalejo, editors, , Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
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