On the public citation graph
Linear interpolation for the higher-order matching problem
0 signed · 25 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/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferredcites →https://doi.org/10.1016/0168-0072(94)90083-3openalex-snapshot
Third order matching is decidable
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0002openalex-snapshot
Lambda Calculi with Types
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11787006_30openalex-snapshot
A Game-Theoretic Approach to Deciding Higher-Order Matching
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_24openalex-snapshot
A Decidable Variant of Higher Order Matching
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_2openalex-snapshot
Higher Order Unification 30 Years Later
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_6openalex-snapshot
Complexity of the Higher Order Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-25938-1_12openalex-snapshot
Deterministic Higher-Order Patterns for Program Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_1openalex-snapshot
Games, Automata and Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_23openalex-snapshot
Verification of Higher-Order Computation: A Game-Semantic Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_1openalex-snapshot
Introduction to Decidability of Higher-Order Matching
inferred← citeshttps://doi.org/10.1007/bfb0028013openalex-snapshot
Higher-order matching and tree automata
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50018-7openalex-snapshot
Higher-Order Unification and Matching
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.021openalex-snapshot
Model-Checking Games for Typed λ-Calculi
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.12.008openalex-snapshot
Deterministic second-order patterns
inferred← citeshttps://doi.org/10.1017/s0960129500003108openalex-snapshot
Decidability of fourth-order matching
inferred← citeshttps://doi.org/10.1093/jigpal/11.1.51openalex-snapshot
Higher Order β Matching is Undecidable
inferred← citeshttps://doi.org/10.1109/lics.2007.23openalex-snapshot
Higher-Order Matching, Games and Automata
inferred← citeshttps://doi.org/10.2168/lmcs-5(3:2)2009openalex-snapshot
Decidability of higher-order matching
inferred← citeshttps://doi.org/10.7146/brics.v13i12.21917openalex-snapshot
Higher-Order Beta Matching with Solutions in Long Beta-Eta Normal Form
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.