290 search results - page 12 / 58 » A Denotational Semantics for Handel-C |
FORTE
2004
14 years 11 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 ...
78
Voted
AAAI
1998
14 years 11 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
15 years 1 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...
LICS
2005
IEEE
15 years 3 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,...
SAS
1994
Springer
15 years 1 months ago
1994
Springer
We definea novelinference systemfor strictness andtotality analysisfor the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those t...