Logic Program Synthesis and Transformation - Meta-Programming in Logic: 4th International Workshops, LOPSTR '94 and META '94, Pisa, Italy, June 20 - 21, 1994. Proceedings

Capa
Laurent Fribourg, Franco Turini
Springer Science & Business Media, 30 de nov de 1994 - 458 páginas
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.
 

O que estão dizendo - Escrever uma resenha

Não encontramos nenhuma resenha nos lugares comuns.

Conteúdo

Logic Frameworks for Logic Programs
1
An Extended Transformation System for CLP Programs
17
Using CallExit Analysis for Logic Program Transformation
36
A Transformation System for Definite Programs Based on Termination Analysis
51
Prejudice and Prospects
69
Transforming Specifications of Observable Behaviour into Programs
88
On Specification Frameworks and Deductive Synthesis of Logic Programs
104
Partial Evaluation of the Real Thing
122
A model of costs and benefits of metalevel computation
248
A Basis for a Multilevel Metalogic Programming Language
262
Logic Programs with Tests
276
An Architecture with Multiple MetaLevels for the Development of Correct Programs
293
Preservation of Fittings Semantics
311
Formal Semantics of Temporal Epistemic Reflection
332
Temporal Semantics of MetaLevel Architectures for Dynamic Control of Reasoning
353
Godel as a MetaLanguage for Composing Logic Programs
377

SchemaBased TopDown Design of Logic Programs Using Abstract Data Types
138
Generalizing Extended Execution for Normal Programs
154
A Declarative Approach
170
A Case Study with FOIL and FOCL
183
Propagation of Interargument Dependencies in Tupledistributive Type Inference Systems
199
Logic Programming and Logic Grammars with Firstorder Continuations
215
a typetheoretic reconstruction
231
A Module System for MetaProgramming
395
Building Proofs in Context
410
Introspective Metatheoretic Reasoning
425
Abstract Debugging of Logic Programs
440
Authors Index
Direitos autorais

Outras edições - Visualizar todos

Termos e frases comuns

Passagens mais conhecidas

Página 450 - P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.

Informações bibliográficas