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 ...
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...
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...
: 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...
We definea novelinference systemfor strictness andtotality analysisfor the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those t...