Biography:Christine Paulin-Mohring
Christine Paulin-Mohring | |
---|---|
Born | 1962 (age 61–62) |
Alma mater | Paris Diderot University |
Known for | Coq |
Awards | ACM Software System Award (2013) |
Scientific career | |
Fields | Mathematics, computer science |
Institutions | Paris-Saclay University |
Doctoral advisor | Gérard Huet |
Christine Paulin-Mohring (born 1962)[1] is a mathematical logician and computer scientist, and Professor Faculté des Sciences at Paris-Saclay University,[2] best known for developing the interactive theorem prover Coq.
Biography
Paulin-Mohring received her PhD in 1989 under the supervision of Gérard Huet.[3] She has been a professor at Paris-Saclay University since 1997 and the dean of the Paris-Saclay Faculty of Sciences since 2016.[4]
Between 2012 and 2015, she was the Scientific Coordinator of the Labex DigiCosme.[5] Currently,[when?] she is a member of the editorial board of the Journal of Formalized Reasoning.[6]
Recognition
Paulin-Mohring won the Michel-Monpetit Prize (fr) of the French Academy of Sciences in 2015.[7]
She and the rest of the Coq development team (Thierry Coquand, Gérard Huet, Bruno Barras, Jean-Christophe Filliâtre, Hugo Herbelin, Chetan Murthy, Yves Bertot and Pierre Castéran) won the 2013 ACM Software System Award[8][9] awarded by the Association for Computing Machinery.
She was elected to the Academia Europaea in 2014.[10]
Further reading
- Lecture Notes in Computer Science. Types for Proofs and Programs: International Workshop TYPES'96, Aussois, France, 15–19 December 1996 Selected Papers; Eduardo Gimenez, Christine Paulin-Mohring, Springer[11]
- Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, 15–18 December 2004, Revised Selected Papers: 3839 (Lecture Notes in Computer Science); Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner, Springer, 2008[12]
- Interactive Theorem Proving: 4th International Conference, ITP 2013, Rennes, France, 22–26 July 2013, Proceedings (Lecture Notes in Computer Science); Sandrine Blazy, Christine Paulin-Mohring, David Pichardie, Springer, 2013[13]
References
- ↑ Birth year from Library of Congress catalog entry. Retrieved 1 December 2018.
- ↑ "introduction". 8 July 2016. https://www.lri.fr/~paulin/.
- ↑ Christine Paulin-Mohring at the Mathematics Genealogy Project
- ↑ "Short biography". Laboratoire de Recherche en Informatique. https://www.lri.fr/~paulin/bio.html.
- ↑ "Labex DigiCosme | Organisation-EN" (in en). DigiCosme - Paris-Saclay. https://digicosme.lri.fr/tiki-index.php?page=Organisation.
- ↑ "Editorial Team". https://jfr.unibo.it/about/editorialTeam.
- ↑ "Lauréats 2015 des prix thématiques" (in fr). French Academy of Sciences. https://www.academie-sciences.fr/en/Laureats/laureats-2015-prix-thematiques.html.
- ↑ "Christine Paulin-Mohring" (in en). https://awards.acm.org/award-winners/PAULIN-MOHRING_4099933.
- ↑ "ACM Honors Computing Innovators Who Are Changing the World" (in en). https://www.acm.org/articles/bulletins/2014/april/2013-tech-awards.
- ↑ "Christine Paulin-Mohring". Member profiles. Academia Europaea. https://www.ae-info.org/ae/User/Paulin-Mohring_Christine.
- ↑ Eduardo Gimenez, Christine Paulin-Mohring. Lecture Notes in Computer Science. Types for Proofs and Programs. Springer.
- ↑ Types for proofs and programs: international workshop, TYPES 2004, Jouy-en-Josas, France, 15–18 December 2004: revised selected papers. Filliâtre, Jean-Christophe., Paulin-Mohring, Christine, Werner, Benjamin.. Berlin: Springer. 2006. ISBN 978-3-540-31429-5. OCLC 262692632. https://www.worldcat.org/oclc/262692632.
- ↑ Blazy, Sandrine; Paulin-Mohring, Christine; Pichardie, David, eds (22 July 2013). Interactive theorem proving: 4th International Conference, ITP 2013, Rennes, France, 22–26 July 2013. Proceedings. Berlin: Springer. ISBN 978-3-642-39634-2. OCLC 856650301. https://www.worldcat.org/oclc/856650301.
External links
- Home page at LRI
- Christine Paulin-Mohring at the Mathematics Genealogy Project
Original source: https://en.wikipedia.org/wiki/Christine Paulin-Mohring.
Read more |