Exact Real Number Computations Relative to Hereditary Total Functions (2000)
by
Dag Normann
| Venue: | Theoretical Computer Science |
| Citations: | 4 - 0 self |
BibTeX
@ARTICLE{Normann00exactreal,
author = {Dag Normann},
title = {Exact Real Number Computations Relative to Hereditary Total Functions},
journal = {Theoretical Computer Science},
year = {2000},
volume = {284},
pages = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that the continuous existential quantifier is not definable in Escard6's Real-PCF from all functionals equivalent to a given total one in a uniform way.
Citations
| 363 | LCF considered as a programming language - Plotkin - 1977 |
| 15 | The continuous functionals of finite type over the reals - Normann - 2001 |
| 13 | Computability over the partial continuous functionals - Normann - 1998 |
| 9 | The continuous functionals - Normann - 1999 |
| 7 | Full abstraction, totality and PCF - Plotkin - 1999 |
| 6 | The hereditarily partial effective functionals and recursion theory in higher types - Longo, Moggi - 1984 |
| 2 | A theory of computable functionals of higher type, Unpublished notes - Scott - 1969 |
| 1 | PCF extended with real numbers: a domain-theoretic approach to higher-order exact number computation - Escard6 - 1996 |
| 1 | PCF extended with real numbers - Escard6 - 1996 |
| 1 | Models of polymorphism with totality, Can& Scient - Rummclhoff - 2000 |
