Limiting semantics of numerical programs
From MaRDI portal
Publication:1392276
DOI10.1016/S0304-3975(96)00050-3zbMath0903.68118OpenAlexW2091718659MaRDI QIDQ1392276
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00050-3
Related Items (1)
Cites Work
- Domain theory and integration
- \(\mathbb{T}^\omega\) as a universal domain
- Limiting semantics of numerical programs
- Dynamical systems, measures, and fractals via domain theory
- A Simple but Realistic Model of Floating-Point Computation
- Metric spaces, generalized logic, and closed categories
- Completeness of Quasi-Uniform and Syntopological Spaces
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Limiting semantics of numerical programs