2 papers
cs.PL2026
Typing Strictness (Extended Version)
Daniel Sainati, Joseph W. Cutler, Benjamin C. Pierce +1
Strictness analysis is critical to efficient implementation of languages with non-strict evaluation, mitigating much of the performance overhead of laziness. However, reasoning abo…
cs.PL2025
Rebound: Efficient, Expressive, and Well-Scoped Binding
Noé De Santo, Stephanie Weirich
We introduce the Rebound library that supports well-scoped term representations in Haskell and automates the definition of substitution, alpha-equivalence, and other operations tha…