291 search results - page 11 / 59 » CPP Denotational Semantics |
FORTE
2004
13 years 9 months ago
2004
The main goal of this paper is to extend sPBC with the iteration operator, providing an operational semantics for the language, as well as a denotational semantics, which is based ...
AAAI
1998
13 years 9 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
CONCUR
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...
JUCS
2010
13 years 2 months ago
2010
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
A number of authors have exported domain-theoretic techniques from denotational semantics to the operational study of contextual equivalence and preorder. We further develop this,...