Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-22T05:08:26.288Z Has data issue: false hasContentIssue false
  • English
  • Français

Computing with continuous objects: a uniform co-inductive approach

Published online by Cambridge University Press:  19 August 2021

Dieter Spreen Open the ORCID record for Dieter Spreen [Opens in a new window]
Dieter Spreen*
Affiliation:
Department of Mathematics, University of Siegen, Siegen 57068, Germany Email: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets and uniformly continuous maps is presented. In the work of Berger, it was shown how to extract certified algorithms working with the signed digit representation from constructive proofs. Berger and the present author generalised this approach to complete metric spaces and showed how to deal with compact sets. Here, we unify this work and lay the foundations for doing a similar thing for the much more comprehensive class of compact Hausdorff spaces occurring in applications. The approach is of the same computational power as Weihrauch’s Type-Two Theory of Effectivity.

Keywords

Computingiterative function systemtopologycompact setinductive/co-inductive definitionprogram extraction
Type
Paper
Information
Mathematical Structures in Computer Science , Volume 31 , Issue 2 , February 2021 , pp. 144 - 192
Check for updates
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2021. Published by Cambridge University Press

Footnotes

*

This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 731143.

References

Adámek, J., Milius, S. and Moss, L. (2019). Initial Algebras, Terminal Coalgebras, and the Theory of Fixed Points of Functors, Manuscript.CrossRefGoogle Scholar
Aubin, J.-P. and Cellina, A. (1984). Differential Inclusions, Set-Valued Maps and Viability Theory, Springer, Berlin.CrossRefGoogle Scholar
Aubin, J.-P. and Frankowska, H. (1990). Set-Valued Analysis, Birkhäuser, Basel.Google Scholar
Barnsley, M. F., Wilson, D. C. and Leśnik, K. (2014). Some recent progress concerning topology of fractals. In: Hard, K. P., et al. (eds.), Recent Progress in General Topology III, Atlantis Press. doi: 10.2991/978-94-6239-024-9.CrossRefGoogle Scholar
Berger, U. (2010). Realisability for induction and coinduction with applications to constructive analysis. Journal of Universal Computer Science 16 (18) 2535–2555.Google Scholar
Berger, U. (2011). From coinductive proofs to exact real arithmetic: theory and applications, Logical Methods in Computer Science 7 (1) 1–24. doi: 10.2168/LMCS7(1:8)2011.CrossRefGoogle Scholar
Berger, U. (2017). Unpublished notes.Google Scholar
Berger, U. and Hou, T. (2008). Coinduction for exact real number computation. Theory of Computing Systems 43 394–409. doi: 10.1007.s0022400790176.CrossRefGoogle Scholar
Berger, U. and Seisenberger, M. (2010). Proofs, programs, processes. In: Ferreira, F., Löwe, B., Mayordomo, E. and Gomes, L. M. (eds.), Programs, Proofs, Processes, 6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, Springer-Verlag, Berlin, 39–48.CrossRefGoogle Scholar
Berger, U. and Seisenberger, M. (2012). Proofs, programs, processes. Theory of Computing Systems 51 313–329. doi: 10.1007/s00224-011-9325-8.CrossRefGoogle Scholar
Berger, U. and Spreen, D. (2016) A coinductive approach to computing with compact sets. Journal Logic & Analysis 8 (3) 1–35. doi: 10.4115/jla.2016.8.3.Google Scholar
Berger, U. and Tsuiki, H. (2021) Intuitionistic fixed point logic. Annals Pure Applied Logic 172 (3). doi: 10.1016/j.apal.2020.102903.CrossRefGoogle Scholar
Brattka, V. and Presser, G. (2003). Computability on subsets of metric spaces. Theoretical Computer Science 305 43–76. doi: 10.1016/S0304-3975(02)00693-X.CrossRefGoogle Scholar
Ciaffaglione, A. and Di Gianantonio, P. (2006). A certified, corecursive implementation of exact real numbers. Theoretical Computer Science 351 39–51. doi: 10.1016/j.tcs.2005.09.061.CrossRefGoogle Scholar
Edalat, A. (1996). Power domains and iterated function systems. Information and Computation 124 182–197.CrossRefGoogle Scholar
Edalat, A. and Heckmann, R. (2002). Computing with real numbers: I. The LFT approach to real number computation; II. A domain framework for computational geometry. In: Barthe, G., Dybjer, P., Pinto, L. and Saraiva, J. (eds.), Applied Semantics – Lecture Notes from the International Summer School, Caminha, Portugal, Springer-Verlag, Berlin, 193–267. doi: 10.1007/35404569965.CrossRefGoogle Scholar
Edalat, A. and Sünderhauf, P. (1998). A domain-theoretic approach to real number computation. Theoretical Computer Science 210 73–98. doi: 10.1016/S03043975(98)000978.CrossRefGoogle Scholar
Engelking, R. (1989). General Topology, revised and completed edn., Heldermann Verlag, Berlin.Google Scholar
Hutchinson, J. E. (1981). Fractals and self-similarity. Indiana University Mathematics Journal 30 (5) 713–747.CrossRefGoogle Scholar
Kameyama, A. (2000). Distances on topological self-similar sets and the kneading determinants. Journal of Mathematics of Kyoto University 40 (4) 603–674.Google Scholar
Klein, E. and Thompson, A. C. (1984). Theory of Correspondences: Including Applications to Mathematical Economics, Wiley, New York.Google Scholar
Marcial-Romero, J. R. and Hötzel Escardó, M. (2007). Semantics of a sequential language for exact real number computation. Theoretical Computer Science 379 (12) 120–141. doi: 10.1016/j.tcs.2007.01.021.CrossRefGoogle Scholar
Michael, E. (1951). Topologies on spaces of subsets. Transactions American Mathematical Society 71 152–182.CrossRefGoogle Scholar
Munkres, J. R. (2000). Topology, 2nd edn., Prentice Hall, Upper Saddle River, NJ.Google Scholar
Rutten, J. J. M. M. (2000). Universal coalgebra: a theory of systems. Theoretical Computer Science 249 3–80.CrossRefGoogle Scholar
Schwichtenberg, H. and Wainer, S. S. (2012). Proofs and Computations, Cambridge University Press, Cambridge.Google Scholar
Scriven, A. (2008). A functional algorithm for exact real integration with invariant measures. Electronic Notes in Theoretical Computer Science 218 337–353.CrossRefGoogle Scholar
Tsuiki, H. (2002). Real number computation through Gray code embedding. Theoretical Computer Science 284 (2) 467–485.CrossRefGoogle Scholar
Weihrauch, K. (2000). Computable Analysis, Springer-Verlag, Berlin. doi: 10.1007/9783642569999.CrossRefGoogle Scholar
Willard, S. (1970). General Topology, Addison-Wesley, Reading, MA.Google Scholar