Notions of computability at higher types I

Notions of computability at higher types I (2005)

by John Longley

Venue:	In Logic Colloquium 2000
Citations:	10 - 5 self

77	The Effective Topos – J Hyland - 1982
402	Domain Theory – Samson Abramsky, Achim Jung - 1994
115	Metamathematical Investigation of Intuitionistic Analysis and Arithmetic – A S Troelstra - 1973
9	Comparing functional paradigms for exact real-number computation – Andrej Bauer, Martín Hötzel Escardó, Alex Simpson - 2002
83	Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
51	Recursive functionals and quantifiers of finite types – S C Kleene - 1959
4	On the ubiquity of certain total type structures – John Longley - 2007
17	Cartesian closed categories of algebraic CPO’s – A Jung - 1990
15	is not always sober – Scott - 1981
4	Stone duality for stable functions – T Ehrhard, P Malacaria - 1991
6	A syntactic approach to Diers’ localizable categories – P T Johnstone - 1979
12	Categories of embeddings – T Coquand - 1989
6	Completion of a construction of Johnstone – J Isbell - 1982
6	Disjunctive Systems and L-Domains – Guo-qiang Zhang - 1992
2	Stable Neighbourhoods – Guo Qiang Zhang - 1992
2	duality and representation of stable domains – Stone - 1997
2	Localisation dans les cat'egories de mod`eles – M Coste - 1977
9	DI-domains as prime information systems – G-Q Zhang - 1992
20	Domains and Lambda-Calculi, volume 46 of Cambridge Tracts – R M Amadio, P-L Curien - 1998