Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Partial evaluation in logic programming
Journal of Logic Programming
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
Introduction to Functional Programming
Introduction to Functional Programming
Equivalent Transformation by Safe Extension of Data Structures
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
A data model for XML databases
Journal of Intelligent Information Systems - Special issue on web intelligence
Toward a software development model for automatic marking software
Proceedings of the 35th annual ACM SIGUCCS fall conference
Flexible hardware-software cooperation system with HwModule board and co-design framework by ET
ACACOS'08 Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science
IEICE - Transactions on Information and Systems
Hi-index | 0.00 |
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and computation consists in successive reduction of problems by rule application. As long as meaning-preserving rewriting rules, called ET rules, with respect to given background knowledge are used, correct computation results are guaranteed. In this paper, a general framework for program synthesis in the ET model is described. The framework comprises two main phases: (1) equivalent transformation of specifications, and (2) generation of a program from an obtained specification. A method for program generation in the second phase, called the squeeze method, is presented. It constructs a program by accumulation of ET rules one by one on demand, with the goal of producing a correct, efficient, and nonredundant program.