On the public citation graph
Syntactic control of interference Part 2
0 signed · 59 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.1002/malq.19810270205openalex-snapshot
Functional Characters of Solvable Terms
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_6openalex-snapshot
Towards a Theory of Parallel Programming
inferredcites →https://doi.org/10.1145/512760.512766openalex-snapshot
Syntactic control of interference
inferredcites →https://doi.org/10.1184/r1/6608582openalex-snapshot
Preliminary design of the programming language Forsythe
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.1995.1086openalex-snapshot
Intersection and Union Types: Syntax and Semantics
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_11openalex-snapshot
Typing with Conditions and Guarantees for Functional In-place Update
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_14openalex-snapshot
Functional In-Place Update with Layered Datatype Sharing
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_19openalex-snapshot
Resource Interpretations, Bunched Implications and the αλ-Calculus (Preliminary Version)
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_69openalex-snapshot
Intersection and union types
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_33openalex-snapshot
Determining storage properties of sequential and concurrent programs with assignment and structured data
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_61openalex-snapshot
Characterization of the principal type of normal forms in an intersection type system
inferred← citeshttps://doi.org/10.1007/3540543961_10openalex-snapshot
Assignments for applicative languages
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_9openalex-snapshot
Design of the Programming Language Forsythe
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_11openalex-snapshot
The Essence of Parallel Algol
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_9openalex-snapshot
Global State Considered Unnecessary: Introduction to Object-Based Semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_6openalex-snapshot
Challenges for Formal Semantic Description: Responses from the Main Approaches
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_16openalex-snapshot
A λ-Calculus for Resource Separation
inferred← citeshttps://doi.org/10.1007/bf01211394openalex-snapshot
Types with intersection: An introduction
inferred← citeshttps://doi.org/10.1007/bf01806032openalex-snapshot
Global state considered unnecessary: An introduction to object-based semantics
inferred← citeshttps://doi.org/10.1007/bfb0013458openalex-snapshot
Linear logic and interference control
inferred← citeshttps://doi.org/10.1016/0304-3975(96)80138-1openalex-snapshot
Syntactic control of interference revisited
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00359-4openalex-snapshot
Syntactic control of interference revisited
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00026-xopenalex-snapshot
Syntactic Control of Interference Revisited
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1017/s0956796800000125openalex-snapshot
Equivalence in functional languages with effects
inferred← citeshttps://doi.org/10.1017/s0956796800001593openalex-snapshot
Weak polymorphism can be sound
inferred← citeshttps://doi.org/10.1017/s0960129500000311openalex-snapshot
A model for syntactic control of interference
inferred← citeshttps://doi.org/10.1109/lics.2009.26openalex-snapshot
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
inferred← citeshttps://doi.org/10.1109/memcod.2011.5970519openalex-snapshot
Function interface models for hardware compilation
inferred← citeshttps://doi.org/10.1145/143165.143169openalex-snapshot
The essence of functional programming
inferred← citeshttps://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferred← citeshttps://doi.org/10.1145/199448.199450openalex-snapshot
Isolating side effects in sequential languages
inferred← citeshttps://doi.org/10.1145/211782.211821openalex-snapshot
A logical framework for software proof reuse
inferred← citeshttps://doi.org/10.1145/2429069.2429103openalex-snapshot
The type discipline of behavioral separation
inferred← citeshttps://doi.org/10.1145/292540.292564openalex-snapshot
Typed memory management in a calculus of capabilities
inferred← citeshttps://doi.org/10.1145/3485516openalex-snapshot
Reachability types: tracking aliasing and separation in higher-order functional programs
inferred← citeshttps://doi.org/10.1145/3632856openalex-snapshot
Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs
inferred← citeshttps://doi.org/10.1145/363911.363923openalex-snapshot
Typed memory management via static capabilities
inferred← citeshttps://doi.org/10.1184/r1/6587339openalex-snapshot
A decision procedure for the subtype relation on intersection types with bounded variables
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c020openalex-snapshot
Intersection Types, $\lambda$-models, and Böhm Trees
inferred← citeshttps://doi.org/10.48550/arxiv.0907.0749openalex-snapshot
Function Interface Models for Hardware Compilation: Types, Signatures, Protocols
inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
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.