Source-to-source optimizing transformations of Prolog programs based on abstract interpretation
| dc.creator | Gobert, Francois | |
| dc.creator | Charlier, Baudouin Le | |
| dc.date | 2007-10-31 | |
| dc.date.accessioned | 2026-07-07T08:39:44Z | |
| dc.date.available | 2026-07-07T08:39:44Z | |
| dc.description | Making a Prolog program more efficient by transforming its source code, without changing its operational semantics, is not an obvious task. It requires the user to have a clear understanding of how the Prolog compiler works, and in particular, of the effects of impure features like the cut. The way a Prolog code is written - e.g., the order of clauses, the order of literals in a clause, the use of cuts or negations - influences its efficiency. Furthermore, different optimization techniques may be redundant or conflicting when they are applied together, depending on the way a procedure is called - e.g., inserting cuts and enabling indexing. We present an optimiser, based on abstract interpretation, that automatically performs safe code transformations of Prolog procedures in the context of some class of input calls. The method is more effective if procedures are annotated with additional information about modes, types, sharing, number of solutions and the like. Thus the approach is similar to Mercury. It applies to any Prolog program, however. | |
| dc.description | Paper presented at the 17th Workshop on Logic-based Methods in Programming Environments (WLPE2007) | |
| dc.identifier | https://arxiv.org/abs/0710.5895 | |
| dc.identifier | http://arxiv.org/abs/0710.5895 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/141176 | |
| dc.subject | Programming Languages | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Software Engineering | |
| dc.subject | D.2.6; D.1.6 | |
| dc.title | Source-to-source optimizing transformations of Prolog programs based on abstract interpretation | |
| dc.type | text |