On the public citation graph
Decidability of conversion for type theory in type theory
0 signed · 88 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/3-540-45842-5_8openalex-snapshot
A Kripke-Style Model for the Admissibility of Structural Rules
inferredcites →https://doi.org/10.1007/3-540-60579-7_2openalex-snapshot
A short and flexible proof of strong normalization for the calculus of constructions
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
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/s0168-0072(02)00096-9openalex-snapshot
Induction–recursion and initial algebras
inferredcites →https://doi.org/10.1017/cbo9780511569807.011openalex-snapshot
An algorithm for testing conversion in type theory
inferredcites →https://doi.org/10.1017/s0956796816000022openalex-snapshot
Well-founded recursion with copatterns and sized types
inferredcites →https://doi.org/10.1109/lics.2007.33openalex-snapshot
Normalization by Evaluation for Martin-Löf Type Theory with Typed Equality Judgements
inferredcites →https://doi.org/10.1109/lics.2013.29openalex-snapshot
Type-Based Productivity of Stream Definitions in the Calculus of Constructions
inferredcites →https://doi.org/10.1145/1042038.1042041openalex-snapshot
On equivalence and canonical forms in the LF type theory
inferredcites →https://doi.org/10.1145/237721.240882openalex-snapshot
Proving the correctness of reactive systems using sized types
inferredcites →https://doi.org/10.1145/2837614.2837638openalex-snapshot
Type theory in type theory using quotient inductive types
inferredcites →https://doi.org/10.2168/lmcs-11(1:13)2015openalex-snapshot
Positive Inductive-Recursive Definitions
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.2307/2586554openalex-snapshot
A general formulation of simultaneous inductive-recursive definitions in type theory
inferredcites →https://doi.org/10.23638/lmcs-13(4:1)2017openalex-snapshot
Normalisation by Evaluation for Type Theory, in Type Theory
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-33636-3_12openalex-snapshot
Shallow Embedding of Type Theory is Morally Correct
inferred← citeshttps://doi.org/10.1007/978-3-030-52200-1_25openalex-snapshot
Equality Checking for General Type Theories in Andromeda 2
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_7openalex-snapshot
slepice: Towards a Verified Implementation of Type Theory in 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_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/978-3-031-57262-3_6openalex-snapshot
Generic bidirectional typing for dependent type theories
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_4openalex-snapshot
In Cantor Space No One Can Hear You Stream
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_4openalex-snapshot
Building a Correct-by-Construction Type Checker for a Dependently Typed Core Language
inferred← citeshttps://doi.org/10.1017/s0956796819000170openalex-snapshot
POPLMark reloaded: Mechanizing proofs by logical relations
inferred← citeshttps://doi.org/10.1017/s0956796821000034openalex-snapshot
Cubical Agda: A dependently typed programming language with univalence and higher inductive types
inferred← citeshttps://doi.org/10.1017/s0956796822000120openalex-snapshot
Is sized typing for Coq practical?
inferred← citeshttps://doi.org/10.1017/s0956796823000060openalex-snapshot
Normalization by evaluation for modal dependent type theory
inferred← citeshttps://doi.org/10.1109/lics.2019.8785683openalex-snapshot
A Type Theory for Defining Logics and Proofs
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470667openalex-snapshot
Internal ∞-Categorical Models of Dependent Type Theory : Towards 2LTT Eating HoTT
inferred← citeshttps://doi.org/10.1145/3290316openalex-snapshot
Definitional proof-irrelevance without K
inferred← citeshttps://doi.org/10.1145/3293880.3294095openalex-snapshot
Eliminating Reflection from Type Theory: To the Legacy of Martin Hofmann
inferred← citeshttps://doi.org/10.1145/3341691openalex-snapshot
Cubical agda: a dependently typed programming language with univalence and higher inductive types
inferred← citeshttps://doi.org/10.1145/3371076openalex-snapshot
Coq Coq correct! verification of type checking and erasure for Coq, in Coq
inferred← citeshttps://doi.org/10.1145/3408983openalex-snapshot
Elaboration with first-class implicit function types
inferred← citeshttps://doi.org/10.1145/3434341openalex-snapshot
The taming of the rew: a type theory with computational assumptions
inferred← citeshttps://doi.org/10.1145/3495528openalex-snapshot
Gradualizing the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1145/3547641openalex-snapshot
Staged compilation with two-level type theory
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/3661814.3662070openalex-snapshot
“Upon This Quote I Will Build My Church Thesis”
inferred← citeshttps://doi.org/10.1145/3661814.3662104openalex-snapshot
Separating Markov's Principles
inferred← citeshttps://doi.org/10.1145/3678000openalex-snapshot
Proceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3678000.3678201openalex-snapshot
Intrinsically Typed Syntax, a Logical Relation, and the Scourge of the Transfer Lemma
inferred← citeshttps://doi.org/10.1145/3704843openalex-snapshot
Consistency of a Dependent Calculus of Indistinguishability
inferred← citeshttps://doi.org/10.1145/3704844openalex-snapshot
BiSikkel: A Multimode Logical Framework in Agda
inferred← citeshttps://doi.org/10.1145/3704851openalex-snapshot
A Dependent Type Theory for Meta-programming with Intensional Analysis
inferred← citeshttps://doi.org/10.1145/3706056openalex-snapshot
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq
inferred← citeshttps://doi.org/10.1145/3715095openalex-snapshot
Generic Bidirectional Typing for Dependent Type Theories
inferred← citeshttps://doi.org/10.1145/3715707openalex-snapshot
‘Upon This Quote I Will Build My Church Thesis’
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/3759538.3759653openalex-snapshot
A Formalization of Opaque Definitions for a Dependent Type Theory
inferred← citeshttps://doi.org/10.1145/3776645openalex-snapshot
Normalisation for First-Class Universe Levels
inferred← citeshttps://doi.org/10.1145/3776672openalex-snapshot
Algorithmic Conversion with Surjective Pairing: A Syntactic and Untyped Approach
inferred← citeshttps://doi.org/10.1145/3776685openalex-snapshot
Canonicity for Indexed Inductive-Recursive Types
inferred← citeshttps://doi.org/10.1145/3776695openalex-snapshot
A Lazy, Concurrent Convertibility Checker
inferred← citeshttps://doi.org/10.1145/3779031.3779085openalex-snapshot
Mechanizing Synthetic Tait Computability in Istari
inferred← citeshttps://doi.org/10.1145/3779031.3779087openalex-snapshot
A Certifying Proof Assistant for Synthetic Mathematics in Lean
inferred← citeshttps://doi.org/10.1145/3808322openalex-snapshot
Nested Inductive Types: Justified and Usable Nested Inductive Types in Lean and Rocq
inferred← citeshttps://doi.org/10.1145/3828677openalex-snapshot
On Recursion in Graded Modal Type Theory
inferred← citeshttps://doi.org/10.15476/elte.2022.070openalex-snapshot
Type-Theoretic Signatures for Algebraic Theories and Inductive Types
inferred← citeshttps://doi.org/10.23638/lmcs-16(1:10)2020openalex-snapshot
Signatures and Induction Principles for Higher Inductive-Inductive Types
inferred← citeshttps://doi.org/10.4204/eptcs.337.2openalex-snapshot
Touring the MetaCoq Project (Invited Paper)
inferred← citeshttps://doi.org/10.4204/eptcs.449.15openalex-snapshot
A Machine-checked Proof of Consistency for Impredicative Pure Type Systems
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:17)2022openalex-snapshot
An extensible equality checking algorithm for dependent type theories
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:43)2022openalex-snapshot
A Cubical Language for Bishop Sets
inferred← citeshttps://doi.org/10.48550/arxiv.2001.07655openalex-snapshot
Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type Theory
inferred← citeshttps://doi.org/10.48550/arxiv.2009.01883openalex-snapshot
Internal $\infty$-Categorical Models of Dependent Type Theory: Towards 2LTT Eating HoTT
inferred← citeshttps://doi.org/10.48550/arxiv.2102.06513openalex-snapshot
Complete Bidirectional Typing for the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.48550/arxiv.2107.07670openalex-snapshot
Touring the MetaCoq Project (Invited Paper)
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
inferred← citeshttps://doi.org/10.70675/edb2bdbcz9127z4457zb323z5bddb713a299openalex-snapshot
Une théorie des types avec insignifiance des preuves définitionnelle
inferred← citeshttps://doi.org/10.70675/f3c96514z4373z4f99z8b3fzb1b41307d558openalex-snapshot
Formalisation et Méta-Théorie de la 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.