79 citations · 353 across the 23 of their papers we have counts for
1 paper · 1 filter
Lars Birkedal, Aleš Bizjak, Jan Schwinghammer
Programming languages with countable nondeterministic choice are computationally interesting since countable nondeterminism arises when modeling fairness for concurrent systems. Be…