ILPS'97 Workshop on
Specialization of Declarative Programs and its Applications
Port Jefferson, NY, October 16-17, 1997
---- CALL FOR PARTICIPATION ----
Please, accept our apologies if you receive this message more than once.
========================================================================
see also: http://www.cs.kuleuven.ac.be/~michael/workshop.html
========================================================================
Program specialization, also called partial evaluation, partial deduction
or supercompilation, is an automatic method for program optimization,
similar in concept to, but in several ways stronger than highly optimizing
compilers. The central idea is to specialize a given source program for a
particular application domain. This is (mostly) done by a well-automated
application of parts of the Burstall and Darlington unfold/fold
transformation framework.
Program specialization encompasses traditional compiler optimization
techniques, such as constant folding and in-lining used in compilers,
but uses more aggressive transformations, yielding both (much) greater
speedups and more difficulty in controlling the transformation process.
Program specialization can be used to speed up existing programs for certain
application domains, sometimes achieving speedups of several orders of
magnitude.It however also allows the user to write programs at a higher
level using a more secure, readable and maintainable style. The program
specializer then takes care of transforming this readable, but inefficient
program into an efficient one.
Declarative programming languages, are high-level programming languages in
which one only has to state what is to be computed and not necessarily how
it is to be computed. Because of their clear (and often simple) semantical
foundations, declarative languages offer significant advantages for the design
of semantic based program analyzers, transformers and optimizers.
The aim of this workshop is to discuss new trends, ideas and developments
concerning the specialization of declarative languages, especially geared
towards trying to exploit the advantages of these languages in practice.
The workshop is thereby not limited to the field of logic programming -
contributions from other fields involved with the declarative programming
paradigm, like e.g. functional programming, will be presented and
cross-fertilization is sought.
We are looking forward to seeing you in Port Jefferson.
Workshop Coordinator:
---------------------
Michael Leuschel, University of Leuven, Belgium
Program Committee:
------------------
Saumya Debray, University of Arizona, USA
John Gallagher, University of Bristol, UK
Manuel Hermenegildo, University of Madrid, Spain
Neil Jones, University of Copenhagen, Denmark
Michael Leuschel, University of Leuven, Belgium
Important dates:
----------------
Conference: October 12-17, 1997
Workshop: October 16
Registration, Accommodation, Travelling:
----------------------------------------
See the ILPS'97 homepage at
http://www.cs.sunysb.edu/~ilps97/
or
http://www.ida.liu.se/~ilps97/
Contact address:
----------------
Michael Leuschel
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200 A
B - 3001 Heverlee
BELGIUM
Tel: +32-(0)16-32 7555
Fax: +32-(0)16-32 7996
Email: michael@cs.kuleuven.ac.be
WWW: http://www.cs.kuleuven.ac.be/~michael
Workshop Web Site:
---------------------
http://www.cs.kuleuven.ac.be/~michael/workshop.html
Tentative Workshop Schedule:
-----------------------------
Thursday, October 16, 1997
9.00 - 9.10 Welcome and introduction
9.10 - 9.50 SESSION 1
* A. Roychoudhury, C.R. Ramakrishnan, I.V. Ramakrishnan, R.C. Sekar:
Making a Success out of Early Failures
* Philippe Ezequel:
Distinguishing distinguished variables
9.50 - 10.20 Open Discussion and Coffee Break
10.20 - 11.20 SESSION 2
* Wim Vanhoof:
Bottom-up Information Propagation for Partial Deduction
* German Puebla, John Gallagher and Manuel Hermenegildo:
Towards Integrating Partial Evaluation in a Specialization
Framework based on Generic Abstract Interpretation
* Kostis Sagonas (invited):
Problems and Prospects for the Specialisation of
Tabled Logic Programs
11.20 - 12.20 Open Discussion Forum
12.20 - 13.40 Lunch
13.40 - 14.40 SESSION 3
* Jean-Fabrice Rabauthe, Philippe Devienne, Anne Parrain,
Serge Varennes and Patrick Taillibert:
Unfolding and aggregating transformations of real Prolog programs
* Dmitri Boulanger and Ulrich Geske (invited):
Problem-oriented specialisation and optimization of declarative programs
14.40 - 15.10 Open Discussion and Coffee Break
15.10 - 15.50 SESSION 4
* Husain Ibraheem and David Schmidt:
Partial Evaluation of Higher-Order Natural-Semantics Derivations
* Joao Saraiva, Matthijs Kuiper and Doaitse Swierstra:
Specializing Trees for Efficient Functional Decoration
15.50 - 16.30 Open Discussion and Closing
|-------------------------------------------------------------|
|ALL participants are invited to prepare 1-2 slides for the |
|open discussion forum or for one of the open discussions on |
|such topics as: open problems, directions for future |
|research, interesting relation with other areas and fields !!|
|-------------------------------------------------------------|
========================================================================
--------------------------------------------------------------------------
The dbworld list reaches many people, and should only be used for
messages of general interest to the database community.
To subscribe or unsubscribe yourself (or optionally (address)) from
dbworld, send a msg to majordomo@cs.wisc.edu with one of these lines:
subscribe dbworld (address)
unsubscribe dbworld (address)
To find out more options send a msg with the line:
help
--------------------------------------------------------------------------