On the public citation graph

Studying the fully abstract model of PCF within its continuous function model

https://doi.org/10.1007/bfb0037109
0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/bfb0037110openalex-snapshot
A new characterization of lambda definability
inferredcites →https://doi.org/10.1007/bfb0040262openalex-snapshot
Equationally fully abstract models of PCF
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1017/cbo9780511525902.015openalex-snapshot
Reasoning about sequential functions via logical relations
inferredcites →https://doi.org/10.2307/2273377openalex-snapshot
Completeness, invariance and λ-definability

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.2000.2917openalex-snapshot
On Full Abstraction for PCF: I, II, and III
inferred← citeshttps://doi.org/10.1006/inco.2000.2930openalex-snapshot
Full Abstraction for PCF
inferred← citeshttps://doi.org/10.1006/inco.2002.2957openalex-snapshot
A Relational Account of Call-by-Value Sequentiality
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_26openalex-snapshot
Finite Models and Full Completeness
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_12openalex-snapshot
Well-Going Programs Can Be Typed
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_6openalex-snapshot
Relative Definability and Models of Unary PCF
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_12openalex-snapshot
Lambda Definability with Sums via Grothendieck Logical Relations
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_87openalex-snapshot
Full Abstraction for PCF (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_18openalex-snapshot
Mechanizing logical relations
inferred← citeshttps://doi.org/10.1007/3-540-61254-8_22openalex-snapshot
The variable containment problem
inferred← citeshttps://doi.org/10.1007/bfb0037110openalex-snapshot
A new characterization of lambda definability
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00194-8openalex-snapshot
Finitary PCF is not decidable
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00024-3openalex-snapshot
Decidability of behavioural equivalence in unary PCF
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00048-6openalex-snapshot
Unary PCF is decidable
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot
Some aspects of categories in computer science
inferred← citeshttps://doi.org/10.1017/9781316755884.004openalex-snapshot
Notions of computability at higher types I
inferred← citeshttps://doi.org/10.1109/lics.1997.614953openalex-snapshot
A relational account of call-by-value sequentiality
inferred← citeshttps://doi.org/10.1109/lics.1999.782612openalex-snapshot
Full abstraction and universality via realisability
inferred← citeshttps://doi.org/10.2168/lmcs-3(3:7)2007openalex-snapshot
Inductive Definition and Domain Theoretic Properties of Fully Abstract
inferred← citeshttps://doi.org/10.26083/tuprints-00000351openalex-snapshot
A Universal Realizability Model for Sequential Functional Computation
inferred← citeshttps://doi.org/10.7146/brics.v4i41.18967openalex-snapshot
A Relational Account of Call-by-Value Sequentiality
inferred← citeshttps://doi.org/10.7146/brics.v6i10.20067openalex-snapshot
A Relational Account of Call-by-Value Sequentiality
inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
inferred← citeshttps://doi.org/10.7551/mitpress/1104.003.0005openalex-snapshot
Effect Types and Region-Based Memory Management
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.