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

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

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

This paper discusses the design of a hierarchy of structures which combine linear algebra with concepts related to limits, like topology and norms, in dependent type theory. This hierarchy is the backbone of a new library of formalized classical analysis, for the Coq proof assistant. It extends the Mathematical Components library, geared towards algebra, with topics in analysis. Issues of a more general nature related to the inheritance of poorer structures from richer ones arise due to this combination. We present and discuss a solution, coined forgetful inheritance, based on packed classes and unification hints.
Original languageEnglish
Title of host publicationAutomated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings
EditorsN. Peltier, V. Sofronie-Stokkermans
PublisherSpringer
Pages3-20
ISBN (Print)9783030510534
DOIs
Publication statusPublished - 2020
Externally publishedYes
Event10th International Joint Conference on Automated Reasoning, IJCAR 2020 - Virtual, Online
Duration: 1 Jul 20204 Jul 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Joint Conference on Automated Reasoning, IJCAR 2020
CityVirtual, Online
Period1/07/204/07/20

Fingerprint

Dive into the research topics of 'Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis'. Together they form a unique fingerprint.

Cite this