This paper presents a type system which guarantees that well-typed programs in a procedural programming language satisfy a noninterference security property. With all program input...
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
The appeal of persistent class-oriented programming languages is great. Allowing class definitions to be persistent, in addition to instance data, greatly increases the ease of ac...
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...