|
Sat, May 19 |
|
|
Sun, May 20 |
- WESTAPP 2001
WESTAPP 2001 takes place in the Matthias van Geuns building at the Bolognalaan 10 (busstop : "Bestuursgebouw" (bus 11 and bus 12))
|
9.30 - 10.30 |
Session 1
-
Invited talk: Separability, self-recognition and unification
Corrado Böhm
|
11.00 - 12.00 |
Session 2
-
Verifying Explicit Substitution Calculi in Binding Structures with Effect Binding
Burkhart Wolff
-
A Generic Object Calculus Based on Addressed Term Rewriting Systems
Daniel Dougherty, Frederic Lang, Pierre Lescanne, Luigi Liquori, Kristoffer Rose
|
13.30 - 15.30 |
Session 3
-
Invited talk: Axiomatic Rewriting Theory and Explicit Substitution
Paul-André Melliès
-
Strong normalisation of Herbelin's explicit substitution calculus with substitution propagation
Roy Dyckhoff and Christian Urban
-
Generalized Director Strings and Explicit Substitutions
Maribel Fernández and Ian Mackie
|
- International Workshop on Termination
WST takes place in the Matthias van Geuns building at the Bolognalaan 10 (busstop : "Bestuursgebouw" (bus 11 and bus 12))
|
16.00 - 18.30 |
-
Is the SE calculus strongly normalizing?
Fairouz Kamareddine, Alejandro Ríos
-
Reducibility method for termination properties of typed lambda terms
Silvia Ghilezan, Viktor Kuncak & Silvia Likavec
-
Strong normalization by reducibility of the weak lambda-p calculus
Julian Forest
-
Higher order recursive path orderings a la carte
Jean-Pierre Jouannaud & Albert Rubio
-
A monotonic higher-order semantic path ordering
Christina Borralleras & Albert Rubio
|
- Common WESTAPP / WST Dinner
|
20.00 |
-
Common WESTAPP and WST dinner at indonesian restaurant Selamat Makan
Voorstraat 100, 3512 AV Utrecht
(voluntary. dinner costs will be approx 25 euro)
|
|
Mon, May 21 |
- International Workshop on Termination
WST takes place in the Matthias van Geuns building at the Bolognalaan 10 (busstop : "Bestuursgebouw" (bus 11 and bus 12))
|
9.00 - 10.00 |
-
Mathematical analysis of some termination principles
Andreas Weiermann
-
Busy beaver PCPs
Mario Schmidt, Heiko Stamer & Johannes Waldmann
|
10.30 - 12.30 |
-
Decidability of termination of certain one-rule string rewriting systems
Alfons Geser
-
Relating termination and infinitary normalization
Salvador Lucas
-
On termination of OBJ programs
Salvador Lucas
-
On termination of multiple premise ground rewrite systems
Dieter Hofbauer
-
Knowledge based simplification of termination proofs
Bernard Gramlich
|
14.00 - 16.00 |
-
Approximating dependency graphs using tree automata techniques
Aart Middeldorp & Seitaro Yuuki
-
Semantic labeling meets dependency pairs
Enno Ohlebusch
-
Proving termination automatically and incrementally
Xavier Urbain
-
Comparing techniques for automated termination proofs
Jürgen Giesl & Aart Middeldorp
|
16.30 - 18.30 |
-
On the termination of meta-programs
Alexander Serebrenick
-
Inference of termination conditions for numerical loops
Alexander Serebrenick
-
Binding-time annotations without binding-time analysis
Wim Vanhoof & Maurice Bruynooghe
-
Apparent causality for distributed termination detection
Farhad Arbab
-
On a control-theoretic approach for proving termination
Oliver Theel
|
|
Tue, May 22 |
- RTA2001
RTA takes place in the Megaron hall (also called mu) in the Educatorium building at the Leuvenlaan 19 (busstop: bus 12: "Unnik gebouw", bus 11: "Bestuursgebouw")
|
8.45 - 9.00 |
Opening |
9.00 - 10.30 |
Session 1 (chair: Vincent van Oostrom)
-
Matching Power
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
-
General Recursion on Second Order Term Algebras
Alessandro Berarducci, Corrado Böhm
-
Beta Reduction Constraints
Manuel Bodirsky, Katrin Erk, Alexander Kroller, Joachim Niehren
|
10.30 - 11.00 |
Coffee break |
11.00 - 12.30 |
Session 2 (chair: Claude Kirchner)
-
The Unification Problem for Confluent Right-Ground Term Rewriting Systems
Michio Oyamaguchi, Yoshikatsu Ohta
-
Goal-Directed E-Unification
Christopher Lynch, Barbara Morawska
-
Matching with Free Function Symbols - A Simple Extension of Matching?
Christophe Ringeissen
|
12.30 - 14.00 |
Lunch break |
14.00 - 15.00 |
Session 3 (chair: Michael Rusinowitch)
-
Context Unification and Traversal Equations
Jordi Levy, Mateu Villaret
-
Combining Pattern E-Unification Algorithms
Alexandre Boudet, Evelyn Contejean
|
15.00 - 15.20 |
Coffee break |
15.20 - 16.20 |
Session 4 (chair: Mariangiola Dezani)
-
Invited talk: Computing and Proving
Henk Barendregt
|
16.20 - 16.30 |
Break |
16.30 - 17.30 |
Session 5 (chair: Enno Ohlebusch)
-
Relating Accumalative and Non-Accumulative Functional Programs
Armin Kühnemann, Robert Glück, Kazuhiko Kakehi
-
Transfinite Rewriting Semantics for Term Rewriting Systems
Salvador Lucas
|
17.30 - 17.45 |
Break |
17.45 - |
Business meeting |
|
Wed, May 23 |
- RTA2001
RTA takes place in the Megaron hall (also called mu) in the Educatorium building at the Leuvenlaan 19 (busstop: bus 12: "Unnik gebouw", bus 11: "Bestuursgebouw")
|
9.00 - 10.30 |
Session 6 (chair: Joe Wells)
-
Uniform Normalisation beyond Orthogonality
Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
-
From Higher-Order Rewriting to First-Order Rewriting
Eduardo Bonelli, Delia Kesner, Alejandro Ríos
-
A Formalised First-Order Confluence Proof for the Lambda-Calculus using One-Sorted Variable Names
(Barendrecht was right after all... almost)
René Vestergaard, James Brotherston
|
10.30 - 11.00 |
Coffee Break |
11.00 - 12.00 |
Session 7 (chair: Jan Willem Klop)
-
Invited talk: Rewriting the Rules for Chip Design
Arvind
|
12.00 - 12.10 |
Break |
12.10 - 12.50 |
Session 8 (chair: Thomas Arts)
-
Stratego: A Language for Program Transformation based on Rewriting Strategies
Eelco Visser
-
Parallel Evaluation of Interaction Nets with MPINE
Jorge Sousa Pinto
|
13.00 |
Excursion to Burger's Zoo
|
19.00 |
Conference dinner
The RTA Conference Dinner will be hosted in the Academiegebouw
|
|
Thu, May 24 |
- RTA2001
RTA takes place in the Megaron hall (also called mu) in the Educatorium building at the Leuvenlaan 19 (busstop: bus 12: "Unnik gebouw", bus 11: "Bestuursgebouw")
|
9.00 - 10.30 |
Session 9 (chair: Sophie Tison)
-
A Normal Form for Church-Rosser Language Systems
Jens R. Woinowski
-
Weakly Regular Relations and Applications
Sébastien Limet, Pierre Réty, Helmut Seidl
-
On the Parallel Complexity of Tree Automata
Markus Lohrey
|
10.30 - 11.00 |
Coffee break |
11.00 - 12.30 |
Session 10 (chair: Nachum Dershowitz)
-
Verifying Ground Orientability of Rewrite Rules by the Knuth-Bendix Ordering
Konstantin Korovin, Andrei Voronkov
-
Termination Proofs by Context-Dependent Interpretations
Dieter Hofbauer
-
Dependency Pairs for Equational Rewriting
Jürgen Giesl, Deepak Kapur
|
12.30 - 14.00 |
Lunch break |
14.00 - 15.00 |
Session 11 (chair: Jürgen Giesl)
-
Confluence and Termination of Simply Typed Term Rewriting Systems
Toshiyuki Yamada
-
On Termination of Higher-Order Rewriting
Femke van Raamsdonk
|
15.00 - 15.20 |
Coffee break |
15.20 - 16.20 |
Session 12 (chair: Robert Nieuwenhuis)
-
Invited talk: Rewriting for Deduction and Verification
Michaël Rusinowitch
|
16.20 - 16.30 |
Break |
16.30 - 17.30 |
Session 13 (chair: Aart Middeldorp)
-
Universal Interaction Systems with Only Two Agents
Denis Bechet
-
Deriving Focuses Calculi for Transitive Relations
Georg Struth
|
|
Fri, May 25 |
- IFIP
The IFIP meeting takes place in the Bestuursgebouw
|
Annual meeting of the
IFIP working group 1.6 (Term Rewriting).
This meeting is only on invitation.
|
|
Sat, May 26 |
- WRS
WRS takes place in the Matthias van Geuns building at the Bolognalaan 10 (busstop : "Bestuursgebouw" (bus 11 and bus 12))
|
08.50 - 09.00 |
Opening |
09.00 - 10.30 |
Session 1:
|
09.00 - 10.00 |
-
Invited talk: Evaluation Strategies for Functional Logic Programming
Sergio Antoy
|
10.00 - 10.30 |
-
Declarative Debugging of Functional Logic Programs
Maria Alpuente, Francisco J. Correa and Moreno Falaschi
|
10.30 - 11.00 |
Coffee break
|
11.00 - 12.30 |
Session 2:
|
11.00 - 11.30 |
-
Just-in-time: On Strategy Annotations
Jaco van de Pol
|
11.30 - 12.00 |
-
Generic Sort-Preserving Traversal Strategies
Ralf Laemmel
|
12.00 - 12.30 |
-
Compact Normalisation Trace via Lazy Rewriting
Quang Huy Nguyen
|
12.30 - 14.00 |
Lunch break
|
14.00 - 15.30 |
Session 3:
|
14.00 - 15.00 |
-
invited talk: A Survey of Strategies in Program Transformation Systems
Eelco Visser
|
15.00 - 15.30 |
-
Fusing Logic and Control with Local Transformations: An Example Optimization
Patricia Johann and Eelco Visser
|
15.30 - 16.00 |
Coffee break
|
16.00 - 17.30 |
Session 4:
|
16.00 - 16.30 |
-
The Simple Type Theory of Normalization by Evaluation
René Vestergaard
|
16.30 - 17.30 |
-
Panel Discussion: 'Hot Topics in Reduction Strategies'
Michael Hanus, Tetsuo Ida, Paul Klint
|
17.30 |
Closing
|