Abstract conjunctive partial deduction for the analysis and compilation of coroutines

DOI10.1007/s00165-016-0389-8zbMath1355.68038OpenAlexW2509164840MaRDI QIDQ511025

Danny De Schreye, Vincent Nys

Publication date: 14 February 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/544182

zbMATH Keywords

abstract conjunctive partial deductioncompiling controlcoroutines

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• ECCE

Cites Work

• Unnamed Item
• Unnamed Item
• The list introduction strategy for the derivation of logic programs
• Sound and complete partial deduction with unfolding based on well-founded measures
• Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction
• A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs
• Compiling control
• An Efficient Unification Algorithm
• Partial evaluation in logic programming
• Transformation of logic programs: Foundations and techniques
• Proving correctness of imperative programs by linearizing constrained Horn clauses
• Speedup of logic programs by binarization and partial deduction
• Term Rewriting and All That
• Annotation of logic programs for independent AND-parallelism by partial evaluation
• Conjunctive partial deduction: foundations, control, algorithms, and experiments
• A practical framework for theabstract interpretation of logic programs

This page was built for publication: Abstract conjunctive partial deduction for the analysis and compilation of coroutines