5 citations · 8 across the 2 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2020
Tabled Typeclass Resolution
Daniel Selsam, Sebastian Ullrich, Leonardo de Moura
Typeclasses provide an elegant and effective way of managing ad-hoc polymorphism in both programming languages and interactive proof assistants. However, the increasingly sophistic…
cs.PL2020★ 5 cited
Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages
Sebastian Ullrich, Leonardo de Moura
In interactive theorem provers (ITPs), extensible syntax is not only crucial to lower the cognitive burden of manipulating complex mathematical objects, but plays a critical role i…
cs.PL2019★ 3 cited
Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming
Sebastian Ullrich, Leonardo de Moura
Most functional languages rely on some garbage collection for automatic memory management. They usually eschew reference counting in favor of a tracing garbage collector, which has…