Coimbra
September 7–9, 2009
Coimbra — Portugal
PPDP 2009
11th International ACM SIGPLAN Symposium on
Principles and Practice of Declarative Programming
Colocated with CSL 09 and LOPSTR 09
Association for Computing Machinery

Invited talks

In addition to the accepted papers, the scientific program will contain one talk by Vasco T. Vasconcelos and two joint PPDP-LOPSTR talks by Ralf Lämmel and German Vidal.
    Ralf Lämmel, University of Koblenz-Landau, Germany
    Scrap your boilerplate -- prologically!

    Vasco Thudichum Vasconcelos, University of Lisbon, Portugal
    Session types for linear multithreaded functional programming

    German Vidal, Technical University of Valencia, Spain
    Towards scalable partial evaluation of declarative programs

List of accepted papers

  • Gabriel Aranda-López, Susana Nieva, Fernando Sáenz-Pérez and Jaime Sánchez-Hernández. Implementing a Fixed Point Semantics for a Constraint Deductive Database

  • Nick Benton, Lennart Beringer, Martin Hofmann and Andrew Kennedy. Relational semantics for effect-based program transformations: higher-order store

  • Rafael del Vado Vírseda. A Higher-Order Logical Framework for the Algorithmic Debugging and Verification of Declarative Programs

  • Ezra Cooper and Philip Wadler. The RPC Calculus

  • Wolfgang Dvorak, Georg Gottlob, Reinhard Pichler and Stefan Woltran. Alternation as a Programming Paradigm

  • Christos Dimoulas, Riccardo Pucella and Matthias Felleisen. Future Contracts

  • Malgorzata Biernacka and Dariusz Biernacki. Context-based proofs of termination for typed delimited-control operators

  • Pascual Julián-Iranzo and Clemente Rubio-Manzano. A Declarative Semantics for Bousi~Prolog

  • Moreno Falaschi, Carlos Olarte and Catuscia Palamidessi. A Framework for Abstract Interpretation of Timed Concurrent Constraint Programs

  • Giuseppe Castagna, Mariangiola Dezani, Elena Giachino and Luca Padovani. Foundations of Session Types

  • Vivek Nigam and Dale Miller. Algorithmic specifications in linear logic with subexponentials

  • Michael Codish, Samir Genaim and Peter Stuckey. A Declarative Encoding of Telecommunications Feature Subscription in SAT

  • Sergio Antoy and Michael Hanus. Set Functions for Functional Logic Programming

  • Quan Phan and Gerda Janssens. Path-sensitive region analysis for Mercury programs

  • Silvia Clerici and Cristina Zoltan. A Dynamically Customizable Process-centered Evaluation Model

  • Paul Tarau. An Embedded Declarative Data Transformation Language

  • Hai-Feng Guo, Wen Zheng and Mahadevan Subramaniam. L2C2: Logic-based LSC Consistency Checking

  • Kenny Zhu, Daniel Dantas, Kathleen Fisher, Limin Jia, Yitzhak Mandelbaum, Vivek Pai and David Walker. Language Support for Processing Distributed Ad Hoc Data

  • Naoki Kobayashi. Model-Checking Higher-Order Functions

  • Hiroshi Unno and Naoki Kobayashi. Dependent Type Inference with Interpolants

  • Maurizio Gabbrielli, Maria Chiara Meo and Jacopo Mauro. On the expressive power of priorities in CHR

  • Markus Kaiser and Ralf Laemmel. An Isabelle/HOL-based model of Stratego-like traversal strategies

  • Hanne Vlaeminck, Joost Vennekens and Marc Denecker. A Logical Framework for Configuration Software

  • Konstantinos Sagonas and Thanassis Avgerinos. Automatic Refactoring of Erlang Programs

  • Amy Felty and Alberto Momigliano. Reasoning with Hypothetical Judgments and Open Terms in Hybrid

  • Carl Eastlund and Matthias Felleisen. Making Induction Manifest in Modular ACL2