2011/11/25 by Jeremy Avigad, Avigad, Jeremy
Computer Science · #F.4.1 #FOS: Computer and information sciences #I.2.3 #Logic in Computer Science (cs.LO) #Mathematics, Computing, and Information Processing #Semantic Web and Ontologies
paper · pdf · doi:10.48550/arxiv.1111.5885
openalex publication_date 2011/11/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the theory of programming languages, type inference is the process of inferring the type of an expression automatically, often making use of information from the context in which the expression appears. Such mechanisms turn out to be extremely useful in the practice of interactive theorem proving, whereby users interact with a computational proof assistant to construct formal axiomatic derivations of mathematical theorems. This article explains some of the mechanisms for type inference used by the Mathematical Components project, which is working towards a verification of the Feit-Thompson theorem.