Logic-Based Program Synthesis and Transformation
Editat de Pierre Fleneren Limba Engleză Paperback – 24 mar 1999
Preț: 324.61 lei
Preț vechi: 405.76 lei
-20%
Puncte Express: 487
Carte tipărită la comandă
Livrare economică 28 iulie-11 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540657651
ISBN-10: 3540657657
Pagini: 348
Ilustrații: X, 338 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.53 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540657657
Pagini: 348
Ilustrații: X, 338 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.53 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Attempto Controlled English — Not Just Another Logic Specification Language.- A Step Towards a Methodology for Mercury Program Construction: A Declarative Semantics for Mercury.- Pragmatics in the Synthesis of Logic Programs.- Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems.- Synthesis of Programs in Abstract Data Types.- OOD Frameworks in Component-Based Software - Development in Computational Logic.- The Use of Renaming in Composing General Programs.- Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes.- Specialising Logic Programs with Respect to Call/Post Specifications.- Generalization in Hierarchies of Online Program Specialization Systems.- Improving Homeomorphic Embedding for Online Termination.- Successes in Logic Programs.- Inferring and Compiling Termination for Constraint Logic Programs.- Strictness Analysis as Finite-Domain Constraint Solving.- Invariant Discovery via Failed Proof Attempts.- Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations.- Algorithms for Synthesizing Reactive Systems: A Perspective.- Schema-Guided Synthesis of CLP Programs.- Abstract: Proof Planning with Program Schemas.- Logical Synthesis of Imperative O.O. Programs.- Mathematical Foundations for Program Transformations.- An Exhaustive-Search Method Using Layered Streams Obtained Through a Meta-Interpreter for Chain Programs.- Bottom-Up Specialisation of Logic Programs.- Myrtle: A Set-Oriented Meta-Interpreter Driven by a “Relational” Trace for Deductive Databases Debugging.