P
Pierre-Évariste Dagand
Researcher at University of Paris
Publications - 31
Citations - 1507
Pierre-Évariste Dagand is an academic researcher from University of Paris. The author has contributed to research in topics: Correctness & Type theory. The author has an hindex of 11, co-authored 30 publications receiving 1375 citations. Previous affiliations of Pierre-Évariste Dagand include French Institute for Research in Computer Science and Automation & Microsoft.
Papers
More filters
Proceedings ArticleDOI
The multikernel: a new OS architecture for scalable multicore systems
Andrew Baumann,Paul Barham,Pierre-Évariste Dagand,Tim Harris,Rebecca Isaacs,Simon Peter,Timothy Roscoe,Adrian Schüpbach,Akhilesh Singhania +8 more
TL;DR: This work investigates a new OS structure, the multikernel, that treats the machine as a network of independent cores, assumes no inter-core sharing at the lowest level, and moves traditional OS functionality to a distributed system of processes that communicate via message-passing.
Proceedings ArticleDOI
Fully abstract compilation to JavaScript
Cédric Fournet,Nikhil Swamy,Juan Chen,Pierre-Évariste Dagand,Pierre-Yves Strub,Benjamin Livshits +5 more
TL;DR: This paper compiles an ML-like language with higher-order functions and references to JavaScript, while preserving all source program properties, and shows full abstraction: two programs are equivalent in all source contexts if and only if their wrapped translations are equivalents in all JavaScript contexts.
Proceedings ArticleDOI
The gentle art of levitation
TL;DR: A closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe, so datatype-generic programming thus becomes ordinary programming.
Proceedings ArticleDOI
A formally verified compiler for Lustre
TL;DR: This work shows that repeated execution of the generated assembly code faithfully implements the dataflow semantics of source programs, and resolves two key technical challenges.
Proceedings ArticleDOI
Coq: the world's best macro assembler?
TL;DR: Using dependent types, type classes and notation the authors give the x86 semantics a makeover that counters its reputation for baroqueness, and model bits, bytes, and memory concretely using functions that can be computed inside Coq itself to prove theorems.