Computable analysis for verified exact real computation
From MaRDI portal
Cites work
- A certified, corecursive implementation of exact real numbers
- A tutorial on computable analysis
- An introduction to many-valued and fuzzy logic. Semantics, algebras, and derivation systems
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Continuous and monotone machines
- Coquelicot: a user-friendly library of real analysis for Coq
- Feasible real random access machines
- Formalization of real analysis: a survey of proof assistants and libraries
- Formalization techniques for asymptotic reasoning in classical analysis
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746043 (Why is no real title available?)
- Introduction to Interval Analysis
- Mathematical Knowledge Management
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- PCF extended with real numbers
- Proving Bounds on Real-Valued Functions with Computations
- Theory of representations
Cited in
(2)
This page was built for publication: Computable analysis for verified exact real computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839852)