Exact real number computations relative to hereditarily total functionals.
From MaRDI portal
Publication:1607298
DOI10.1016/S0304-3975(01)00100-1zbMath1042.68049OpenAlexW2082376293MaRDI QIDQ1607298
Publication date: 31 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00100-1
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Semantics of a sequential language for exact real-number computation ⋮ Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Cites Work
- LCF considered as a programming language
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- PCF extended with real numbers
- The hereditary partial effective functionals and recursion theory in higher types
- Full abstraction, totality and PCF
- Computability over the partial continuous functionals
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Exact real number computations relative to hereditarily total functionals.
