Computable analysis for extraction of certified programs and its applications
From MaRDI portal
Cites work
- A computable ordinary differential equation which possesses no computable solution
- A Coq formalization of Taylor models and power series for solving ordinary differential equations
- A Real Number Structure that is Effectively Categorical
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- Extracting efficient exact real number computation from proofs in constructive type theory
- Formalizing hyperspaces for extracting efficient exact real computation
- scientific article; zbMATH DE number 2069519 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746043 (Why is no real title available?)
- scientific article; zbMATH DE number 7374771 (Why is no real title available?)
- scientific article; zbMATH DE number 4189687 (Why is no real title available?)
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Realizability. An introduction to its categorical side
- Recursive function theory and numerical analysis
- The calculus of constructions
- The Picard Algorithm for Ordinary Differential Equations in Coq
- Towards using exact real arithmetic for initial value problems
- Using Taylor models in exact real arithmetic
This page was built for publication: Computable analysis for extraction of certified programs and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897660)
