On the public citation graph
Inverting inductively defined relations in LEGO
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-60579-7_3openalex-snapshot
Codifying guarded definitions with recursive schemes
inferredcites →https://doi.org/10.1007/3-540-61629-2_33openalex-snapshot
Inductively defined relations: A brief tutorial extended abstract
inferredcites →https://doi.org/10.1007/3-540-61780-9_64openalex-snapshot
Automating inversion of inductive predicates in Coq
inferredcites →https://doi.org/10.1007/bfb0013605openalex-snapshot
A finitary version of the calculus of partial inductive definitions
inferredcites →https://doi.org/10.1016/0304-3975(91)90028-zopenalex-snapshot
Author index volume 86 (1991)
inferredcites →https://doi.org/10.1016/s0304-3975(06)80007-1openalex-snapshot
Partial inductive definitions
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.48456/tr-265openalex-snapshot
Reasoning with inductively defined relations in the HOL theorem prover
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/11617990_12openalex-snapshot
A Few Constructions on Constructors
inferred← citeshttps://doi.org/10.1007/11780274_27openalex-snapshot
Eliminating Dependent Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_5openalex-snapshot
Builtin Types Viewed as Inductive Families
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_10openalex-snapshot
Nominal Inversion Principles
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_29openalex-snapshot
Equations: A Dependent Pattern-Matching Compiler
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_25openalex-snapshot
Handcrafted Inversions Made Operational on Operational Semantics
inferred← citeshttps://doi.org/10.1017/s095679681800014xopenalex-snapshot
Proof-relevant unification: Dependent pattern matching with only the axioms of your type theory
inferred← citeshttps://doi.org/10.1023/a:1006294005493openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
inferred← citeshttps://doi.org/10.1145/3018610.3018612openalex-snapshot
Lifting proof-relevant unification to higher dimensions
inferred← citeshttps://doi.org/10.1561/2500000045openalex-snapshot
QED at Large: A Survey of Engineering of Formally Verified Software
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.