Theory of local register allocation for prolog clauses II
M. Fico
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
When a relative order of an abstract process and of a code rendering is swapped during compilation, then the abstract process relates to compiled clause and not to its abstract code. The proposed algorithms of the optimal register allocation warrant a correspondence between a clause representation and parameters of its abstract code, regardless of the type of occurrence of temporary variables. The feasible optimal abstract code with minimal  length and minimal number of registers is an exact defined surroundings for all subsequent optimizing procedures of the Prolog compiler.
Publié le : 2012-01-26
Classification: 
@article{cai554,
     author = {M. Fico},
     title = {Theory of local register allocation for prolog clauses II},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai554}
}
M. Fico. Theory of local register allocation for prolog clauses II. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai554/