PPDP 2009: Coimbra, Portugal

• Vasco Thudichum Vasconcelos:
  Session types for linear multithreaded functional programming. 1-6
  
• Ralf Lämmel:
  Scrap your boilerplate: prologically! 7-12
  

Functional programming

• Konstantinos F. Sagonas, Thanassis Avgerinos:
  Automatic refactoring of Erlang programs. 13-24
  
• Naoki Kobayashi:
  Model-checking higher-order functions. 25-36
  
• Silvia Clerici, Cristina Zoltan:
  A dynamically customizable process-centered evaluation model. 37-48
  

Integration of paradigms

• Rafael del Vado Vírseda:
  A higher-order logical framework for the algorithmic debugging and verification of declarative programs. 49-60
  
• Wolfgang Dvorák, Georg Gottlob, Reinhard Pichler, Stefan Woltran:
  Alternation as a programming paradigm. 61-72
  
• Sergio Antoy, Michael Hanus:
  Set functions for functional logic programming. 73-82
  

Reasoning systems

• Amy P. Felty, Alberto Momigliano:
  Reasoning with hypothetical judgments and open terms in hybrid. 83-92
  
• Markus Kaiser, Ralf Lämmel:
  An Isabelle/HOL-based model of stratego-like traversal strategies. 93-104
  
• Carl Eastlund, Matthias Felleisen:
  Making induction manifest in modular ACL2. 105-116
  

Expressive logics

• Gabriel Aranda-López, Susana Nieva, Fernando Sáenz-Pérez, Jaime Sánchez-Hernández:
  Implementing a fixed point semantics for a constraint deductive database based on hereditary harrop formulas. 117-128
  
• Vivek Nigam, Dale Miller:
  Algorithmic specifications in linear logic with subexponentials. 129-140
  
• Hanne Vlaeminck, Joost Vennekens, Marc Denecker:
  A logical framework for configuration software. 141-148
  

Logic programming

• Pascual Julián Iranzo, Clemente Rubio-Manzano:
  A declarative semantics for Bousi~Prolog. 149-160
  
• Quan Phan, Gerda Janssens:
  Path-sensitive region analysis for mercury programs. 161-170
  
• Paul Tarau:
  An embedded declarative data transformation language. 171-182
  
• Hai-Feng Guo, Wen Zheng, Mahadevan Subramaniam:
  L2C2: logic-based LSC consistency checking. 183-194
  

Concurrency

• Christos Dimoulas, Riccardo Pucella, Matthias Felleisen:
  Future contracts. 195-206
  
• Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi:
  A framework for abstract interpretation of timed concurrent constraint programs. 207-218
  
• Giuseppe Castagna, Mariangiola Dezani-Ciancaglini, Elena Giachino, Luca Padovani:
  Foundations of session types. 219-230
  

Distribution

• Ezra Cooper, Philip Wadler:
  The RPC calculus. 231-242
  
• Kenny Qili Zhu, Daniel S. Dantas, Kathleen Fisher, Limin Jia, Yitzhak Mandelbaum, Vivek Pai, David Walker:
  Language support for processing distributed ad hoc data. 243-254
  

Constraints

• Michael Codish, Samir Genaim, Peter J. Stuckey:
  A declarative encoding of telecommunications feature subscription in SAT. 255-266
  
• Maurizio Gabbrielli, Jacopo Mauro, Maria Chiara Meo:
  On the expressive power of priorities in CHR. 267-276
  

Types

• Hiroshi Unno, Naoki Kobayashi:
  Dependent type inference with interpolants. 277-288
  
• Malgorzata Biernacka, Dariusz Biernacki:
  Context-based proofs of termination for typed delimited-control operators. 289-300
  
• Nick Benton, Andrew Kennedy, Lennart Beringer, Martin Hofmann:
  Relational semantics for effect-based program transformations: higher-order store. 301-312