A stream calculus of bottomed sequences for real number computation

DOI10.1016/j.entcs.2013.09.023zbMath1334.68071OpenAlexW2040883430WikidataQ113317949 ScholiaQ113317949MaRDI QIDQ265834

Kei Terayama, Hideki Tsuiki

Publication date: 12 April 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2013.09.023

zbMATH Keywords

streamPCFadequacybottomdomain modelparallel orreal number computation

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Coinduction for exact real number computation
• LCF considered as a programming language
• PCF extended with real numbers
• Domain representations of topological spaces
• Topological properties of real number representations.
• Real number computation through Gray code embedding.
• An abstract data type for real numbers
• Proofs and Computations
• Domain-Theoretic Foundations of Functional Programming
• A universality theorem for PCF with recursive types, parallel-or and ∃
• On the non-sequential nature of the interval-domain model of real-number computation
• Compact metric spaces as minimal-limit sets in domains of bottomed sequences
• Continuous Lattices and Domains

This page was built for publication: A stream calculus of bottomed sequences for real number computation