Arnaud Spiwack Email & Phone Number

Tokyo, Jp

Paris Area, France

Senior software architect and R&D team lead in distributed computing projects.

R&D developer and devops in R&D High Performance Computing projects.

I studied the theoretical foundation of the audio-dedicated circuit-based language Faust. During that time, I was a collaborator to the Inria's Deducteam, where I studied unification and type inference in the context of the dependently typed rewriting-based programming language Dedukti.

I stayed shortly at the πr² team where I helped prepare the release of Coq v8.5.

I was a member of the Abstraction team, and the Verasco european project. I formalised parts of the Xisa modular static analyser in Coq.

I worked in the πr² team. I worked on the theory of dependent type programming, in particular on a dependently typed version of linear logic. I also worked as a Coq developer.

I taught for blackboard and laboratory exercises in an introductory programming class where the supporting language was a simplified variant of Scheme.

I worked as a PhD student in the TypiCal team (formerly LogiCal), in the LIX, computer science department of Ecole Polytechnique. My researches involve developing in Coq (a dependent type theory) a formal computation tool for homological algebra (inspired by Kenzo).This work is supervised by Thierry Coquand et Benjamin Werner.

I was a teaching assistant in an introductory algorithmic and data structures class where the supporting language was Java, for 3 years.I was a teaching assistant in a computer checked mathematics course where the supporting language was Coq, for 2 years.

I worked as a PhD student in the ProgLog team, in the computer science department of Chalmers Tekniska Högskola (aka Chalmers University of Technology). My researches involve developing in Coq (a dependent type theory) a formal computation tool for homological algebra (inspired by Kenzo).This work is supervised by Thierry Coquand et Benjamin Werner.

I worked in the LogiCal team (now called TypiCal team), in LIX (the computer science department of Ecole Polytechnique) as a trainee. My researches involved adding support for primitive datatypes (especially integers) in Coq (a dependent type theory). The primary goal was to provide a framework for fast computation in dependent type theories.This work was directed by Benjamin Werner.

I worked in the ProgLog team of the computer science department of Chalmers Tekniska Högskola (aka Chalmers University of Technology) as a trainee. My reasearches aimed at providing a generic proof for strong normalisation (based on domain theory) of dependent typed theories enriched with powerful computation principle (like bar recursion or double shift negation) which provide expressivity closer to classical logic.This work was directed by Thierry Coquand.

I worked as a trainee in INRIA Sophia-Antipolis. My researches aimed at better understanding the notion of traits in a typed object-oriented programming. It mainly focused on Java-like languages: named-based subtyping, classe-based languages.This work was directed by Luigi Liquori.

Master'S Degree, Computer Science

I studied theoretical computing sciences. I specialised in the "theory B" kind (proof theory, programming languages, …).

Mathematics