TACS
2001
Springer
13 years 9 months ago
2001
Springer
TACS
2001
Springer
13 years 9 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
TACS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
TACS
2001
Springer
13 years 9 months ago
2001
Springer
TACS
2001
Springer
13 years 9 months ago
2001
Springer
We propose the πD -calculus, a process calculus that can flexibly model fine-grained control of resource access in distributed computation, with a type system that statically pr...