49 search results - page 1 / 10 » A calculus for uniform feature composition |
TOPLAS
2010
13 years 2 months ago
2010
HASKELL
2009
ACM
13 years 11 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
FOSSACS
2007
Springer
13 years 10 months ago
2007
Springer
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
FMICS
2009
Springer
13 years 8 months ago
2009
Springer
In this paper we show how Rate Transition Systems (RTSs) can be used as a unifying framework for the definition of the semantics of stochastic process algebras. RTSs facilitate the...
ICDCSW
2009
IEEE
13 years 2 months ago
2009
IEEE
Dynamic composition of protocol features allows applications to establish connections with custom communication characteristics. Automatically computing possible compositions and ...