IDL'999 Call for Participation and Preliminary Program

Paul Tarau <tarau@silo.csci.unt.edu>
22 Aug 1999 19:01:49 -0400

          From comp.compilers

Related articles
IDL'999 Call for Participation and Preliminary Program tarau@silo.csci.unt.edu (Paul Tarau) (1999-08-22)
| List of all articles for this month |

From: Paul Tarau <tarau@silo.csci.unt.edu>
Newsgroups: comp.compilers
Date: 22 Aug 1999 19:01:49 -0400
Organization: -
Keywords: conference

IDL'99 - International Workshop on Implementation of Declarative Languages


                        http://www.binnetcorp.com/wshops/IDL99.html


                                Paris, France, September 27-28, 1999


You are invited to attend this workshop held at PLI'99 - the
International Conference on Principles, Logics, and Implementations of
high-level programming languages, http://pauillac.inria.fr/pli/,
preliminary registration before Aug 27, 1999.


                                                    IDL'99 Preliminary Program


Sep 27, 1999 morning session


Invited talk
9:00-10:30 Peter Van Roy: The Mozart Programming System and Its Implementation


10:30-11:00 break


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




Sep 27, 1999 afternoon session


1:30-2:30-System demos


Implementation Techniques for Functional and Logic/Functional Languages
2:30-3:00 S. Peyton-Jones, S. Marlow: Secrets of the Glasgow Haskell Compiler Inliner
3:00-3:30 W. Grieskamp: The uZ Calculus and its Implementation
3:30-4:00 break
4:00-4:30 K. Eder: Implementing Escher on a Graph Reduction Machine
4:30-5:00 M. Alpuente, S. Escobar, S. Lucas: Incremental Needed Narrowing




Sep 28, 1999 morning session


Analysis of Inferential Languages:
9:30-10:00 M. Hanus, F. Steiner: A Type-based Nondeterminism Analysis for
                      Functional Logic Languages
10:00-10:30 N. Mazur, G. Janssens, M. Bruynooghe: Towards Memory Reuse in Mercury
10:30-11:00 break
11:00-11:30 J. Ahn and T. Han: Analysis of Parallelism in Recursive Functions
                        on Recursive Data Structures
11:30-12:00 K.-F. Faxen: Representation Analysis for Coercion Placement




Sep 28, 1999 afternoon session


System demos 1:30-2:30


2:30-4:00 Panel discussion
Trends in the Design and Implementation of Inferential Languages




Workshop Chairs


Konstantinos Sagonas Paul Tarau
Uppsala University, University of North Texas
Computing Science Department and BinNet Corporation


Program Committee


Marc Feeley (Université de Montréal, CANADA)
Maria Garcia de la Banda (Monash University, AUSTRALIA)
Fergus Henderson (University of Melbourne, AUSTRALIA)
Michael Hanus (RWTH Aachen, GERMANY)
Mark P. Jones (Oregon Graduate Institute of Science & Technology, USA)
Guy Lapalme (Université de Montréal, CANADA)
Olivier Ridoux (IRISA/INRIA Campus de Beaulieu, FRANCE)
Konstantinos Sagonas (Uppsala University, SWEDEN)
Paul Tarau (University of North Texas & BinNet Corporation, USA)
Neng-Fa Zhou (Kyushu Institute of Technology, JAPAN)


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.