On the ubiquity of certain total type structures (2007)

by John Longley
Venue:UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
Citations:4 - 2 self

Documents Related by Co-Citation

10 Notions of computability at higher types I – John Longley - 2005
363 LCF considered as a programming language – G D Plotkin - 1977
2 Categorical simulations – J R B Cockett, Pieter J W Hofstra
55 Realizability Toposes and Language Semantics – J Longley - 1995
7 Relative and Modified Relative Realizability – Lars Birkedal, Jaap Van Oosten - 2001
77 The Effective Topos – J Hyland - 1982
17 Matching typed and untyped realizability – J R Longley - 1999
4 Constructive natural deduction and its ‘ω-set’ interpretation – G Longo, E Moggi - 1991
32 The fixed point property in synthetic domain theory – P Taylor - 1991
1 Linear realizability – Naohiko Hoshino - 2007
8 Process Realizability – Samson Abramsky - 2000
8 Impredicativity entails Untypedness – Peter Lietz, Thomas Streicher - 2000
1 Introduction to Turing categories – J. R. B. Cockett, Pieter J. W. Hofstra
6 Oosten Realizability. An Introduction to its Categorical Side – J van
1 Some reasons for generalizing recursion theory. Logic Colloquium ’69 – G Kreisel - 1971
1 Unifying typed and untyped realizability. Unpublished electronic note, available from the author’s web – J R Longley - 1999
1 Oosten, Extensional realizability – J van - 1997
65 Über die bausteine der mathematischen logik – M Schönfinkel - 1924
52 First steps in synthetic domain theory – J M E Hyland - 1488