Austria – Japan Summer Workshop on Term Rewriting

8 – 13 August 2005, Obergurgl

The workshop takes place in the Obergurgl University Centre: http://www2.uibk.ac.at/obergurgl/ (click “Brochure english”)

The workshop will be modeled on the Japanese term rewriting meetings:

• presentations in English about recent work or work in progress
• no proceedings
• lots of time for discussions and social activities

We booked a number of rooms from August 8 until (and including) August 12. To accommodate people coming from Japan, the program of the workshop will start in the morning of August 9. The price of accommodation is 34 euros per person per day (including breakfast and dinner).

The nearest airport is Innsbruck airport. If many participants arrive about the same time (late afternoon or early evening) on the 8th we might be able to arrange some transportation to Obergurgl. If you arrive before the 8th in Innsbruck or want to stay after the workshop, we can arrange accommodation in Innsbruck.

Participants

Austria

• Stefan Blom (University of Innsbruck)
• Nao Hirokawa (University of Innsbruck)
• Martin Korp (University of Innsbruck)
• Temur Kutsia (Research Institute for Symbolic Computation, Linz)
• Aart Middeldorp (University of Innsbruck)
• Georg Moser (University of Innsbruck)
• Jose Juan Rodriguez-Navarro (University of Innsbruck)
• Christian Sternagel (University of Innsbruck)
• Harald Zankl (University of Innsbruck)

Japan

• Takahito Aoto (Tohoku University)
• Makoto Hamana (Gunma University)
• Kentaro Kikuchi (Tohoku University)
• Ichiro Mitsuhashi (Mie University)
• Naoki Nishida (Nagoya University)
• Mizuhito Ogawa (Japan Advanced Institute of Science and Technology)
• Satoshi Okui (Chubu University)
• Michio Oyamaguchi (Mie University)
• Taro Suzuki (Aizu University)
• Yoshihito Toyama (Tohoku University)
• Toshiyuki Yamada (Mie University)

Netherlands

• Vincent van Oostrom (Utrecht University)

Support Staff

• Simon Bailey
• Mona Kornherr
• Anna Maria Scheiring

Program

• Takahito Aoto
  • Dependency Pairs for Simply Typed Term Rewriting
• Stefan Blom
  • A Characterisation of Sharing in Term Graphs
• Makoto Hamana
  • Key Ideas of Universal Algebra for CRSs (45 minutes)
• Nao Hirokawa
  • Polynomial Interpretations Revisited
• Kentaro Kikuchi
  • On General Methods for Proving Properties of Typed Lambda Terms
• Temur Kutsia
  • Matching with Regular Constraints
• Aart Middeldorp
  • Some Remarks on Proving Termination of Applicative Rewrite Systems
• Georg Moser
  • Proofs of the Termination of Rewrite Rules for Polytime Functions
• Mizuhito Ogawa
  • TBA
• Vincent van Oostrom
  • Non-Modularity in Higher-Order Rewriting (and some modularity in first-order rewriting)
• Ichiro Mitsuhashi
  • Generalization of Decidability Results for Reachability, Joinability, and Word Problems
• Naoki Nishida
  • Dependency Graph Method for Proving Termination of Narrowing
• Satoshi Okui
  • Pattern Matching Incomplete RE-Typed Expressions via Transformation
• Michio Oyamaguchi
  • On Confluence and Reachability of Flat Rewrite Systems
• Taro Suzuki
  • A Statically Typed Second Order Rewrite System for XML Transformation
• Yoshihito Toyama
  • Reduction Strategies for Left-Linear Term Rewriting Systems
• Toshiyuki Yamada
  • Termination by Transformation