On the public citation graph
Observational equality: now for good
0 signed · 45 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/978-3-030-33636-3_7openalex-snapshot
Setoid Type Theory—A Syntactic Translation
inferredcites →https://doi.org/10.1016/s0049-237x(08)71945-1openalex-snapshot
An Intuitionistic Theory of Types: Predicative Part
inferredcites →https://doi.org/10.1016/s0049-237x(08)71989-xopenalex-snapshot
The Type Theoretic Interpretation of Constructive Set Theory
inferredcites →https://doi.org/10.1109/lics.1999.782636openalex-snapshot
Extensional equality in intensional type theory
inferredcites →https://doi.org/10.1145/3158111openalex-snapshot
Decidability of conversion for type theory in type theory
inferredcites →https://doi.org/10.1145/3209108.3209197openalex-snapshot
On Higher Inductive Types in Cubical Type Theory
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/3434341openalex-snapshot
The taming of the rew: a type theory with computational assumptions
inferredcites →https://doi.org/10.23638/lmcs-16(2:14)2020openalex-snapshot
Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality
inferredcites →https://doi.org/10.4115/jla.2016.8.1openalex-snapshot
An algebraic weak factorisation system on 01-substitution sets: a constructive proof
inferredcites →https://doi.org/10.4230/lipics.csl.2016.21openalex-snapshot
Extending Homotopy Type Theory with Strict Equality
inferredcites →https://doi.org/10.4230/lipics.fscd.2019.31openalex-snapshot
Cubical Syntax for Reflection-Free Extensional Equality
inferredcites →https://doi.org/10.4230/lipics.fscd.2024.10openalex-snapshot
A general definition of dependent type theories
inferredcites →https://doi.org/10.4230/lipics.itcs.2018.56openalex-snapshot
A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma
inferredcites →https://doi.org/10.4230/lipics.types.2015.5openalex-snapshot
Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom
inferredcites →https://doi.org/10.70930/tac/a8860iydopenalex-snapshot
A C-system defined by a universe category
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-031-57262-3openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_12openalex-snapshot
Observational Equality Meets CIC
inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_13openalex-snapshot
Definitional Functoriality for Dependent (Sub)Types
inferred← citeshttps://doi.org/10.1007/s10817-022-09655-xopenalex-snapshot
Efficient Extensional Binary Tries
inferred← citeshttps://doi.org/10.1017/s0956796823000060openalex-snapshot
Normalization by evaluation for modal dependent type theory
inferred← citeshttps://doi.org/10.1145/3497775.3503951openalex-snapshot
Coq’s vibrant ecosystem for verification engineering (invited talk)
inferred← citeshttps://doi.org/10.1145/3547627openalex-snapshot
Propositional equality for gradual dependently typed programming
inferred← citeshttps://doi.org/10.1145/3547641openalex-snapshot
Staged compilation with two-level type theory
inferred← citeshttps://doi.org/10.1145/3632850openalex-snapshot
Internal and Observational Parametricity for Cubical Agda
inferred← citeshttps://doi.org/10.1145/3674647openalex-snapshot
Dependent Ghosts Have a Reflection for Free
inferred← citeshttps://doi.org/10.1145/3704843openalex-snapshot
Consistency of a Dependent Calculus of Indistinguishability
inferred← citeshttps://doi.org/10.1145/3704851openalex-snapshot
A Dependent Type Theory for Meta-programming with Intensional Analysis
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/3747506openalex-snapshot
Frex: Dependently Typed Algebraic Simplification
inferred← citeshttps://doi.org/10.1145/3747508openalex-snapshot
Normalization by Evaluation for Non-cumulativity
inferred← citeshttps://doi.org/10.1145/3747511openalex-snapshot
McTT: A Verified Kernel for a Proof Assistant
inferred← citeshttps://doi.org/10.1145/3747535openalex-snapshot
Type Theory in Type Theory using a Strictified Syntax
inferred← citeshttps://doi.org/10.1145/3776678openalex-snapshot
Handling Higher-Order Effectful Operations with Judgemental Monadic Laws
inferred← citeshttps://doi.org/10.1145/3779031.3779085openalex-snapshot
Mechanizing Synthetic Tait Computability in Istari
inferred← citeshttps://doi.org/10.1145/3779031.3779090openalex-snapshot
Can We Formalise Type Theory Intrinsically without Any Compromise? A Case Study in Cubical Agda
inferred← citeshttps://doi.org/10.70675/1423c0dez59dez4873zac7fzc6cd90f116dbopenalex-snapshot
Generic bidirectional typing in a logical framework for dependent type theories
inferred← citeshttps://doi.org/10.70675/c1efe9f4z1500z4e67zaad4zcb5531cce150openalex-snapshot
Continuité en théorie des 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.