Christine Paulin-Mohring

Christine Paulin-Mohring (born 1962)[1] is a mathematical logician and computer scientist, and Professor at Paris-Saclay University, best known for developing the interactive theorem prover Coq.

Christine Paulin-Mohring
Born1962 (1962)
Alma materParis Diderot University
Known forCoq
AwardsACM Software System Award (2013)
Scientific career
FieldsMathematics, computer science
InstitutionsParis-Saclay University
Doctoral advisorGérard Huet

Biography

Paulin-Mohring received her PhD in 1989 under the supervision of Gérard Huet.[2] She has been a professor at Paris-Saclay University since 1997 and the dean of the Paris-Saclay Faculty of Sciences since 2016.[3]

Between 2012 and 2015, she was the Scientific Coordinator of the Labex DigiCosme.[4] Currently, she is a member of the editorial board of the Journal of Formalized Reasoning.[5]

Recognition

Paulin-Mohring won the Michel-Monpetit Prize of the French Academy of Sciences in 2015.[6]

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[7][8] awarded by the Association for Computing Machinery.

She was elected to the Academia Europaea in 2014.[9]

Further reading
  • Lecture Notes in Computer Science. Types for Proofs and Programs: International Workshop TYPES'96, Aussois, France, December 15–19, 1996 Selected Papers; Eduardo Gimenez, Christine Paulin-Mohring, Springer[10]
  • Types for Proofs and Programs: International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15–18, 2004, Revised Selected Papers: 3839 (Lecture Notes in Computer Science); Jean-Christophe Filliatre, Christine Paulin-Mohring, Benjamin Werner, Springer, 2008[11]
  • Interactive Theorem Proving: 4th International Conference, ITP 2013, Rennes, France, July 22–26, 2013, Proceedings (Lecture Notes in Computer Science); Sandrine Blazy, Christine Paulin-Mohring, David Pichardie, Springer, 2013[12]

References
  1. Birth year from Library of Congress catalog entry. Retrieved 1 December 2018.
  2. Christine Paulin-Mohring at the Mathematics Genealogy Project
  3. "Short biography". Laboratoire de Recherche en Informatique. Retrieved 11 May 2020.
  4. "Labex DigiCosme | Organisation-EN". DigiCosme - Paris-Saclay. Archived from the original on 19 August 2017. Retrieved 10 October 2018.
  5. "Editorial Team". Journal of Formalized Reasoning. Retrieved 10 October 2018.
  6. "Lauréats 2015 des prix thématiques" (in French). French Academy of Sciences. Retrieved 29 May 2019.
  7. "Christine Paulin-Mohring". awards.acm.org. Retrieved 2020-10-06.
  8. "ACM Honors Computing Innovators Who Are Changing the World". www.acm.org. Retrieved 2020-10-06.
  9. "Christine Paulin-Mohring". Member profiles. Academia Europaea. Retrieved 2020-10-08.
  10. Eduardo Gimenez, Christine Paulin-Mohring. Lecture Notes in Computer Science. Types for Proofs and Programs. Springer. ASIN B01K93CDG6.
  11. Types for proofs and programs: international workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004: revised selected papers. Filliâtre, Jean-Christophe., Paulin-Mohring, Christine, Werner, Benjamin. Berlin: Springer. 2006. ISBN 978-3-540-31429-5. OCLC 262692632.CS1 maint: others (link)
  12. Interactive theorem proving: 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. Proceedings. Blazy, Sandrine, Paulin-Mohring, Christine, Pichardie, David. Berlin: Springer. ISBN 978-3-642-39634-2. OCLC 856650301.CS1 maint: others (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.