DeepAI AI Chat
Log In Sign Up

Computing with Continuous Objects: A Uniform Co-inductive Approach

by   Dieter Spreen, et al.

A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In 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 a much more comprehensive class of objects occurring in applications. The approach is of the same computational power as Weihrauch's Type-Two Theory of Effectivity.


page 1

page 2

page 3

page 4


The Scott model of PCF in univalent type theory

We develop the Scott model of the programming language PCF in constructi...

On Higher Inductive Types in Cubical Type Theory

Cubical type theory provides a constructive justification to certain asp...

Computing with Infinite Objects: the Gray Code Case

Infinite Gray code has been introduced by Tsuiki <cit.> as a redundancy-...

Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data

Choosing an encoding over binary strings for input/output to/by a Turing...

Formally continuous functions on Baire space

A function from Baire space to the natural numbers is called formally co...

Uniform Envelopes

In the author's PhD thesis (2019) universal envelopes were introduced as...

Patch Locale of a Spectral Locale in Univalent Type Theory

Stone locales together with continuous maps form a coreflective subcateg...