Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis

DOI10.1007/978-3-030-51054-1_1OpenAlexW3020731832MaRDI QIDQ5048989

Cyril Cohen, Kazuhiko Sakaguchi, Marie Kerjean, Reynald Affeldt, Damien Rouhling, Assia Mahboubi

Publication date: 9 November 2022

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51054-1_1

zbMATH Keywords

formalization of mathematicsCoqdependent type theorypacked classes

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (5)

Validating Mathematical Structures ⋮ Measure construction by extension in dependent type theory with application to integration ⋮ Towards a practical library for monadic equational reasoning in Coq ⋮ Multiple-inheritance hazards in dependently-typed algebraic hierarchies ⋮ Graded rings in Lean's dependent type theory

Uses Software

• Coq
• Isabelle
• Nuprl
• Agda
• Coquelicot
• HoTT
• Lean
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Telescopic mappings in typed lambda calculus
• Coquelicot: a user-friendly library of real analysis for Coq
• Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
• Type classes for mathematics in type theory
• Hints in Unification
• Packaging Mathematical Structures
• The Lean Theorem Prover (System Description)
• Canonical Big Operators
• First-Class Type Classes
• Validating Mathematical Structures
• Canonical Structures for the Working Coq User
• A Machine-Checked Proof of the Odd Order Theorem
• The Architecture of Mathematics

This page was built for publication: Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis