SLACS2000 Program (as of Aug. 29th)

Note. This program is tentative; it may change.

Sep. 27th, Wednesday

1400-1410

opening

14:10-15:20

Hiroshi Nakano (Ryukoku U.)
Constructive programming with approximation modality

Hirofumi Yokouchi (Gunma U.)
Type checking algorithms for refinement types and their implementation

15:35--17:20

Nobuyuki Sakamoto (Tohoku U.)
A new construction of countable functionals

Motohiko Mouri (JAIST)
XPE with Theorem Provers

Izumi Takeuti (Kyoto U.)
The measure of an omega-regular language is a rational number

Sep. 28th, Thursday

9:30--10:40

Ken-etsu Fujita (Shimane U.), A. Middeldorp (Tsukuba U.)
Synchronized Term Rewriting Systems

Toshiyuki Yamada (Tsukuba U.)
Termination of Symply Typed Term Rewriting Systems

10:55-12:40

Michiro Kondo (Shimane U.)
On structures of weak interlaced bilattices

Mamoru Shimoda (Shimonoseki City. U.)
On a generalization of fuzzy relation

Masaru Shirahata (Keio U.)
Goedel's Dialectica interpretation and game semantics

14:00--15:00

Masako Takahashi (ICU)
Tutorial: Proofs and Types

15:15--16:25

Ryo Kashima (Titech)
Simple proof of the standardization theorem in lambda-calculus

Kensuke Baba (Kyushu U.)
Case Calculus for Classical Logic

16:40--17:50

Sachio Hirokawa (Kyushu U.)
Long D-normal form and uniqueness of proofs

Yoshihiko Kakutani (Kyoto U.)
Duality between Call-by-name Recursion and Call-by-value Iteration

Evening: Sake-party

Sep. 29th, Friday

9:30--10:40

Tetsuhiro Kamide (Wakayama)
Substructural Logics with Mingle

Katsumi Sasaki (Nanzan U.)
Exact models for disjunction free fragments of propositional lax logic

10:50--12:15

Yoshihito Tanaka (Kyushu Sangyo U.)
Some proof systems for common knowledge predicate logic

John Longley (Edinburgh U.)
Programming languages and notions of computability