198 search results - page 27 / 40 » Modal Proofs as Distributed Programs (Extended Abstract) |
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
ENTCS
2008
13 years 8 months ago
2008
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
CIE
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
PERVASIVE
2004
Springer
14 years 2 months ago
2004
Springer
Based on an extensive field study of current firefighting practices, we have developed a system called Siren to support tacit communication between firefighters with multiple level...
IWAN
1999
Springer
14 years 26 days ago
1999
Springer
There is a need to be able to program network components to adapt to application requirements for quality of service, specialised application dependent routing, to increase effici...