Monday 3rd December 2001 | Tuesday 4th December 2001 | Wednesday 5th December 2001 | |||
07:30-08:30 | Breakfast | 07:30-08:30 | Breakfast | ||
Session 2 | Session 4 | ||||
09:00-10:00 | Takaki | 09:00-09:45 | Kinoshita | ||
10:15-10:45 | Takeuti | 10:00-11:00 | Tsuiki | ||
11:00-12:00 | Nagayama | ||||
11:00 | Closing | ||||
15:00 | Opening | ||||
Session 1 | Session 3 | ||||
15:15-15:45 | Fujinami | 15:00-15:45 | Ohsaki | ||
16:00-17:00 | Power | 16:00-17:00 | Treinen | ||
18:30- | Dinner | 18:30- | Dinner |
Name | Affiliation | Talk |
Tsutomu Fujinami | JAIST | A Decidable Linear Logic for Speech Translation |
Hitoshi Furusawa | AIST | |
Masahito Hasegawa | Kyoto U. | |
Ryu Hasegawa | U. Tokyo | |
Yoshihiko Kakutani | Kyoto U. | |
Yasuo Kawahara | Kyushu U. | |
Yoshiki Kinoshita | AIST | Kleene Categories for Tree Languages |
Yuichi Komori | Chiba U. | |
Hiroyuki Miyoshi | Kyoto Sangyo U. | |
Misao Nagayama | Tokyo Woman's Christian U. | On Girard's New Denotational Semantics |
Hitoshi Ohsaki | AIST | Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories |
John Power | Edinburgh U. | Computational Effects and Enriched Lawvere Theories |
Takafumi Sakurai | Chiba U. | |
Osamu Takaki | Kyoto U. | Primitive Recursive Analogues of Large Cardinals |
Izumi Takeuti | Kyoto U. | On a Problem by Y. Akama and D. Takeuti |
Kostas Tourlas | Edinburgh U. | |
Ralf Treinen | U. Paris-Sud | Tree Automata and Tree Constraints |
Hideki Tsuiki | Kyoto U. | Domain Theoretic Account of Computability via Bottomed Sequences |