On the public citation graph
Coq Coq correct! verification of type checking and erasure for Coq, in Coq
0 signed · 87 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-319-08970-6_32openalex-snapshot
Universe Polymorphism in Coq
inferredcites →https://doi.org/10.1007/978-3-319-22102-1_24openalex-snapshot
Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_35openalex-snapshot
A Verified Compiler from Isabelle/HOL to CakeML
inferredcites →https://doi.org/10.1007/978-3-319-94821-8_2openalex-snapshot
Towards Certified Meta-Programming with Typed Template-Coq
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/s0747-7171(89)80045-8openalex-snapshot
Parallel reductions in λ-calculus
inferredcites →https://doi.org/10.1017/s0956796813000282openalex-snapshot
Proof-producing translation of higher-order logic into pure and stateful ML
inferredcites →https://doi.org/10.1109/lics.2017.8005113openalex-snapshot
An effectful way to eliminate addiction to dependence
inferredcites →https://doi.org/10.1145/2756553openalex-snapshot
A New Approach to Incremental Cycle Detection and Related Problems
inferredcites →https://doi.org/10.1145/3158111openalex-snapshot
Decidability of conversion for type theory in type theory
inferredcites →https://doi.org/10.1145/3167089openalex-snapshot
Œuf: minimizing the Coq extraction TCB
inferredcites →https://doi.org/10.1145/3290316openalex-snapshot
Definitional proof-irrelevance without K
inferredcites →https://doi.org/10.1145/3341690openalex-snapshot
Equations reloaded: high-level dependently-typed functional programming and proving in Coq
inferredcites →https://doi.org/10.4230/lipics.itp.2019.17openalex-snapshot
A Certifying Extraction with Time Bounds from Coq to Call-By-Value Lambda Calculus
inferredcites →https://doi.org/10.4230/lipics.itp.2019.18openalex-snapshot
Formal Proof and Analysis of an Incremental Cycle Detection Algorithm
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-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-030-75267-5_3openalex-snapshot
On the Conciliation of Traditional and Computer-Assisted Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_6openalex-snapshot
Isabelle’s Metalogic: Formalization and Proof Checker
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_8openalex-snapshot
The Trusted Computing Base of the CompCert Verified Compiler
inferred← citeshttps://doi.org/10.1007/978-3-031-29082-4_3openalex-snapshot
Curiously Empty Intersection of Proof Engineering and Computational Sciences
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_16openalex-snapshot
End-to-End Mechanized Proof of a JIT-Accelerated eBPF Virtual Machine for IoT
inferred← citeshttps://doi.org/10.1007/978-3-031-75380-0_16openalex-snapshot
SyDPaCC: A Framework for the Development of Verified Scalable Parallel Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-87054-5_12openalex-snapshot
Formally Verified Verifiable Group Generators
inferred← citeshttps://doi.org/10.1007/978-3-032-11176-0_13openalex-snapshot
Lean4Less: Eliminating Definitional Equalities from Lean via an Extensional-to-Intensional Translation
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.1007/s10009-022-00690-yopenalex-snapshot
Verified Propagation Redundancy and Compositional UNSAT Checking in CakeML
inferred← citeshttps://doi.org/10.1007/s10817-022-09648-wopenalex-snapshot
A Formalization and Proof Checker for Isabelle’s Metalogic
inferred← citeshttps://doi.org/10.1007/s10817-024-09705-6openalex-snapshot
Towards a Scalable Proof Engine: A Performant Prototype Rewriting Primitive for Coq
inferred← citeshttps://doi.org/10.1007/s10817-025-09743-8openalex-snapshot
Candle: A Verified Implementation of HOL Light (Extended Version)
inferred← citeshttps://doi.org/10.1007/s10817-026-09753-0openalex-snapshot
The Rewster: Type Preserving Rewrite Rules for the Rocq Prover
inferred← citeshttps://doi.org/10.1017/s0956796822000077openalex-snapshot
Extracting functional programs from Coq, in Coq
inferred← citeshttps://doi.org/10.1017/s0956796822000120openalex-snapshot
Is sized typing for Coq practical?
inferred← citeshttps://doi.org/10.1109/access.2025.3527158openalex-snapshot
Formal Verification of ERC-Based Smart Contracts: A Systematic Literature Review
inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11401967openalex-snapshot
PACE: Policy Adaptation for Cybersecurity Events Through Formal Verification of LLM-Generated Firewall Policies
inferred← citeshttps://doi.org/10.1109/compsac51774.2021.00176openalex-snapshot
A Framework for the Composition of IoT and CPS Capabilities
inferred← citeshttps://doi.org/10.1109/formalise58978.2023.00021openalex-snapshot
A Verified UAV Flight Plan Generator
inferred← citeshttps://doi.org/10.1142/9789811236488_0008openalex-snapshot
The Braga Method: Extracting Certified Algorithms from Complex Recursive Schemes in Coq
inferred← citeshttps://doi.org/10.1145/3373718.3394792openalex-snapshot
A calculus of expandable stores
inferred← citeshttps://doi.org/10.1145/3429979openalex-snapshot
The Marriage of Univalence and Parametricity
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/3473591openalex-snapshot
Compositional optimizations for CertiCoq
inferred← citeshttps://doi.org/10.1145/3486609.3487201openalex-snapshot
Extracting the power of dependent types
inferred← citeshttps://doi.org/10.1145/3495528openalex-snapshot
Gradualizing the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1145/3573105.3575685openalex-snapshot
Formalising Decentralised Exchanges in Coq
inferred← citeshttps://doi.org/10.1145/3611643.3616290openalex-snapshot
Engineering a Formally Verified Automated Bug Finder
inferred← citeshttps://doi.org/10.1145/3632916openalex-snapshot
Securing Verified IO Programs Against Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3656379openalex-snapshot
Verified Extraction from Coq to OCaml
inferred← citeshttps://doi.org/10.1145/3674647openalex-snapshot
Dependent Ghosts Have a Reflection for Free
inferred← citeshttps://doi.org/10.1145/3703595.3705879openalex-snapshot
CertiCoq-Wasm: A Verified WebAssembly Backend for CertiCoq
inferred← citeshttps://doi.org/10.1145/3704860openalex-snapshot
A Verified Foreign Function Interface between Coq and C
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/3706056openalex-snapshot
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq
inferred← citeshttps://doi.org/10.1145/3735452.3735528openalex-snapshot
JetCert: A Self-Adaptive Compilation Framework for Fast and Safe Code Execution
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/3747522openalex-snapshot
SecRef*: Securely Sharing Mutable References between Verified and Unverified Code in F*
inferred← citeshttps://doi.org/10.29007/413dopenalex-snapshot
A Mechanised Semantics for HOL with Ad-hoc Overloading
inferred← citeshttps://doi.org/10.33842/2313-125x-2023-23-11-20openalex-snapshot
TECHNOLOGIES OF INFERENCE IN SOFTWARE SYSTEMS
inferred← citeshttps://doi.org/10.3390/math8091573openalex-snapshot
Coinductive Natural Semantics for Compiler Verification in Coq
inferred← citeshttps://doi.org/10.4204/eptcs.337.2openalex-snapshot
Touring the MetaCoq Project (Invited Paper)
inferred← citeshttps://doi.org/10.4204/eptcs.402.7openalex-snapshot
Embedding Differential Dynamic Logic in PVS
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.21openalex-snapshot
Church's thesis and related axioms in Coq's type theory
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.48550/arxiv.2006.15135openalex-snapshot
Generating induction principles and subterm relations for inductive types using MetaCoq
inferred← citeshttps://doi.org/10.48550/arxiv.2101.09655openalex-snapshot
Relational Type Theory (All Proofs)
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.2105.10819openalex-snapshot
Choosing is Losing: How to combine the benefits of shallow and deep embeddings through reflection
inferred← citeshttps://doi.org/10.48550/arxiv.2107.07670openalex-snapshot
Touring the MetaCoq Project (Invited Paper)
inferred← citeshttps://doi.org/10.48550/arxiv.2108.10259openalex-snapshot
The Multiverse: Logical Modularity for Proof Assistants
inferred← citeshttps://doi.org/10.70675/0a3f5dbaza45az464dz8686z8c853cf21497openalex-snapshot
Prétraitement compositionnel en Coq
inferred← citeshttps://doi.org/10.70675/95fceee8z06bbz48ccz8b06z87fb9e672ea8openalex-snapshot
Proof-oriented domain-specific language design for high-assurance software
inferred← citeshttps://doi.org/10.70675/9f1bc1e0z9d8az4296z8ee8zdcd60f5ddd06openalex-snapshot
Higher-Order Confluence and Universe Embedding in the Logical Framework
inferred← citeshttps://doi.org/10.70675/a56b1bcez2a44z4e4az8e69zeec71287c91copenalex-snapshot
Toward a Framework for the Composition and Assessment of IoT and CPS Capabilities : Smart Cities Applications
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.