23rd TRS meeting

The TRS meetings are biannual informal workshops aiming to promote research on rewriting and related areas (e.g. term rewriting, lambda calculi, ...). Participants are required to give a talk(s) of approximately 15 - 60 minutes in English. The subject of the talk is not restricted to one's own research; it's perfectly OK to explain another paper in the field of rewriting. (See TRS meeting homepage for more info.)

The 23rd Term Rewriting Meeting was held
at 3F meeting room, VBL(Venture Buisiness Laboratory), Nagoya University
on Wed.24, Thu.25 and Fri 26 Sep 2003.

Participants

AOTO Takahito, Tohoku Univ.
IWAMI Munehiro, Shimane Univ.
KASUYA Hideto, Aichi Prefectural Univ.
KUSAKARI Keiichiro, Nagoya Univ.
MATSUMOTO Toshimasa, JAIST
MITSUHASHI Ichiro, Mie univ.
NAGASHIMA Masanori, Nagoya Univ.
NAKAMURA Masaki, JAIST
NISHIDA Naoki, Nagoya Univ.
OGAWA Mizuhito, JAIST/JST
OHSAKI Hitoshi, AIST & JST
OYAMAGUCHI Michio, Mie Univ.
SAKAI Masahiko, Nagoya Univ.
TOYAMA Yoshihito, Tohoku Univ.
YAMADA Toshiyuki, Mie Univ.
YUEN Shoji, Nagoya Univ.

Program


24th 14:00-17:00 Free discussions
25th 9:30-12:00
Munehiro Iwami	Persistence of termination for locally confluent overlay term rewriting systems
Takahito Aoto	Termination of term rewriting systems with higher-order variables by translation
Keiichiro Kusakari	Argument filtering methods in simply-typed term rewriting systems
Hideto Kasuya	On Nk tree automaton and its properties for decidability problem of higher-order rewrite systems
25th 13:00-15:30
Ichiro Mitsuhashi	Decidability of reachability & joinability
Toshimasa Matsumoto	Improved sequent system for the modal logic KB
Masanori Nagashima	Program generation by transformation from quantified equational specification
Masaki Nakamura	Total function symbols for term rewriting systems
25th 15:45-18:00
Naoki Nishida	Basic narrowing improves efficiency of computation of right-linear term rewriting systems with extra variables
Mizuhito Ogawa	Iterative-free program analysis
Hitoshi Ohsaki	Recognizing boolean closed A-tree languages with membership conditional rewriting mechanism
26th 9:15-12:30
Masahiko Sakai	On equivalence of termination and innermost termination
Yoshihito Toyama	Termination of S-expression rewriting system (SRS)
Shoji Yuen	Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
Toshiyuki Yamada	Quasi-reducible sets
Michio Oyamaguchi	On the confluence and related problems of TRSs

How to get to VBL (the place of the meeting)

Use subway (Higashiyama-line) from Nagoya St. to Motoyama St. (about 15 minutes)
Transportation Bureau City of Nagoya (Japanese/English)
10 minutes walk from Motoyama station (Higashiyama-line)
See also subway map and campus map ( Japanese/ English)
PARKING information

Last modified: Oct.15.2003 by Masahiko Sakai(mail: sakai at is.nagoya-u.ac.jp).