Degerstedt, L. (1995). Declarative Development of Abstract Machines -- A Case Study in Bottom-up Execution for Logic Databases. Technical Report LiTH-IDA-R-95-45, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),
Abstract: We propose a new declarative method for development of abstract machines. Using this method the abstract machine can be designed by means of stepwise refinement of both control and data representation. The approach is declarative in the sense that each refinement of the initial computational model respects the declarative reading of its predecessor. The paper suggests to use fixed point characterizations based on a variant of chaotic iteration as computational models. Two classes of transformations of such models, called splittings and restrictions, are identified as the cornerstones of the method. We give sufficient criteria for when these transformations may be used. Ordinary bottom-up computation of logic databases is used as an illustrative example throughout the paper.
CS Dept TR Overview