A Combinatory Algebra for Sequential Functionals of Finite Type (1997)

by Jaap Van Oosten
Venue:University of Utrecht
Citations:21 - 2 self

Documents Related by Co-Citation

36 The sequentially realizable functionals – John Longley
60 Realizability Toposes and Language Semantics – J Longley - 1994
395 LCF considered as a programming language – G Plotkin - 1977
52 Sequentiality and Strong Stability – A Bucciarelli, T Ehrhard - 1991
86 Sequential algorithms on concrete data structures – G Berry, P-L Curien - 1982
22 Projecting Sequential Algorithms on Strongly Stable Functions – Thomas Ehrhard - 1993
59 Hypercoherences: A Strongly Stable Model of Linear Logic – Thomas Ehrhard - 1993
192 Full Abstraction for PCF – Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria - 1996
59 Hereditarily Sequential Functionals – Hanno Nickau - 1994
19 A Uniform Approach to Domain Theory in Realizability Models – John R. Longley, Alex K. Simpson - 1996
49 Fully abstract semantics for observably sequential languages – Robert Cartwright, Robert Cartwright, Pierre-louis Curien, Pierre-louis Curien, Matthias Felleisen, Matthias Felleisen - 1994
12 A relative definability result for strongly stable functions and some corollaries – T Ehrhard - 1997
34 On the symmetry of sequentiality – P-L Curien - 1993
48 A type-theoretical alternative to ISWIM – D S Scott - 1993
83 The effective topos – M E Hyland - 1982
15 Program Verification in Synthetic Domain Theory – B Reus - 1995
9 The Modified Realizability Topos – Jaap Van Oosten, Jaap Van Oosten - 1996
200 On full abstraction for PCF – J M E Hyland, C H L Ong
22 Interpretation of analysis by means of functionals of finite type – G Kreisel - 1959