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

11 Notions of computability at higher types I – John Longley - 2005
394 LCF considered as a programming language – G D Plotkin - 1977
8 Relative and Modified Relative Realizability – Lars Birkedal, Jaap Van Oosten - 2001
60 Realizability Toposes and Language Semantics – J Longley - 1994
4 Categorical simulations – J Cockett, P Hofstra
79 The effective topos – M E Hyland - 1982
1 Some reasons for generalizing recursion theory. Logic Colloquium ’69 – G Kreisel - 1971
1 Linear realizability – Naohiko Hoshino - 2007
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
8 Impredicativity entails Untypedness – Peter Lietz, Thomas Streicher - 2000
5 E.Moggi: Constructive Natural Deduction and its "ω-Set" interpretation – G Longo - 1988
9 Process Realizability – Samson Abramsky - 2000
53 First steps in synthetic domain theory – Martin Hyland - 1991
33 The fixed point property in synthetic domain theory – Paul Taylor - 1991
4 Introduction to Turing categories – J. R. B. Cockett, Pieter J. W. Hofstra
17 Matching typed and untyped realizability – J Longley - 1999
238 The Lazy Lambda Calculus – Samson Abramsky - 1990
313 Functions as processes, in – R Milner - 1990