On the public citation graph

Uniqueness type inference

https://doi.org/10.1007/bfb0026821
0 signed · 33 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-57529-4_42openalex-snapshot
Conventional and uniqueness typing in graph rewrite systems
inferredcites →https://doi.org/10.1007/3-540-57787-4_4openalex-snapshot
Extending graph rewriting with copying
inferredcites →https://doi.org/10.1007/978-1-4471-3215-8_1openalex-snapshot
High Level Specification of I/O in Functional Languages
inferredcites →https://doi.org/10.1017/s0956796800001258openalex-snapshot
The ins and outs of Clean I/O
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1990.113759openalex-snapshot
Single-threaded polymorphic lambda calculus
inferredcites →https://doi.org/10.1145/165180.165222openalex-snapshot
Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722298_7openalex-snapshot
The Implementation of Interactive Local State Transition Systems in Clean
inferred← citeshttps://doi.org/10.1007/11559306_14openalex-snapshot
A Concurrent Lambda Calculus with Futures
inferred← citeshttps://doi.org/10.1007/3-540-45361-x_12openalex-snapshot
Porting the Clean Object I/O Library to Haskell
inferred← citeshttps://doi.org/10.1007/3-540-48515-5_15openalex-snapshot
Explicit Message Passing for Concurrent Clean
inferred← citeshttps://doi.org/10.1007/bfb0055427openalex-snapshot
Types for 0, 1 or many uses
inferred← citeshttps://doi.org/10.1007/bfb0055438openalex-snapshot
Interactive functional objects in Clean
inferred← citeshttps://doi.org/10.1007/s10766-006-0018-xopenalex-snapshot
SAC—A Functional Array Language for Efficient Multi-threaded Execution
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.016openalex-snapshot
A concurrent lambda calculus with futures
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80830-2openalex-snapshot
Formal Methods for Industrial Critical Systems at Trinity College, University of Dublin
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80175-6openalex-snapshot
A Derivation System for Uniqueness Typing
inferred← citeshttps://doi.org/10.1017/s0956796805005538openalex-snapshot
Shared memory multiprocessor support for functional array processing in SAC
inferred← citeshttps://doi.org/10.1017/s0960129500070109openalex-snapshot
Uniqueness typing for functional languages with graph rewriting semantics
inferred← citeshttps://doi.org/10.1109/icnc.2014.6975803openalex-snapshot
Uniqueness logic represented via decimal numbers with WASD neural network
inferred← citeshttps://doi.org/10.1145/1017472.1017483openalex-snapshot
wxHaskell
inferred← citeshttps://doi.org/10.1145/1291151.1291189openalex-snapshot
A generic usage analysis with subeffect qualifiers
inferred← citeshttps://doi.org/10.1145/1291220.1291189openalex-snapshot
A generic usage analysis with subeffect qualifiers
inferred← citeshttps://doi.org/10.1145/1707790.1707797openalex-snapshot
Free theorems for functional logic programs
inferred← citeshttps://doi.org/10.1145/1836089.1836118openalex-snapshot
Type inference in intuitionistic linear logic
inferred← citeshttps://doi.org/10.1145/2248418.2248426openalex-snapshot
A modular memory optimization for synchronous data-flow languages
inferred← citeshttps://doi.org/10.1145/2345141.2248426openalex-snapshot
A modular memory optimization for synchronous data-flow languages
inferred← citeshttps://doi.org/10.1145/2906363.2906379openalex-snapshot
In-Place Update in a Dataflow Synchronous Language
inferred← citeshttps://doi.org/10.1145/3408985openalex-snapshot
Kindly bent to free us
inferred← citeshttps://doi.org/10.1145/3564529openalex-snapshot
A Survey on Parallelism and Determinism
inferred← citeshttps://doi.org/10.1145/3607840openalex-snapshot
FP²: Fully in-Place Functional Programming
inferred← citeshttps://doi.org/10.1145/3674642openalex-snapshot
Oxidizing OCaml with Modal Memory Management
inferred← citeshttps://doi.org/10.14236/ewic/fp1995.1openalex-snapshot
Uniqueness Typing in Natural Deduction Style
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.