On the public citation graph
A verified typechecker
0 signed · 28 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_71openalex-snapshot
Checking algorithms for Pure Type Systems
inferredcites →https://doi.org/10.1016/0304-3975(90)90108-topenalex-snapshot
Type checking with universes
inferredcites →https://doi.org/10.1017/s0956796800020025openalex-snapshot
Introduction to generalized type systems
inferredcites →https://doi.org/10.1017/s0956796800020037openalex-snapshot
Modular proof of strong normalization for the calculus of constructions
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0002openalex-snapshot
Lambda Calculi with Types
inferredcites →https://doi.org/10.1093/oso/9780198538356.001.0001openalex-snapshot
Computation and Reasoning
inferredcites →https://doi.org/10.1142/0867openalex-snapshot
A Perspective in Theoretical Computer Science
inferredcites →https://doi.org/10.5860/choice.32-5698openalex-snapshot
Computation and reasoning: a type theory for computer science
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11541868_19openalex-snapshot
A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-45884-0_5openalex-snapshot
Theory of Judgments and Derivations
inferred← citeshttps://doi.org/10.1007/3-540-60579-7_8openalex-snapshot
On extensibility of proof checkers
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_33openalex-snapshot
The practice of logical frameworks
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_23openalex-snapshot
Implementing a model checker for LEGO
inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_16openalex-snapshot
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
inferred← citeshttps://doi.org/10.1007/bfb0097785openalex-snapshot
Verification of the interface of a small proof system in coq
inferred← citeshttps://doi.org/10.1007/bfb0105414openalex-snapshot
Formal verification of algorithm W: The monomorphic case
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50020-5openalex-snapshot
Proof-Assistants Using Dependent Type Systems
inferred← citeshttps://doi.org/10.1017/s0956796899003573openalex-snapshot
Type-checking injective pure type systems
inferred← citeshttps://doi.org/10.1023/a:1006294005493openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
inferred← citeshttps://doi.org/10.1109/icsm.1996.565014openalex-snapshot
Reverse engineering concurrent programs using formal modelling and analysis
inferred← citeshttps://doi.org/10.1109/lics.2008.29openalex-snapshot
Mechanizing the Metatheory of LF
inferred← citeshttps://doi.org/10.1109/wcre.1996.558918openalex-snapshot
Reverse engineering concurrent programs using formal modelling and analysis
inferred← citeshttps://doi.org/10.1145/1877714.1877721openalex-snapshot
Mechanizing the metatheory of LF
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.