Computability of Continuous Solutions of Higher-Type Equations
暂无分享,去创建一个
[1] Dag Normann,et al. The Continuous Functionals , 1999, Handbook of Computability Theory.
[2] Matthias Schröder,et al. Extended admissibility , 2002, Theor. Comput. Sci..
[3] Dag Normann,et al. Computing with Functionals—Computability Theory or Computer Science? , 2006, Bulletin of Symbolic Logic.
[4] J. Lawson,et al. Comparing Cartesian closed categories of (core) compactly generated spaces , 2004 .
[5] Andrej Bauer,et al. A Relationship between Equilogical Spaces and Type Two Effectivity , 2001, MFPS.
[6] Martín Hötzel Escardó,et al. Exhaustible Sets in Higher-type Computation , 2008, Log. Methods Comput. Sci..
[7] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.
[8] Alex K. Simpson,et al. Lazy Functional Algorithms for Exact Real Functionals , 1998, MFCS.
[9] Matthias Schröder,et al. A Convenient Category of Domains , 2007, Computation, Meaning, and Logic.
[10] Dag Normann. Applications of the Kleene–Kreisel Density Theorem to Theoretical Computer Science , 2008 .
[11] Jozef Gruska,et al. Mathematical Foundations of Computer Science 1998 , 1998, Lecture Notes in Computer Science.
[12] Kenneth W. Regan,et al. Computability , 2022, Algorithms and Theory of Computation Handbook.
[13] D. Normann. Recursion on the countable functionals , 1980 .
[14] M. Beeson. Foundations of Constructive Mathematics , 1985 .