AttributesValues
type
value
  • 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.
Subject
  • Mathematical analysis
  • Topology
  • Numerical analysis
  • Algebra
  • Linear algebra
  • Mathematical structures
  • Type theory
  • Functional languages
  • Free theorem provers
  • Proof assistants
  • OCaml software
  • Dependently typed programming
  • Type systems
  • 1989 software
  • Dependently typed languages
  • Educational math software
  • Extensible syntax programming languages
  • Free software programmed in OCaml
  • Programming languages created in 1984
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software