35 citations · 57 across the 5 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
cs.PL2008★ 4 cited
Periodic Single-Pass Instruction Sequences
Jan A. Bergstra, Alban Ponse
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative pro…
math.RA2008★ 3 cited
Differential Meadows
Jan A. Bergstra, Alban Ponse
A meadow is a zero totalised field (0^{-1}=0), and a cancellation meadow is a meadow without proper zero divisors. In this paper we consider differential meadows, i.e., meadows equ…
math.RA2008★ 35 cited
Cancellation Meadows: a Generic Basis Theorem and Some Applications
Jan A. Bergstra, Inge Bethke, Alban Ponse
Let Q_0 denote the rational numbers expanded to a "meadow", that is, after taking its zero-totalized form (0^{-1}=0) as the preferred interpretation. In this paper we consider "can…