PCF extended with real numbers
- 1 August 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 162 (1) , 79-115
- https://doi.org/10.1016/0304-3975(95)00250-2
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Semi-metrics, closure spaces and digital topologyTheoretical Computer Science, 1995
- Domain theory and integrationTheoretical Computer Science, 1995
- Abstract Interpretation, Logical Relations, and Kan ExtensionsJournal of Logic and Computation, 1990
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Computability and noncomputability in classical analysisTransactions of the American Mathematical Society, 1983
- Computing with infinite objectsTheoretical Computer Science, 1980
- Effectively given domainsTheoretical Computer Science, 1977
- A fundamental effect in computations on real numbersTheoretical Computer Science, 1977
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Criteria of constructibility for real numbersThe Journal of Symbolic Logic, 1953