Logic program specialisation through partial deduction: Control issues
From MaRDI portal
Publication:4452606
DOI10.1017/S147106840200145XzbMath1105.68331MaRDI QIDQ4452606
Maurice Bruynooghe, Michael Leuschel
Publication date: 1 March 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
68N17: Logic programming
Related Items
Predicate Pairing for program verification, Generalization-Driven Semantic Clone Detection in CLP, Generalization strategies for the verification of infinite state systems, Oracle-Based Partial Evaluation, Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation, Fifty Years of Prolog and Beyond, Analysis and Transformation of Constrained Horn Clauses for Program Verification, Partial evaluation of Maple, Type-based homeomorphic embedding for online termination, Efficient and flexible access control via Jones-optimal logic program specialisation, A partial evaluation framework for order-sorted equational programs modulo axioms, Closed-form upper bounds in static cost analysis, Fast offline partial evaluation of logic programs, A Study on the Practicality of Poly-Controlled Partial Evaluation, Fast Offline Partial Evaluation of Large Logic Programs
Uses Software