4 papers
Linear Constraints
Arnaud Spiwack, Csongor Kiss, Jean-Philippe Bernardy +2
Linear constraints are the linear counterpart of Haskell's class constraints. Linearly typed parameters allow the programmer to control resources such as file handles and manually…
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…
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…
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…