On the public citation graph

A graded dependent type system with a usage-aware semantics

https://doi.org/10.1145/3434331
0 signed · 55 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.1006/inco.2001.2951openalex-snapshot
A Linear Logical Framework
inferredcites →https://doi.org/10.1007/3-540-45413-6_27openalex-snapshot
The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping
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-94-015-9333-5openalex-snapshot
Semirings and their Applications
inferredcites →https://doi.org/10.1007/bfb0022251openalex-snapshot
A mixed linear and non-linear logic: Proofs, terms and models
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/s0304-3975(99)00054-7openalex-snapshot
Operational interpretations of linear logic
inferredcites →https://doi.org/10.1017/s0956796800001660openalex-snapshot
Reference counting as a computational interpretation of linear logic
inferredcites →https://doi.org/10.1145/158511.158618openalex-snapshot
A natural semantics for lazy evaluation
inferredcites →https://doi.org/10.1145/2370776.2370792openalex-snapshot
Linear dependent types in a call-by-value scenario
inferredcites →https://doi.org/10.1145/2676726.2676969openalex-snapshot
Integrating Linear and Dependent Types
inferredcites →https://doi.org/10.1145/292540.292555openalex-snapshot
A core calculus of dependency
inferredcites →https://doi.org/10.1145/3110275openalex-snapshot
A specification for dependent types in Haskell
inferredcites →https://doi.org/10.1145/3158093openalex-snapshot
Linear Haskell: practical linearity in a higher-order polymorphic language
inferredcites →https://doi.org/10.1145/3341705openalex-snapshot
A role for dependent types in Haskell
inferredcites →https://doi.org/10.1145/3341714openalex-snapshot
Quantitative program reasoning with graded modal types
inferredcites →https://doi.org/10.1145/3408972openalex-snapshot
A unified view of modalities in type systems
inferredcites →https://doi.org/10.2168/lmcs-6(4:7)2010openalex-snapshot
Bounded Linear Logic, Revisited
inferredcites →https://doi.org/10.2168/lmcs-8(1:29)2012openalex-snapshot
On Irrelevance and Algorithmic Equality in Predicative Type Theory
inferredcites →https://doi.org/10.4230/lipics.ecoop.2020.20openalex-snapshot
A Framework for Resource Dependent EDSLs in a Dependently Typed Language (Pearl)
inferredcites →https://doi.org/10.48550/arxiv.1710.09756openalex-snapshot
Linear Haskell: practical linearity in a higher-order polymorphic language
inferredcites →https://doi.org/10.5555/353629.353648openalex-snapshot
A sound type system for secure flow analysis

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-72019-3_17openalex-snapshot
Graded Modal Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_13openalex-snapshot
Linearity and Uniqueness: An Entente Cordiale
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-15298-6_16openalex-snapshot
Additive Types in Quantitative Type Theory
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_4openalex-snapshot
Program Synthesis from Graded Types
inferred← citeshttps://doi.org/10.1007/978-3-031-74558-4_5openalex-snapshot
Programming with Dependent Additive Pairs
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.1016/j.ic.2024.105234openalex-snapshot
Non-linear communication via graded modal session types
inferred← citeshttps://doi.org/10.1145/3498692openalex-snapshot
A relational theory of effects and coeffects
inferred← citeshttps://doi.org/10.1145/3563319openalex-snapshot
Coeffects for sharing and mutation
inferred← citeshttps://doi.org/10.1145/3571256openalex-snapshot
Elements of Quantitative Rewriting
inferred← citeshttps://doi.org/10.1145/3605159.3605856openalex-snapshot
Monitoring for Resource-Awareness
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/3609027openalex-snapshot
Proceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3609027.3609404openalex-snapshot
A Calculus of Inductive Linear Constructions
inferred← citeshttps://doi.org/10.1145/3609027.3609408openalex-snapshot
Combining Dependency, Grades, and Adjoint Logic
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/3632918openalex-snapshot
Polynomial Time and 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/3678721.3686232openalex-snapshot
Coeffects for MiniJava: Cf-Mj
inferred← citeshttps://doi.org/10.1145/3689750openalex-snapshot
Effects and Coeffects in Call-by-Push-Value
inferred← citeshttps://doi.org/10.1145/3703595.3705888openalex-snapshot
Split Decisions: Explicit Contexts for Substructural Languages
inferred← citeshttps://doi.org/10.1145/3704843openalex-snapshot
Consistency of a Dependent Calculus of Indistinguishability
inferred← citeshttps://doi.org/10.1145/3720476openalex-snapshot
Modal Effect Types
inferred← citeshttps://doi.org/10.1145/3776657openalex-snapshot
Typing Strictness
inferred← citeshttps://doi.org/10.1145/3828677openalex-snapshot
On Recursion in Graded Modal Type Theory
inferred← citeshttps://doi.org/10.22152/programming-journal.org/2022/6/5openalex-snapshot
A Functional Programming Language with Versions
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d17openalex-snapshot
Graded Modal Dependent Type Theory
inferred← citeshttps://doi.org/10.4204/eptcs.353.6openalex-snapshot
Deriving Distributive Laws for Graded Linear Types
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.