PRELIMINARY PROGRAM
PPDP 2000
2nd International Conference on
Principles and Practice of Declarative Programming
Montréal, Canada
September 20-22, 2000
http://cs.yorku.ca/ppdp00
associated with PLI 2000:
Colloquium on Principles, Logics, and Implementations
of High-Level Programming Languages
http://www.cs.yorku.ca/pli00
WEDNESDAY, September 22
Opening: 14.20-14.30
Invited Talk: 14.30-15.30
From Logic to Stochastic Processes
Prakash Panangaden
Session I: 16:00-18:00
A Parallel Implementation for Optimal Lambda-Calculus Reduction
Marco Pedicini, Francesco Quaglia
Logical Relations, Data Abstraction, and Structured Fibrations
John Power, Edmund Robinson
Operational Semantics and Extensionality
Simona Ronchi Della Rocca
A High Performance Erlang System
Erik Johansson, Mikael Pettersson, Konstantinos Sagonas
THURSDAY, September 21
Invited Talk: 8:30-9:30
Concurrent Constraint Programming and Linear Logic
Francois Fages
Session II: 9:35-10:35
A Framework for the Recursive Definition of Data Structures
Jean-Louis Giavitto
Declarative Event-Oriented Programming
Conal Elliott
Session III: 11:00-12:30
Linear Logic Programming with Ordered Contexts
Jeff Polakow
Proof Construction and Non-Commutativity: a Cluster Calculus
Claudia Faggian
A Bottom-up Semantics for LO
Marco Bozzano, Giorgio Delzanno, Maurizio Martelli
Session IV: 14:00-15:30
Enhanced Sharing Analysis Techniques: A Comprehensive Evaluation
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
A Characterization of Symmetric Semantics by Domain Complementation
Roberto Giacobazzi, Isabella Mastroeni
Concurrent Constraint Programming: Towards Probabilistic Abstract
Interpretation
Alessandra Di Pierro, Herbert Wiklicky
Session V: 16:00-17:30
Simplifying Termination Proofs for Rewrite Systems by Preprocessing
Bernhard Gramlich
A Model for Comparing the Space Usage of Lazy Evaluators
Adam Bakewell, Colin Runciman
Higher Order Unification via Lambda-s-e-Style of Explicit Substitution
Mauricio Ayala-Rincon, Fairouz Kamareddine
FRIDAY
Invited Talk: 8:30-9:30
Proof-Carrying Code: Design, Implementation and Applications
George Necula
Session VI: 9:35-10:35
Justifying Proofs using Memo Tables
Abhik Roychoudhury, C.R. Ramakrishnan, I.V. Ramakrishnan
Semantic Analysis of Pointer Aliasing, Allocation and Disposal in Hoare
Logic
Cristiano Calcagno, Samin Ishtiaq, Peter W. O'Hearn
Session VII: 11:00-12:30
Type-based Nondeterminism Checking in Functional Logic Programs
Michael Hanus, Frank Steiner
A Precise Type Analysis of Logic Programs
Lunjin Lu
Efficient Abstract Interpretation using Component-Wise Homomorphism
Jörg Köller, Markus Mohnen
Session VIII: 14:00-15:30
Extending Constraint Logic Programming with Open Functions
Nikolay Pelov, Maurice Bruynooghe
Efficient Memory Management in a Single Stack Prolog Machine
Xining Li
Continuations for Parallel Logic Programming
Eneia Todoran, Nikolaos S. Papaspyrou
Session IX: 16:00-17:30
Solving Coverability Problems of Petri Nets by Partial Deduction
Michael Leuschel, Helko Lehmann
Symmetric Monoidal Sketches
Martin Hyland, John Power
Modular Reseting of Synchronous Data-flow Programs
Gregoire Hamon, Marc Pouzet
Closing 17:30-17:40
VENUE
PLI 2000 will be held in Montréal, at
Holiday Inn Select
Jardin Sinomonde
99 Viger Avenue West
Montréal (Québec)
Canada H2Z 1E9
http://www.hiselect-yul.com
mailto: [EMAIL PROTECTED]
SPONSORS
PPDP 2000 is sponsored by ACM SIGPLAN with support of Microsoft Research,
the Canadian Space Agency, York University, EAPLS, the Association for
Logic Programming and COMPULOG Americas
