Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
Abstract. We propose a new type discipline for the -calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are...
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic k...