Notions of computability at higher types I (2005)

Cached

Download Links

by John Longley
Venue:In Logic Colloquium 2000
Citations:12 - 5 self

Documents Related by Co-Citation

461 Domain Theory – Samson Abramsky, Achim Jung - 1994
15 Comparing functional paradigms for exact real-number computation – Andrej Bauer, Martín Hötzel Escardó, Alex Simpson - 2002
15 Computable and recursively countable functions of higher type – R O Gandy, J M E Hyland - 1976
25 Comparing cartesian closed categories of (core) compactly generated spaces – Martín Escardó, Jimmie Lawson, Alex Simpson - 2004
1312 Monads for functional programming – Philip Wadler - 1995
83 The effective topos – M E Hyland - 1982
124 1973] Metamathematical Investigation of Intuitionistic Arithmetic and Analysis – A S Troelstra
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
11 Operational domain theory and topology of a sequential language – Martín Escardó, Weng Kin Ho - 2005
23 Totale Objekte und Mengen in der Bereichstheorie. Doctoral Dissertation – U Berger - 1990
4 Compact sets of functions and function rings[J – D Gale
37 Total sets and objects in domain theory – U Berger - 1993
26 Synthetic topology of data types and classical spaces – Martín Escardó - 2004
13 A Convenient Category of Domains – Ingo Battenfeld, Matthias Schröder, Alex Simpson
41 Programming in Haskell – G Hutton - 2007
265 Foundations of Constructive Mathematics – M J Beeson - 1985
59 Continuous Lattices and Domains – G Gierz, K H Hofmann, K Keimel, J D Lawson, M Mislove, D S Scott - 2003
86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
16 A Relationship between Equilogical Spaces and Type Two Effectivity – Andrej Bauer