Declarative languages have long promised the ability to rapidly create easily maintainable software for complex applications. The International Symposium of Practical Aspects of Declarative Languages (PADL) provides a yearly - rum for presenting results on the principles the implementations and especially the applications of declarative languages. The PADL symposium held January 19–20, 2009 in Savannah, Georgia was the 11th in this series. This year 48 papers were submitted from authors in 17 countries. The P- gram Committee performed outstandingly to ensure that each of these papers submitted to PADL 2009 was thoroughly reviewed by at least three referees in a short period of time. The resulting symposium presented a microcosm of how the current generation of declarative languages are being used to address real applications, along with on-going work on the languages themselves. The program also included two invited talks, "Inspecting and Preferring Abductive Models” by Luis Moniz Pereira and "Applying Declarative Languages to C- mercial Hardware Design” by Je? Lewis. Regular papers presented a variety of applications, including distributed applications over networks, network veri?- tion, user interfaces, visualization in astrophysics, nucleotide sequence analysis and planning under incomplete information. PADL 2009 also included ongoing work on the declarative languages themselves. Multi-threaded and concurrent Prolog implementation was addressed in several papers, as were innovations for tabling in Prolog and functional arraysin Haskell. Recent applications have also sparked papers on meta-predicates in Prolog and a module system for ACL2.
Invited Talk.- On Preferring and Inspecting Abductive Models.- User Interfaces and Environments.- Declarative Programming of User Interfaces.- Huge Data But Small Programs: Visualization Design via Multiple Embedded DSLs.- Toward a Practical Module System for ACL2.- Networks and Data.- Declarative Network Verification.- Operational Semantics for Declarative Networking.- Ad Hoc Data and the Token Ambiguity Problem.- Multi-threading and Parallelism.- High Level Thread-Based Competitive Or-Parallelism in Logtalk.- Implementing Thread Cancellation in Multithreaded Prolog Systems.- Interoperating Logic Engines.- Databases and Large Data Sets.- High-Level Interaction with Relational Databases in Logic Programming.- Typed Datalog.- Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell.- Tabling and Optimization.- One Table Fits All.- Recycle Your Arrays!.- Towards a Complete Scheme for Tabled Execution Based on Program Transformation.- Language Extensions and Implementation.- Improving Performance of Conformant Planners: Static Analysis of Declarative Planning Domain Specifications.- Layered Models Top-Down Querying of Normal Logic Programs.- Secure Implementation of Meta-predicates.
This book constitutes the refereed proceedings of the 11th International
Symposium on Practical Aspects of Declarative Languages, PADL 2009, held
in Savannah, GA, USA, in January 2009, colocated with POPL 2009, the
Symposium on Principles of Programming Languages.
The 18 revised full papers presented together with 1 invited talk were
carefully reviewed and selected from 48 submissions. The volume features
original work emphasizing novel applications and implementation
techniques for all forms of declarative concepts, including functions,
relations, logic, and constraints. The papers address all current
aspects of declarative programming; they are organized in topical
sections on user interfaces and environments, networks and data,
multi-threading and parallelism, databases and large data sets, tabling
and optimization, as well as language extensions and implementation.
Declarative languages have long promised the ability to rapidly create easily maintainable software for complex applications. The International Symposium of Practical Aspects of Declarative Languages (PADL) provides a yearly - rum for presenting results on the principles the implementations and especially the applications of declarative languages. The PADL symposium held January 19-20, 2009 in Savannah, Georgia was the 11th in this series. This year 48 papers were submitted from authors in 17 countries. The P- gram Committee performed outstandingly to ensure that each of these papers submitted to PADL 2009 was thoroughly reviewed by at least three referees in a short period of time. The resulting symposium presented a microcosm of how the current generation of declarative languages are being used to address real applications, along with on-going work on the languages themselves. The program also included two invited talks, "Inspecting and Preferring Abductive Models" by Luis Moniz Pereira and "Applying Declarative Languages to C- mercial Hardware Design" by Je? Lewis. Regular papers presented a variety of applications, including distributed applications over networks, network veri?- tion, user interfaces, visualization in astrophysics, nucleotide sequence analysis and planning under incomplete information. PADL 2009 also included ongoing work on the declarative languages themselves. Multi-threaded and concurrent Prolog implementation was addressed in several papers, as were innovations for tabling in Prolog and functional arraysin Haskell. Recent applications have also sparked papers on meta-predicates in Prolog and a module system for ACL2.
Inhaltsverzeichnis
Invited Talk.- On Preferring and Inspecting Abductive Models.- User Interfaces and Environments.- Declarative Programming of User Interfaces.- Huge Data But Small Programs: Visualization Design via Multiple Embedded DSLs.- Toward a Practical Module System for ACL2.- Networks and Data.- Declarative Network Verification.- Operational Semantics for Declarative Networking.- Ad Hoc Data and the Token Ambiguity Problem.- Multi-threading and Parallelism.- High Level Thread-Based Competitive Or-Parallelism in Logtalk.- Implementing Thread Cancellation in Multithreaded Prolog Systems.- Interoperating Logic Engines.- Databases and Large Data Sets.- High-Level Interaction with Relational Databases in Logic Programming.- Typed Datalog.- Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell.- Tabling and Optimization.- One Table Fits All.- Recycle Your Arrays!.- Towards a Complete Scheme for Tabled Execution Based on Program Transformation.- Language Extensions and Implementation.- Improving Performance of Conformant Planners: Static Analysis of Declarative Planning Domain Specifications.- Layered Models Top-Down Querying of Normal Logic Programs.- Secure Implementation of Meta-predicates.
Klappentext
Declarative languages have long promised the ability to rapidly create easily maintainable software for complex applications. The International Symposium of Practical Aspects of Declarative Languages (PADL) provides a yearly - rum for presenting results on the principles the implementations and especially the applications of declarative languages. The PADL symposium held January 19-20, 2009 in Savannah, Georgia was the 11th in this series. This year 48 papers were submitted from authors in 17 countries. The P- gram Committee performed outstandingly to ensure that each of these papers submitted to PADL 2009 was thoroughly reviewed by at least three referees in a short period of time. The resulting symposium presented a microcosm of how the current generation of declarative languages are being used to address real applications, along with on-going work on the languages themselves. The program also included two invited talks, "Inspecting and Preferring Abductive Models" by Luis Moniz Pereira and "Applying Declarative Languages to C- mercial Hardware Design" by Je? Lewis. Regular papers presented a variety of applications, including distributed applications over networks, network veri?- tion, user interfaces, visualization in astrophysics, nucleotide sequence analysis and planning under incomplete information. PADL 2009 also included ongoing work on the declarative languages themselves. Multi-threaded and concurrent Prolog implementation was addressed in several papers, as were innovations for tabling in Prolog and functional arraysin Haskell. Recent applications have also sparked papers on meta-predicates in Prolog and a module system for ACL2.
