PCF extended with real numbers
From MaRDI portal
Recommendations
Cites work
- A fundamental effect in computations on real numbers
- Abstract Interpretation, Logical Relations, and Kan Extensions
- Computability and Noncomputability in Classical Analysis
- Computing with infinite objects
- Criteria of constructibility for real numbers
- Domain theory and integration
- Dynamical systems, measures, and fractals via domain theory
- Effectively given domains
- scientific article; zbMATH DE number 3846844 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 3706504 (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 555217 (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?)
- scientific article; zbMATH DE number 860046 (Why is no real title available?)
- scientific article; zbMATH DE number 3428899 (Why is no real title available?)
- scientific article; zbMATH DE number 3216177 (Why is no real title available?)
- scientific article; zbMATH DE number 3219506 (Why is no real title available?)
- scientific article; zbMATH DE number 3246263 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 958048 (Why is no real title available?)
- Integration in Real PCF
- Interval representations
- LCF considered as a programming language
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the definitions of computable real continuous functions
- Power domains and iterated function systems
- Recursive Real Numbers
- Semi-metrics, closure spaces and digital topology
- The computable multi-functions on multi-represented sets are closed under programming
Cited in
(70)- An extension of the dual complexity space and an application to computer science
- A domain-theoretic approach to computability on the real line
- Induction and recursion on the partial real line with applications to Real PCF
- Quantitative semantics, topology, and possibility measures
- Properly injective spaces and function spaces
- Hierarchies of total functionals over the reals
- Contractivity of linear fractional transformations
- Exact real number computations relative to hereditarily total functionals.
- Coupled coincidence points in partially ordered cone metric spaces with a \(c\)-distance
- Integration in Real PCF
- Fixed point theorems for Ćirić-type strong almost contractions on partial metric spaces
- An abstract data type for real numbers
- Best proximity point theorems for weakly contractive mapping and weakly Kannan mapping in partial metric spaces
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Domain theoretic second-order Euler's method for solving initial value problems
- Intuitionistic fixed point logic
- Fixed-point theorems for multivalued generalized nonlinear contractive maps in partial metric spaces
- Semantics of a sequential language for exact real-number computation
- Common fixed point of mappings satisfying almost generalized \((S,T)\)-contractive condition in partially ordered partial metric spaces
- Common fixed point theorems for weakly isotone increasing mappings in ordered partial metric spaces
- Fixed point theorems for generalized almost contractions in partial metric spaces
- Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point
- Bicompleting weightable quasi-metric spaces and partial metric spaces
- A stream calculus of bottomed sequences for real number computation
- Can partial indexings be totalized?
- Semi-decidability of may, must and probabilistic testing in a higher-type setting
- Coherence spaces and uniform continuity
- Contextual equivalence for probabilistic programs with continuous random variables and scoring
- Iterative approximation of fixed points of Prešić operators on partial metric spaces
- Generalized Geraghty type mappings on partial metric spaces and fixed point results
- A quasi-metric computational model from modular functions on monoids
- Effective λ-models versus recursively enumerable λ-theories
- On cyclic generalized weakly C-contractions on partial metric spaces
- Fixed point theory for cyclic generalized contractions in partial metric spaces
- Coincidence and fixed points for contractions and cyclical contractions in partial metric spaces
- Common fixed points of \(g\)-quasicontractions and related mappings in 0-complete partial metric spaces
- Fixed point results under various contractive conditions in partial metric spaces
- Fixed point theorems under Hardy-Rogers contractive conditions on 0-complete ordered partial metric spaces
- On fixed point theory in partial metric spaces
- Coupled coincidence points of mappings in ordered partial metric spaces
- Fixed point theorems for weak contractions in the sense of Berinde on partial metric spaces
- Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
- scientific article; zbMATH DE number 1531376 (Why is no real title available?)
- An abstract data type for real numbers
- On naturally continuous non-dcpo domains
- Sequential real number computation and recursive relations
- A fixed point theorem for new type contractions on weak partial metric spaces
- Admissibly Represented Spaces and Qcb-Spaces
- Lazy computation with exact real numbers
- Partial correctness for probabilistic demonic programs
- Recursive solution of initial value problems with temporal discretization
- Common coincidence points for Nadler's type hybrid fuzzy contractions
- Extracting total Amb programs from proofs
- Generalized contractions on partial metric spaces
- Fixed point theorems for monotone mappings on partial metric spaces
- Semantics, specification logic, and Hoare logic of exact real computation
- Fixed points of Geraghty-type mappings in various generalized metric spaces
- Continuous domains for function spaces using spectral compactification
- A language for evaluating derivatives of functionals using automatic differentiation
- Continuous R-valuations
- Computable analysis for verified exact real computation
- A Cartesian closed category for random variables
- A careful retrospection of metric spaces and contraction mappings with computer simulation
- The interval domain in homotopy type theory
- A domain-theoretic approach to statistical programming languages
- Quasi-metrics and monotone normality
- The lambda calculus is quantifiable
- Partial metric monoids and semivaluation spaces
- Termination of floating-point computations
- Two Suzuki type fixed point theorems on partial metric spaces
This page was built for publication: PCF extended with real numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349926)
