On the public citation graph
A term calculus for Intuitionistic Linear Logic
0 signed · 166 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/bfb0013458openalex-snapshot
Linear logic and interference control
inferredcites →https://doi.org/10.1007/bfb0037099openalex-snapshot
A term calculus for Intuitionistic Linear Logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0304-3975(92)90386-topenalex-snapshot
Bounded linear logic: a modular approach to polynomial-time computability
inferredcites →https://doi.org/10.1016/0304-3975(93)90181-ropenalex-snapshot
Computational interpretations of linear logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7039-9openalex-snapshot
The Collected Papers of Gerhard Gentzen
inferredcites →https://doi.org/10.1017/s0956796800001131openalex-snapshot
Lilac: a functional programming language based on linear logic
inferredcites →https://doi.org/10.1109/lics.1992.185536openalex-snapshot
Operational aspects of linear lambda calculus
inferredcites →https://doi.org/10.2307/2274279openalex-snapshot
A natural extension of natural deduction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48088-3_2openalex-snapshot
Chu’s Construction: A Proof-Theoretic Approach
inferred← citeshttps://doi.org/10.1007/11417170_22openalex-snapshot
L3: A Linear Language with Locations
inferred← citeshttps://doi.org/10.1007/11874683_1openalex-snapshot
Functorial Boxes in String Diagrams
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/3-540-48959-2_18openalex-snapshot
A Study of Abramsky’s Linear Chemical Abstract Machine
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_14openalex-snapshot
Categorical Models of Explicit Substitutions
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_6openalex-snapshot
Linear λ-calculus and categorical models revisited
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_23openalex-snapshot
Holomorphic models of exponential types in linear logic
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_18openalex-snapshot
Coalgebras and approximation
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_80openalex-snapshot
A model of intuitionistic affine logic from stable domain theory
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_12openalex-snapshot
Rewriting properties of combinators for rudimentary linear logic
inferred← citeshttps://doi.org/10.1007/3-540-61487-7_26openalex-snapshot
Proofs, concurrent objects and computations in a FILL framework
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_8openalex-snapshot
Syntactic Control of Interference Revisited
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-45231-5_26openalex-snapshot
Semantical Analysis of Contextual Types
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_11openalex-snapshot
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_18openalex-snapshot
The Benefits of Diligence
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_10openalex-snapshot
A Functorial Bridge Between the Infinitary Affine Lambda-Calculus and Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-72056-2_16openalex-snapshot
Dialectica Categories for the Lambek Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_4openalex-snapshot
Soft lambda-Calculus: A Language for Polynomial Time Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_16openalex-snapshot
“Wave-Style” Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_16openalex-snapshot
A λ-Calculus for Resource Separation
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_30openalex-snapshot
Extending the Explicit Substitution Paradigm
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_29openalex-snapshot
Strict Geometry of Interaction Graph Models
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_7openalex-snapshot
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-12821-9_2openalex-snapshot
Physics, Topology, Logic and Computation: A Rosetta Stone
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_7openalex-snapshot
Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
inferred← citeshttps://doi.org/10.1007/978-3-642-21490-5_2openalex-snapshot
Covert Movement in Logical Grammar
inferred← citeshttps://doi.org/10.1007/978-3-642-22303-7_7openalex-snapshot
Intuitionistic Sequent-Style Calculus with Explicit Structural Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-23283-1_10openalex-snapshot
Intersection Types for the Resource Control Lambda Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-40447-4_3openalex-snapshot
The Blame Theorem for a Linear Lambda Calculus with Type Dynamic
inferred← citeshttps://doi.org/10.1007/978-3-642-54833-8_19openalex-snapshot
A Core Quantitative Coeffect Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_9openalex-snapshot
Linearity, Control Effects, and Behavioral Types
inferred← citeshttps://doi.org/10.1007/978-94-007-0002-4_4openalex-snapshot
Comparison to Seligman’s Natural Deduction System
inferred← citeshttps://doi.org/10.1007/978-94-007-7548-0_9openalex-snapshot
Categorical Semantics of Linear Logic for All
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_1openalex-snapshot
Labelled Proof Systems for Intuitionistic Provability
inferred← citeshttps://doi.org/10.1007/bf00873993openalex-snapshot
An internal language for autonomous categories
inferred← citeshttps://doi.org/10.1007/bf01806032openalex-snapshot
Global state considered unnecessary: An introduction to object-based semantics
inferred← citeshttps://doi.org/10.1007/bfb0014046openalex-snapshot
What is a categorical model of Intuitionistic Linear Logic?
inferred← citeshttps://doi.org/10.1007/bfb0022245openalex-snapshot
The Girard Translation extended with recursion
inferred← citeshttps://doi.org/10.1007/bfb0022251openalex-snapshot
A mixed linear and non-linear logic: Proofs, terms and models
inferred← citeshttps://doi.org/10.1007/bfb0026989openalex-snapshot
A deciding algorithm for linear isomorphism of types with complexity O(nlog 2(n)).
inferred← citeshttps://doi.org/10.1007/s001530100136openalex-snapshot
A normalizing system of natural deduction for intuitionistic linear logic
inferred← citeshttps://doi.org/10.1007/s10485-004-3134-zopenalex-snapshot
Relating Categorical Semantics for Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.1007/s10988-005-2656-7openalex-snapshot
Relational Nouns, Pronouns, and Resumption
inferred← citeshttps://doi.org/10.1007/s10988-010-9079-9openalex-snapshot
Propositional glue and the projection architecture of LFG
inferred← citeshttps://doi.org/10.1007/s11049-012-9168-2openalex-snapshot
Copy raising and perception
inferred← citeshttps://doi.org/10.1007/s11225-018-9828-2openalex-snapshot
Translations Between Gentzen–Prawitz and Jaśkowski–Fitch Natural Deduction Proofs
inferred← citeshttps://doi.org/10.1016/0304-3975(96)80138-1openalex-snapshot
Syntactic control of interference revisited
inferred← citeshttps://doi.org/10.1016/j.apal.2007.03.005openalex-snapshot
Coherence in smccs and equivalences on derivations in imll with unit
inferred← citeshttps://doi.org/10.1016/j.apal.2008.03.006openalex-snapshot
Synthetic domain theory and models of linear Abadi & Plotkin logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.049openalex-snapshot
A Language For Multiplicative-additive Linear Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.007openalex-snapshot
The Linear Logical Abstract Machine
inferred← citeshttps://doi.org/10.1016/j.ic.2006.08.008openalex-snapshot
Resource operators for λ-calculus
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/j.tcs.2005.06.005openalex-snapshot
Weak linearization of the lambda calculus
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00075-6openalex-snapshot
Proof theory in the abstract
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00349-2openalex-snapshot
Two applications of analytic functors
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00241-9openalex-snapshot
Glueing and orthogonality for models of linear logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00308-5openalex-snapshot
A new framework for declarative programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00454-1openalex-snapshot
On categorical equivalence of Gentzen-style derivations in IMLL
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00044-3openalex-snapshot
New Curry-Howard terms for full linear logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00359-4openalex-snapshot
Syntactic control of interference revisited
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00048-1openalex-snapshot
A classical linear λ-calculus
inferred← citeshttps://doi.org/10.1016/s1389-1286(01)00154-2openalex-snapshot
SafetyNet: A language-based approach to programmable networks
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00021-0openalex-snapshot
Generalizing Coherence Spaces and Hypercoherences
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00022-2openalex-snapshot
Call-by-name, Call-by-value, Call-by-need, and the Linear Lambda Calculus
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)00028-3openalex-snapshot
On a Modal λ-Calculus for S4
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80356-6openalex-snapshot
An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01180-1openalex-snapshot
Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80312-3openalex-snapshot
Abstract Games for Linear Logic Extended Abstract
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80399-8openalex-snapshot
Towards a Classical Linear λ-calculus (Preliminary Report)
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80733-9openalex-snapshot
Quantales as completions of ordered monoids: Revised semantics for Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80030-0openalex-snapshot
Relevant and substructural logics
inferred← citeshttps://doi.org/10.1017/9781316755983.008openalex-snapshot
A pragmatic interpretation of substructural logics
inferred← citeshttps://doi.org/10.1017/s0956796800001246openalex-snapshot
Strong normalisation for the linear term calculus
inferred← citeshttps://doi.org/10.1017/s0956796800001660openalex-snapshot
Reference counting as a computational interpretation of linear logic
inferred← citeshttps://doi.org/10.1017/s0956796820000076openalex-snapshot
A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
inferred← citeshttps://doi.org/10.1017/s0956796899003615openalex-snapshot
Girard translation and logical predicates
inferred← citeshttps://doi.org/10.1017/s0956796899003639openalex-snapshot
Program equivalence in a linear functional language
inferred← citeshttps://doi.org/10.1017/s0960129500001055openalex-snapshot
! and ? – Storage as tensorial strength
inferred← citeshttps://doi.org/10.1017/s0960129500003200openalex-snapshot
Linear types and approximation
inferred← citeshttps://doi.org/10.1017/s0960129500003273openalex-snapshot
Cut rules and explicit substitutions
inferred← citeshttps://doi.org/10.1017/s096012950900766xopenalex-snapshot
From parametric polymorphism to models of polymorphic FPC
inferred← citeshttps://doi.org/10.1017/s0960129509990375openalex-snapshot
Some reasons for generalising domain theory
inferred← citeshttps://doi.org/10.1017/s0960129516000347openalex-snapshot
A linear/producer/consumer model of classical linear logic
inferred← citeshttps://doi.org/10.1017/s0960129520000109openalex-snapshot
Encodings of Turing machines in linear logic
inferred← citeshttps://doi.org/10.1023/a:1005025414656openalex-snapshot
Curry-Howard Terms for Linear Logic
inferred← citeshttps://doi.org/10.1023/a:1026187215321openalex-snapshot
Two Natural Deduction Systems for Hybrid Logic: A Comparison
inferred← citeshttps://doi.org/10.1075/lfab.5.03asuopenalex-snapshot
Towards a unified theory of resumption
inferred← citeshttps://doi.org/10.1080/11663081.2015.1080422openalex-snapshot
Non-normal modalities in variants of linear logic
inferred← citeshttps://doi.org/10.1093/jigpal/9.1.27openalex-snapshot
Completeness of bisimilarity for contextual equivalence in linear theories
inferred← citeshttps://doi.org/10.1093/logcom/exs023openalex-snapshot
What is a model for a semantically linear -calculus?
inferred← citeshttps://doi.org/10.1109/lics.2004.1319621openalex-snapshot
Light types for polynomial time computation in lambda-calculus
inferred← citeshttps://doi.org/10.1109/lics.2017.8005089openalex-snapshot
Dual-Context Calculi for Modal Logic
inferred← citeshttps://doi.org/10.1109/opnarc.2000.828140openalex-snapshot
A language-based approach to programmable networks
inferred← citeshttps://doi.org/10.1145/1708016.1708027openalex-snapshot
Lightweight linear types in system f°
inferred← citeshttps://doi.org/10.1145/2542667openalex-snapshot
Undecidability of Propositional Separation Logic and Its Neighbours
inferred← citeshttps://doi.org/10.1145/2837614.2837652openalex-snapshot
A theory of effects and resources: adjunction models and polarised calculi
inferred← citeshttps://doi.org/10.1145/331605.331611openalex-snapshot
From Algol to polymorphic linear lambda-calculus
inferred← citeshttps://doi.org/10.1145/3498669openalex-snapshot
A fine-grained computational interpretation of Girard’s intuitionistic proof-nets
inferred← citeshttps://doi.org/10.1145/3531130.3532445openalex-snapshot
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
inferred← citeshttps://doi.org/10.1145/3545115openalex-snapshot
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types
inferred← citeshttps://doi.org/10.1145/3632926openalex-snapshot
Higher Order Bayesian Networks, Exactly
inferred← citeshttps://doi.org/10.1145/3636501.3636956openalex-snapshot
Displayed Monoidal Categories for the Semantics of Linear Logic
inferred← citeshttps://doi.org/10.1184/r1/6610634openalex-snapshot
The inverse method for intuitionistic linear logic : (the propositional fragment)
inferred← citeshttps://doi.org/10.1201/9781439863763-14openalex-snapshot
A pragmatic interpretation of substructural logics
inferred← citeshttps://doi.org/10.17863/cam.55080openalex-snapshot
Cartesian closed bicategories: type theory and coherence
inferred← citeshttps://doi.org/10.20381/ruor-19805openalex-snapshot
Semantics for a higher-order functional programming language for quantum computation
inferred← citeshttps://doi.org/10.20381/ruor-20066openalex-snapshot
Categorical models of computation: Partially traced categories and presheaf models of quantum computation
inferred← citeshttps://doi.org/10.21236/ada275184openalex-snapshot
Basic Research in Computer Science
inferred← citeshttps://doi.org/10.21464/fi38101openalex-snapshot
Analogical Reasoning and Word-Meanings in a Multidimensional Space
inferred← citeshttps://doi.org/10.2168/lmcs-10(3:16)2014openalex-snapshot
Categorical Proof Theory of Co-Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.2168/lmcs-9(4:3)2013openalex-snapshot
Non-idempotent intersection types and strong normalisation
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:10)2020openalex-snapshot
Dual-Context Calculi for Modal Logic
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25ccdopenalex-snapshot
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic
inferred← citeshttps://doi.org/10.4204/eptcs.172.10openalex-snapshot
QPEL: Quantum Program and Effect Language
inferred← citeshttps://doi.org/10.4204/eptcs.176.2openalex-snapshot
A Linear/Producer/Consumer Model of Classical Linear Logic
inferred← citeshttps://doi.org/10.4204/eptcs.292.2openalex-snapshot
The Bang Calculus and the Two Girard's Translations
inferred← citeshttps://doi.org/10.4204/eptcs.325.18openalex-snapshot
Deriving Theorems in Implicational Linear Logic, Declaratively
inferred← citeshttps://doi.org/10.4204/eptcs.353.10openalex-snapshot
A Linear Algebra Approach to Linear Metatheory
inferred← citeshttps://doi.org/10.4204/eptcs.357.7openalex-snapshot
A Subexponential View of Domains in Session Types
inferred← citeshttps://doi.org/10.4204/eptcs.358.8openalex-snapshot
Normalization by Evaluation for the Lambek Calculus
inferred← citeshttps://doi.org/10.4204/eptcs.449.5openalex-snapshot
A Typing System for the Linear Lambda-Calculus in de Bruijn Notation
inferred← citeshttps://doi.org/10.4204/eptcs.71.1openalex-snapshot
A Lambda Term Representation Inspired by Linear Ordered Logic
inferred← citeshttps://doi.org/10.4230/lipics.types.2017.1openalex-snapshot
A Type Theory for Probabilistic and Bayesian Reasoning
inferred← citeshttps://doi.org/10.4324/9780203016244openalex-snapshot
An Introduction to Substructural Logics
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:23)2023openalex-snapshot
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
inferred← citeshttps://doi.org/10.48550/arxiv.0912.0419openalex-snapshot
An affine-intuitionistic system of types and effects: confluence and termination
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3455openalex-snapshot
Resource control and strong normalisation
inferred← citeshttps://doi.org/10.48550/arxiv.1412.2219openalex-snapshot
Resource control and intersection types: an intrinsic connection
inferred← citeshttps://doi.org/10.48550/arxiv.1605.08106openalex-snapshot
The Many Worlds of Modal λ-calculi: I. Curry-Howard for Necessity, Possibility and Time
inferred← citeshttps://doi.org/10.48550/arxiv.1807.00067openalex-snapshot
Josephine: Using JavaScript to safely manage the lifetimes of Rust data
inferred← citeshttps://doi.org/10.48550/arxiv.1912.07462openalex-snapshot
On the Unity of Logic: a Sequential, Unpolarized Approach
inferred← citeshttps://doi.org/10.48550/arxiv.2101.08364openalex-snapshot
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version)
inferred← citeshttps://doi.org/10.70675/0bb75525z0078z4033z88b5z919b98f2b635openalex-snapshot
Bicategorical orthogonality constructions for linear logic
inferred← citeshttps://doi.org/10.70675/ee5a7d84z59daz4227zac9cz9f36d8e5c5b9openalex-snapshot
Reductions and linear approximations
inferred← citeshttps://doi.org/10.70930/tac/et1997rtopenalex-snapshot
Dialectica and Chu Constructions: Cousins?
inferred← citeshttps://doi.org/10.7146/brics.v3i46.20048openalex-snapshot
A Decision Algorithm for Linear Isomorphism of Types with Complexity Cn(log2(n))
showing the first 155 of 156 · page through all 156
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.