A universal characterization of the closed euclidean interval

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 115-125

  Escardó, Martín H ^a   Simpson, Alex K ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; NUMBER THEORY; OBJECT ORIENTED PROGRAMMING; RECURSIVE FUNCTIONS; SET THEORY; THEOREM PROVING;

CLOSED EUCLIDEAN INTERVAL; COMPUTABLE FUNCTIONS; EUCLIDEAN TOPOLOGY;

LOGIC PROGRAMMING;

EID: 0034863996     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2001.932488     Document Type: Article

References (35)

1. Constructive real interpretation of numerical programs
2. Exact real arithmetic: Formulating real numbers as functions
3. Exact real arithmetic: A case study in higher order programming
4. A functional approach to computability on real numbers
5. Coalgebra-to-algebra morphisms
6. PCF extended with real numbers
7. Induction and recursion on the partial real line with applications to real PCF
8. Probabilistic domains
9. A universal characterization of [0, ∞]
10. On a topological topos
11. Cancellative medial means are arithmetic
12. An elementary theory of the category of sets
13. A first introduction to topos theory
14. Wellfounded trees in categories
15. A constructive proof of Tarski's fixed-point theorem for dcpo's
16. On coalgebra of real numbers
17. On computable numbers, with an application to the Entscheindungproblem
18. Exact real computer arithmetic with continued fractions
19. Computing with infinite objects