Program of the colloquium

All mornings and Wednesday afternoon will start with an invited talk. Invited talks are plenary sessions and are offered every day to all participants. The other sessions are run concurrently between conferences and workshops. Everyone should meet again at breaks and lunches.

Monday, 27 September 1999

 8:30 - 9:30 Invited Speaker

You Can Design Microprocessors Too: Putting TRS's to Work
Arvind (MIT, USA)

ICFP

• When is a Functional Program Not a Functional Program?
  John Longley (University of Edinburgh, Scotland)
• Monadic Encapsulation in ML
  Miley Semmelroth and Amr Sabry (University of Oregon, USA)

IDL

• The Mozart Programming System and Its Implementation (invited talk)
  Peter Van Roy

COCL

• The Module System of lambda-Prolog and its Realization (invited talk)
  Gopalan Nadathur

OOSDS

• Introduction to the Workshop
  C. Cap
• An Overview of a Formalism for Open Distributed Systems
  Olaf Owe and Isabelle Ryl

ICFP

• Trampolined Style
  Steven E. Ganz and Daniel P. Friedman (Indiana University, USA)
• From Fast Exponentiation to Square Matrices: An Adventure in Types
  Chris Okasaki (Columbia University, USA)
• Tracing Piece by Piece: Affordable Debugging for Lazy Functional Languages
  Henrik Nilsson (Linköping University, Sweden and INRIA Sophia-Antipolis, France)

IDL

• From Tabling to Transformation: Efficiently Computing Residual  Programs in the SLG-WAM
  B. Cui, T. Swift, and D.S. Warren
• Practical Investigation of Constraints with Graph Views
  Tobias Müller
• Actor Prolog: an Object-Oriented Language with the Classical Declarative Semantics
  A. A. Morozov

COCL

• A Logic Programming Framework for Component-Based Software Prototyping Maurizio Martelli, Viviana Mascardi, and Floriano Zini
• The Dynamic Composition of Abductive Agents in ALIAS
  Anna Ciampolini, Evelina Lamma, Paola Mello and Paolo Torroni
• Towards Active Logic Programming
  Stefania Costantini

OOSDS

• Formal Development of Open Distributed Systems: toward an Integrated framework
  Issa Traore, Demissie Aredo, and Ketil Stolen
• Design by Contract for Java Based Mobile Agents
  Seng Wai Loke and Sea Ling
• Automatic Implementation of Distributed systems Specifications in Mondel
  L. H. C. Branco, A. F. de Prado, W. L. de Souza, and M. S. Anna

ICFP

• Atomic Heap Transactions and Fine-Grain Interrupts
  Olin Shivers, James W. Clark, and Roland McGrath (MIT, USA)
• On Embedding a Microarchitectural Design Language Within Haskell
  John Launchbury, Jeff Lewis, and Byron Cook (Oregon Graduate Institute of Science and Technology, USA)
• Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming
  John Hughes and Lars Pareto (Chalmers University, Sweden)

IDL

• System demos
  
• Secrets of the Glasgow Haskell Compiler Inliner
  S. Peyton-Jones and S. Marlow:

COCL

• Towards Component-based Software Development in Computational Logic (invited talk)
  Kung-Kiu Lau
• A Framework for Integrating ALN-Theories with Recursive Definition
  Aida Vitoria and Margarida Mamede

OOSDS

• Generating CSP Models of Threaded Java Programs
  Claire Williams
• Programming and Implementation Issues in Non-Uniform TyCO
  A. Ravara and L. Lopes
• A Confluent Extension of Lafont's Interaction Nets
  S. Matsuoka

ICFP

• A Simple Proof Technique for Certain Parametricity Results
  Karl Crary (Carnegie Mellon University, USA)
• Relating Typability and Expressibility in Finite-Rank Intersection Type Systems
  Assaf Kfoury (Boston University, USA), Harry Mairson (Brandeis University, USA), Franklyn Turbak (Wellesley College, USA), and J.B. Wells (Heriot-Watt University, UK)
• Type Fixpoints: Iteration vs. Recursion
  Zdzislaw Splawski (Technical University of Wroclaw, Poland) and Pawel Urzyczyn (University of Warsaw, Poland)

IDL

• The uZ Calculus and its Implementation
  W. Grieskamp
