Computing with continuous objects: a uniform co-inductive approach

DOI10.1017/S0960129521000116MaRDI QIDQ5156773zbMATH OpenFDO

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

zbMATH Keywords

topologycompact setprogram extractioncomputingiterative function systeminductive/co-inductive definition

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Recommendations

• A coinductive approach to computing with compact sets
• From Coinductive Proofs to Exact Real Arithmetic
• From coinductive proofs to exact real arithmetic: theory and applications
• Computable analysis and notions of continuity in \textsc{Coq}
• scientific article; zbMATH DE number 3952751

Cites work

• scientific article; zbMATH DE number 3886197 (Why is no real title available?)
• scientific article; zbMATH DE number 3855514 (Why is no real title available?)
• scientific article; zbMATH DE number 3964277 (Why is no real title available?)
• scientific article; zbMATH DE number 42114 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1461253 (Why is no real title available?)
• scientific article; zbMATH DE number 2090725 (Why is no real title available?)
• scientific article; zbMATH DE number 3326329 (Why is no real title available?)
• A certified, corecursive implementation of exact real numbers
• A coinductive approach to computing with compact sets
• A domain-theoretic approach to computability on the real line
• A functional algorithm for exact real integration with invariant measures
• Computability on subsets of metric spaces.
• Distances on topological self-similar sets and the kneading determinants
• From coinductive proofs to exact real arithmetic: theory and applications
• Intuitionistic fixed point logic
• Power domains and iterated function systems
• Proofs and computations
• Proofs, programs, processes
• Proofs, programs, processes
• Real number computation through Gray code embedding.
• Realisability for induction and coinduction with applications to constructive analysis
• Semantics of a sequential language for exact real-number computation
• Set-valued analysis
• Some recent progress concerning topology of fractals
• Universal coalgebra: A theory of systems

Cited in

(4)

• Computable analysis and notions of continuity in \textsc{Coq}
• Extracting total Amb programs from proofs
• Computing with Continuous Objects: A Uniform Co-inductive Approach
• scientific article; zbMATH DE number 7731929 (Why is no real title available?)

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)