On the public citation graph
Exploring the Regular Tree Types
0 signed · 46 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/11546382_3openalex-snapshot
Epigram: Practical Programming with Dependent Types
inferredcites →https://doi.org/10.1007/3-540-48168-0_32openalex-snapshot
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
inferredcites →https://doi.org/10.1007/3-540-58085-9_78openalex-snapshot
The Alf proof editor and its proof engine
inferredcites →https://doi.org/10.1007/978-0-387-35672-3_1openalex-snapshot
Generic Programming within Dependently Typed Programming
inferredcites →https://doi.org/10.1007/978-3-540-24849-1_8openalex-snapshot
Inductive Families Need Not Store Their Indices
inferredcites →https://doi.org/10.1016/0890-5401(91)90066-bopenalex-snapshot
Telescopic mappings in typed lambda calculus
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.1017/cbo9780511569807.012openalex-snapshot
Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics
inferredcites →https://doi.org/10.1093/oso/9780198538356.001.0001openalex-snapshot
Computation and Reasoning
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/263699.263763openalex-snapshot
PolyP---a polytypic programming language extension
inferredcites →https://doi.org/10.1145/351240.351242openalex-snapshot
Regular expression types for XML
inferredcites →https://doi.org/10.5860/choice.32-5698openalex-snapshot
Computation and reasoning: a type theory for computer science
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11964681_5openalex-snapshot
A Dependently Typed Framework for Static Analysis of Program Execution Costs
inferred← citeshttps://doi.org/10.1007/978-3-540-76786-2_4openalex-snapshot
Generic Programming with Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_22openalex-snapshot
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
inferred← citeshttps://doi.org/10.1017/s0956796810000158openalex-snapshot
Formal polytypic programs and proofs
inferred← citeshttps://doi.org/10.1017/s0956796820000076openalex-snapshot
A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
inferred← citeshttps://doi.org/10.1145/1596550.1596585openalex-snapshot
Generic programming with fixed points for mutually recursive datatypes
inferred← citeshttps://doi.org/10.1145/1596614.1596616openalex-snapshot
Polytypic properties and proofs in Coq
inferred← citeshttps://doi.org/10.1145/1631687.1596585openalex-snapshot
Generic programming with fixed points for mutually recursive datatypes
inferred← citeshttps://doi.org/10.1145/1863523.1863542openalex-snapshot
Species and functors and types, oh my!
inferred← citeshttps://doi.org/10.1145/3236785openalex-snapshot
A type and scope safe universe of syntaxes with binding: their semantics and proofs
inferred← citeshttps://doi.org/10.1145/3240719.3241787openalex-snapshot
From algebra to abstract machine: a verified generic construction
inferred← citeshttps://doi.org/10.2307/j.ctv36xw0k5.7openalex-snapshot
Calculating an Exceptional Machine
inferred← citeshttps://doi.org/10.29007/l41fopenalex-snapshot
Beating the Productivity Checker Using Embedded Languages
inferred← citeshttps://doi.org/10.4204/eptcs.274.2openalex-snapshot
Formalisation in Constructive Type Theory of Barendregt's Variable Convention for Generic Structures with Binders
inferred← citeshttps://doi.org/10.4204/eptcs.43.3openalex-snapshot
Beating the Productivity Checker Using Embedded Languages
inferred← citeshttps://doi.org/10.48730/zt52-kb39openalex-snapshot
A cosmology of datatypes : reusability and dependent 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.