Comparing functional paradigms for exact real-number computation

DOI10.1007/3-540-45465-9_42MaRDI QIDQ4737182zbMATH OpenFDO

Authors Andrej Bauer, Martín Escardo, Alex Simpson

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800488.htm, https://www.research.ed.ac.uk/en/publications/cb525974-4abe-4f00-9be1-69f294026034

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Continuous lattices and posets, applications (06B35) Functional programming and lambda calculus (68N18)

Recommendations

• Real number computability and domain theory
• Lazy functional algorithms for exact real functionals
• Lazy computation with exact real numbers
• Comparing hierarchies of total functionals
• Hierarchies of total functionals over the reals

Cited in

(3)

• Exact real number computations relative to hereditarily total functionals.
• scientific article; zbMATH DE number 1805762 (Why is no real title available?)
• On representations of irrational numbers and the computational complexity of converting between such representations

This page was built for publication: Comparing functional paradigms for exact real-number computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737182)