On the public citation graph

Decidable and undecidable second-order unification problems

https://doi.org/10.1007/bfb0052360
0 signed · 35 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/3-540-55719-9_91openalex-snapshot
Completion of rewrite systems with membership constraints
inferredcites →https://doi.org/10.1007/3-540-61377-3_38openalex-snapshot
Simultaneous rigid E-unification is undecidable
inferredcites →https://doi.org/10.1007/3-540-61464-8_63openalex-snapshot
Linear second-order unification
inferredcites →https://doi.org/10.1007/978-1-4612-2822-6_7openalex-snapshot
Designing Unification Procedures Using Transformations: A Survey
inferredcites →https://doi.org/10.1016/0168-0072(88)90015-2openalex-snapshot
A unification algorithm for second-order monadic terms
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
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(96)00092-8openalex-snapshot
The undecidability of simultaneous rigid E-unification
inferredcites →https://doi.org/10.1070/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1109/lics.1988.5121openalex-snapshot
Rigid E-unification is NP-complete
inferredcites →https://doi.org/10.1109/lics.1998.705663openalex-snapshot
The relation between second-order unification and simultaneous rigid E-unification
inferredcites →https://doi.org/10.1145/268946.268969openalex-snapshot
Second-order unification and type inference for Church-style polymorphism
inferredcites →https://doi.org/10.1145/321752.321764openalex-snapshot
A Complete Mechanization of Second-Order Type Theory

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.1999.2797openalex-snapshot
Logic with Equality: Partisan Corroboration and Shifted Pairing
inferred← citeshttps://doi.org/10.1006/inco.2000.2877openalex-snapshot
On the Undecidability of Second-Order Unification
inferred← citeshttps://doi.org/10.1007/10721975openalex-snapshot
Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings
inferred← citeshttps://doi.org/10.1007/10721975_11openalex-snapshot
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
inferred← citeshttps://doi.org/10.1007/10721975_9openalex-snapshot
Linear Higher-Order Matching Is NP-Complete
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_14openalex-snapshot
Context Unification and Traversal Equations
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_22openalex-snapshot
Decidable Fragments of Simultaneous Rigid Reachability
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_43openalex-snapshot
Tractable and Intractable Second-Order Matching Problems
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_2openalex-snapshot
Rigid Reachability
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_5openalex-snapshot
Restricted Combinatory Unification
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_38openalex-snapshot
Regular Patterns in Second-Order Unification
inferred← citeshttps://doi.org/10.1007/978-3-540-25979-4_4openalex-snapshot
Monadic Second-Order Unification Is NP-Complete
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-70590-1_17openalex-snapshot
Nominal Unification from a Higher-Order Perspective
inferred← citeshttps://doi.org/10.1007/s00200-009-0106-4openalex-snapshot
Simplifying the signature in second-order unification
inferred← citeshttps://doi.org/10.1016/j.ic.2003.08.002openalex-snapshot
Decidability of bounded second order unification
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/s0020-0190(00)00029-6openalex-snapshot
Farmer's Theorem revisited
inferred← citeshttps://doi.org/10.1109/lics.1998.705663openalex-snapshot
The relation between second-order unification and simultaneous rigid E-unification
inferred← citeshttps://doi.org/10.1137/050645403openalex-snapshot
The Complexity of Monadic Second-Order Unification
inferred← citeshttps://doi.org/10.1145/2159531.2159532openalex-snapshot
Nominal Unification from a Higher-Order Perspective
inferred← citeshttps://doi.org/10.4230/lipics.fscd.2021.27openalex-snapshot
What's Decidable about (Atomic) Polymorphism
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.