Guy L. Steele
YOU?
Author Swipe
View article: The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming
The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming Open
Functional logic languages have a rich literature, but it is tricky to give them a satisfying semantics. In this paper we describe the Verse calculus, VC, a new core calculus for deterministic functional logic programming. Our main contrib…
View article: LXM: better splittable pseudorandom number generators (and almost as fast)
LXM: better splittable pseudorandom number generators (and almost as fast) Open
In 2014, Steele, Lea, and Flood presented SplitMix, an object-oriented pseudorandom number generator (prng) that is quite fast (9 64-bit arithmetic/logical operations per 64 bits generated) and also splittable . A conventional prng object …
View article: Computationally easy, spectrally good multipliers for congruential pseudorandom number generators
Computationally easy, spectrally good multipliers for congruential pseudorandom number generators Open
Congruential pseudorandom number generators rely on good multipliers , that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and …
View article: Formal Verification of Authenticated, Append-Only Skip Lists in Agda: Extended Version
Formal Verification of Authenticated, Append-Only Skip Lists in Agda: Extended Version Open
Authenticated Append-Only Skiplists (AAOSLs) enable maintenance and querying of an authenticated log (such as a blockchain) without requiring any single party to store or verify the entire log, or to trust another party regarding its conte…
View article: Formal Verification of Authenticated, Append-Only Skip Lists in Agda:\n Extended Version
Formal Verification of Authenticated, Append-Only Skip Lists in Agda:\n Extended Version Open
Authenticated Append-Only Skiplists (AAOSLs) enable maintenance and querying\nof an authenticated log (such as a blockchain) without requiring any single\nparty to store or verify the entire log, or to trust another party regarding\nits co…
View article: Computationally easy, spectrally good multipliers for congruential pseudorandom number generators
Computationally easy, spectrally good multipliers for congruential pseudorandom number generators Open
Congruential pseudorandom number generators rely on good multipliers , that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and …
View article: Computationally easy, spectrally good multipliers for congruential\n pseudorandom number generators
Computationally easy, spectrally good multipliers for congruential\n pseudorandom number generators Open
Congruential pseudorandom number generators rely on good multipliers, that\nis, integers that have good performance with respect to the spectral test. We\nprovide lists of multipliers with a good lattice structure up to dimension\neight an…
View article: Polymorphic symmetric multiple dispatch with variance
Polymorphic symmetric multiple dispatch with variance Open
Many object-oriented languages provide method overloading, which allows multiple method declarations with the same name. For a given method invocation, in order to choose what method declaration to invoke, multiple dispatch considers the r…
View article: Using Butterfly-Patterned Partial Sums to Optimize GPU Memory Accesses\n for Drawing from Discrete Distributions
Using Butterfly-Patterned Partial Sums to Optimize GPU Memory Accesses\n for Drawing from Discrete Distributions Open
We describe a technique for drawing values from discrete distributions, such\nas sampling from the random variables of a mixture model, that avoids computing\na complete table of partial sums of the relative probabilities. A table of\nalte…
View article: Using Butterfly-Patterned Partial Sums to Optimize GPU Memory Accesses for Drawing from Discrete Distributions
Using Butterfly-Patterned Partial Sums to Optimize GPU Memory Accesses for Drawing from Discrete Distributions Open
We describe a technique for drawing values from discrete distributions, such as sampling from the random variables of a mixture model, that avoids computing a complete table of partial sums of the relative probabilities. A table of alterna…