• Implementing Escher on a Graph Reduction Machine
  K. Eder
• Incremental Needed Narrowing
  M. Alpuente, S. Escobar and S. Lucas:

COCL

• Conformance and Refinement of Behavior in pi-calculus
  Carlos Canal, Ernesto Pimentel, and Jose M. Troya
• Intra- and Inter-OOD-Framework Interactions in Component-based Software Development in Computational Logic Juliana Kuester Filipe, Kung-Kiu Lau, Mario Ornaghi, and Hirokazu Yatsu.
• Concluding remarks

OOSDS

• An Aspect-Oriented Approach based on Multiparty Interactions to Specifying the Behaviour of a System
  A. Ruiz, R. Corchuelo, J. A. Perez, A. Duran, and M. Toro
• Reasoning about Object Behaviours with Rewriting
  A. Bouhoula, A. Jebali, and M. Rusinowitch

Tuesday, 28 September 1999

 8:30 - 9:30 Invited Speaker

Objects, Classes and Modules in Objective Caml
Xavier Leroy (INRIA Rocquencourt and Trusted Logic, France)

ICFP

• How to Build a HOT Programming Environment (or Revenge of the Son of the Lisp Machine)
  Matthew Flatt, Robert Bruce Findler, Shriram Krishnamurthi, and Matthias Felleisen (Rice University, USA)
• Haskell and XML: Generic Combinators or Type-Based Translation?
  Malcolm Wallace and Colin Runciman (University of York, England)

IDL

• A Type-based Nondeterminism Analysis for Functional Logic Languages
  M. Hanus and F. Steiner:
• Towards Memory Reuse in Mercury
  N. Mazur, G. Janssens and M. Bruynooghe:

LFM

• The Context Calculus Lambda-c
  Mirna Bognar and Roel de Vrijer (Vrije University, The Netherlands)
• Explicit Substitutions for Linear Logical Frameworks
  Iliano Cervesato (Stanford University, USA), Valeria de Paiva (University of Birmingham, UK), and Eike Ritter (University of Birmingham, UK)

DPS

• Programming with Sets in CLAIRE
  Yves Caseau (Ecole Normale Supérieure and Bouygues, France)

ICFP

• Calling Hell From Heaven and Heaven From Hell
  Sigbjorn Finne (University of Glasgow, Scotland), Daan Leijen (University of Utrecht, The Netherlands), Erik Meijer (University of Utrecht, The Netherlands) and Simon Peyton Jones (Microsoft Research Ltd, England)
• Interlanguage Working Without Tears: Blending SML with Java
  Nick Benton and Andrew Kennedy (Microsoft Research Ltd, England)
• Programming Contest Awards Presentations

IDL

• Analysis of Parallelism in Recursive Functions on Recursive Data Structures
  J. Ahn and T. Han
• Representation Analysis for Coercion Placement
  K.-F. Faxen
• System demos
  

LFM

• JaLoF: A Development Environment for Deduction Systems
  Roderick Moten (Colgate University, USA)
• Structured Type Theory
  Catarina Coquand and Thierry Coquand (Chalmers University and University of Goteborg, Sweden)
• Reflective Metalogical Frameworks
  David Basin (University of Freiburg, Germany), Manuel Clavel (University of Navarre, Spain), and José Meseguer (SRI International, USA)

DPS

• Towards Schema-Guided Compilation of Set Constraint Programs
  P. Flener, B. Hnich, and Z. Kiziltan (Uppsala University, Sweden)
• Sets and Constraint Logic Programming
  A. Dovier (Università di Verona, Italy), C. Piazza (Università di Udine, Italy), E. Pontelli (New Mexico State University, USA), and G. Rossi (Università di Parma, Italy)
• Extended partial-order logic programming
  M. Osorio (Universitad de las Américas, México) and J. C. Nieves (Benemérita Universitad Autonoma de Puebla, México)

ICFP

• Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
  Atsushi Ohori and Nobuaki Yoshida (Kyoto University, Japan)
• Type Dispatch for Named Hierarchical Types
  Neal Glew (Cornell University, USA)
• Representing Java Classes in a Typed Intermediate Language
  Christopher League, Zhong Shao, and Valery Trifonov (Yale University, USA)

