François Fages
| François Fages | |
|---|---|
Fages in May 2008
|
|
| Born |
23 August 1959 Paris |
| Residence | Senlisse |
| Nationality | French |
| Citizenship | French |
| Known for | Fages Theorem |
| Spouse(s) |
Colette Fages (m. 1984) 3 children |
| Awards | |
| Scientific career | |
| Fields | Computer Science |
| Institutions | INRIA |
| Doctoral advisor | Gérard Huet |
| Doctoral students | 29 |
Colette Fages (m. 1984)
François Fages (August 23, 1959) is a French computer scientist known for contributions in the areas of unification theory, rule-based modelling, logic programming,concurrent constraint logic programming,computational biology and systems biology.
Fages was born in Paris, France. He studied Mathematics and Physics at Université Paris-Sud, Computer Science at the Université Pierre et Marie Curie and received his PhD from the Université Pierre et Marie Curie under the supervision of Gérard Huet, in 1983 at age 23.
Fages took a junior researcher position from CNRS at Ecole Normale Supérieure, and became in addition, part-time teacher at Ecole Polytechnique from 1985 to 1998, and part-time consultant at Thomson-CSF (now Thales Group) research center from 1985 to 1996. Since 1999, he is a senior researcher at the Institut national de recherche en informatique et en automatique (INRIA), the French national research institute on computer science and control.
He is known in unification theory for having shown the non-existence of minimal sets of unifiers in some equational theories (conjecture of Plotkin, 1972), and the decidability of associative-commutative unification in presence of several function symbols (conjecture of Stickel, 1981).
...
Wikipedia