AbstractWe 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
In this paper we are interested in the process of formalizing a mathematical text written in Common ...
In this paper we will discuss various aspects of computable/constructive analysis, namely semantics,...
A gentle introduction for graduate students and researchers in the art of formalizing mathematics on...
We provide a computer verified exact monadic functional implementation of the Riemann integral in ty...
AbstractWe provide a computer-verified exact monadic functional implementation of the Riemann integr...
Contains fulltext : 84382.pdf (preprint version ) (Open Access) ...
AbstractType Theory is a mathematical language with computation rules developed by Per Martin-Löf. T...
The first part of the paper introduces the varieties of modern constructive mathematics, concentrati...
AbstractThe structure of monadic functional programs allows the integration of many different featur...
AbstractWe develop an algorithm for exact real integration over a class of self-similar spaces and m...
The structure of monadic functional programs allows the integration of many different features by ju...
Abstract: Taking as a starting point (a modification of) a weak theory of arithmetic of Jan Johannse...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
Drawing together two lines of research (that done in type-safe region-based memory management and t...
International audienceDijkstra monads are a means by which a dependent type theory can beenhanced wi...
In this paper we are interested in the process of formalizing a mathematical text written in Common ...
In this paper we will discuss various aspects of computable/constructive analysis, namely semantics,...
A gentle introduction for graduate students and researchers in the art of formalizing mathematics on...
We provide a computer verified exact monadic functional implementation of the Riemann integral in ty...
AbstractWe provide a computer-verified exact monadic functional implementation of the Riemann integr...
Contains fulltext : 84382.pdf (preprint version ) (Open Access) ...
AbstractType Theory is a mathematical language with computation rules developed by Per Martin-Löf. T...
The first part of the paper introduces the varieties of modern constructive mathematics, concentrati...
AbstractThe structure of monadic functional programs allows the integration of many different featur...
AbstractWe develop an algorithm for exact real integration over a class of self-similar spaces and m...
The structure of monadic functional programs allows the integration of many different features by ju...
Abstract: Taking as a starting point (a modification of) a weak theory of arithmetic of Jan Johannse...
AbstractThis tutorial aims at giving an account on the realizability models for several constructive...
Drawing together two lines of research (that done in type-safe region-based memory management and t...
International audienceDijkstra monads are a means by which a dependent type theory can beenhanced wi...
In this paper we are interested in the process of formalizing a mathematical text written in Common ...
In this paper we will discuss various aspects of computable/constructive analysis, namely semantics,...
A gentle introduction for graduate students and researchers in the art of formalizing mathematics on...
DOI
Add to ORKG