On the public citation graph
Verification of the interface of a small proof system in coq
0 signed · 24 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-58085-9_82openalex-snapshot
Closure under alpha-conversion
inferredcites →https://doi.org/10.1007/3-540-62688-3_32openalex-snapshot
A module calculus for pure type systems
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/s0747-7171(06)80007-6openalex-snapshot
Synthesis of ML programs in the system Coq
inferredcites →https://doi.org/10.1017/s0956796800020037openalex-snapshot
Modular proof of strong normalization for the calculus of constructions
inferredcites →https://doi.org/10.1145/199448.199476openalex-snapshot
Applicative functors and fully transparent higher-order modules
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-319-00966-7_1openalex-snapshot
Foundations of Mathematics from the Perspective of Computer Verification
inferred← citeshttps://doi.org/10.1007/s10817-011-9230-5openalex-snapshot
A Solution to the PoplMark Challenge Based on de Bruijn Indices
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.1016/j.entcs.2009.09.005openalex-snapshot
Convincing Proofs for Program Certification
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.008openalex-snapshot
Mathematics in the age of the Turing machine
inferred← citeshttps://doi.org/10.1017/s0956796815000210openalex-snapshot
Pure type systems with explicit substitutions
inferred← citeshttps://doi.org/10.1098/rsta.2005.1650openalex-snapshot
The challenge of computer mathematics
inferred← citeshttps://doi.org/10.1109/lics.2011.37openalex-snapshot
CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory
inferred← citeshttps://doi.org/10.1145/2220336.2220346openalex-snapshot
Generating Invariant-Based Certificates for Embedded Systems
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.70675/a0401fc4z9e58z488ez84bezd17c69085acbopenalex-snapshot
Interoperability between proof systems using the logical framework Dedukti
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.