15 citations · 39 across the 14 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2018
Three Euler's Sieves and a Fast Prime Generator (Functional Pearl)
Ivano Salvo, Agnese Pacifico
The Euler's Sieve refines the Sieve of Eratosthenes to compute prime numbers, by crossing off each non prime number just once. Euler's Sieve is considered hard to be faithfully and…
cs.PL2018
Computing Integer Sequences: Filtering vs Generation (Functional Pearl)
Ivano Salvo, Agnese Pacifico
As a report of a teaching experience, we analyse Haskell programs computing two integer sequences: the Hamming sequence and the Ulam sequence. For both of them, we investigate two…