On the public citation graph
A unified view of modalities in type systems
0 signed · 73 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/11538363_6openalex-snapshot
Distributed Control Flow with Classical Modal Logic
inferredcites →https://doi.org/10.1007/3-540-48959-2_21openalex-snapshot
Natural Deduction for Intuitionistic Non-commutative Linear Logic
inferredcites →https://doi.org/10.1007/978-3-642-02273-9_8openalex-snapshot
Bounded Linear Logic, Revisited
inferredcites →https://doi.org/10.1007/978-3-642-54833-8openalex-snapshot
Programming Languages and Systems
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_18openalex-snapshot
Bounded Linear Types in a Resource Semiring
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_19openalex-snapshot
A Core Quantitative Coeffect Calculus
inferredcites →https://doi.org/10.1007/s10817-011-9219-0openalex-snapshot
Strongly Typed Term Representations in Coq
inferredcites →https://doi.org/10.1016/0304-3975(85)90135-5openalex-snapshot
Automatic synthesis of typed Λ-programs on term algebras
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.1017/s0960129500000372openalex-snapshot
Categorical data types in parametric polymorphism
inferredcites →https://doi.org/10.1017/s0960129501003322openalex-snapshot
A judgmental reconstruction of modal logic
inferredcites →https://doi.org/10.1080/00029890.1958.11989160openalex-snapshot
The Mathematics of Sentence Structure
inferredcites →https://doi.org/10.1109/csf.2019.00008openalex-snapshot
Optimising Faceted Secure Multi-Execution
inferredcites →https://doi.org/10.1109/lics.2001.932499openalex-snapshot
Intensionality, extensionality, and proof irrelevance in modal type theory
inferredcites →https://doi.org/10.1145/1016850.1016868openalex-snapshot
Translating dependency into parametricity
inferredcites →https://doi.org/10.1145/158511.158618openalex-snapshot
A natural semantics for lazy evaluation
inferredcites →https://doi.org/10.1145/1863543.1863568openalex-snapshot
Distance makes the types grow stronger
inferredcites →https://doi.org/10.1145/2429069.2429113openalex-snapshot
Linear dependent types for differential privacy
inferredcites →https://doi.org/10.1145/2951913.2951939openalex-snapshot
Combining effects and coeffects via grading
inferredcites →https://doi.org/10.1145/3158093openalex-snapshot
Linear Haskell: practical linearity in a higher-order polymorphic language
inferredcites →https://doi.org/10.1145/3209108.3209189openalex-snapshot
Syntax and Semantics of Quantitative Type Theory
inferredcites →https://doi.org/10.1145/3236785openalex-snapshot
A type and scope safe universe of syntaxes with binding: their semantics and proofs
inferredcites →https://doi.org/10.1145/3264820.3264823openalex-snapshot
A Perspective on the Dependency Core Calculus
inferredcites →https://doi.org/10.1145/3290333openalex-snapshot
Modalities, cohesion, and information flow
inferredcites →https://doi.org/10.1145/3341693openalex-snapshot
Simple noninterference from parametricity
inferredcites →https://doi.org/10.1145/3341714openalex-snapshot
Quantitative program reasoning with graded modal types
inferredcites →https://doi.org/10.4230/lipics.types.2020.0openalex-snapshot
Front Matter, Table of Contents, Preface, Conference Organization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_12openalex-snapshot
Generalized Bounded Linear Logic and its Categorical Semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_17openalex-snapshot
Graded Modal Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_14openalex-snapshot
A Framework for Substructural Type Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_15openalex-snapshot
A Dependent Dependency Calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_3openalex-snapshot
Layered Modal Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_4openalex-snapshot
Program Synthesis from Graded Types
inferred← citeshttps://doi.org/10.1007/978-3-032-08187-2_7openalex-snapshot
On Graded Coeffect Types for Information-Flow Control
inferred← citeshttps://doi.org/10.1007/978-981-95-3585-9_2openalex-snapshot
Fair Termination for Resource-Aware Active Objects
inferred← citeshttps://doi.org/10.1007/s10849-022-09378-7openalex-snapshot
Algebraic Effects for Extensible Dynamic Semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105234openalex-snapshot
Non-linear communication via graded modal session types
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114063openalex-snapshot
A Java-like calculus with heterogeneous coeffects
inferred← citeshttps://doi.org/10.1145/3434326openalex-snapshot
A practical mode system for recursive definitions
inferred← citeshttps://doi.org/10.1145/3434331openalex-snapshot
A graded dependent type system with a usage-aware semantics
inferred← citeshttps://doi.org/10.1145/3498692openalex-snapshot
A relational theory of effects and coeffects
inferred← citeshttps://doi.org/10.1145/3531130.3533337openalex-snapshot
Logical Foundations of Quantitative Equality
inferred← citeshttps://doi.org/10.1145/3547626openalex-snapshot
Linearly qualified types: generic inference for capabilities and uniqueness
inferred← citeshttps://doi.org/10.1145/3607852openalex-snapshot
Dependently-Typed Programming with Logical Equality Reflection
inferred← citeshttps://doi.org/10.1145/3607862openalex-snapshot
A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized
inferred← citeshttps://doi.org/10.1145/3622843openalex-snapshot
Resource-Aware Soundness for Big-Step Semantics
inferred← citeshttps://doi.org/10.1145/3632886openalex-snapshot
Internalizing Indistinguishability with Dependent Types
inferred← citeshttps://doi.org/10.1145/3649848openalex-snapshot
Functional Ownership through Fractional Uniqueness
inferred← citeshttps://doi.org/10.1145/3674642openalex-snapshot
Oxidizing OCaml with Modal Memory Management
inferred← citeshttps://doi.org/10.1145/3689750openalex-snapshot
Effects and Coeffects in Call-by-Push-Value
inferred← citeshttps://doi.org/10.1145/3707203openalex-snapshot
A Layered Approach to Intensional Analysis in Type Theory
inferred← citeshttps://doi.org/10.1145/3720423openalex-snapshot
Destination Calculus: A Linear 𝜆-Calculus for Purely Functional Memory Writes
inferred← citeshttps://doi.org/10.1145/3828677openalex-snapshot
On Recursion in Graded Modal Type Theory
inferred← citeshttps://doi.org/10.14418/wes01.3.139openalex-snapshot
A Bunched Homotopy Type Theory for Synthetic Stable Homotopy Theory
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cb2openalex-snapshot
Generalized Bounded Linear Logic and its Categorical Semantics
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d17openalex-snapshot
Graded Modal Dependent Type Theory
inferred← citeshttps://doi.org/10.4204/eptcs.353.10openalex-snapshot
A Linear Algebra Approach to Linear Metatheory
inferred← citeshttps://doi.org/10.4204/eptcs.353.6openalex-snapshot
Deriving Distributive Laws for Graded Linear Types
inferred← citeshttps://doi.org/10.4230/lipics.csl.2026.3openalex-snapshot
Modal Reasoning = Metric Reasoning, via Lawvere
inferred← citeshttps://doi.org/10.46298/entics.12299openalex-snapshot
A Complete V-Equational System for Graded lambda-Calculus
inferred← citeshttps://doi.org/10.46298/lmcs-20(2:1)2024openalex-snapshot
A Fibrational Tale of Operational Logical Relations: Pure, Effectful and Differential
inferred← citeshttps://doi.org/10.48550/arxiv.2011.04070openalex-snapshot
A graded dependent type system with a usage-aware semantics (extended version)
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.