Principles and Practice of Declarative Programming: International Conference, PPDP’99, Paris, France, September, 29 - October 1, 1999. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the International Conference on Principles and Practice of Declarative Programming, PPDP'99, held in Paris, France, in September/October 1999.
The 22 revised full papers presented together with three invited contributions were carefully reviewed and selected from a total of 52 full-length papers submitted. Among the topics covered are type theory; logics and logical methods in understanding, defining, integrating, and extending programming paradigms such as functional, logic, object-oriented, constraint, and concurrent programming; support for modularity; the use of logics in the design of program development tools; and development and implementation methods.

Author(s): Simon Peyton Jones, Norman Ramsey (auth.), Gopalan Nadathur (eds.)
Series: Lecture Notes in Computer Science 1702
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1999

Language: English
Pages: 442
Tags: Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Programming Techniques

Front Matter....Pages -
C-— : A Portable Assembly Language that Supports Garbage Collection....Pages 1-28
On Formalised Proofs of Termination of Recursive Functions....Pages 29-46
Argument Filtering Transformation....Pages 47-61
A Primitive Calculus for Module Systems....Pages 62-79
Non-dependent Types for Standard ML Modules....Pages 80-97
Constraint Programming in OPL....Pages 98-116
Compiling Constraint Handling Rules into Prolog with Attributed Variables....Pages 117-133
Parallel Execution Models for Constraint Programming over Finite Domains....Pages 134-151
Functional Plus Logic Programming with Built-In and Symbolic Constraints....Pages 152-169
A Calculus for Interaction Nets....Pages 170-187
Distributed Programming in a Multi-Paradigm Declarative Language....Pages 188-205
Logical and Meta-Logical Frameworks....Pages 206-206
A Simple and General Method for Integrating Abstract Interpretation in SICStus....Pages 207-223
Run Time Type Information in Mercury....Pages 224-243
A Virtual Machine for a Process Calculus....Pages 244-260
Optimising Bytecode Emulation for Prolog....Pages 261-277
OPENLOG: A Logic Programming Language Based on Abduction....Pages 278-293
An Operational Semantics of Starlog....Pages 294-310
On the Verification of Finite Failure....Pages 311-327
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices....Pages 328-341
Modular Termination Proofs for Prolog with Tabling....Pages 342-359
Declarative Program Transformation: A Deforestation Case-Study....Pages 360-377
A Semantic Account of Type-Directed Partial Evaluation....Pages 378-395
A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs....Pages 396-413
Widening Sharing....Pages 414-431
Back Matter....Pages -