Name
Abstract | ||
|---|---|---|
Partial evaluation is usually devoted to program specialisation, in order to improve the speed-up. Generally, the price to pay is measured in term of unreadability and size of the code produced, especially for real Prolog programs. Moreover, it is often difficult to ensure an improvement on the space complexity which is a crucial point in industrial program development where size of the stack during execution can exceed 15 MegaBytes. To focus on the problem of readability in this context, we propose a transformation which aims, a contrario, to "simplify" programs, that is to say which tends to make code compression.We will first give the theoretical motivations of this purpose by making some links with the Kolmogorov complexity. Then, we will present our transformation, and an application to the reduction of predicate's arity. These technics permit to combine gains in terms of code size (and then in the WAM stacks), and in terms of readability. This clearly illustrates the William of Ockham's principle (what is called Ockham's razor [1]): compression = understanding and shows the classical program transformations in a new light. |
Year | Venue | Keywords |
|---|---|---|
1998 | IJCSLP | source-to-source prolog program compression |
Field | DocType | ISSN |
Compression (physics),Programming language,Computer science,Prolog | Conference | 1061-0464 |
ISBN | Citations | PageRank |
0-262-60031-5 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Devienne | 1 | 131 | 19.93 |
| Anne Parrain | 2 | 188 | 7.56 |
| Patrick Taillibert | 3 | 77 | 15.76 |
| Serge Varennes | 4 | 0 | 0.34 |