On the public citation graph
Higher-order matching and tree automata
0 signed · 41 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-61254-8_28openalex-snapshot
Third-order matching in the polymorphic lambda calculus
inferredcites →https://doi.org/10.1007/bfb0014069openalex-snapshot
Third-order matching in the presence of type constructors
inferredcites →https://doi.org/10.1007/bfb0030617openalex-snapshot
Linear interpolation for the higher-order matching problem
inferredcites →https://doi.org/10.1016/0020-0190(94)00130-8openalex-snapshot
Haskell overloading is DEXPTIME-complete
inferredcites →https://doi.org/10.1016/0168-0072(94)90083-3openalex-snapshot
Third order matching is decidable
inferredcites →https://doi.org/10.1016/0304-3975(81)90040-2openalex-snapshot
The undecidability of the second-order unification problem
inferredcites →https://doi.org/10.1016/0304-3975(93)90175-sopenalex-snapshot
The undecidability of pattern matching in calculi where primitive recursive functions are representable
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1093/logcom/3.3.287openalex-snapshot
A Complete Proof Synthesis Method for the Cube of Type Systems
inferredcites →https://doi.org/10.2307/2274588openalex-snapshot
J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2000.2877openalex-snapshot
On the Undecidability of Second-Order Unification
inferred← citeshttps://doi.org/10.1007/10705424_14openalex-snapshot
Higher Order Matching for Program Transformation
inferred← citeshttps://doi.org/10.1007/11787006_30openalex-snapshot
A Game-Theoretic Approach to Deciding Higher-Order Matching
inferred← citeshttps://doi.org/10.1007/11787006_31openalex-snapshot
Descriptive and Relative Completeness of Logics for Higher-Order Functions
inferred← citeshttps://doi.org/10.1007/3-540-44978-7_13openalex-snapshot
Higher-Order Pattern Matching for Automatically Applying Fusion Transformations
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-45793-3_32openalex-snapshot
Higher-Order Positive Set Constraints
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-32254-2_10openalex-snapshot
Decidable Variants of Higher-Order Unification
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_41openalex-snapshot
Decidability of Arity-Bounded Higher-Order Matching
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-642-02261-6_5openalex-snapshot
Recognizability in the Simply Typed Lambda-Calculus
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/s00224-004-1151-9openalex-snapshot
The Complexity of Linear and Stratified Context Matching Problems
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.ic.2011.06.003openalex-snapshot
On the expressive power of schemes
inferred← citeshttps://doi.org/10.1016/j.jsc.2003.09.002openalex-snapshot
Tractable and intractable second-order matching problems
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.01.005openalex-snapshot
Decidability of bounded higher-order unification
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00402-3openalex-snapshot
Higher-order matching for program transformation
inferred← citeshttps://doi.org/10.1017/s0960129500003108openalex-snapshot
Decidability of fourth-order matching
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.2197/ipsjtrans.2.71openalex-snapshot
Recognizability of Redexes for Higher-Order Rewrite Systems
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.