33 citations · 33 across the 2 of their papers we have counts for
Showing 2001Show all
2 papers · 1 filter
cs.CL2001
Type Arithmetics: Computation based on the theory of types
Oleg Kiselyov
The present paper shows meta-programming turn programming, which is rich enough to express arbitrary arithmetic computations. We demonstrate a type system that implements Peano ari…
cs.CR2001
Secure Counting: counting members of a subset without revealing their identities
Oleg Kiselyov
Suppose there is a group of N people some of whom possess a specific property. For example, their wealth is above or below a threshold, they voted for a particular candidate, they…