Online partial deduction of logic programs
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
Tupling calculation eliminates multiple data traversals
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Reducing nondeterminism while specializing logic programs
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Program Derivation = Rules + Strategies
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Binary Speed Up for Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
Perfect Model Checking via Unfold/Fold Transformations
CL '00 Proceedings of the First International Conference on Computational Logic
A framework for the integration of partial evaluation and abstract interpretation of 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
Redundant Call Elimination via Tupling
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
A Multiple-Clause Folding Rule Using Instantiation and Generalization
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Extra Variables Can Be Eliminated from Functional Logic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Elimination of Local Variables from Definite Logic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
The hyper system: knowledge reformation for efficient first-order hypothetical reasoning
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Improving efficiency of prolog programs by fully automated unfold/fold transformation
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Transformations of logic programs on infinite lists
Theory and Practice of Logic Programming
The transformational approach to program development
A 25-year perspective on logic programming
Automated proof compression by invention of new definitions
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
An algorithm for local variable elimination in normal logic programs
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Proving properties of constraint logic programs by eliminating existential variables
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Solving first order formulae of pseudo-regular theory
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Generation of test data structures using constraint logic programming
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Redundant Call Elimination via Tupling
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
A Multiple-Clause Folding Rule Using Instantiation and Generalization
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Proving Theorems by Program Transformation
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.00 |