7 citations · 26 across the 8 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2009
Straight-line instruction sequence completeness for total calculation on cancellation meadows
Jan A. Bergstra, Inge Bethke
A combination of program algebra with the theory of meadows is designed leading to a theory of computation in algebraic structures which use in addition to a zero test and copying…
cs.LO2009★ 2 cited
Square root meadows
Jan A. Bergstra, I. Bethke
Let Q_0 denote the rational numbers expanded to a meadow by totalizing inversion such that 0^{-1}=0. Q_0 can be expanded by a total sign function s that extracts the sign of a rati…
cs.LO2007
Tuplix Calculus
J. A. Bergstra, A. Ponse, M. B. van der Zwaag
We introduce a calculus for tuplices, which are expressions that generalize matrices and vectors. Tuplices have an underlying data type for quantities that are taken from a zero-to…