16th TRS meeting (Gunma Univewrsity, Kiryu, March 6-7, 2000)
Organized by Hirofumi Yokouchi, Takahito Aoto (Gunma University)
List of presentations.
3/6 (Mon) 13:00-18:00
- Hitoshi Ohsaki (ETL),
Equational Tree Automata
- Keiichirou Kusakari (JAIST),
On Proving Termination of Higher-Order Term Rewriting Systems
- Thomas Arts (Computer Science Lab. Ericsson),
Erlang Process Verification based on Dependency Pairs (with J.Giesl)
- Hirofumi Yokouchi (Gunma University),
Type checking algorithms for refinement type systems
- Fer-Jan de Vries (ETL),
Infinite lambda-calculus plus eta-rule, "some problems"
- Paula Severi (Universidad de la Republica Uruguay),
Bohm Theorem for Berarducci Trees (with M.Dezani, Fer-Jan de Vries)
- Masahiko Sakai (Nagoya University),
Experiment on deciding NVNF-sequentiality of TRSs
- Aart Middeldorp (University of Tsukuba),
Call by Need Computations and Signature Extension
3/7 (Tue) 9:30-12:00
- Yoshihito Toyama (JAIST),
Confluent TRSs with extra variables (From discussion with T.Suzuki)
- Mizuhito Ogawa (NTT Communication Science Laboratories),
Tree width and its applications
- Taro Suzuki, JAIST
Lazy narrowing calculus and selection strategy
- Toshiyuki Yamada (University of Tsukuba),
Termination of higher-order rewriting by interpretation
- Takahito Aoto (Gunma University),
An approach to prove innermost termination of term rewriting systems
List of participants.
- Hirofumi Yokouchi, Takahito Aoto (Gunma Univ.)
- Aart Middeldorp, Toshiyuki Yamada (Univ. Tsukuba)
- Masahiko Sakai (Nagoya Univ.)
- Yoshihito Toyama, Taro Suzuki, Keiichirou Kusakari (JAIST)
- Paula Severi (Universidad de la Republica Uruguay)
- Thomas Arts (Computer Science Lab. Ericsson)
- Fer-Jan de Vries, Hitoshi Ohsaki (ETL)
- Mizuhito Ogawa (NTT)