Foundations of logic programming
Foundations of logic programming
Introduction to logic programming
Introduction to logic programming
Symbolic Semantics and Program Reduction
IEEE Transactions on Software Engineering - Annals of discrete mathematics, 24
An experiment in partial evaluation: the generation of a compiler generator
Proc. of the first international conference on Rewriting techniques and applications
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Symbolic evaluation with structural recursive symbolic constants
Science of Computer Programming
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Program Transformation Systems
ACM Computing Surveys (CSUR)
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying Correctness of Logic Programs
TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
Program Simplification via Symbolic Interpretation
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Generalized partial computation for a lazy functional language
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Software Specialization Via Symbolic Execution
IEEE Transactions on Software Engineering
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program specialization via algorithmic unfold/fold transformations
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
A Logic-Based Transformation System
IEEE Transactions on Knowledge and Data Engineering
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Specialising Logic Programs with Respect to Call?Post Specifications
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Automated Strategies for Specializing Constraint Logic Programs
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Inductively Verifying Invariant Properties of Parameterized Systems
Automated Software Engineering
An unfold/fold transformation framework for definite logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
Higher-Order and Symbolic Computation
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
Implementing Reflective Access Control in SQL
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
The transformational approach to program development
A 25-year perspective on logic programming
Hi-index | 0.00 |
A specialization method for logic programs that allows one to restrict a general program to special cases by means of constraint predicates is presented. A set of basic transformation operations, which are shown to produce equivalent programs, is defined. The method uses these operations for propagating the constraint information through the program and for consequently simplifying it whenever possible. Some examples of specializations are given, and some improvements and developments of the method are discussed.