25 citations · 637 across the 113 of their papers we have counts for
5 papers · 2 filters
Note on paraconsistency and reasoning about fractions
Jan A. Bergstra, Inge Bethke
We apply a paraconsistent logic to reason about fractions.
Probabilistic thread algebra
J. A. Bergstra, C. A. Middelburg
We add probabilistic features to basic thread algebra and its extensions with thread-service interaction and strategic interleaving. Here, threads represent the behaviours produced…
A Hoare-like logic of asserted single-pass instruction sequences
J. A. Bergstra, C. A. Middelburg
We present a formal system for proving the partial correctness of a single-pass instruction sequence as considered in program algebra by decomposition into proofs of the partial co…
Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals
Jan A. Bergstra, Alban Ponse
Integer arithmetic is specified according to three views: unary, binary, and decimal notation. The binary and decimal view have as their characteristic that each normal form resemb…
On algorithmic equivalence of instruction sequences for computing bit string functions
J. A. Bergstra, C. A. Middelburg
Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only in…