1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.PL2016
Proust: A Nano Proof Assistant
Prabhakar Ragde
Proust is a small Racket program offering rudimentary interactive assistance in the development of verified proofs for propositional and predicate logic. It is constructed in stage…
cs.PL2014★ 1 cited
Simple Balanced Binary Search Trees
Prabhakar Ragde
Efficient implementations of sets and maps (dictionaries) are important in computer science, and balanced binary search trees are the basis of the best practical implementations. P…
cs.PL2013★ 1 cited
Mathematics Is Imprecise
Prabhakar Ragde
We commonly think of mathematics as bringing precision to application domains, but its relationship with computer science is more complex. This experience report on the use of Rack…