Author:
GEUVERS HERMAN,NIQUI MILAD,SPITTERS BAS,WIEDIJK FREEK
Abstract
In this paper we will discuss various aspects of computable/constructive analysis, namely semantics, proofs and computations. We will present some of the problems and solutions of exact real arithmetic varying from concrete implementations, representation and algorithms to various models for real computation. We then put these models in a uniform framework using realisability, which opens the door to the use of type theoretic and coalgebraic constructions both in computing and reasoning about these computations. We will indicate that it is often natural to use constructive logic to reason about these computations.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Formal proofs for Lyapunov stability theorems in exact real arithmetic;2023 European Control Conference (ECC);2023-06-13
2. Verified Exact Real Computation with Nondeterministic Functions and Limits;Fundamentals of Computation Theory;2023
3. Definitions, Assumptions, Propositions and Proofs in Sraffa’s PCMC;Palgrave Studies in the History of Economic Thought;2021
4. Taylor Series Revisited;Theoretical Aspects of Computing – ICTAC 2019;2019
5. Lambda Obfuscation;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2018