loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
Infinite sets that admit fast exhaustive search
Wroclaw, Poland
July 10-July 14
ISBN: 0-7695-2908-9
ASCII Text
x 
 
Mart?n Escard?, "Infinite sets that admit fast exhaustive search," Logic in Computer Science, Symposium on, pp. 443-452, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2007.25,
author = {Mart?n Escard?},
title = {Infinite sets that admit fast exhaustive search},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2007},
issn = {1043-6871},
pages = {443-452},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2007.25},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Infinite sets that admit fast exhaustive search
SN - 1043-6871
SP443
EP452
A1 - Mart?n Escard?,
PY - 2007
KW - Higher-type computability and complexity
KW - Kleene-Kreisel functionals
KW - PCF
KW - Haskell
KW - topology.
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Mart?n Escard?, University of Birmingham, UK
Perhaps surprisingly, there are infinite sets that admit mechanical exhaustive search in finite time. We investigate three related questions: What kinds of infinite sets admit mechanical exhaustive search in finite time? How do we systematically build such sets? How fast can exhaustive search over infinite sets be performed?
Index Terms:
Higher-type computability and complexity, Kleene-Kreisel functionals, PCF, Haskell, topology.
Citation:
Mart?n Escard?, "Infinite sets that admit fast exhaustive search," lics, pp.443-452, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.