Comparing cartesian closed categories of (core) compactly generated spaces (2004)

by Martín Escardó , Jimmie Lawson , Alex Simpson
Citations:25 - 11 self

Documents Related by Co-Citation

461 Domain Theory – Samson Abramsky, Achim Jung - 1994
16 A Relationship between Equilogical Spaces and Type Two Effectivity – Andrej Bauer
265 Foundations of Constructive Mathematics – M J Beeson - 1985
232 An Introduction to Computable Analysis – K Weihrauch - 2000
13 Exhaustible sets in higher-type computation – Martín Escardó
13 A Convenient Category of Domains – Ingo Battenfeld, Matthias Schröder, Alex Simpson
23 Recursion on the Countable Functionals – D Normann
59 Continuous Lattices and Domains – G Gierz, K H Hofmann, K Keimel, J D Lawson, M Mislove, D S Scott - 2003
12 Admissible Representations for Continuous Computations – M Schröder - 2002
9 Extended admissibility – M Schröder - 2002
401 Vulnerabilities Analysis – Matt Bishop - 1999
7 Recursion on the countable functionals, volume 811 of Lec. Not – D Normann - 1980
23 Lazy Functional Algorithms for Exact Real Functionals – Alex K. Simpson - 1998
6 Towards a convenient category of topological domains – A Simpson - 2003
4 A Category of Topological Predomains,” Diploma Thesis – I Battenfeld - 2004
5 Computing with functionals—computability theory or computer science – D Normann - 2006
11 Compactly generated domain theory – O Battenbeld, M Schröder, A Simpson
210 Data types as lattices – D SCOTT - 1976
41 Programming in Haskell – G Hutton - 2007