Semantics of a sequential language for exact real-number computation
From MaRDI portal
Publication:2373708
DOI10.1016/J.TCS.2007.01.021zbMATH Open1118.68083OpenAlexW2111203331MaRDI QIDQ2373708FDOQ2373708
Authors: J. Raymundo Marcial-Romero, Martín Escardo 
Publication date: 16 July 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.01.021
Recommendations
- A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
- Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
- Lazy computation with exact real numbers
- SHRAD: A language for sequential real number computation
- New Computational Paradigms
Cites Work
- PCF extended with real numbers
- LCF considered as a programming language
- An abstract data type for real numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the non-sequential nature of the interval-domain model of real-number computation
- Continuous Lattices and Domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Powerdomain Construction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Power domain constructions
- Power domains
- A fundamental effect in computations on real numbers
- Title not available (Why is that?)
- A semantics for complex objects and approximate answers
- The mixed powerdomain
- Semantics of a sequential language for exact real-number computation
- Recursive characterization of computable real-valued functions and relations
- Induction and recursion on the partial real line with applications to Real PCF
- Lazy computation with exact real numbers
- Title not available (Why is that?)
- Exact real number computations relative to hereditarily total functionals.
- Sequentiality and piecewise-affinity in segments of Real-PCF
Cited In (18)
- Abstract State Machines with Exact Real Arithmetic
- A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
- Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
- Semantics, specification logic, and Hoare logic of exact real computation
- SHRAD: A language for sequential real number computation
- Proofs, programs, processes
- Constructive domains with classical witnesses
- Semantics of a sequential language for exact real-number computation
- Computing with continuous objects: a uniform co-inductive approach
- Sequential real number computation and recursive relations
- Sequential real number computation and recursive relations
- Computable decision making on the reals and other spaces. Via partiality and nondeterminism
- Lookahead analysis in exact real arithmetic with logical methods
- First-order universality for real programs
- From Coinductive Proofs to Exact Real Arithmetic
- Title not available (Why is that?)
- New Computational Paradigms
- On naturally continuous non-dcpo domains
Uses Software
This page was built for publication: Semantics of a sequential language for exact real-number computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373708)
