Logic Program Synthesis and Transformation - Meta-Programming in Logic

Logic frameworks for logic programs.- An extended transformation system for CLP programs.- Using call/exit analysis for logic program transformation.- A transformation system for definite programs based on termination analysis.- On the use of inductive reasoning in program synthesis: Prejudice and prospects.- Transforming specifications of observable behaviour into programs.- On specification frameworks and deductive synthesis of logic programs.- Partial evaluation of the “real thing”.- Schema-based top-down design of logic programs using abstract data types.- Generalizing extended execution for normal programs.- Partial deduction of disjunctive logic programs: A declarative approach.- Avoiding non-termination when learning logic programs: A case study with FOIL and FOCL.- Propagation of inter-argument dependencies in “Tuple-distributive” type inference systems.- Logic programming and logic grammars with first-order continuations.- Improving the Whelk system: A type-theoretic reconstruction.- A model of costs and benefits of meta-level computation.- A basis for a multilevel metalogic programming language.- Logic programs with tests.- An architecture with multiple meta-levels for the development of correct programs.- More on unfold/fold transformations of normal programs: Preservation of fitting's semantics.- Formal semantics of temporal epistemic reflection.- Temporal semantics of meta-level architectures for dynamic control of reasoning.- Gödel as a meta-language for composing logic programs.- A module system for meta-programming.- Building proofs in context.- Introspective metatheoretic reasoning.- Abstract debugging of logic programs.