518 search results - page 52 / 104 » Automating Proofs in Category Theory |
DAC
2007
ACM
16 years 25 days ago
2007
ACM
A protocol for latency-insensitive design with early evaluation is presented. The protocol is based on a symmetric view of the system in which tokens carrying information move in ...
DAC
2006
ACM
16 years 24 days ago
2006
ACM
A simple protocol for latency-insensitive design is presented. The main features of the protocol are the efficient implementation of elastic communication channels and the automat...
199
click to vote
POPL
2004
ACM
16 years 4 days ago
2004
ACM
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
HMF is a conservative extension of Hindley-Milner type inference with first-class polymorphism. In contrast to other proposals, HML uses regular System F types and has a simple ty...
WOSP
2010
ACM
15 years 6 months ago
2010
ACM
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...