Infinite sets that admit fast exhaustive search

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 443-452

  Escardó, Martín ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Haskell; Higher type computability and complexity; Kleene Kreisel functionals; PCF; Topology

Indexed keywords

EXHAUSTIVE SEARCH; FINITE TIME; FUNCTIONALS; HASKELL; HIGHER-TYPE COMPUTABILITY AND COMPLEXITY; PCF;

TOPOLOGY;

COMPUTATION THEORY;

EID: 70350496340     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.25     Document Type: Conference Paper

References (25)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3 of Oxford science publications, pages 1-168. 1994.
2. A. Bauer, M.H. Escardó, and A.K. Simpson. Comparing functional paradigms for exact real-number computation. volume 2380 of Lect. Not. Comp. Sci., pages 488-500, 2002.
3. M.J. Beeson. Foundations of Constructive Mathematics. Springer, 1985.
4. U. Berger. Totale Objekte und Mengen in der Bereichstheorie. PhD thesis, Mathematisches Institut der Universität München, 1990.
5. U. Berger. Total sets and objects in domain theory. Ann. Pure Appl. Logic, 60(2):91-117, 1993.
6. M.H. Escardó. Synthetic topology of data types and classical spaces. Electron. Notes Theor. Comput. Sci., 87:21-156, 2004.
7. M.H. Escardó. Haskell program for exhaustive search over infinite sets. http://www.cs.bham.ac.uk/~mhe/papers/exhaustive.hs, School of Computer Science, University of Birmingham, Summer 2006.
8. M.H. Escardó and W.K. Ho. Operational domain theory and topology of a sequential programming language. In Proceedings of the 20th Annual IEEE Symposium on Logic In Computer Science, pages 427-436, 2005.
9. M.H. Escardó, J. Lawson, and A. Simpson. Comparing Cartesian closed categories of (core) compactly generated spaces. Topology Appl., 143(1-3):105-145, 2004. (Pubitemid 39109174)
10. G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, and D.S. Scott. Continuous Lattices and Domains. CUP, 2003.
11. G. Hutton. Programming in Haskell. CUP, 2007.
12. J.R. Longley. On the ubiquity of certain type structures. Mathematical Structures in Computer Science. To appear.
13. J.R. Longley. Notions of computability at higher types. I. In Logic Colloquium 2000, volume 19 of Lect. Notes Log., pages 32-142. Assoc. Symbol. Logic, Urbana, IL, 2005.
14. S. Mac Lane. Categories for the Working Mathematician. Springer, 1971.
15. D. Normann. Recursion on the countable functionals, volume 811 of Lec. Not. Math. Springer, 1980.
16. D. Normann. Computability over the partial continuous functionals. J. Symbolic Logic, 65(3):1133-1142, 2000.
17. D. Normann. Comparing hierarchies of total functionals. Logical Methods in Computer Science, 1(2):1-28, 2005.
18. D. Normann. Computing with functionals-computability theory or computer science? Bull. Symbolic Logic, 12(1):43-59, 2006. (Pubitemid 43481056)
19. G.D. Plotkin. LCF considered as a programming language. Theoret. Comput. Sci., 5(1):223-255, 1977.
20. ω as a universal domain. J. Comput. System Sci., 17:209-236, 1978.
21. G.D. Plotkin. Full abstraction, totality and PCF. Math. Structures Comput. Sci., 9(1):1-20, 1999.
22. D.S. Scott. Data types as lattices. SIAM J. Comput., 5:522-587, 1976.
23. D.S. Scott. A type-theoretical alternative to CUCH, ISWIM and OWHY. Theoret. Comput. Sci., 121:411-440, 1993. Reprint of a 1969 manuscript.
24. A. Simpson. Lazy functional algorithms for exact real functionals. Lec. Not. Comput. Sci., 1450:323-342, 1998.
25. M.B. Smyth. Topology. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 1 of Oxford science publications, pages 641-761. 1992.