Last Updated: March 22, 2001
March 15
- 10:00-10:35
- Yohji Akama (Tohoku University)
Limiting Partial Combinatory Algebras
- 10:35-11:20
- Thomas Arts (Ericsson Computer Science Laboratory)
Erlang to mCRL; generating large TRSs
- 11:20-11:30
- break
- 11:30-12:05
- M.R.K. Krishna Rao (University of Tsukuba)
Term rewriting in Design & Verification of Processors (Arvind + Sher)
- 12:05-13:30
- lunch
- 13:30-14:15
- Juergen Giesl (RWTH Aachen, Germany)
Dependency Pairs for Equational Rewriting
- 14:15-14:50
- Takahito Aoto (Gunma University)
On completeness of unfailing completion
- 14:50-15:05
- break
- 15:05-15:40
- Hitoshi Ohsaki (Electrotechnical Laboratory)
Beyond the regularity: summary and some additional
results on equational tree automata
- 15:40-16:10
- Toshinori Takai (Nara Institute of Science and Technology)
Termination of finite-path overlapping term rewriting systems
- 16:10-16:25
- break
- 16:25-17:00
- Yoshihito Toyama (Tohoku University)
Unary is better than binary (joint work with Y.Amachi)
- 17:00-17:20
- Shin'ich Fukui (Tohoku University)
Ground-reducibility ---decidability and application---
- 19:00-?
- party
March 16
- 9:40-10:15
- Ryo Kashima (Tokyo Institute of Technology)
Simple proof of the standardization theorem in lambda-calculus
- 10:15-10:50
- Izumi Takeuchi (Informatics,Kyoto Univ.)
Decomposition of omega regular languages
- 10:50-11:00
- break
- 11:00-12:00
- Aart Middeldorp (University of Tsukuba)
Approximating Dependency Graphs using Tree Automata Techniques
- 12:00-13:30
- lunch
- 13:30-14:05
- Masaki Nakamura (JAIST)
On the evaluation strategy
- 14:05-14:40
- Taro Suzuki (Tohoku University)
A Complete Selection Function for Lazy Conditional Narrowing
- 14:40-14:55
- break
- 14:55-15:30
- Toshiyuki Yamada (University of Tsukuba)
A Unification Algorithm for Typed lambda-calculus (by G.P.Huet,TCS '75)
- 15:30-16:05
- Keiichirou Kusakari (Tohoku University)
Lexicographic Path Orders in Simply-Typed TRSs