On the public citation graph

Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study

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.
Claim with ORCID
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.
See reference health

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/11780274_27openalex-snapshot
Eliminating Dependent Pattern Matching
inferredcites →https://doi.org/10.1007/978-3-319-08970-6openalex-snapshot
Interactive Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-319-08970-6_24openalex-snapshot
Compositional Computational Reflection
inferredcites →https://doi.org/10.1007/978-3-642-14052-5_29openalex-snapshot
Equations: A Dependent Pattern-Matching Compiler
inferredcites →https://doi.org/10.1016/0890-5401(91)90053-5openalex-snapshot
Finitely stratified polymorphism
inferredcites →https://doi.org/10.17077/etd.vibd09toopenalex-snapshot
The semantic analysis of advanced programming languages

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-031-91118-7_10openalex-snapshot
Stratified Type Theory
inferred← citeshttps://doi.org/10.1017/s0956796816000174openalex-snapshot
Eliminating dependent pattern matching without K
inferred← citeshttps://doi.org/10.1145/2841316openalex-snapshot
Verified Functional Programming in Agda
inferred← citeshttps://doi.org/10.1145/2841316.2841317openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/2841316.2841318openalex-snapshot
Functional Programming with the Booleans
inferred← citeshttps://doi.org/10.1145/2841316.2841319openalex-snapshot
Introduction to Constructive Proof
inferred← citeshttps://doi.org/10.1145/2841316.2841320openalex-snapshot
Natural Numbers
inferred← citeshttps://doi.org/10.1145/2841316.2841321openalex-snapshot
Lists
inferred← citeshttps://doi.org/10.1145/2841316.2841322openalex-snapshot
Internal Verification
inferred← citeshttps://doi.org/10.1145/2841316.2841323openalex-snapshot
Type-Level Computation
inferred← citeshttps://doi.org/10.1145/2841316.2841324openalex-snapshot
Generating Agda Parsers with gratr
inferred← citeshttps://doi.org/10.1145/2841316.2841325openalex-snapshot
A Case Study: Huffman Encoding and Decoding
inferred← citeshttps://doi.org/10.1145/2841316.2841326openalex-snapshot
Reasoning About Termination
inferred← citeshttps://doi.org/10.1145/2841316.2841327openalex-snapshot
Intuitionistic Logic and Kripke Semantics
inferred← citeshttps://doi.org/10.1145/2841316.2841328openalex-snapshot
Quick Guide to Symbols
inferred← citeshttps://doi.org/10.1145/3018610.3018615openalex-snapshot
The HoTT library: a formalization of homotopy type theory in Coq
inferred← citeshttps://doi.org/10.1145/3341690openalex-snapshot
Equations reloaded: high-level dependently-typed functional programming and proving in Coq
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.