3rd INTERNATIONAL WORKSHOP ON TERMINATION

Utrecht (The Netherlands)

May 21-22-23, 1997

After the successful international workshops on termination in St. Andrews (1993) and La Bresse (1995) the third international workshop on termination is planned to be held in Ede in May 1997. The location is situated in a wooded area with a lot of opportunities for a nice walk. All kind of sporting facilities are situated around the corner. The location is on a five minutes walk from the railway station Ede-Wageningen. There is a direct train connection to Schiphol airport and to Arnhem. The detailed travel information, including maps is now available

Preliminary program

There is also a graphical representation of the program.

Tuesday, May 20

17:00 Registration and Buffet

Wednesday, May 21

8:30 - 8:40 Opening of WST97
8:40 - 9:30 Nachum Dershowitz
Well-Quasi Orderings and Some Applications
9:30 - 9:50 BREAK
9:50 - 10:30 Bernhard Gramlich
A Refined Analysis for Termination of Combined Rewrite Systems
10:30 - 11:10 Maria Ferreira
Recursively defined (quasi) orders on terms
11:10 - 11:30 BREAK
11:30 - 12:10 Jean-Pierre Jouannaud and Albert Rubio
Higher-Order Simplifcation Orderings
12:10 - 12:50 Albert Rubio
A total AC-compatible ordering with RPO scheme
12:50 - 14:20 LUNCH
14:20 - 15:10 Ursula Martin
Proving termination by counting things
15:10 - 15:50 Jörg Frank and Dieter Hofbauer
On Total Simplification Orderings on Strings
15:50 - 16:20 BREAK
16:20 - 17:00 François Monin
Ordinals extracted from termination proofs of functions
17:00 - 17:40 Andreas Weiermann
A constructive proof of strong normalization for Gödel's T via a monotone interpretation
18:30 - DINNER

Thursday, May 22

8:30 - 9:20 Pierre Lescanne
Strong Normalisation in Second Order Lambda Calculus with Explicit Substitutions
9:20 - 9:40 BREAK
9:40 - 10:20 Roberto Di Cosmo and Delia Kesner
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
10:20 - 11:00 Johannes Waldmann
Deciding Termination in CL(S)
11:00 - 11:20 BREAK
11:20 - 11:50 Thomas Arts
Termination and Innermost Normalisation of Term Rewriting Systems (Termination)
11:50 - 12:30 Jürgen Giesl
Termination and Innermost Normalisation of Term Rewriting Systems (Innermost Normalisation)
12:30 - 13:30 LUNCH
13:30 - 14:20 Hans Zantema
Transformational techniques for proving termination of term rewriting
14:50 - EXCURSION

Friday, May 23

8:30 - 9:20 Stefaan Decorte and Danny De Schreye
Demand-driven and constraint-based automatic left-termination analysis for Logic Programs
9:20 - 9:40 BREAK
9:40 - 10:20 Nachum Dershowitz, N. Lindenstrauss, Y. Sagiv
What Norms are Useful for Logic Programs?
10:20 - 11:00 Alfons Geser
On Normalising, Non-Terminating One-rule String Rewriting Systems
11:00 - 11:20 BREAK
11:20 - 12:00 Jürgen Brauburger
Computing the Domains of Partial Functions
12:00 - 12:40 Thomas Genet
Proving Termination of Sequential Reduction Relation using Tree Automata
12:40 - 14:00 LUNCH
14:00 - 14:50 Detlef Plump
Proving Termination of Term Graph Rewriting
14:50 - 15:10 BREAK
15:10 - 15:50 Jürgen Müller
Termination of Single-Pushout Graph Rewriting Systems -- Forward Closures
15:50 - 16:30 Elias Tahhan Bittar
Strong Elimination Proofs for Cut Elimination in Getnzen's Sequent Calculi



Program committee