IDL

• Trends in the Design and Implementation of Inferential Languages (Panel discussion)
  

LFM

• A Logic Programming Approach to Implementing Higher-Order Narrowing
  Murat Sinan Aygun (Bogazici University, Turkey)
• The Type Theory and Type Checker of GF
  Petri Mäenpää (Nokia Telecommunications, Finland) and Aarne Ranta (Chalmers University and University of Goteborg, Sweden)
• Pure Type Systems in Rewriting Logic
  Mark-Oliver Stehr and José Meseguer (SRI International, USA)

DPS

• Decision procedures for fragments of set theory with monotone and additive functions
  D. Cantone (Università di Catania, Italy), J. T. Schwartz (New York University, USA), and C. G. Zarba (Università di Catania, Italy)
• Provable Exists^*-Forall-sentences about sets with atoms
  A. Dovier (Università di Verona, Italy), A. Formisano (Università "La Sapienza" di Roma, Italy), and E.G. Omodeo (Università di L'Aquila, Italy)
• Fast (Hyper) Set Equivalence
  A. Dovier (Università di Verona, Italy), C. Piazza, and A. Policriti (Università di Udine, Italy)

ICFP

• Principals in Programming Languages: A Syntactic Proof Technique
  Steve Zdancewic, Dan Grossman, and Greg Morrisett (Cornell University, USA)
• Static Interpretation of Modules
  Martin Elsman (University of California at Berkeley, USA)
• Transparent Modules with Fully Syntactic Signatures
  Zhong Shao (Yale University, USA)

LFM

• On Equivalence and Canonical Forms in the LF Type Theory
  Robert Harper and Frank Pfenning (Carnegie Mellon University, USA)
• Type Checking Meta Programs
  Nikolaj Bjorner (Kestrel Institute, USA)

DPS

• Yet another way of Set-processing: The Escher style and its implementation
  K. Edr (University of Bristol, UK)
• Constraint Logic Programming with sets for animation and verification of B specification
  L. Py, B. Legeard (Université de Franche-comté, France)
• Set Constraints in Computational Linguistics - Solving Tree Descriptions
  D. Duchier (University of the Saarland, Germany)
• A Declarative Semantics for Sets Based on the Stable Model Semantics
  J. D. Jones (University of Arkansas at Little Rock, USA)

Wednesday, 29 September 1999

 8:30 - 9:30 Invited Speaker

Modern Languages for Modern Parallel Computing
Alex Aiken (University of California at Berkeley, USA)

ICFP

• Flexible Type Analysis
  Karl Crary (Carnegie Mellon University, USA) and Stephanie Weirich (Cornell University, USA)
• Type Inference Builds a Short Cut to Deforestation
  Olaf Chitil (RWTH Aachen, Germany)

FDPE

• Straight to the Heart of Computer Science via Functional Programming
  Robert Giegerich (Bielefeld University, Germany), Ralf Hinze (Bonn University, Germany) and Stefan Kurtz (Bielefeld University, Germany)
• Advanced programming concepts in a course on grammars and parsing
  Johan Jeuring and Doaitse Swierstra (Utrecht University, The Netherlands)

ICFP

• Verification of Erlang Programs using Abstract Interpretation and Model Checking
  Frank Huch (RWTH Aachen, Germany)
• Specialization of Inductively Sequential Functional Logic Programs
  Maria Alpuente (UPV, Spain), Michael Hanus (RWTH Aachen, Germany), Salvador Lucas (UPV, Spain), German Vidal (UPV, Spain)

FDPE

• Declarative Programming Across the Undergraduate Curriculum
  Amr Sabry (University of Oregon, USA)
• Plenary discussion

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

PPDP

• 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)

FDPE

• Proof-directed debugging
  Robert Harper (Carnegie-Mellon University, USA)
• Fun-ctional programming tasks with strategic higher order
  Kris Aerts and Karel de Vlaminck (Catholic University of Leuven, Belgium)

PPDP

• 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)

FDPE

• Denotational Semantics for Teaching Lazy Functional Programming
  Olaf Chitil (RWTH Aachen, Germany)
• Implementing Constructivist Ideas in Functional Programming
  Tami Lapidot, Dalit Levy and Tamar Paz (Technion, Israel)
• Plenary discussion

