On the public citation graph
Categorical models for local names
0 signed · 92 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.1995.1077openalex-snapshot
A Variable Typed Logic of Effects
inferredcites →https://doi.org/10.1006/inco.1995.1103openalex-snapshot
Kripke Logical Relations and PCF
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.1007/3-540-57880-3_30openalex-snapshot
Fully abstract translations and parametric polymorphism
inferredcites →https://doi.org/10.1007/3-540-58338-6_107openalex-snapshot
Full abstraction for the second order subset of an ALGOL-like language
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_8openalex-snapshot
Towards Fully Abstract Semantics for Local Variables: Preliminary Report
inferredcites →https://doi.org/10.1007/bf01220868openalex-snapshot
Monads on symmetric monoidal closed categories
inferredcites →https://doi.org/10.1007/bfb0037118openalex-snapshot
A logic for parametric polymorphism
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
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(89)90069-8openalex-snapshot
A syntactic theory of sequential state
inferredcites →https://doi.org/10.1016/0304-3975(92)90014-7openalex-snapshot
The revised report on the syntactic theories of sequential control and state
inferredcites →https://doi.org/10.1016/0304-3975(92)90301-uopenalex-snapshot
Inferring the equivalence of functional programs that mutate data
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1017/cbo9780511525902.013openalex-snapshot
Semantics of local variables
inferredcites →https://doi.org/10.1017/s0956796800000125openalex-snapshot
Equivalence in functional languages with effects
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferredcites →https://doi.org/10.1112/blms/19.2.190openalex-snapshot
INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7)
inferredcites →https://doi.org/10.1145/158511.158624openalex-snapshot
Relational parametricity and local variables
inferredcites →https://doi.org/10.22028/d291-25818openalex-snapshot
Full abstraction for the second order subset of an ALGOL-like language (preliminary report)
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.
inferredcites →https://doi.org/10.48456/tr-285openalex-snapshot
Functional programming and input/output
inferredcites →https://doi.org/10.7146/math.scand.a-11042openalex-snapshot
Bilinearity and Cartesian Closed Monads.
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.2001.2927openalex-snapshot
Objects and Classes in Algol-Like Languages
inferred← citeshttps://doi.org/10.1007/11575467_3openalex-snapshot
Data Refinement with Low-Level Pointer Operations
inferred← citeshttps://doi.org/10.1007/11783596_5openalex-snapshot
Relational Semantics for Higher-Order Programs
inferred← citeshttps://doi.org/10.1007/11828563_5openalex-snapshot
Local Variable Scoping and Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1007/3-540-36575-3_16openalex-snapshot
Correctness of Data Representations Involving Heap Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_24openalex-snapshot
Notions of Computation Determine Monads
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_45openalex-snapshot
Names, equations, relations: Practical ways to reason about new
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_2openalex-snapshot
Deciding contextual equivalence of ν-calculus with effectful contexts (full version)
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_21openalex-snapshot
A Game Semantics of Local Names and Good Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_31openalex-snapshot
Complete Lax Logical Relations for Cryptographic Lambda-Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_10openalex-snapshot
Free-Algebra Models for the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_48openalex-snapshot
Logical Relations for Dynamic Name Creation
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_17openalex-snapshot
On Completeness of Logical Relations for Monadic Types
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_5openalex-snapshot
Completeness for Algebraic Theories of Local State
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_13openalex-snapshot
Relating Computational Effects by ⊤ ⊤-Lifting
inferred← citeshttps://doi.org/10.1007/978-3-642-40206-7_1openalex-snapshot
An Effect System for Algebraic Effects and Handlers
inferred← citeshttps://doi.org/10.1007/s001650200016openalex-snapshot
A New Approach to Abstract Syntax with Variable Binding
inferred← citeshttps://doi.org/10.1007/s10990-006-8747-5openalex-snapshot
An initial algebra approach to term rewriting systems with variable binders
inferred← citeshttps://doi.org/10.1016/0304-3975(96)80139-3openalex-snapshot
Objects, interference and the Yoneda embedding
inferred← citeshttps://doi.org/10.1016/j.apal.2003.12.006openalex-snapshot
An approach to deciding the observational equivalence of Algol-like languages
inferred← citeshttps://doi.org/10.1016/j.apal.2007.10.006openalex-snapshot
A game semantics of names and pointers
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.018openalex-snapshot
Semantics for Local Computational Effects
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.083openalex-snapshot
Monoidal Indeterminates and Categories of Possible Worlds
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.020openalex-snapshot
Automata-Theoretic Semantics of Idealized Algol with Passive Expressions
inferred← citeshttps://doi.org/10.1016/j.ic.2012.10.014openalex-snapshot
Relating computational effects by ⊤⊤-lifting
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.10.007openalex-snapshot
Local variable scoping and Kleene algebra with tests
inferred← citeshttps://doi.org/10.1016/j.scico.2004.01.007openalex-snapshot
Correctness of data representations involving heap data structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.003openalex-snapshot
On a monadic semantics for freshness
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.024openalex-snapshot
Free-algebra models for the π -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.033openalex-snapshot
Cryptographic logical relations
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.001openalex-snapshot
Monoidal indeterminates and categories of possible worlds
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00281-4openalex-snapshot
A fully abstract denotational semantics for the calculus of higher-order communicating systems
inferred← citeshttps://doi.org/10.1017/s0960129508007172openalex-snapshot
Logical relations for monadic types
inferred← citeshttps://doi.org/10.1017/s0960129523000324openalex-snapshot
Dilations and information flow axioms in categorical probability
inferred← citeshttps://doi.org/10.1090/crmp/053/11openalex-snapshot
Indexed Lawvere theories for local state
inferred← citeshttps://doi.org/10.1109/lics.1996.561301openalex-snapshot
A fully abstract domain model for the π-calculus
inferred← citeshttps://doi.org/10.1109/lics.1999.782617openalex-snapshot
A new approach to abstract syntax involving binders
inferred← citeshttps://doi.org/10.1109/lics.2004.1319609openalex-snapshot
Nominal games and full abstraction for the nu-calculus
inferred← citeshttps://doi.org/10.1109/lics.2004.27openalex-snapshot
Nominal games and full abstraction for the nu-calculus
inferred← citeshttps://doi.org/10.1109/lics.2007.21openalex-snapshot
Full abstraction for nominal general references
inferred← citeshttps://doi.org/10.1109/lics.2013.58openalex-snapshot
Instances of Computational Effects: An Algebraic Perspective
inferred← citeshttps://doi.org/10.1145/1925844.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferred← citeshttps://doi.org/10.1145/1926385.1926401openalex-snapshot
Step-indexed kripke models over recursive worlds
inferred← citeshttps://doi.org/10.1145/234528.234739openalex-snapshot
On the relationship between formal semantics and static analysis
inferred← citeshttps://doi.org/10.1145/2676726.2676999openalex-snapshot
Algebraic Effects, Linearity, and Quantum Programming Languages
inferred← citeshttps://doi.org/10.1145/2775051.2676999openalex-snapshot
Algebraic Effects, Linearity, and Quantum Programming Languages
inferred← citeshttps://doi.org/10.1145/3408993openalex-snapshot
Recovering purity with comonads and capabilities
inferred← citeshttps://doi.org/10.1145/3434292openalex-snapshot
Probabilistic programming semantics for name generation
inferred← citeshttps://doi.org/10.1145/3531130.3533355openalex-snapshot
Probability monads with submonads of deterministic states
inferred← citeshttps://doi.org/10.1145/3808343openalex-snapshot
Categorical Semantics of Probabilistic Symbolic Execution
inferred← citeshttps://doi.org/10.1145/888251.888266openalex-snapshot
Term rewriting with variable binding
inferred← citeshttps://doi.org/10.20948/abrau-2021-1-ceuropenalex-snapshot
On Theory of Names to be Used in Semantics of References in Functional and Object-Oriented Languages
inferred← citeshttps://doi.org/10.20948/abrau-2021-30openalex-snapshot
On theories of names and references in formal languages and implications for functional and object-oriented programming
inferred← citeshttps://doi.org/10.2168/lmcs-10(4:9)2014openalex-snapshot
An Effect System for Algebraic Effects and Handlers
inferred← citeshttps://doi.org/10.2168/lmcs-5(3:8)2009openalex-snapshot
Full abstraction for nominal general references
inferred← citeshttps://doi.org/10.3233/fi-1998-33403openalex-snapshot
Names, Equations, Relations: Practical Ways to Reason about new
inferred← citeshttps://doi.org/10.48456/tr-618openalex-snapshot
The Fresh Approach: functional programming with names and binders
inferred← citeshttps://doi.org/10.5555/2591370.2591394openalex-snapshot
Instances of Computational Effects: An Algebraic Perspective
inferred← citeshttps://doi.org/10.7146/brics.v4i39.18965openalex-snapshot
Names, Equations, Relations: Practical Ways to Reason about new
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.