On the public citation graph
A fully abstract translation between a λ-calculus with reference types and Standard ML
0 signed · 30 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1993.1044openalex-snapshot
Full Abstraction in the Lazy Lambda Calculus
inferredcites →https://doi.org/10.1007/3-540-57182-5_8openalex-snapshot
Observable properties of higher order functions that dynamically create local names, or: What's new?
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1016/0304-3975(94)90014-0openalex-snapshot
A co-induction principle for recursively defined domains
inferredcites →https://doi.org/10.1017/s0956796800000125openalex-snapshot
Equivalence in functional languages with effects
inferredcites →https://doi.org/10.1017/s0960129500000293openalex-snapshot
Fully abstract translations between functional languages
inferredcites →https://doi.org/10.1109/lics.1989.39174openalex-snapshot
Equality in lazy computation systems
inferredcites →https://doi.org/10.1109/lics.1992.185532openalex-snapshot
References, local variables and operational reasoning
inferredcites →https://doi.org/10.48456/tr-285openalex-snapshot
Functional programming and input/output
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
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.1996.0008openalex-snapshot
Proving Congruence of Bisimulation in Functional Programming Languages
inferred← citeshttps://doi.org/10.1006/inco.1996.0061openalex-snapshot
From Operational Semantics to Domain Theory
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_35openalex-snapshot
Adequacy of Compositional Translations for Observational Semantics
inferred← citeshttps://doi.org/10.1007/978-1-4471-3573-9_6openalex-snapshot
A Tutorial on Co-induction and Functional Programming
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_7openalex-snapshot
Reasoning About Local Variables with Operationally-Based Logical Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-04164-8_17openalex-snapshot
A Complete, Co-inductive Syntactic Theory of Sequential Control and State
inferred← citeshttps://doi.org/10.1007/bfb0014309openalex-snapshot
Semantic foundations for embedding HOL in Nuprl
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.027openalex-snapshot
Observational program calculi and the correctness of translations
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80013-6openalex-snapshot
Bisimilarity as a Theory of Functional Programming
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80691-7openalex-snapshot
Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report)
inferred← citeshttps://doi.org/10.1017/cbo9780511526619.007openalex-snapshot
Operationally-Based Theories of Program Equivalence
inferred← citeshttps://doi.org/10.1093/jigpal/5.4.589openalex-snapshot
A note on logical relations between semantics and syntax
inferred← citeshttps://doi.org/10.1109/lics.1996.561314openalex-snapshot
Reasoning about local variables with operationally-based logical relations
inferred← citeshttps://doi.org/10.1145/1111037.1111050openalex-snapshot
Small bisimulations for reasoning about higher-order imperative programs
inferred← citeshttps://doi.org/10.1145/1190215.1190244openalex-snapshot
A complete, co-inductive syntactic theory of sequential control and state
inferred← citeshttps://doi.org/10.1145/1596627.1596633openalex-snapshot
Correctly translating concurrency primitives
inferred← citeshttps://doi.org/10.1145/2837614.2837618openalex-snapshot
Fully-abstract compilation by approximate back-translation
inferred← citeshttps://doi.org/10.1145/3280984openalex-snapshot
Formal Approaches to Secure Compilation
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:2)2017openalex-snapshot
Modular, Fully-abstract Compilation by Approximate Back-translation
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.