Sciweavers

Share
TACS
2001
Springer
10 years 4 months ago
Non-structural Subtype Entailment in Automata Theory
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...
Joachim Niehren, Tim Priesnitz
TACS
2001
Springer
10 years 4 months ago
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
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...
Hiroshi Nakano
TACS
2001
Springer
10 years 4 months ago
Solo Diagrams
Cosimo Laneve, Joachim Parrow, Björn Victor
TACS
2001
Springer
10 years 4 months ago
A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation
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...
Daisuke Hoshina, Eijiro Sumii, Akinori Yonezawa
books