First-Order Universality for Real Programs
From MaRDI portal
Publication:3576032
DOI10.1007/978-3-642-03073-4_1zbMath1268.03033MaRDI QIDQ3576032
Publication date: 28 July 2010
Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_1
68N18: Functional programming and lambda calculus
03B70: Logic in computer science
68Q55: Semantics in the theory of computing
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
03D78: Computation over the reals, computable analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LCF considered as a programming language
- Feasible real random access machines
- Recursive characterization of computable real-valued functions and relations
- Semantics of a sequential language for exact real-number computation
- On the definitions of computable real continuous functions
- A Denotational Semantics for Total Correctness of Sequential Exact Real Programs