On the public citation graph
Elaborating dependent (co)pattern matching
0 signed · 43 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/11780274_27openalex-snapshot
Eliminating Dependent Pattern Matching
inferredcites →https://doi.org/10.1007/978-3-319-21401-6_26openalex-snapshot
The Lean Theorem Prover (System Description)
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.1007/978-3-642-14052-5_29openalex-snapshot
Equations: A Dependent Pattern-Matching Compiler
inferredcites →https://doi.org/10.1017/s095679681300018xopenalex-snapshot
Idris, a general-purpose dependently typed programming language: Design and implementation
inferredcites →https://doi.org/10.1093/logcom/2.3.297openalex-snapshot
Logic Programming with Focusing Proofs in Linear Logic
inferredcites →https://doi.org/10.1093/oso/9780198501275.001.0001openalex-snapshot
Twenty Five Years of Constructive Type Theory
inferredcites →https://doi.org/10.1109/lics.2008.48openalex-snapshot
Focusing on Binding and Computation
inferredcites →https://doi.org/10.1145/1292597.1292606openalex-snapshot
Pattern matching coverage checking with dependent types using set approximations
inferredcites →https://doi.org/10.1145/1328438.1328482openalex-snapshot
Focusing and higher-order abstract syntax
inferredcites →https://doi.org/10.1145/141471.141499openalex-snapshot
Compiling lazy pattern matching
inferredcites →https://doi.org/10.1145/2500365.2500591openalex-snapshot
Wellfounded recursion with copatterns
inferredcites →https://doi.org/10.1145/2951913openalex-snapshot
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming
inferredcites →https://doi.org/10.1145/2951913.2951917openalex-snapshot
Unifiers as equivalences: proof-relevant unification of dependently typed data
inferredcites →https://doi.org/10.1145/3018610.3018612openalex-snapshot
Lifting proof-relevant unification to higher dimensions
inferredcites →https://doi.org/10.1145/3022670.2951917openalex-snapshot
Unifiers as equivalences: proof-relevant unification of dependently typed data
inferredcites →https://doi.org/10.1145/800055.802037openalex-snapshot
Compiling a functional language
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-030-45231-5_14openalex-snapshot
Constructing Infinitary Quotient-Inductive Types
inferred← citeshttps://doi.org/10.1007/978-3-031-29082-4_3openalex-snapshot
Curiously Empty Intersection of Proof Engineering and Computational Sciences
inferred← citeshttps://doi.org/10.1007/978-3-031-99751-8_10openalex-snapshot
CoScheme: Compositional Copatterns in Scheme
inferred← citeshttps://doi.org/10.1017/s0956796819000182openalex-snapshot
Elaborating dependent (co)pattern matching: No pattern left behind
inferred← citeshttps://doi.org/10.1017/s0956796821000034openalex-snapshot
Cubical Agda: A dependently typed programming language with univalence and higher inductive types
inferred← citeshttps://doi.org/10.1145/3290316openalex-snapshot
Definitional proof-irrelevance without K
inferred← citeshttps://doi.org/10.1145/3341690openalex-snapshot
Equations reloaded: high-level dependently-typed functional programming and proving in Coq
inferred← citeshttps://doi.org/10.1145/3341691openalex-snapshot
Cubical agda: a dependently typed programming language with univalence and higher inductive types
inferred← citeshttps://doi.org/10.1145/3408989openalex-snapshot
Lower your guards: a compositional pattern-match coverage checker
inferred← citeshttps://doi.org/10.1145/3471875.3472991openalex-snapshot
A simpler encoding of indexed types
inferred← citeshttps://doi.org/10.1145/3586048openalex-snapshot
Live Pattern Matching with Typed Holes
inferred← citeshttps://doi.org/10.1145/3759427.3760362openalex-snapshot
Controlling Copatterns: There and Back Again
inferred← citeshttps://doi.org/10.1145/3798248openalex-snapshot
PLEX: Normalization for Refinement Types
inferred← citeshttps://doi.org/10.17863/cam.47998openalex-snapshot
Typal Heterogeneous Equality Types
inferred← citeshttps://doi.org/10.17863/cam.49284openalex-snapshot
Constructing Infinitary Quotient-Inductive Types
inferred← citeshttps://doi.org/10.48550/arxiv.2105.14840openalex-snapshot
Elegant elaboration with function invocation
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.