S. Renault. A system for transforming logic programs. R 97-04, Department of Computer Science, University of Rome Tor Vergata, Rome, Italy, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Ph.D. Thesis Proposal: Transformation of Constraint Logic Programs - Fioravanti (Correct)
....of not completely speci ed system components. 2 A System for Transforming Constraint Logic Programs As part of my research, I will develop a system for mechanizing the transformation of constraint logic programs and experimenting a number of applications. My starting point will be the MAP system [14] for transforming logic programs. The system will be composed of the following main modules: a transformation engine written in Prolog, which should provide procedures to apply basic transformation rules and strategies, like those presented in [6] a module which should allow the user to ....
S. Renault. A system for transforming logic programs. R 9704, Department of Computer Science, University of Rome Tor Vergata, Rome, Italy, 1997.
Derivation of Efficient Logic Programs by.. - Pettorossi, Proietti, .. (2001) Self-citation (Renault) (Correct)
....repeated subcomputations are avoided, is based on the ideas which motivate the tupling strategy [33] rst proposed as a transformation technique for functional languages. 41 8 Experimental Evaluation The Determinization Strategy has been implemented in the MAP program transformation system [38]. All program specialization examples presented in Sections 3.3, 5.3, and 7 have been worked out in a fully automatic way by the MAP system. We have compared the specialization times and the speedups obtained by the MAP system with those obtained by ECCE, a system for (conjunctive) partial ....
....the clauses in the given set) In this respect, our technique improves over conjunctive partial deduction [8] which is a specialization technique where new predicates are de ned in terms of conjunctions of atoms. We have implemented the Determinization Strategy in the MAP transformation system [38] and we have tested this implementation by performing several specializations of string matching and parsing programs. We have also compared the results obtained by using the MAP system with those obtained by using the ECCE system for (conjunctive) partial deduction [23] Our computer experiments ....
S. Renault. A system for transforming logic programs. R 97-04, Department of Computer Science, University of Rome Tor Vergata, Rome, Italy, 1997.
Derivation of Efficient Logic Programs by.. - Pettorossi, Proietti, .. (2002) Self-citation (Renault) (Correct)
....n 1 1] new3( 0 n 2 1] true Figure 3: Derivation tree T 2 for sp string parse( 0 n 1] 6. 6 Discussion of the Specialization Examples All program specialization examples presented in this Section were worked out in a fully automatic way by using the MAP program transformation system [32]. The performance of the specialized programs may be further improved by several post processing techniques which preserve the operational semantics and the semideterminism of the programs. In particular, if the specialized programs are to be run by a standard Prolog system, we may: i) reorder ....
S. Renault. A system for transforming logic programs. R 97-04, Department of Computer Science, University of Rome Tor Vergata, Rome, Italy, 1997.
Guidelines to the Current Implementation of the MAP.. - Sophie Renault Iasi-Cnr Self-citation (Renault) (Correct)
.... MAP transformation system is a tool which is designed to support the interactive transformation of logic programs using the unfold fold methodology [4] It has been developed at IASI Institute of the National Research Council, Rome, Italy, on the basis of an existing implementation presented in [5]. The main novelty in the new implementation is a graphical user interface (GUI) through which transformations are specified and applied by means of mouse clicks, button presses, menu selections, dialog boxes etc. The core of the system, i.e. the transformation engine, is written in SICStus Prolog ....
S. Renault. A System for Transforming Logic Programs. RR-97.04, Department of Computer Science, University of Rome Tor Vergata, 1997.
Design, Implementation, And Use Of The Map Transformation .. - Renault, Pettorossi.. (1998) Self-citation (Renault) (Correct)
.... is a tool which is designed to support the interactive derivation of logic programs [2] using the unfold fold transformation methodology [1, 4, 10] It has been developed at the IASI Institute of the National Research Council, Rome (Italy) on the basis of an existing implementation described in [8]. The main novelty in the new implementation is a graphical user interface (GUI) through which transformations are speci ed and applied by means of mouse clicks, button presses, menu selections, and dialog boxes. The following set of prede ned transformation rules is provided by the system: de ....
....the de nition of strategies, that is, sequences of applications of the rules which allow us to derive very e cient programs. Strategies can be generated in a semiautomatic way. Some examples of strategies for logic programs can be found in [5, 6, 7] and are partially implemented in the system [8]. At present, however, these strategies cannot be used via the GUI. In Section 2, we recall the basic rules for logic programs transformation. In Section 3 we give an overview of the system by describing the main components of the GUI and how they interact with the underlying Prolog implementation ....
[Article contains additional citation context not shown here]
S. Renault, \A system for transforming logic programs," R 97-04, Department of Computer Science, University of Rome Tor Vergata, Rome, Italy, 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