Comparing functional paradigms for exact real-number computation (2002)

by Andrej Bauer , Martín Hötzel Escardó , Alex Simpson
Venue:in Proceedings ICALP 2002, Springer LNCS 2380
Citations:15 - 3 self

Active Bibliography

2 Applications of the Kleene-Kreisel Density Theorem to Theoretical Computer Science – Dag Normann - 2006
4 On the ubiquity of certain total type structures – John Longley - 2007
12 Continuous Functionals of Dependent Types and Equilogical Spaces – Andrej Bauer, Lars Birkedal - 2000
12 Notions of computability at higher types I – John Longley - 2005
6 Admissible Domain Representations of Topological Spaces – Göran Hamrin, Göran Hamrin - 2005
Domain-Theoretic Methods for Program Synthesis – Ulrich Berger
5 Comparing hierarchies of total functionals – Dag Normann - 2005
22 Topological and Limit-space subcategories of Countably-based Equilogical Spaces – Matas Menni, Alex Simpson - 2001
16 A Relationship between Equilogical Spaces and Type Two Effectivity – Andrej Bauer
in a higher-type setting – Martín Escardó
10 A universal characterization of the closed euclidean interval (Extended Abstract) – Martín H. Escardó, Alex K. Simpson - 2001
14 Infinite sets that admit fast exhaustive search – Martín Escardó - 2007
2 Computing with functionals - computability theory or computer science – Dag Normann - 2006
2 Fundamentals of Computing I – Viggo Stoltenberg-hansen, Viggo Stoltenberg-hansen, John V. Tucker, John V. Tucker - 1992
Computability on topological spaces via domain – Viggo Stoltenberg-hansen, John V. Tucker
12345efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES – Viggo Stoltenberg-hansen, John V. Tucker
4 Computability on topological spaces via domain representations – Viggo Stoltenberg-Hansen, John V. Tucker - 2007
1 Sheaf Toposes for Realizability – Steven Awodey, Andrej Bauer - 2001
Recommended Citation – Steve Awodey, Andrej Bauer, Steven Awodey, Andrej Bauer - 2004