DeepAI AI Chat
Log In Sign Up

Constructive Domains with Classical Witnesses

by   Dirk Pattinson, et al.

We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness assertions classically. Technically, we start from a predomain base and construct a completion. We then investigate continuity with respect to the Scott topology, and present a construction of the function space. We then discuss our main motivating example in detail, and instantiate our theory to real numbers that we conceptualise as the total elements of the completion of the predomain of rational intervals, and prove a representation theorem that precisely delineates the class of representable continuous functions.


page 1

page 2

page 3

page 4


Formally continuous functions on Baire space

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

Extracting efficient exact real number computation from proofs in constructive type theory

Exact real computation is an alternative to floating-point arithmetic wh...

An Analysis of Tennenbaum's Theorem in Constructive Type Theory

Tennenbaum's theorem states that the only countable model of Peano arith...

Continuous and monotone machines

We investigate a variant of the fuel-based approach to modeling divergin...

Ergodic theorems for algorithmically random points

This paper is a survey of applications of the theory of algorithmic rand...

Sharp Elements and Apartness in Domains

Working constructively, we study continuous directed complete posets (dc...

Sharp Elements and the Scott Topology of Continuous Dcpos

Working constructively, we study continuous directed complete posets (dc...