Density and Choice for Total Continuous Functionals (1996)

by Helmut Schwichtenberg
Venue:About and Around Georg Kreisel
Citations:8 - 3 self

Documents Related by Co-Citation

260 Domains for denotational semantics – D S SCOTT - 1982
76 Interpretation of analysis by means of constructive functionals of finite types – G Kreisel - 1959
53 Using Information Systems to Solve Recursive Domain Equations – K G Larsen, G Winskel - 1991
395 LCF considered as a programming language – G Plotkin - 1977
42 Countable functionals – S C Kleene - 1959
124 1973] Metamathematical Investigation of Intuitionistic Arithmetic and Analysis – A S Troelstra
29 Mathematical Theory of Domains,'' Cambridge Tracts – V Stoltenberg-Hansen, I Lindstrom, E R Griffor - 1994
50 T ω as a universal domain – G Plotkin
342 Intuitionistic Type Theory – Per Martin-Löf - 1984
3 The domain interpretation of type theory. Talk at the workshop on semantics of programming languages – P Martin-Löf - 1983
15 Normal form theorem for bar recursive functions of finite type – W W Tait - 1971
191 Outline of a mathematical theory of computation – D S Scott - 1970
27 Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) – Stephen A. Cook, Bruce M. Kapron - 1990
14 On characterizations of the basic feasible functional – R Irwin, B Kapron, J Royer
36 A New Characterization Of Type 2 Feasibility – Kapron Cook, S. A. Cook - 1996
88 Functional interpretations of feasibly constructive arithmetic – Stephen Cook, Alasdair Urquhart - 1993
6 Characterising polytime through higher type recursion – S Bellantoni, K-H Niggl, H Schwichtenberg - 2000
145 Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes – Kurt Gödel - 1958
77 Basic Simple Type Theory – J R Hindley - 1997