On the public citation graph

Types for 0, 1 or many uses

https://doi.org/10.1007/bfb0055427
0 signed · 23 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/3-540-52592-0_66openalex-snapshot
A backwards analysis for compile-time garbage collection
inferredcites →https://doi.org/10.1007/3-540-61739-6_48openalex-snapshot
Tractable constraints in finite semilattices
inferredcites →https://doi.org/10.1007/bfb0026821openalex-snapshot
Uniqueness type inference
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1145/174675.177855openalex-snapshot
Implementation of the typed call-by-value λ-calculus using a stack of regions
inferredcites →https://doi.org/10.1145/224164.224168openalex-snapshot
Once upon a type
inferredcites →https://doi.org/10.1145/512927.512945openalex-snapshot
A unified approach to global program optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45361-x_9openalex-snapshot
A Usage Analysis with Bounded Usage Polymorphism and Subtyping
inferred← citeshttps://doi.org/10.1007/3-540-61739-6_48openalex-snapshot
Tractable constraints in finite semilattices
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_17openalex-snapshot
Modular Inference of Linear Types for Multiplicity-Annotated Arrows
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_18openalex-snapshot
Linear Declassification
inferred← citeshttps://doi.org/10.1007/978-3-642-34407-7_4openalex-snapshot
Challenges for a Trace-Based Just-In-Time Compiler for Haskell
inferred← citeshttps://doi.org/10.1007/s00354-008-0038-8openalex-snapshot
A New Type System for JVM Lock Primitives
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80284-1openalex-snapshot
A Foundation for Space-Safe Transformations of Call-by-Need Programs
inferred← citeshttps://doi.org/10.1023/a:1012944815270openalex-snapshot
Type-Based Useless-Variable Elimination
inferred← citeshttps://doi.org/10.1145/1086365.1086376openalex-snapshot
A step-indexed model of substructural state
inferred← citeshttps://doi.org/10.1145/1291151.1291189openalex-snapshot
A generic usage analysis with subeffect qualifiers
inferred← citeshttps://doi.org/10.1145/289423.289427openalex-snapshot
A type based sharing analysis for update avoidance and optimisation
inferred← citeshttps://doi.org/10.1145/292540.292545openalex-snapshot
Once upon a polymorphic type
inferred← citeshttps://doi.org/10.1145/3209108.3209189openalex-snapshot
Syntax and Semantics of Quantitative Type Theory
inferred← citeshttps://doi.org/10.1145/328690.328702openalex-snapshot
Type-based useless variable elimination
inferred← citeshttps://doi.org/10.1145/328691.328702openalex-snapshot
Type-based useless variable elimination
inferred← citeshttps://doi.org/10.1145/568173.568182openalex-snapshot
A new type system for JVM lock primitives
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.