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

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. This Volume Contains The Papers Presented At The 1999 International C- Ference On Principles And Practice Of Declarative Programming (ppdp’99) Held In Paris From September 29 Through October 1, 1999. Ppdp’99 Participated, Together With The International Conference On Functional Programming (icfp) And Several Related Workshops, In A Federation Of Colloquia Known As Principles, Logics And Implementations Of High-level Programming Languages(pli’99). The Overall Event Was Organized By The Institut National De Recherche En Inf- Matique Et En Automatique (inria) And The Acm Special Interest Group For Programming Languages (acm/sigplan). Ppdp Represents The Union Of Two Conferences That Had Been In Existence For About A Decade: Programming Languages,implementations, Logics And P- Grams(plilp)andalgebraicandlogicprogramming(alp). Theseconferences Wereheldasoneforthe?rsttimeunderthenameplilp/alpintheirtenthand Seventhrespectiveincarnationslastyear. Thepresentrenditionfollowsadecision Bythe Combinedsteering Committees To Adopta Simpler Namefor The Conference That Also Re?ected The Union. Continuing The Tradition Of Plilp/alp, Ppdp Aims To Stimulate Research In The Use Of Declarative Methods In Programming And On The Design, Application, And Implementation Of Programming Languages That Support Such Methods. Topics Of Interest Include The Use Of Type Theory, Logics, And Logical Methods In Understanding, De?ning, Integrating, And Exte- Ing Programming Paradigms Such As Those For Functional, Logic, Object-oriented, Constraint,and Concurrentprogramming;support For Modularity;the Use Of L- Ics In The Design Of Program Development Tools; Development Of Implementation Methods; And The Application Of The Relevant Paradigms And Associated Methods In Industry And Education. Many Of These Themes Are Re?ected In The Papers Appearing In The Present Collection. 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. Gopalan Nadathur (ed.). Includes Bibliographical References And Index. Frontmatter 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 Backmatter 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.