Arnaud Spiwack

29 papers A* 1B 2C 2Journal 20Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Destination Calculus: A Linear λ-Calculus for Purely Functional Memory Writes.
CoRR
Thomas Bagrel, Arnaud Spiwack
2025 J jnl
Destination Calculus: A Linear 𝜆-Calculus for Purely Functional Memory Writes.
Proc. ACM Program. Lang.
Thomas Bagrel, Arnaud Spiwack
2025 J jnl
Invertible Syntax without the Tuples (Functional Pearl).
CoRR
Mathieu Boespflug, Arnaud Spiwack
2025 J jnl
Refinement-Types Driven Development: A study.
CoRR
Facundo Domínguez, Arnaud Spiwack
2022 J jnl
Linearly qualified types: generic inference for capabilities and uniqueness.
Proc. ACM Program. Lang.
Arnaud Spiwack, Csongor Kiss, Jean-Philippe Bernardy, Nicolas Wu, Richard A. Eisenberg
2021 J jnl
Evaluating Linear Functions to Symmetric Monoidal Categories.
CoRR
Jean-Philippe Bernardy, Arnaud Spiwack
2021 C conf
Evaluating linear functions to symmetric monoidal categories.
Haskell
Jean-Philippe Bernardy, Arnaud Spiwack
2021 J jnl
Linear Constraints.
CoRR
Jean-Philippe Bernardy, Richard A. Eisenberg, Csongor Kiss, Arnaud Spiwack, Nicolas Wu
2021 C conf
Union and intersection contracts are hard, actually.
DLS
Teodoro Freund, Yann Hamdaoui, Arnaud Spiwack
2021 J jnl
Union and intersection contracts are hard, actually.
CoRR
Teodoro Freund, Yann Hamdaoui, Arnaud Spiwack
2018 J jnl
Circuits via topoi.
CoRR
Arnaud Spiwack
2018 J jnl
Linear Haskell: practical linearity in a higher-order polymorphic language.
Proc. ACM Program. Lang.
Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, Arnaud Spiwack
2017 J jnl
Linear Haskell: practical linearity in a higher-order polymorphic language.
CoRR
Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, Arnaud Spiwack
2015 J jnl
Notes on axiomatising Hurkens's Paradox.
CoRR
Arnaud Spiwack
2015 J jnl
The tree machine.
CoRR
Arnaud Spiwack
2014 B conf
Balancing Lists: A Proof Pearl.
ITP
Guyslain Naves, Arnaud Spiwack
2014 J jnl
Balancing lists: a proof pearl.
CoRR
Guyslain Naves, Arnaud Spiwack
2013 J jnl
Abstract interpretation as anti-refinement.
CoRR
Arnaud Spiwack
2013 — conf
The Rooster and the Syntactic Bracket.
TYPES
Hugo Herbelin, Arnaud Spiwack
2013 J jnl
The Rooster and the Syntactic Bracket.
CoRR
Hugo Herbelin, Arnaud Spiwack
2011 — —
Verified Computing in Homological Algebra. (Calculs vérifiés en algèbre homologique).
Arnaud Spiwack
2010 B conf
Extending Coq with Imperative Features and Its Application to SAT Verification.
ITP
Michaël Armand, Benjamin Grégoire, Arnaud Spiwack, Laurent Théry
2008 — conf
Catch Me If You Can - Looking for Type-Safe, Hierarchical, Lightweight, Polymorphic and Efficient Error Management in OCaml.
IFL
David Teller, Arnaud Spiwack, Till Varoquaux
2008 J jnl
Extending FeatherTrait Java with Interfaces.
Theor. Comput. Sci.
Luigi Liquori, Arnaud Spiwack
2008 J jnl
FeatherTrait: A modest extension of Featherweight Java.
ACM Trans. Program. Lang. Syst.
Luigi Liquori, Arnaud Spiwack
2007 J jnl
A proof of strong normalisation using domain theory
CoRR
Thierry Coquand, Arnaud Spiwack
2007 J jnl
A proof of strong normalisation using domain theory.
Log. Methods Comput. Sci.
Thierry Coquand, Arnaud Spiwack
2007 — conf
Towards Constructive Homological Algebra in Type Theory.
Calculemus/MKM
Thierry Coquand, Arnaud Spiwack
2006 A* conf
A Proof of Strong Normalisation using Domain Theory.
LICS
Thierry Coquand, Arnaud Spiwack