Practical Aspects of Declarative Languages: 11th International Symposium, PADL 2009, Savannah, GA, USA, January 19-20, 2009, ProceedingsDeclarative 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. |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Invited Talk | 1 |
User Interfaces and Environments | 16 |
Visualization Design via Multiple | 31 |
Toward a Practical Module System for ACL2 | 46 |
Networks and Data | 61 |
Operational Semantics for Declarative Networking | 76 |
Ad Hoc Data and the Token Ambiguity Problem | 91 |
Multithreading and Parallelism | 107 |
Databases and Large Data Sets | 152 |
Typed Datalog | 168 |
Using Bloom Filters for Large Scale Gene Sequence Analysis | 183 |
Recycle Your Arrays | 209 |
Towards a Complete Scheme for Tabled Execution Based on Program | 224 |
Language Extensions and Implementation | 239 |
Layered Models TopDown Querying of Normal Logic Programs | 254 |
Secure Implementation of Metapredicates | 269 |
Implementing Thread Cancellation in Multithreaded Prolog Systems | 122 |
Interoperating Logic Engines | 137 |
Other editions - View all
Common terms and phrases
abducibles abstract ACL2 action algorithm allows answer applications approach argument array assume atom attribute body cancellation checking clause combination competitive compiler complete Computer concept constraints construct contains context corresponding create data structure database defined definition depends described different directive domain elements engine evaluation event example execution existing expressed extended field Figure first function given goal head Heidelberg implementation important initial instance interface language layer literals LNCS Logic Programming meta-predicate module node Note operations or-parallelism original performance possible predicate present problem Prolog proof protocol query reference represented rule running semantics sequence shows solution specification standard step stored stream structure subgoal techniques theorem thread token transformation trie tuple update variables Vector visualization