1216 search results - page 31 / 244 » Hybrid type checking |
165
click to vote
POPL
2001
ACM
15 years 10 months ago
2001
ACM
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
Gordon and Jeffrey developed a type system for checking correspondence assertions. The correspondence assertions, proposed by Woo and Lam, state that when a certain event (called a...
80
Voted
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
ESOP
2000
Springer
15 years 1 months ago
2000
Springer
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...
CONCUR
2008
Springer
14 years 11 months ago
2008
Springer
We present a framework that combines ideas from spatial logics and Igarashi and Kobayashi's behavioural type systems, drawing benefits from both. In our approach, type systems...