The sequentially realizable functionals

The sequentially realizable functionals

Cached

Download Links

[www.dcs.ed.ac.uk]

by John Longley

Citations:

36 - 9 self

BibTeX

@MISC{Longley_thesequentially,
    author = {John Longley},
    title = {The sequentially realizable functionals},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

573	The Definition of Standard ML (Revised - Milner, Tofte, et al. - 1997
363	LCF considered as a programming language - Plotkin - 1977
199	Data types as lattices - Scott - 1976
173	Full abstraction for PCF - Abramsky, Jagadeesan, et al. - 2000
105	G.: A fully abstract game semantics for general references - Abramsky, Honda, et al. - 1998
83	Sequential algorithms on concrete data structures - Berry, Curien - 1982
67	A Curry-Howard foundation for functional computation with control - Ong, Stewart - 1992
59	Stable models of typed lambda-calculi - Berry - 1978
58	Full abstraction for functional languages with control - Laird - 1997
56	Hereditarily sequential functionals - Nickau - 1994
55	Hypercoherences: a strongly stable model of linear logic - Ehrhard - 1993
55	Realizability Toposes and Language Semantics - Longley - 1995
52	Full abstraction for sequential languages: The state of the art - Berry, Curien, et al.
52	First steps in synthetic domain theory - Hyland - 1488
51	Recursive functionals and quantifiers of finite types - Kleene - 1959
47	Sequentiality and strong stability - Bucciarelli, Ehrhard - 1991
47	Fully abstract semantics for observably sequential languages - Cartwright, Curien, et al. - 1994
43	A type-theoretical alternative to ISWIM - Scott - 1993
38	Observable sequentiality and full abstraction - Cartwright, Felleisen - 1992
32	The fixed point property in synthetic domain theory - Taylor - 1991
31	A small complete category - Hyland - 1988
31	A semantic analysis of control - Laird - 1998
31	Kripke logical relations and PCF - O’Hearn, Riecke - 1995
26	Pre-logical relations - Honsell, Sannella - 1999
26	Fully abstract models of typed λ-calculi - Milner - 1977
25	Type theory via exact categories - Birkedal, Carboni, et al. - 1998
23	Investigations into intensional type theory - Streicher - 1993
22	Projecting sequential algorithms on strongly stable functions - Ehrhard - 1996
22	Finitary PCF is not decidable - Loader
21	Interpretation of Analysis by means of Functionals of Finite Type - Kreisel - 1959
21	A combinatory algebra for sequential functionals of finite type - Oosten - 1997
19	A uniform approach to domain theory in realizability models - Longley, Simpson - 1997
18	Sequentiality in an extensional framework - Bucciarelli, Ehrhard - 1994
18	Fully abstract translations between functional languages - Riecke - 1991
17	When is a functional program not a functional program - Longley - 1999
15	Program Verification in Synthetic Domain Theory - Reus - 1995
14	Modified realizability toposes and strong normalization proofs - Hyland, Ong - 1993
14	The Revised Report on Scheme: A Dialect of LISP - Steele, man - 1978
13	Logical full abstraction and PCF - Longley, Plotkin - 1998
12	Sequential models of PCF: some contributions to the domain-theoretic approach to full abstraction - Bucciarelli - 1993
11	Concrete domains. Theoretical Computer Science, 121(1& 2):187–277 - Kahn, Plotkin - 1993
10	SPCF: its model, calculus, and computational power - Kanneganti, Cartwright, et al. - 1993
10	The Foundations of Intuitionistic Mathematics - Kleene, Vesley - 1965
9	The Modified Realizability Topos - Oosten - 1996
9	Computational adequacy in an elementary topos - Simpson - 1999
7	Full abstraction, totality and PCF - Plotkin - 1999
7	Naive Synthetic Domain Theory—A Logical Approach - Reus, Streicher - 1994
7	Degrees of parallelism in computations - Sazonov - 1976
6	Domains and Lambda-Calculi. Cambridge tracts in theoretical computer science - Amadio, Curien - 1997
6	A relative PCF-definability result for strongly stable functions and some corollaries - Ehrhard - 1999