Speaker:Naoki Kobayashi
Time:2001-04-30 16:00:00
Place:Rm.1502, Computer Science Bldg. KAIST

Abstract

Type systems for programming languages have been playing an important role in guaranteeing the correctness of sequential programs. Recently, a number of type systems for concurrent programming languages have also been proposed to analyze various properties of concurrent programs such as non-determinism and deadlock. Unfortunately, however, most of them have been designed in an ad hoc manner, due to the lack of a general framework of type systems for concurrent programming languages. In this talk, I show that we can obtain a general framework of type systems for concurrent programming languages based on a view: types as abstract programs. Using our general framework, we can easily derive various type systems for concurrent programming languages.


[ List ]