Program of the PPDP'99 conference

Wednesday, 29 September 1999

12h00 - 13h30 Lunch

13h30 - 14h30 Invited talk. Chair: Gopalan Nadathur.

C--: A Portable Assembly Language
Simon Peyton Jones (Microsoft Research, UK)

• On Formalised Proofs of Termination of Recursive Functions
  Fairouz Kamareddine and François Monin (Heriot-Watt University, Scotland)
• Argument Filtering Transformation
  Keiichirou Kusakari, Masaki Nakamura, and Yoshihito Toyama (JAIST, Japan)

15h30 - 16h00 Tea time

• A Primitive Calculus for Module Systems
  Davide Ancona and Elena Zucca (University of Genova, Italy)
• Non-Dependent Types for Standard ML Modules
  Claudio V. Russo (University of Edinburgh, Scotland)

19h00 - 23h00 Soirée parisienne

19h00 Visit of the Grande Galerie de l'évolution


20h00 Cocktails and dinner

Thursday, 30 September 1999

8:30 - 9:30 Invited talk. Chair: François Fages.

The OPL Optimization Programming Language
Pascal van Hentenryck (Catholic University of Louvain, Belgium)

• Compiling Constraint Handling Rules into Prolog with Attributed Variables
  Christian Holzbaur and Thom Fruehwirth (University of Vienna, Austria and Ludwig-Maximilians-Universitaet, Germany)
• Parallel Execution Models for Constraint Programming over Finite Domains
  Alvaro Ruiz-Andino, Lourdes Araujo, Fernando Saenz, and Jose Ruz (Universidad Complutense de Madrid, Spain)

10h45 - 11h15 Coffee break

• Functional Plus Logic Programming with Built-in and Symbolic Constraints Puri Arenas-Sanchez, Francisco Lopez-Fraguas, and Mario Rodriguez-Artalejo (Universidad Complutense de Madrid, Spain)
• A Calculus for Interaction Nets
  Maribel Fernandez and Ian Mackie (LIENS and CNRS-LIX, France)
• Distributed Programming in a Multi-Paradigm Declarative Language
  Michael Hanus (RWTH Aachen, Germany)

12h45 - 14h30 Lunch

Logical and Meta-Logical Frameworks
Frank Pfenning (Carnegie Mellon University, USA)

16h00 - 16h30 Tea time

• A Simple and General Method for Integrating Abstract Interpretation in SICStus
  Dante Baldan, Nicola Civran, Gilberto File, and Francesco Pulvirenti (University of Padova, Italy)
• Run time Type Information in Mercury
  Tyson Dowd, Zoltan Somogyi, Fergus Henderson, Thomas Conway, and David Jeffery (University of Melbourne, Australia)
• TyCOAM: An Abstract Machine for a Concurrent Object Calculus
  Luis Lopes, Fernando Silva, and Vasco Vasconcelos (Universidade do Porto, Portugal)
• Optimising Bytecode Emulation for Prolog
  Vitor Santos Costa (Universidade do Porto, Portugal)

Friday, 1 October 1999

8:30 - 9:30 Invited talk. Chair: Eugenio Moggi.

Mobility in the Join-Calculus
Georges Gonthier (INRIA Rocquencourt, France)

• OPENLOG: A Logic Programming Language Based on Abduction
  Jacinto Davila (Universidad de Los Andes, Venezuela)
• An Operational Semantics of Starlog
  Lunjin Lu and John G. Cleary (University of Waikato, New Zealand)

10h45 - 11h15 Coffee break

• On the Verification of Finite Failure
  Roberta Gori and Giorgio Levi (Universita di Pisa, Italy)
• Localizing and Explaining Reasons for Nonterminating Logic Programs with Failure Slices
  Ulrich Neumerkel and Fred Mesnard (Université de la Réunion, France)
• Modular Termination Proofs For Prolog With Tabling
  Sofie Verbaeten, Konstantinos Sagonas, and Danny De Schreye (Katholieke Universiteit Leuven, Belgium)

12h45 - 14h30 Lunch

Data Structures in Declarative Languages
Chris Okasaki (Columbia University, USA)

16h00 - 16h30 Tea time

• Declarative Program Transformation: A Deforestation Case-Study
  Loic Correnson (INRIA Rocquencourt, France), Etienne Duris (Cedric-CNAM, France), Didier Parigot (INRIA Rocquencourt, France), and Gilles Roussel (Institut Gaspard Monge, France)
• A Semantic Account of Type-Directed Partial Evaluation
  Andrzej Filinski (University of Aarhus, Denmark)
• A Parameterized Unfold/Fold Transformation Framework for Definite Logic
  Programs Abhik Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, and I.V. Ramakrishnan (SUNY at Stony Brook, USA)
• Widening Sharing
  Enea Zaffanella (Universita degli Studi di Modena, Italy), Roberto Bagnara (Universita degli Studi di Parma, Italy), and Patricia M. Hill (University of Leeds, UK)