19:00 Visit of the Grande Galerie de l'évolution


20:00 Cocktails and dinner

Thursday, 30 September 1999

 8:30 - 9:30 Invited talk

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

PPDP

• 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)

HOOTS

• Monads, Effects and Transformations
  Nick Benton and Andrew Kennedy (Microsoft Research, UK)

WAAAPL

• Invited Talk: TBA

PPDP

• 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)

HOOTS

• Monadic encapsulation of effects: a revised approach
  E. Moggi and F. Palumbo (University of Genova, Italy)
• Imprecise Exceptions, Co-inductively
  Andrew Moran (Chalmers University, Sweden), Søren B. Lassen (University of Cambridge, UK), and Simon Peyton Jones (Microsoft Research, UK)

WAAAPL

• Manufacturing Datatypes
  Ralf Hinze (Universität Bonn, Germany)
• Dependently Typed Data Structures
  Hongwei Xi (Oregon Graduate Institute, USA)
• Teaching Monadic Algorithms to First-Year Students
  Ricardo Peña, Yolanda Ortega, and Fernando Rubio (Universidad Complutense de Madrid, Spain)

PPDP (tutorial)

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

HOOTS

• Space-profiling semantics of the call-by-value lambda calculus and the CPS transformation
  Yasuhiko Minamide (University of Tsukuba, Japan)
• A foundation for space-safe transformation of call-by-need programs
  Joergen Gustavsson and David Sands (Chalmers University, Sweden)

WAAAPL

• Modular Lazy Search for Constraint Satisfaction Problems
  Thomas Nordin (Oregon Graduate Institute, USA)
  Andrew Tolmach (Portland State University, USA)
• Persistent Triangulations
  Guy Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary Miller, and Noel Walkington (Carnegie Mellon University, USA)
• An Algebraic Dynamic Programming Approach to the Analysis of Recombinant DNA Sequences
  Robert Giegerich, Stefan Kurtz (Universität Bielefeld, Germany) and Georg Weiller (Australian National University, Australia)

PPDP

• 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)

HOOTS

• Object Closure Conversion
  Neal Glew (Cornell University, USA)
• On proving syntactic properties of CPS programs
  Olivier Danvy, Belmina Dzafic (University of Aarhus, Denmark) and Frank Pfenning (Carnegie Mellon University, USA)

WAAAPL

• Constructing Red-Black Trees
  Ralf Hinze (Universität Bonn, Germany)
• An Experimental Study of Compression Methods for Functional Tries
  Jukka-Pekka Iivonen, Matti Tikkanen (Nokia Telecommunications, Finland) and Stefan Nilsson (Royal Institute of Technology, Sweden)

Friday, 1 October 1999

 8:30 - 9:30 Invited talk

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

PPDP

• 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)

HOOTS

• Invited Talk: Trees and bisimulation for the pure lambda-calculus
  Søren B. Lassen (University of Cambridge, UK)

HASKELL

• Typing Haskell In Haskell
  Mark Jones (Oregon Graduate Institute, USA)

PPDP

• 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)

HOOTS

• Putting operational techniques to the test: A syntactic theory for behavioural Verilog
  John Fiskio-Lasseter and Amr Sabry (University of Oregon, USA)
• Specifying the PLAN Network Programming Language
  Pankaj Kakkar, Michael Hicks, Jon Moore, and Carl A. Gunter (University of Pennsylvania, USA)

HASKELL

• Embedding Prolog in Haskell
  Mike Spivey and Silvija Seres (Oxford University, UK)
• Logical Abstractions in Haskell
  Jeff Lewis, John Launchbury and Nancy Day (Oregon Graduate Institute, USA)

PPDP (Tutorial)

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

HASKELL

• The Syntactical Subtleties of Haskell (Invited Talk)
  Simon Marlow (Microsoft Research Cambridge, UK)
• Lightweight Extensible Records for Haskell
  Mark Jones (Oregon Graduate Institute, USA) and Simon Peyton Jones (Microsoft Research Cambridge, UK)

PPDP

• 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)

HASKELL

• A Generic Programming Extension for Haskell
  Ralf Hinze (Bonn University, Germany)
• Restricted Datatypes in Haskell
  John Hughes (Chalmers University, Sweden)