85 citations · 103 across the 13 of their papers we have counts for
Showing 2025 · cs.PLShow all
3 papers · 2 filters
cs.PL2025
Refinement-Types Driven Development: A study
Facundo Domínguez, Arnaud Spiwack
This paper advocates for the broader application of SMT solvers in everyday programming, challenging the conventional wisdom that these tools are solely for formal methods and veri…
cs.PL2025
Invertible Syntax without the Tuples (Functional Pearl)
Mathieu Boespflug, Arnaud Spiwack
In the seminal paper Functional unparsing, Olivier Danvy used continuation passing to reanalyse printf-like format strings as combinators. In the intervening decades, the conversat…
cs.PL2025★ 1 cited
Destination Calculus: A Linear λ-Calculus for Purely Functional Memory Writes
Thomas Bagrel, Arnaud Spiwack
Destination passing -- aka. out parameters -- is taking a parameter to fill rather than returning a result from a function. Due to its apparently imperative nature, destination pas…