Thierry Coquand

Thierry Coquand
Name	Thierry Coquand
Birth date	1961
Nationality	French
Fields	Logic, computer science, mathematics
Alma mater	École Normale Supérieure, University of Paris-Sud
Known for	Calculus of constructions, Coq, constructive mathematics

Thierry Coquand is a French logician and computer scientist known for foundational work in type theory, constructive mathematics, and the development of proof assistants. He has made influential contributions to the calculus of constructions, interactive theorem proving, and semantics connecting category theory, lambda calculus, and formal verification. His research has intersected with institutions and figures across France, United Kingdom, and United States academic networks.

Early life and education

Coquand was born in France and completed formative studies at the École Normale Supérieure and the University of Paris-Sud, where he studied under advisors connected to traditions including André Weil, Jean-Pierre Serre, and influences from Henri Cartan and Bourbaki circles. During his doctoral work he engaged with problems related to intuitionism, Brouwer, and Brouwerian constructive approaches, alongside contemporaries from CNRS and collaborators linked to University of Cambridge and INRIA. His education connected him to researchers such as Gérard Huet, Jean-Yves Girard, and Per Martin-Löf through seminars and conferences like those at IHÉS and Cours Peccot.

Academic career and positions

Coquand has held positions at institutions including CNRS, Université de Paris-Sud, and visiting posts at University of Cambridge, University of Edinburgh, and Carnegie Mellon University. He participated in research groups at INRIA and collaborated with teams at Microsoft Research and École Polytechnique. Coquand has been affiliated with faculties and laboratories such as Laboratoire de Recherche en Informatique (LRI), CNRS units, and international consortia connected to ACM and European Mathematical Society. He taught courses influencing students who went on to work at IBM Research, Google Research, and other leading centers in formal methods and theoretical computer science.

Contributions to type theory and constructive mathematics

Coquand advanced the semantics of type theory by connecting syntactic systems to models from category theory, including work related to topos theory, Kripke semantics, and realizability models used by researchers such as Stephen Kleene and Dana Scott. He contributed to constructive treatments of classical results associated with Brouwer, Errett Bishop, and Brouwerian schools, and engaged with proof interpretations related to Gödel and Gödelian extraction techniques. His research intersects with the work of Per Martin-Löf, Jean-Yves Girard, Henk Barendregt, and Gilles Kahn on normalization, termination, and consistency proofs, and informed developments in homotopy type theory pursued by groups including Univalent Foundations and researchers such as Vladimir Voevodsky and Steve Awodey.

Research on the calculus of constructions and Coq

Coquand was instrumental in the formulation and semantic understanding of the calculus of constructions, collaborating with figures like Gérard Huet and linking to systems by Thierry H. C., Jean-Yves Girard and the Curry–Howard correspondence lineage initiated by Haskell Curry and William Howard. His work fed directly into the development of the Coq proof assistant, a project involving INRIA, Gérard Huet, Georges Gonthier, and later contributors from Microsoft Research and École Normale Supérieure de Lyon. Coquand explored mechanized proofs, program extraction, and type-checking algorithms that influenced implementations used by teams at Microsoft Research for projects like the CompCert verified compiler and by the Mathematical Components project led by Georges Gonthier. His collaborations connect to proof engineering efforts at Cambridge Theorem Proving Group and verification applications in seL4 and other formal verification initiatives.

Awards and honors

Coquand's research has been recognized by honors and invitations from institutions such as INRIA, CNRS, and learned societies including the European Mathematical Society and the ACM. He has been invited to speak at international venues like the International Congress of Mathematicians, the Logic in Computer Science conference, and workshops organized by IHP and IHÉS. His work has been cited in award-winning projects in formal verification, including efforts recognized by ACM SIGPLAN and communities around the Turing Award-level research networks that include recipients like Robin Milner and Edsger W. Dijkstra.

Selected publications

- Coquand, T.; contributions to semantics of type theory and normalization proofs appearing in proceedings of LICS and journals associated with Elsevier and Springer. - Coquand, T.; papers on constructive interpretations and links to Brouwer and Errett Bishop traditions published in outlets connected to Cambridge University Press and Oxford University Press. - Coquand, T.; collaborative works on the calculus of constructions and mechanized proof appearing with coauthors such as Gérard Huet, Georges Gonthier, and Thierry Mondet in conference volumes from CADE and ICFP. - Coquand, T.; articles on Coq, program extraction, and proof assistants cited by projects like CompCert, Mathematical Components, and verification efforts at INRIA and Microsoft Research.

Category:French mathematicians Category:Logicians Category:Computer scientists