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.
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 |
Biography
editPaulin-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
editPaulin-Mohring won the Michel-Monpetit Prize 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
edit- 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
edit- ^ Birth year from Library of Congress catalog entry. Retrieved 1 December 2018.
- ^ "introduction". Laboratoire de Recherche en Informatique. 8 July 2016. Retrieved 7 March 2023.
- ^ Christine Paulin-Mohring at the Mathematics Genealogy Project
- ^ "Short biography". Laboratoire de Recherche en Informatique. Retrieved 11 May 2020.
- ^ "Labex DigiCosme | Organisation-EN". DigiCosme - Paris-Saclay. Archived from the original on 19 August 2017. Retrieved 10 October 2018.
- ^ "Editorial Team". Journal of Formalized Reasoning. Retrieved 10 October 2018.
- ^ "Lauréats 2015 des prix thématiques" (in French). French Academy of Sciences. Retrieved 29 May 2019.
- ^ "Christine Paulin-Mohring". awards.acm.org. Archived from the original on 28 November 2021. Retrieved 6 October 2020.
- ^ "ACM Honors Computing Innovators Who Are Changing the World". www.acm.org. Retrieved 6 October 2020.
- ^ "Christine Paulin-Mohring". Member profiles. Academia Europaea. Retrieved 8 October 2020.
- ^ Eduardo Gimenez, Christine Paulin-Mohring. Lecture Notes in Computer Science. Types for Proofs and Programs. Springer. ASIN B01K93CDG6.
- ^ 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.
{{cite book}}: CS1 maint: others (link) - ^ 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.