On the public citation graph
A reasonably gradual type theory
0 signed · 52 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.1006/inco.1995.1057openalex-snapshot
Parallel Reductions in λ-Calculus
inferredcites →https://doi.org/10.1007/1-4020-8141-3_34openalex-snapshot
Dynamic Typing with Dependent Types
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_1openalex-snapshot
Well-Typed Programs Can’t Be Blamed
inferredcites →https://doi.org/10.1017/s0956796818000011openalex-snapshot
Foundations of dependent interoperability
inferredcites →https://doi.org/10.1090/pspum/017/0257175openalex-snapshot
Equality in hyperdoctrines and comprehension schema as an adjoint functor
inferredcites →https://doi.org/10.1093/oso/9780198501275.003.0010openalex-snapshot
An intuitionistic theory of types
inferredcites →https://doi.org/10.1109/lics.2017.8005113openalex-snapshot
An effectful way to eliminate addiction to dependence
inferredcites →https://doi.org/10.1145/1706299.1706342openalex-snapshot
Threesomes, with and without blame
inferredcites →https://doi.org/10.1145/2103776.2103780openalex-snapshot
Equational reasoning about programs with general recursion and call-by-value semantics
inferredcites →https://doi.org/10.1145/2535838.2535883openalex-snapshot
Combining proofs and programs in a dependently typed language
inferredcites →https://doi.org/10.1145/277650.277732openalex-snapshot
Eliminating array bound checking through dependent types
inferredcites →https://doi.org/10.1145/2816707.2816710openalex-snapshot
Gradual certified programming in coq
inferredcites →https://doi.org/10.1145/2837614openalex-snapshot
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
inferredcites →https://doi.org/10.1145/3018610.3018620openalex-snapshot
The next 700 syntactical models of type theory
inferredcites →https://doi.org/10.1145/3236768openalex-snapshot
Graduality from embedding-projection pairs
inferredcites →https://doi.org/10.1145/3290316openalex-snapshot
Definitional proof-irrelevance without K
inferredcites →https://doi.org/10.1145/3341691openalex-snapshot
Cubical agda: a dependently typed programming language with univalence and higher inductive types
inferredcites →https://doi.org/10.1145/3341692openalex-snapshot
Approximate normalization for gradual dependent types
inferredcites →https://doi.org/10.1145/3371126openalex-snapshot
The fire triangle: how to mix substitution, dependent elimination, and effects
inferredcites →https://doi.org/10.1145/3373718openalex-snapshot
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
inferredcites →https://doi.org/10.1145/3373718.3394759openalex-snapshot
Partial Univalence in n-truncated Type Theory
inferredcites →https://doi.org/10.1145/3373718.3394794openalex-snapshot
A Constructive Model of Directed Univalence in Bicubical Sets
inferredcites →https://doi.org/10.1145/3495528openalex-snapshot
Gradualizing the Calculus of Inductive Constructions
inferredcites →https://doi.org/10.1145/3547627openalex-snapshot
Propositional equality for gradual dependently typed programming
inferredcites →https://doi.org/10.21136/hs.2017.06openalex-snapshot
A type theory for synthetic ∞-categories
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.29007/3w36openalex-snapshot
Termination Casts: A Flexible Approach to Termination with General Recursion
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.4230/lipics.snapl.2015.274openalex-snapshot
Refined Criteria for Gradual Typing
inferredcites →https://doi.org/10.4230/lipics.types.2015.5openalex-snapshot
Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1145/3547627openalex-snapshot
Propositional equality for gradual dependently typed programming
inferred← citeshttps://doi.org/10.1145/3586048openalex-snapshot
Live Pattern Matching with Typed Holes
inferred← citeshttps://doi.org/10.1145/3589806.3600034openalex-snapshot
GTP Benchmarks for Gradual Typing Performance
inferred← citeshttps://doi.org/10.1145/3696443.3708923openalex-snapshot
Honey Potion: An eBPF Backend for Elixir
inferred← citeshttps://doi.org/10.1145/3704912openalex-snapshot
All Your Base Are Belong to Us: Sort Polymorphism for Proof Assistants
inferred← citeshttps://doi.org/10.1145/3747507openalex-snapshot
Robust Dynamic Embedding for Gradual Typing
inferred← citeshttps://doi.org/10.1145/3776732openalex-snapshot
Bounded Sort Polymorphism with Elimination Constraints
inferred← citeshttps://doi.org/10.1145/3794763.3794812openalex-snapshot
The Way of Types: A Report on Developer Experience with Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3839501openalex-snapshot
Interactive Data Analysis with Lively Typed Tables
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.