G
Gérard Huet
Researcher at French Institute for Research in Computer Science and Automation
Publications - 70
Citations - 9074
Gérard Huet is an academic researcher from French Institute for Research in Computer Science and Automation. The author has contributed to research in topics: Proof assistant & Mathematical proof. The author has an hindex of 29, co-authored 68 publications receiving 8892 citations. Previous affiliations of Gérard Huet include Case Western Reserve University & SRI International.
Papers
More filters
Journal ArticleDOI
The calculus of constructions
Thierry Coquand,Gérard Huet +1 more
TL;DR: In this article, the authors propose a method to solve the problem of homonymity in homonymization, i.e., homonym-of-subjects-with-objectivity.
The Coq proof assistant : reference manual, version 6.1
Bruno Barras,Samuel Boutin,Cristina Cornes,Judicaël Courant,Jean-Christophe Filliâtre,Eduardo Giménez,Hugo Herbelin,Gérard Huet,César A. Muñoz,Chetan Murthy,Catherine Parent,Christine Paulin-Mohring,Amokrane Saïbi,Benjamin Werner +13 more
TL;DR: Coq V6.1 is a proof assistant based on a higher-order logic allowing powerful definitions of functions and is available by anonymous ftp at ftp.ens-lyon.fr/INRIA/Projects/coq/V 6.1.
Journal ArticleDOI
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems
TL;DR: This paper gives new results, and presents old ones, concerning ChurchRosser theorems for rewrmng systems, depending solely on axioms for a binary relatton called reduction, and how these criteria yield new methods for the mechanizaUon of equattonal theories.
Book ChapterDOI
Equations and rewrite rules: a survey
Gérard Huet,Derek C. Oppen +1 more
TL;DR: The problem of "solving" equations, the problem of proving termination of sets of rewrite rules, and the decidability and complexity of word problems and of combinations of equational theories are discussed.
Proceedings ArticleDOI
Conflunt reductions: Abstract properties and applications to term rewriting systems
TL;DR: This paper gives new results, and presents old ones in a unified formalism, concerning Church-Rosser theorems for rewriting systems, and shows how these results yield efficient methods for the mechanization of equational theories.