52 search results - page 1 / 11 » The Generalised Substitution Language Extended to Probabilis... |
B
1998
Springer
13 years 9 months ago
1998
Springer
Let predicate P be converted from Boolean to numeric type by writing P , with false being 0 and true being 1, so that in a degenerate sense P can be regarded as `the probability th...
IGPL
2000
13 years 5 months ago
2000
Abstract Neil Ghani Valeria de Paiva Eike Ritter The -calculus 1 adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implement...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We initiate the study of probabilistic parallel programs with dynamic process creation and synchronisation. To this end, we introduce probabilistic split-join systems (pSJSs), a mo...
ESOP
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. The question of equivalence has long vexed research in concurrency, leading to many different denotational- and bisimulation-based approaches; a breakthrough occurred wit...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...