| 18:00 | Registration and dinner |
| 8:50 - 9:00 | Opening of WST '99 |
| 9:00 - 9:45 | Hans Zantema |
| The termination hierarchy for term rewriting (Tutorial talk) | |
| 9:45 - 10:15 | Nachum Dershowitz |
| Undecidability results that follow from results in recursion theory | |
| 10:15 - 10:40 | BREAK |
| 10:40 - 11:10 | Jamie Andrews |
| Termination semantics of logic programs with cut and related features | |
| 11:10 - 11:40 | Sofie Verbaeten & Danny De Schreye |
| Termination of simply moded well-typed logic programs under tabled execution mechanism | |
| 11:40 - 12:10 | Jan-Georg Smaus |
| Well-terminating, input-driven logic programs | |
| 12:10 - 13:40 | LUNCH |
| 13:40 - 14:10 | Aart Middeldorp & Jürgen Giesl |
| Transforming context-sensitive rewrite systems | |
| 14:10 - 14:40 | Maria Ferreira & Anabela Lopes Ribeiro |
| Context-sensitive AC-rewriting | |
| 14:40 - 15:10 | Albert Rubio |
| A fully syntactic AC-RPO | |
| 15:10 - 15:40 | Cristina Borralleras, Maria Ferreira & Albert Rubio |
| Monotonic semantic path orderings | |
| 15:40 - 16:20 | BREAK |
| 16:20 - 16:50 | Jean-Pierre Jouannaud & Albert Rubio |
| Higher-order recursive path orderings | |
| 16:50 - 17:20 | Frederic Blanqui, Jean-Pierre Jouannaud & Mitsuhiro Okada |
| A terminating schema for higher-order rewrite systems | |
| 17:20 - 17:50 | Andreas Abel & Thorsten Altenkirch |
| A semantical analysis of structural recursion | |
| 18:00 | DINNER |
| 8:45 - 9:30 | Dieter Hofbauer |
| On termination and derivation lengths for ground rewrite systems (Tutorial talk) | |
| 9:30 - 10:00 | Andreas Weiermann |
| A slow growing analysis of the canonical rewrite system for the Ackermann function | |
| 10:00 - 10:30 | Ingo Lepper |
| A totally terminating rewrite system whose complexity is not Gamma_0 recursive | |
| 10:30 - 10:45 | BREAK |
| 10:45 - 11:15 | P. Inverardi & Monica Nesi |
| Translating TRSs into OS-TRSs: A result on modularity of termination | |
| 11:15 - 11:45 | Jürgen Giesl, Thomas Arts & Enno Ohlebusch |
| Modularity results for termination proofs using dependency pairs | |
| 11:45 - 12:15 | Thomas Arts & Jürgen Giesl |
| Verification of Erlang processes | |
| 12:15 - 13:30 | LUNCH |
| 13:30 | EXCURSION |
| 9:00 - 9:45 | Ursula Martin |
| On assigning invariants to term orderings (Tutorial talk) | |
| 9:45 - 10:15 | Bernhard Gramlich |
| On some abstract termination criteria | |
| 10:15 - 10:40 | BREAK |
| 10:40 - 11:10 | Johannes Waldmann |
| Top termination of CL(S) | |
| 11:10 - 11:40 | Jürgen Giesl, Vincent von Oostrom & Fer-Jan de Vries |
| Strong convergence of term rewriting using strong dependency pairs | |
| 11:40 - 12:10 | Hitoshi Ohsaki, Aart Middeldorp & Jürgen Giesl |
| Equational termination by semantic labelling | |
| 12:10 - 14:00 | LUNCH |
| 14:00 - 14:30 | Enno Ohlebusch |
| Automatic termination proofs of logic programs via rewrite systems | |
| 14:30 - 15:00 | Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv & Alexander Serebrenik |
| When linear norms are not enough | |
| 15:00 - 15:30 | Oliver Theel & Felix Gärtner |
| On proving termination through transfer functions | |
| 15:30 - 16:20 | BREAK |
| 16:20 - 16:50 | Jean-Yves Marion |
| Termination proofs and computational complexity classes | |
| 16:50 - 17:20 | Guillaume Bonfante |
| Complexity classes within KBO | |
| 17:20 - 17:50 | Elias Tahhan Bittar |
| Recursive upper-bounds for overlay term rewrite systems | |
| 18:00 | DINNER |