Towards creating specialised integrity checks through partial evaluation of meta-interpreters
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
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)
Loop checks for logic programs with functions
Theoretical Computer Science
Binding-Time Annotations Without Binding-Time Analysis
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Design and Implementation of the High-Level Specification Language CSP(LP) in Prolog
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
A New Termination Approach for Specialization
SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
Program Derivation = Rules + Strategies
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Improving Homeomorphic Embedding for Online Termination
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
Homeomorphic embedding for online termination of symbolic methods
The essence of computation
A framework for the integration of partial evaluation and abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Chain programs for writing deterministic metainterpreters
Theory and Practice of Logic Programming
Sequence-based abstract interpretation of Prolog
Theory and Practice of Logic Programming
Transformation by interpreter specialisation
Science of Computer Programming - Special issue on program transformation
Self-tuning resource aware specialisation for prolog
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Automatic type inference via partial evaluation
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
Higher-Order and Symbolic Computation
The Ecce and Logen partial evaluators and their web interfaces
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Nontermination inference of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination of Floating-Point Computations
Journal of Automated Reasoning
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
Efficient and flexible access control via Jones-optimal logic program specialisation
Higher-Order and Symbolic Computation
Type-based homeomorphic embedding for online termination
Information Processing Letters
Termination prediction for general logic programs
Theory and Practice of Logic Programming
Supervising offline partial evaluation of logic programs using online techniques
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
A fixed point semantics for logic programs extended with cuts
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Interleaving symbolic execution and partial evaluation
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Efficient local unfolding with ancestor stacks*
Theory and Practice of Logic Programming
Non-leftmost unfolding in partial evaluation of logic programs with impure predicates
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
| Hi-index | 0.00 |