Computing with continuous objects: a uniform co-inductive approach
From MaRDI portal
Publication:5156773
DOI10.1017/S0960129521000116MaRDI QIDQ5156773FDOQ5156773
Authors: Dieter Spreen 
Publication date: 11 October 2021
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.05392
Recommendations
topologycompact setprogram extractioncomputingiterative function systeminductive/co-inductive definition
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Set-valued analysis
- Universal coalgebra: A theory of systems
- Real number computation through Gray code embedding.
- Proofs and computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some recent progress concerning topology of fractals
- Power domains and iterated function systems
- Title not available (Why is that?)
- Distances on topological self-similar sets and the kneading determinants
- Computability on subsets of metric spaces.
- A domain-theoretic approach to computability on the real line
- Semantics of a sequential language for exact real-number computation
- From coinductive proofs to exact real arithmetic: theory and applications
- Realisability for induction and coinduction with applications to constructive analysis
- Proofs, programs, processes
- A certified, corecursive implementation of exact real numbers
- Proofs, programs, processes
- Intuitionistic fixed point logic
- A coinductive approach to computing with compact sets
- A functional algorithm for exact real integration with invariant measures
Cited In (3)
This page was built for publication: Computing with continuous objects: a uniform co-inductive approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5156773)
