Program for PPDP'03

Wednesday 27 August

11:30 - 12:30 Invited talk (joint with ICFP'03) Understanding aspects. Mitchell Wand (Northeastern University)

14:05 - 14:15 Opening by the Conference & Program Chair

14:15 - 15:45 Session (Types) chaired by Benjamin Pierce

Rank 2 intersection types for modules. Ferruccio Damiani (Universita' di Torino)

Generativity and Dynamic Opacity for Abstract Types. Andreas Rossberg (Universität des Saarlandes)

From Dynamic Binding to State via Modal Possibility. Aleksandar Nanevski (Carnegie Mellon University)

16:15 - 17:45 Session (Functional Language Implementation) chaired by Amr Sabry

A Functional Correspondence between Evaluators and Abstract Machines. Mads Sig Ager (BRICS, University of Aarhus), Dariusz Biernacki (BRICS, University of Aarhus), Olivier Danvy (BRICS, University of Aarhus), Jan Midtgaard (BRICS, University of Aarhus)

Compilation of extended recursion in call-by-value functional languages. Tom Hirschowitz (INRIA Rocquencourt), Xavier Leroy (INRIA Rocquencourt), Joe B. Wells (Heriot-Watt University)

Formally Deriving an STG Machine. Alberto de la Encina (Universidad Complutense de Madrid) Ricardo Peña (Universidad Complutense de Madrid),

Thursday 28 August

9:00 - 10:30 Session (Security) chaired by Dale Miller

Invited talk Towards a Formal Notion of Trust. Mogens Nielsen (BRICS, University of Aarhus)

Statically Assuring Secrecy for Dynamic Concurrent Processes. Rachid Echahed (Laboratoire Leibniz), Frederic Prost (Laboratoire Leibniz), Wendelin Serwe (INRIA)

11:00 - 12:30 Session (Higher-Order Abstract Syntax) chaired by Alberto Momigliano

Explicit Substitutions in the Reduction of Lambda Terms. Gopalan Nadathur (University of Minnesota), Xiaochu Qi (University of Minnesota)

A Framework for Typed HOAS and Semantics. Marino Miculan (DiMI, University of Udine), Ivan Scagnetto (DiMI, University of Udine)

Term Rewriting with Variable Binding: An Initial Algebra Approach. Makoto Hamana (Gunma University)

14:15 - 15:45 Session (Evaluation of Logic Programs): chaired by Konstantinos Sagonas

Efficient Fixpoint Computation in Linear Tabling. Neng-Fa Zhou (City University of New York), Taisuke Sato (Tokyo Institute of Technology)

From Datalog Rules to Efficient Programs with Time and Space Guarantees. Yanhong Liu (State University of New York at Stony Brook), Scott Stoller (State University of New York at Stony Brook)

On the Rewriting and Efficient Computation of Bound Disjunctive Datalog. Sergio Greco (University of Calabria), Ester Zumpano (University of Calabria)

16:15 - 17:45 Session (Constraints) chaired by Alessandra Di Pierro

Integrating Finite Domain Constraints and CLP with Sets. Alessandro Dal Palu' (University of Udine), Agostino Dovier (University of Udine), Enrico Pontelli (New Mexico State University), Gianfranco Rossi (University of Parma)

Extending constraint solvers with constraint handling rules. Gregory Duck (University of Melbourne), Maria Garcia de la Banda (Monash University), Peter Stuckey (University of Melbourne), Christian Holzbaur (University of Vienna)

Finding all minimal unsatisfiable subsets. Maria Garcia de la Banda (Monash University), Peter Stuckey (University of Melbourne), Jeremy Wazny (University of Melbourne)

Friday 29 August

9:00 - 10:30 Session (Verification) chaired by Frank Valencia

Invited talk: Automatic Verification of Cryptographic Protocols: A Logic Programming Approach. Bruno Blanchet (Max Planck Institut für Informatik, Saarbrücken)

Foundational Proof Checkers with Small Witnesses. Dinghao Wu (Princeton University), Andrew Appel (Princeton University), Aaron Stump (Washington University in St. Louis)

11:00 - 12:30 Session (Debugging & Applications) chaired by Fergus Henderson

ViMer: a visual debugger for Mercury. Michael Cameron (Monash University), Maria Garcia de la Banda (Monash University), Kim Marriott (Monash University), Peter Moulder (Monash University)

Practical aspects of Declarative Debugging in Haskell 98. Bernard Pope (The University of Melbourne), Lee Naish (The University of Melbourne)

On Translating Geometric Solids to Functional Expressions. Omid Banyasad (Dalhousie University), Philip Cox (Dalhousie University)

14:15 - 16:15 Session (Rewriting) chaired by Maria Alpuente

Termination of strategies in rule-based languages. Olivier Fissore (LORIA-CNRS), Isabelle Gnaedig (LORIA-INRIA), Helene Kirchner (LORIA-CNRS)

Conditional Narrowing without Conditions. Sergio Antoy (Portland State University), Bernd Brassel (CAU Kiel), Michael Hanus (CAU Kiel)

A Demand Narrowing Calculus with Overlapping Definitional Trees. Rafael Del Vado (Universidad Complutense de Madrid)

Improving (Weakly) Outermost-Needed Narrowing: Natural Narrowing. Santiago Escobar (DSIC-UPV)