Coquelicot
From MaRDI portal
Software:23492
swMATH11552MaRDI QIDQ23492FDOQ23492
Author name not available (Why is that?)
Cited In (18)
- Title not available (Why is that?)
- Simple Type Theory is not too Simple: Grothendieck’s Schemes Without Dependent Types
- Predicate transformer semantics for hybrid systems. Verification components for Isabelle/HOL
- A Coq formalization of Lebesgue integration of nonnegative functions
- The flow of ODEs: formalization of variational equation and Poincaré map
- Title not available (Why is that?)
- Distant decimals of \(\pi \): formal proofs of some algorithms computing them and guarantees of exact computation
- Formally verified approximations of definite integrals
- Verified tail bounds for randomized programs
- A Formalization of Properties of Continuous Functions on Closed Intervals
- Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis
- Validating Mathematical Structures
- Computational logic: its origins and applications
- Formally Verified Approximations of Definite Integrals
- Free modal Riesz spaces are Archimedean: a syntactic proof
- A formal proof in Coq of Lasalle's invariance principle
- Bellerophon: tactical theorem proving for hybrid systems
- A Formal Proof of Cauchy’s Residue Theorem
This page was built for software: Coquelicot
