Abstract | ||
---|---|---|
Current WAM-type compilers employ incremental compilation, in which each procedure is compiled in isolation from the program as a whole. This approach is ideal for the initial stages of program development, since procedures can be compiled and recompiled very quickly. We have developed global compilation techniques to be used in the final stages of program development. These techniques use data-flow and control-flow information to optimize the intermediate code. Specifically, the optimizations involve using inferred mode information to generate indexing code which intermixes unification instructions, primitive test instructions, and switching instructions. One of the primary goals of this research is to develop global compilation techniques which eliminate the need for the user to insert cuts in the program to improve performance. Empirical results show that these optimizationscan result in significant time and space savings. |
Year | DOI | Venue |
---|---|---|
1989 | 10.1016/0743-1066(89)90021-6 | J. Log. Program. |
Keywords | Field | DocType |
global compilation | Compilation error,Programming language,Dynamic compilation,Computer science,Unification,Search engine indexing,Algorithm,Compiler,Prolog,Program development,Single Compilation Unit | Journal |
Volume | Issue | ISSN |
7 | 3 | The Journal of Logic Programming |
Citations | PageRank | References |
30 | 2.32 | 8 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Timothy Hickey | 1 | 107 | 17.81 |
Shyam Mudambi | 2 | 69 | 6.20 |