Principles and Practice of Declarative Programming: International Conference, PPDP'99, Paris, France, September/October 1999 Proceedings (Lecture Notes in Computer Science): 1702 - Brossura

Brossura

ISBN 10: 3540665404 ISBN 13: 9783540665403

Casa editrice: Springer, 1999

Riassunto

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.

Su questo libro

Contenuti

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.

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 1999
• Lingua: Inglese
• ISBN 10: 3540665404
• ISBN 13: 9783540665403
• Rilegatura: Copertina flessibile
• Numero di pagine: 452
• Redattore: Nadathur Gopalan
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania