Lecture Notes in Computer Science

5th International Workshop, LOPSTR'95, Utrecht, The Netherlands, September 20-22, 1995. Proceedings

By: Maurizio Proietti (Editor)

Write A Review

Paperback | 6 March 1996

At a Glance

Paperback
284 Pages

Dimensions(cm)
23.39 x 15.6 x 1.52

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation, LOPSTR'95, held in Utrecht, The Netherlands in September 1995.
The 19 papers included were selected from 40 workshop submissions; they offer a unique up-to-date account of the use of formal synthesis and transformation techniques for computer-aided development of logic programs. Among the topics addressed are deductive and inductive program synthesis, synthesis models based on constructive type theory, program specification, program analysis, theorem proving, and applications to various types of programs.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Computer Architecture & Logic Design Mathematics Mathematical Foundation Mathematical Logic Computer Programming & Software Development Programming & Scripting Languages Artificial Intelligence Compilers & Interpreters Mathematical Theory of Computation

Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints	p. 1
Memoing Evaluation by Source-to-Source Transformation	p. 17
Transformation of Left Terminating Programs: The Reordering Problem	p. 33
Derivation of Concurrent Algorithms in Tempo	p. 46
An Argumentation-Theoretic Approach to Logic Program Transformation	p. 61
Complexity of Horn Programs	p. 76
Studying the Cost of Logic Languages in an Abstract Interpretation Framework for Granularity Analysis	p. 91
Towards Automatic Control for CLP(x) Programs	p. 106
Ideal Refinement of Datalog Programs	p. 120
Guiding Program Development Systems by a Connection Based Proof Strategy	p. 137
Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs	p. 152
Logic Program Synthesis by Induction over Horn Clauses	p. 170
Logic Program Transformation Through Generalization Schemata	p. 171
An Opportunistic Approach for Logic Program Analysis and Optimisation Using Enhanced Schema-Based Transformations	p. 174
Solving Deductive Planning Problems Using Program Analysis and Transformation	p. 189
Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs Under the Completion	p. 204
Termination of Logic Programs Using Semantic Unification	p. 219
On the Mechanics of Metasystem Hierarchies in Program Transformation	p. 234
Efficient Translation of Lazy Functional Logic Programs into Prolog	p. 252
Author Index	p. 267
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

5th International Workshop, LOPSTR'95, Utrecht, The Netherlands, September 20-22, 1995. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Theory of Computation

Statistical Atlases and Computational Models of the Heart. Regular and CMRxRecon Challenge Papers

16th International Workshop, STACOM 2025, Held in Conjunction with MICCAI 2025, Daejeon, South Korea, September 27, 2025, Revised Selected Papers

Graphical Models and Causal Discovery with R

100 Exercises for Building Logic

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Discrete Mathematics for Computing

Grassroots

Effective Machine Learning Teams

Best Practices for ML Practitioners

Beading With Algorithms

Cellular Automata In Peyote Stitch

Theory of Computation for Software Developers

Nonlinear Analysis for Human Movement Variability

Mining Complex Networks

Advances in Applied Mathematics

Mining Complex Networks

Advances in Applied Mathematics

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

Introduction to Machine Learning Algorithms

Basic Principles and Mathematics

Metaheuristic Algorithms

Theory and Practice

Hands-On Generative AI with Transformers and Diffusion Models

Applied Mathematics with F#

Dependable Software Engineering. Theories, Tools, and Applications

11th International Symposium on Dependable Software Engineering: Theories, Tools, and Applications, SETTA 2025, Oxford, UK, December 1â"3, 2025, Proceedings

Spectral Networks

Bridging Higher-rank Teichmuller Theory and BPS States

Conditional Gradient Methods

From Core Principles to AI Applications

Beading With Algorithms

Cellular Automata In Peyote Stitch

A Mathematical Introduction to Data Science with Python

Exploring Computational Geometry

Theory and Python Implementations

Rigorous Software Development

An Introduction to Program Verification

Machine Learning with Julia

An Algorithmic Exploration

This product is categorised by