Paul Hudak (auth.), Bharat Jayaraman (eds.)3540222537, 9783540222538, 9783540248361
The International Symposium on Practical Aspects of Declarative Languages (PADL) is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, especially those emerging from functional, logic, and c- straint languages. Declarative languages have been studied since the inception of computer science, and continue to be a vibrant subject of investigation today due to their applicability in current application domains such as bioinformatics, network con?guration, the Semantic Web, telecommunications software, etc. The 6th PADL Symposium was held in Dallas, Texas on June 18–19, 2004, and was co-located with the Compulog-Americas Summer School on Compu- tional Logic. From the submitted papers, the program committee selected 15 for presentation at the symposium based upon three written reviews for each paper, which were provided by the members of the program committee and additional referees. Two invited talks were presented at the conference. The ?rst was given by Paul Hudak (Yale University) on “An Algebraic Theory of Polymorphic T- poral Media. ” The second invited talk was given by Andrew Fall (Dowlland Technologies and Simon Fraser University) on “Supporting Decisions in C- plex, Uncertain Domains with Declarative Languages. ” Following the precedent set by the previous PADL symposium, the program committee this year again selected one paper to receive the ‘Most Practical – per’award. |
Table of contents :
Front Matter….Pages –
An Algebraic Theory of Polymorphic Temporal Media….Pages 1-15
Supporting Decisions in Complex, Uncertain Domains with Declarative Languages….Pages 16-22
A Typeful Approach to Object-Oriented Programming with Multiple Inheritance….Pages 23-38
Compositional Model-Views with Generic Graphical User Interfaces….Pages 39-55
An Implementation of Session Types….Pages 56-70
UUXML: A Type-Preserving XML Schema–Haskell Data Binding….Pages 71-85
Improved Compilation of Prolog to C Using Moded Types and Determinism Information….Pages 86-103
A Generic Persistence Model for (C)LP Systems (and Two Useful Implementations)….Pages 104-119
Pruning in the Extended Andorra Model….Pages 120-134
USA-Smart: Improving the Quality of Plans in Answer Set Planning….Pages 135-147
$mathbb{ASP-PROLOG}$ : A System for Reasoning about Answer Set Programs in Prolog….Pages 148-162
Simplifying Dynamic Programming via Tabling….Pages 163-177
Symbolic Execution of Behavioral Requirements….Pages 178-192
Observing Functional Logic Computations….Pages 193-208
Parametric Fortran – A Program Generator for Customized Generic Fortran Extensions….Pages 209-223
Typing XHTML Web Applications in ML….Pages 224-238
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell….Pages 239-254
Back Matter….Pages – |
Reviews
There are no reviews yet.