On the public citation graph
On the linear decoration of intuitionistic derivations
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.
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.1007/bfb0022247openalex-snapshot
A λ-calculus structure isomorphic to Gentzen-style sequent calculus structure
inferredcites →https://doi.org/10.1007/bfb0022564openalex-snapshot
The structure of exponentials: Uncovering the dynamics of linear logic proofs
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1093/logcom/1.4.537openalex-snapshot
Some Syntactical Observations on Linear Logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11417170_26openalex-snapshot
A Lambda Calculus for Quantum Computation with Classical Control
inferred← citeshttps://doi.org/10.1007/11417170_6openalex-snapshot
A Feasible Algorithm for Typing in Elementary Affine Logic
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_7openalex-snapshot
Principal Typing in Elementary Affine Logic
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_10openalex-snapshot
Typing Lambda Terms in Elementary Logic with Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_31openalex-snapshot
Checking Polynomial Time Complexity with Types
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.014openalex-snapshot
Type inference for light affine logic via constraints on words
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80030-0openalex-snapshot
Relevant and substructural logics
inferred← citeshttps://doi.org/10.1017/s0956796899003615openalex-snapshot
Girard translation and logical predicates
inferred← citeshttps://doi.org/10.1017/s0960129500000633openalex-snapshot
Semantical observations on the embedding of Intuitionistic Logic into Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.1017/s0960129506005238openalex-snapshot
A lambda calculus for quantum computation with classical control
inferred← citeshttps://doi.org/10.1109/lics.2004.1319621openalex-snapshot
Light types for polynomial time computation in lambda-calculus
inferred← citeshttps://doi.org/10.1145/1836089.1836118openalex-snapshot
Type inference in intuitionistic linear logic
inferred← citeshttps://doi.org/10.1145/3209108.3209132openalex-snapshot
Around Classical and Intuitionistic Linear Logics
inferred← citeshttps://doi.org/10.2307/2275572openalex-snapshot
A new deconstructive logic: linear logic
inferred← citeshttps://doi.org/10.4204/eptcs.292.7openalex-snapshot
The ILLTP Library for Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0305011openalex-snapshot
Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic
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.