Logic program synthesis and transformation-- Meta-programming in Logic : 4th international workshops, LOPSTR '94 and META '94, Pisa, Italy, June 20-21, 1994 : proceedings

"This volume constitutes the combined proceedings of the 4th International Workshops on Logic Program Synthesis and Transformation (LOPSTR '94) and on Meta-Programming (META '94), held jointly in Pisa, Italy in June 1994. This book includes thoroughly revised versions of the best papers presented at both workshops. The main topics addressed by the META papers are language extensions in support of meta-logic, semantics of meta-logic, implementation of meta-logic features, performance of meta-logic, and several applicational aspects. The LOPSTR papers are devoted to unfolding/folding, partial deduction, proofs as programs, inductive logic programming, automated program verification, specification and programming methodologies."--PUBLISHER'S WEBSITE Logic frameworks for logic programs....Pages 1-16 An extended transformation system for CLP programs....Pages 17-35 Using call/exit analysis for logic program transformation....Pages 36-50 A transformation system for definite programs based on termination analysis....Pages 51-68 On the use of inductive reasoning in program synthesis: Prejudice and prospects....Pages 69-87 Transforming specifications of observable behaviour into programs....Pages 88-103 On specification frameworks and deductive synthesis of logic programs....Pages 104-121 Partial evaluation of the “real thing”....Pages 122-137 Schema-based top-down design of logic programs using abstract data types....Pages 138-153 Generalizing extended execution for normal programs....Pages 154-169 Partial deduction of disjunctive logic programs: A declarative approach....Pages 170-182 Avoiding non-termination when learning logic programs: A case study with FOIL and FOCL....Pages 183-198 Propagation of inter-argument dependencies in “Tuple-distributive” type inference systems....Pages 199-214 Logic programming and logic grammars with first-order continuations....Pages 215-230 Improving the Whelk system: A type-theoretic reconstruction....Pages 231-247 A model of costs and benefits of meta-level computation....Pages 248-261 A basis for a multilevel metalogic programming language....Pages 262-275 Logic programs with tests....Pages 276-292 An architecture with multiple meta-levels for the development of correct programs....Pages 293-310 More on unfold/fold transformations of normal programs: Preservation of fitting's semantics....Pages 311-331 Formal semantics of temporal epistemic reflection....Pages 332-352 Temporal semantics of meta-level architectures for dynamic control of reasoning....Pages 353-376 Gödel as a meta-language for composing logic programs....Pages 377-394 A module system for meta-programming....Pages 395-409 Building proofs in context....Pages 410-424 Introspective metatheoretic reasoning....Pages 425-439 Abstract debugging of logic programs....Pages 440-450

This volume constitutes the combined proceedings of the 4th International Workshops on Logic Program Synthesis and Transformation (LOPSTR '94) and on Meta-Programming
(META '94), held jointly in Pisa, Italy in June 1994.
This book includes thoroughly revised versions of the best papers presented at both workshops. The main topics addressed by the META papers are language extensions in support of meta-logic, semantics of meta-logic, implementation of meta-logic features, performance of meta-logic, and several applicational aspects. The LOPSTR papers are devoted to unfolding/folding, partial deduction, proofs as programs, inductive logic programming, automated program verification, specification and programming methodologies.

In 1969 Dana Scott developed his Logic for Computable Functions and with it a model of functional program computation.