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

ISBN-13: 9783540665403 / Angielski / Miękka / 1999 / 442 str.

Gopalan Nadathur; Gopalan Nadathur

Opis

These are the proceedings of the International Conference on Principles and Practice of Declarative Programming, PPDP'99, held in Paris, France, in September/October 1999. 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.

Spis treści

C-—: A Portable Assembly Language that Supports Garbage Collection.- On Formalised Proofs of Termination of Recursive Functions.- Argument Filtering Transformation.- A Primitive Calculus for Module Systems.- Non-dependent Types for Standard ML Modules.- Constraint Programming in OPL.- Compiling Constraint Handling Rules into Prolog with Attributed Variables.- Parallel Execution Models for Constraint Programming over Finite Domains.- Functional Plus Logic Programming with Built-In and Symbolic Constraints.- A Calculus for Interaction Nets.- Distributed Programming in a Multi-Paradigm Declarative Language.- Logical and Meta-Logical Frameworks.- A Simple and General Method for Integrating Abstract Interpretation in SICStus.- Run Time Type Information in Mercury.- A Virtual Machine for a Process Calculus.- Optimising Bytecode Emulation for Prolog.- OPENLOG: A Logic Programming Language Based on Abduction.- An Operational Semantics of Starlog.- On the Verification of Finite Failure.- Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices.- Modular Termination Proofs for Prolog with Tabling.- Declarative Program Transformation: A Deforestation Case-Study.- A Semantic Account of Type-Directed Partial Evaluation.- A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs.- Widening Sharing.