Semantics of a sequential language for exact real-number computation
From MaRDI portal
Publication:2373708
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
- A fundamental effect in computations on real numbers
- A Powerdomain Construction
- A semantics for complex objects and approximate answers
- An abstract data type for real numbers
- Continuous Lattices and Domains
- Exact real number computations relative to hereditarily total functionals.
- scientific article; zbMATH DE number 3846844 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 41225 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 1333613 (Why is no real title available?)
- scientific article; zbMATH DE number 1142322 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 2156365 (Why is no real title available?)
- scientific article; zbMATH DE number 3440003 (Why is no real title available?)
- scientific article; zbMATH DE number 783754 (Why is no real title available?)
- Induction and recursion on the partial real line with applications to Real PCF
- Lazy computation with exact real numbers
- LCF considered as a programming language
- On the non-sequential nature of the interval-domain model of real-number computation
- PCF extended with real numbers
- Power domain constructions
- Power domains
- Recursive characterization of computable real-valued functions and relations
- Semantics of a sequential language for exact real-number computation
- Sequentiality and piecewise-affinity in segments of Real-PCF
- The mixed powerdomain
Cited in
(20)- Limiting semantics of numerical programs
- Semantics of a sequential language for exact real-number computation
- SHRAD: A language for sequential real number computation
- Lookahead analysis in exact real arithmetic with logical methods
- Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
- A Denotational Semantics for Total Correctness of Sequential Exact Real Programs
- Sequential real number computation and recursive relations
- First-order universality for real programs
- From Coinductive Proofs to Exact Real Arithmetic
- On naturally continuous non-dcpo domains
- Sequential real number computation and recursive relations
- Computable decision making on the reals and other spaces. Via partiality and nondeterminism
- Computing with continuous objects: a uniform co-inductive approach
- New Computational Paradigms
- Constructive domains with classical witnesses
- Abstract State Machines with Exact Real Arithmetic
- scientific article; zbMATH DE number 7731929 (Why is no real title available?)
- Semantics, specification logic, and Hoare logic of exact real computation
- Proofs, programs, processes
- A domain-theoretic approach to statistical programming languages
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)
