On the public citation graph

Global state considered unnecessary: An introduction to object-based semantics

https://doi.org/10.1007/bf01806032
0 signed · 106 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.1006/inco.1993.1060openalex-snapshot
Semantical Analysis of Specification Logic, 2
inferredcites →https://doi.org/10.1006/inco.1994.1047openalex-snapshot
Fully Abstract Semantics for Observably Sequential Languages
inferredcites →https://doi.org/10.1006/inco.1994.1052openalex-snapshot
A Fully Abstract Denotational Model for Higher-Order Processes
inferredcites →https://doi.org/10.1007/3-540-08860-1_7openalex-snapshot
Stable models of typed λ-calculi
inferredcites →https://doi.org/10.1007/3-540-15670-4_9openalex-snapshot
The pomset model of parallel processes: Unifying the temporal and the spatial
inferredcites →https://doi.org/10.1007/3-540-54415-1_44openalex-snapshot
Full abstraction and the Context Lemma (preliminary report)
inferredcites →https://doi.org/10.1007/3-540-57887-0_87openalex-snapshot
Full Abstraction for PCF (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-58201-0_81openalex-snapshot
Bistructures, bidomains and linear logic
inferredcites →https://doi.org/10.1007/3-540-58338-6_66openalex-snapshot
Stable bistructure models of PCF
inferredcites →https://doi.org/10.1007/3540543961_10openalex-snapshot
Assignments for applicative languages
inferredcites →https://doi.org/10.1007/978-1-4612-0445-9openalex-snapshot
Logic of Domains
inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_7openalex-snapshot
Idealized Algol and its Specification Logic
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bf00289507openalex-snapshot
Proof of correctness of data representations
inferredcites →https://doi.org/10.1007/bfb0013019openalex-snapshot
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
inferredcites →https://doi.org/10.1007/bfb0013025openalex-snapshot
Basic notions of trace theory
inferredcites →https://doi.org/10.1007/bfb0013026openalex-snapshot
An introduction to event structures
inferredcites →https://doi.org/10.1007/bfb0013458openalex-snapshot
Linear logic and interference control
inferredcites →https://doi.org/10.1007/bfb0022471openalex-snapshot
An approach to fair applicative multiprogramming
inferredcites →https://doi.org/10.1007/bfb0035793openalex-snapshot
Syntactic control of interference Part 2
inferredcites →https://doi.org/10.1007/bfb0037099openalex-snapshot
A term calculus for Intuitionistic Linear Logic
inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot
Procedures and parameters: An axiomatic approach
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
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(82)90123-2openalex-snapshot
Semantics of interference control
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90051-5openalex-snapshot
Theory of traces
inferredcites →https://doi.org/10.1016/0890-5401(90)90045-jopenalex-snapshot
Semantical analysis of specification logic
inferredcites →https://doi.org/10.1016/s1571-0661(04)00026-xopenalex-snapshot
Syntactic Control of Interference Revisited
inferredcites →https://doi.org/10.1016/s1571-0661(04)00027-1openalex-snapshot
Objects, Interference, and the Yoneda Embedding
inferredcites →https://doi.org/10.1017/cbo9780511525902.013openalex-snapshot
Semantics of local variables
inferredcites →https://doi.org/10.1017/s0960129500000207openalex-snapshot
Some monoidal closed categories of stable domains and event structures
inferredcites →https://doi.org/10.1017/s0960129500000311openalex-snapshot
A model for syntactic control of interference
inferredcites →https://doi.org/10.1090/conm/092openalex-snapshot
Categories in Computer Science and Logic
inferredcites →https://doi.org/10.1090/conm/092/1003197openalex-snapshot
Towards a geometry of interaction
inferredcites →https://doi.org/10.1090/conm/092/1003201openalex-snapshot
Multicategories revisited
inferredcites →https://doi.org/10.1109/lics.1990.113747openalex-snapshot
A categorical linear framework for Petri nets
inferredcites →https://doi.org/10.1109/lics.1992.185534openalex-snapshot
New foundations for the geometry of interaction
inferredcites →https://doi.org/10.1109/lics.1994.316055openalex-snapshot
Passivity and independence
inferredcites →https://doi.org/10.1145/115866.115894openalex-snapshot
Is there a use for linear logic?
inferredcites →https://doi.org/10.1145/158511.158521openalex-snapshot
Call by name, assignment, and the lambda calculus
inferredcites →https://doi.org/10.1145/158511.158523openalex-snapshot
On the orthogonality of assignments and procedures in Algol
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/158511.158624openalex-snapshot
Relational parametricity and local variables
inferredcites →https://doi.org/10.1145/158511.158653openalex-snapshot
Object-oriented programming without recursive types
inferredcites →https://doi.org/10.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/367236.367262openalex-snapshot
Report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1145/38765.38823openalex-snapshot
Dimensions of object-based language design
inferredcites →https://doi.org/10.1145/512760.512766openalex-snapshot
Syntactic control of interference
inferredcites →https://doi.org/10.1145/73560.73577openalex-snapshot
Towards fully abstract semantics for local variables
inferredcites →https://doi.org/10.1145/800017.800536openalex-snapshot
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
inferredcites →https://doi.org/10.1184/r1/6608582openalex-snapshot
Preliminary design of the programming language Forsythe
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/2275407openalex-snapshot
Games and full completeness for multiplicative linear logic
inferredcites →https://doi.org/10.5860/choice.30-5049openalex-snapshot
Semantics of programming languages: structures and techniques
inferredcites →https://doi.org/10.7146/dpb.v12i156.7430openalex-snapshot
Type Algebras, Functor Categories, and Block Structure
inferredcites →https://doi.org/10.7146/dpb.v6i78.7691openalex-snapshot
Concurrent Program Schemes and their Interpretations
inferredcites →https://doi.org/10.7551/mitpress/1086.001.0001openalex-snapshot
Actors

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.1006/inco.2002.2995openalex-snapshot
The Essence of Parallel Algol
inferred← citeshttps://doi.org/10.1007/11523468_73openalex-snapshot
Decidability in Syntactic Control of Interference
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_10openalex-snapshot
Reasoning about Idealized ALGOL Using Regular Languages
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_17openalex-snapshot
A Fully Abstract Relational Model of Syntactic Control of Interference
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_43openalex-snapshot
Pomset logic: A non-commutative extension of classical linear logic
inferred← citeshttps://doi.org/10.1007/978-1-4612-4118-8_10openalex-snapshot
Assignments for Applicative Languages
inferred← citeshttps://doi.org/10.1007/978-1-4612-4118-8_5openalex-snapshot
Algol and Functional Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-66545-6_9openalex-snapshot
Pomset Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_6openalex-snapshot
The Far Side of the Cube
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_15openalex-snapshot
Weakly Distributive Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_41openalex-snapshot
Bad Variables Under Control
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_24openalex-snapshot
Synchronous Game Semantics via Round Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_32openalex-snapshot
An Automata-Theoretic Model of Idealized Algol
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.015openalex-snapshot
Global State Considered Helpful
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.099openalex-snapshot
An Algebraic Account of References in Game Semantics
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.014openalex-snapshot
Understanding Game Semantics Through Coherence Spaces
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.023openalex-snapshot
Modelling Local Variables: Possible Worlds and Object Spaces
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.2005.06.001openalex-snapshot
On an open problem of Amadio and Curien: The finite antichain condition
inferred← citeshttps://doi.org/10.1016/j.ic.2018.04.003openalex-snapshot
A partial solution to an open problem of Amadio and Curien
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.023openalex-snapshot
An arithmetic for non-size-increasing polynomial-time computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.10.045openalex-snapshot
Decidability and syntactic control of interference
inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00022-7openalex-snapshot
Stores as homomorphisms and their transformations: A uniform approach to structured types in imperative languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00315-3openalex-snapshot
The regular-language semantics of second-order idealized ALGOL
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00026-xopenalex-snapshot
Syntactic Control of Interference Revisited
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00027-1openalex-snapshot
Objects, Interference, and the Yoneda Embedding
inferred← citeshttps://doi.org/10.1017/s0956796800001611openalex-snapshot
Note on Algol and conservatively extending functional programming
inferred← citeshttps://doi.org/10.1023/a:1010022312623openalex-snapshot
Abstract Models of Storage
inferred← citeshttps://doi.org/10.1109/iccl.1998.674167openalex-snapshot
Type reconstruction for syntactic control of interference. 2
inferred← citeshttps://doi.org/10.1109/lics.1996.561314openalex-snapshot
Reasoning about local variables with operationally-based logical relations
inferred← citeshttps://doi.org/10.1109/lics.1996.561315openalex-snapshot
The essence of parallel Algol
inferred← citeshttps://doi.org/10.1112/s1461157000001364openalex-snapshot
Categorical Models of Syntactic Control of Intereference Revisited, Revisited
inferred← citeshttps://doi.org/10.1145/1925844.1926425openalex-snapshot
Geometry of synthesis III
inferred← citeshttps://doi.org/10.1145/1926385.1926425openalex-snapshot
Geometry of synthesis III
inferred← citeshttps://doi.org/10.1145/2034574.2034805openalex-snapshot
Geometry of synthesis iv
inferred← citeshttps://doi.org/10.1145/2034773.2034805openalex-snapshot
Geometry of synthesis iv
inferred← citeshttps://doi.org/10.1145/210346.210425openalex-snapshot
Parametricity and local variables
inferred← citeshttps://doi.org/10.1145/2103621.2103695openalex-snapshot
Syntactic control of interference for separation logic
inferred← citeshttps://doi.org/10.1145/2103656.2103695openalex-snapshot
Syntactic control of interference for separation logic
inferred← citeshttps://doi.org/10.1145/234528.234736openalex-snapshot
Imperative functional programming
inferred← citeshttps://doi.org/10.1145/2429069.2429091openalex-snapshot
Universal properties of impure programming languages
inferred← citeshttps://doi.org/10.1145/2480359.2429091openalex-snapshot
Universal properties of impure programming languages
inferred← citeshttps://doi.org/10.1145/3498703openalex-snapshot
Layered and object-based game semantics
inferred← citeshttps://doi.org/10.14236/ewic/fp1995.11openalex-snapshot
Type Reconstruction for SCI
inferred← citeshttps://doi.org/10.2168/lmcs-6(1:2)2010openalex-snapshot
A Graph Model for Imperative Computation
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.