Invited Papers -- Model-Based Knowledge Representation and Reasoning Via Answer Set Programming -- On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory -- Substructural Type Systems for Program Analysis -- Refereed Papers -- Integrating Answer Set Reasoning with Constraint Solving Techniques -- Optimizing Compilation of CHR with Rule Priorities -- Constructive Arithmetic -- Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base -- Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl) -- Dependent Types -- On-Demand Refinement of Dependent Types -- Proving Properties about Lists Using Containers -- Rewriting -- Termination of Narrowing in Left-Linear Constructor Systems -- Complexity Analysis by Rewriting -- Rewriting and Call-Time Choice: The HO Case -- Program Transformation -- Semantics and Pragmatics of New Shortcut Fusion Rules -- A Generalization of the Folding Rule for the Clark-Kunen Semantics -- Logic and Lambda-Calculus -- Types for Hereditary Head Normalizing Terms -- A New Translation for Semi-classical Theories — Backtracking without CPS -- Types -- Undoing Dynamic Typing (Declarative Pearl) -- Typed Dynamic Control Operators for Delimited Continuations -- Strictness Analysis Algorithms Based on an Inequality System for Lazy Types -- Constraints II -- Quantitative Logic Programming Revisited -- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation -- Debugging -- Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming -- EasyCheck — Test Data for Free.