Arnaud Spiwack

Registered user since Thu 2 Nov 2017

Name:Arnaud Spiwack
Bio:

Arnaud Spiwack spend the first 10 years of his working life in Academia, between Chalmers university in Gothenburg, Sweden, and École Polytechnique, Inria, and Mines ParisTech, in the Paris area. He spent this time researching dependent types, computer-verified proof, and sequent calculus. During his time in Academia, Arnaud got involved in the development of the Coq Proof Assistant, where he, in particular, re-engineered Coq’s tactic engine and gave it an abstract interface. After leaving Academia, he remained a member of the core development team of the Coq Proof Assistant. He is now a senior architect at Tweag, and is working at making the world better typed.

Country:France
Affiliation:Tweag
Research interests:Programing Languages, Formal Methods

Contributions

ICFP 2023 Committee Member in Program Committee within the ICFP Research Papers-track
ICFP 2022 Author of Linearly Qualified Types: Generic inference for capabilities and uniqueness within the ICFP Papers and Events-track
ECOOP 2022 Author of Union and intersection contracts are hard, actually within the Hub Talks-track
DLS 2021 Author of Union and Intersection Contracts Are Hard, Actually within the DLS 2021-track
Haskell 2021 Author of Evaluating Linear Functions to Symmetric Monoidal Categories within the Haskell 2021-track
HIW 2020 Author of Implementation of linear types within the HIW 2020-track
HIW 2018 Author of Implementing Linear Haskell within the HIW 2018-track
POPL 2018 Author of Linear Haskell: practical linearity in a higher-order polymorphic language within the Research Papers-track
Author of Linear Haskell: practical linearity in a higher-order polymorphic language within the Artifact Evaluation-track