Integration in Real PCF
From MaRDI portal
Publication:1854356
DOI10.1006/inco.1999.2844zbMath1005.03035OpenAlexW2149945624MaRDI QIDQ1854356
Abbas Edalat, Martín Hötzel Escardó
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c12fa278c4407e06082c0865e3bb3aca5b7e23f9
Constructive and recursive analysis (03F60) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Higher-type and set recursion theory (03D65)
Related Items (10)
PCF extended with real numbers ⋮ Recursive solution of initial value problems with temporal discretization ⋮ A domain-theoretic framework for robustness analysis of neural networks ⋮ Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring ⋮ A Functional Algorithm for Exact Real Integration with Invariant Measures ⋮ Algebraic information theory for binary channels ⋮ Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting ⋮ Quantitative semantics, topology, and possibility measures ⋮ The generalized Riemann integral on locally compact spaces ⋮ An abstract data type for real numbers
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domain theory and integration
- A computational model for metric spaces
- The lambda calculus, its syntax and semantics
- Computing with infinite objects
- LCF considered as a programming language
- Induction and recursion on the partial real line with applications to Real PCF
- Properly injective spaces and function spaces
- PCF extended with real numbers
- Dynamical systems, measures, and fractals via domain theory
- Power domains and iterated function systems
- Real number computability and domain theory
- Computability and Noncomputability in Classical Analysis
- When Scott is weak on the top
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Lazy computation with exact real numbers
This page was built for publication: Integration in Real PCF
