1226 search results - page 93 / 246 » Proofs, Programs and Abstract Complexity |
216
click to vote
POPL
2001
ACM
16 years 3 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...
128
click to vote
INTERSENSE
2006
ACM
15 years 9 months ago
2006
ACM
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
145
click to vote
AGP
1996
IEEE
15 years 7 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
157
click to vote
ESOP
2006
Springer
15 years 7 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
109
Voted
ICFP
2006
ACM
16 years 3 months ago
2006
ACM
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...