Please log in to watch this conference skillscast.
It is a very haskellian thing to do, to solve problems by applying types to them. In this talk, you will learn to do just that, to problems found in distributed programming. The interesting commonality of these problems is that they are not commonly recognised as having a solution in the space of types. From memory management, to fusion, to protocols. You will discover that with an extension to Haskell's type system called linear types you can play dirty tricks you usually associate with C programming and keep your hands clean. The Haskell way.
YOU MAY ALSO LIKE:
Distributed Programming with Linear Types
Arnaud Spiwack spend the first 10 years of his working life in Academia, between Chalmers university in Gothenburg, Sweden, and Ecole 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 I/O, and is working at making the world better typed.