年 
年多味
予多


	
							
	      	
		   			
							
	  	       2000/9/27-29			
		        		
	  http://www.sato.kuis.kyoto-u.ac.jp/SLACS/	
	

  流的
発足/的
味能
複多流
雰
発表討他分


   発表聴無


==============

  9/28 () 14:00--15:00 
   
  
  
  theoretical computer science 
  tcs 分
  他未分
  
  
  



==========

9/27()
14:00--14:10
  

14:10--15:20
   龍谷
  的
  Constructive programming with approximation modality

  文 
  Refinement type
  Type checking algorithms for refinement types and their implementation

15:35--17:20
   
  countable functional法
  A new construction of countable functionals

  彦 陸端
  XPE with Theorem Provers

   
  則測有
  The measure of an omega-regular language is a rational number

9/28()
 9:30--10:40
  藤A. Middeldorp 
  同
  Synchronized Term Rewriting Systems

   
  単
  Termination of Symply Typed Term Rewriting Systems

10:55-12:40
  藤朗 
  weak interlaced bilattice 造
  On structures of weak interlaced bilattices

   立
  
  On a generalization of fuzzy relation

  優 
  味
  Goedel's Dialectica interpretation and game semantics

14:00--15:00 
   
  

15:15--16:25
  亮 
  標単
  Simple proof of the standardization theorem in lambda-calculus 

   
  分
  Case Calculus for Classical Logic

16:40--17:50
  廣 
  長唯
  Long D-normal form and uniqueness of proofs

  谷彦 
  Duality between Call-by-name Recursion and Call-by-value Iteration

夕: 

9/29()
 9:30--10:40
  哲 
  Mingle分造
  Substructural Logics with Mingle

  巳 
  Propositional lax logic   
  Exact models for disjunction free fragments of propositional lax logic  

10:50--12:00
   
  Some proof systems for common knowledge predicate logic

  John Longley (Edinburgh University)
  Programming languages and notions of computability
--------------------------------------------------------------------------