A computer-verified monadic functional implementation of the integral

Authors:
Russell OConnor;Bas Spitters
Affiliations:
Radboud University Nijmegen, Netherlands;Radboud University Nijmegen, Netherlands
Venue:
Theoretical Computer Science
Year:
2010

Citing 21
Cited 4

The calculus of constructions

Information and Computation - Semantics of Data Types
Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Programming in Martin-Lo¨f's type theory: an introduction

Programming in Martin-Lo¨f's type theory: an introduction
Type theory and functional programming

Type theory and functional programming
A compiled implementation of strong reduction

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Numerical Integration with Exact Real Arithmetic

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Lazy Functional Algorithms for Exact Real Functionals

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Inductively defined types

COLOG '88 Proceedings of the International Conference on Computer Logic
The view from the left

Journal of Functional Programming
Setoids in type theory

Journal of Functional Programming
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)

Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
Constructive analysis, types and exact real numbers

Mathematical Structures in Computer Science
A monadic, functional implementation of real numbers

Mathematical Structures in Computer Science
Applicative programming with effects

Journal of Functional Programming
Realizability interpretation of proofs in constructive analysis

Theory of Computing Systems
A constructive formalization of the fundamental theorem of calculus

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
From coinductive proofs to exact real arithmetic

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Mechanized metatheory for the masses: the PoplMark challenge

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
A semi-reflexive tactic for (sub-)equational reasoning

TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Expressivity of coalgebraic modal logic: the limits and beyond

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Computer certified efficient exact reals in Coq

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Some steps into verification of exact real arithmetic

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Wave Equation Numerical Resolution: A Comprehensive Mechanized Proof of a C Program

Journal of Automated Reasoning
The picard algorithm for ordinary differential equations in coq

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	5.23

Visualization

Abstract

We provide a computer-verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the beginning of the realization of Bishop's vision to use constructive mathematics as a programming language for exact analysis.