On the public citation graph

Efficient unification over infinite terms

https://doi.org/10.1007/bf03037057
0 signed · 52 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/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1016/0022-0000(78)90043-0openalex-snapshot
Linear unification
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/357162.357168openalex-snapshot
High-Level Language Implications of the Proposed IEEE Floating-Point Standard
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jsco.1998.0248openalex-snapshot
Lazy Linear Combinatorial Unification
inferred← citeshttps://doi.org/10.1007/11799573_32openalex-snapshot
Solving First-Order Constraints in the Theory of the Evaluated Trees
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_54openalex-snapshot
Incremental algorithms for constraint solving and entailment over rational trees
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_80openalex-snapshot
Graph unification and matching
inferred← citeshttps://doi.org/10.1007/978-3-030-29007-8_19openalex-snapshot
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_16openalex-snapshot
Model Completeness for Rational Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-94460-9_13openalex-snapshot
Fuzzy Unification and Generalization of First-Order Terms over Similar Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-33461-3_13openalex-snapshot
Shuly Wintner
inferred← citeshttps://doi.org/10.1007/978-3-540-73817-6_7openalex-snapshot
Solving First-Order Constraints in the Theory of the Evaluated Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_10openalex-snapshot
An Approach to Parallel Unification Using Transputers
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_2openalex-snapshot
Theoretical Issues of Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_3openalex-snapshot
Unification — Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-94-011-2562-8_13openalex-snapshot
The Wivenhoe Computational Model: In Search of More Parallelisms
inferred← citeshttps://doi.org/10.1007/978-94-011-4122-2_5openalex-snapshot
Isomorphism, Unification, and Term-Rewriting Systems
inferred← citeshttps://doi.org/10.1007/bf03037466openalex-snapshot
On parallel unification for Prolog
inferred← citeshttps://doi.org/10.1007/bf03038307openalex-snapshot
Moded flat GHC and its message-oriented implementation technique
inferred← citeshttps://doi.org/10.1007/bfb0020799openalex-snapshot
Average case analysis of unification algorithms
inferred← citeshttps://doi.org/10.1007/s41965-021-00076-0openalex-snapshot
An efficient labelled nested multiset unification algorithm
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90208-bopenalex-snapshot
Average-case analysis of unification algorithms
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90031-0openalex-snapshot
1983–1993: The wonder years of sequential Prolog implementation
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90044-2openalex-snapshot
Records for logic programming
inferred← citeshttps://doi.org/10.1016/b0-08-044854-2/00887-7openalex-snapshot
Unification: Computational Issues
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.02.013openalex-snapshot
Rational Unification in 28 Characters
inferred← citeshttps://doi.org/10.1016/j.fss.2019.03.019openalex-snapshot
Fuzzy lattice operations on first-order terms over signatures with similar constructors: A constraint-based approach
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.013openalex-snapshot
Theory propagation and reification
inferred← citeshttps://doi.org/10.1016/s0743-1066(00)00009-1openalex-snapshot
Pair-sharing over rational trees
inferred← citeshttps://doi.org/10.1017/cbo9781139013574openalex-snapshot
Unification Grammars
inferred← citeshttps://doi.org/10.1017/s1471068402001485openalex-snapshot
Efficient groundness analysis in Prolog
inferred← citeshttps://doi.org/10.1017/s1471068406002997openalex-snapshot
Decomposable theories
inferred← citeshttps://doi.org/10.1017/s1471068407003171openalex-snapshot
Theory of finite or infinite trees revisited
inferred← citeshttps://doi.org/10.1017/s1471068421000211openalex-snapshot
Analysis and Transformation of Constrained Horn Clauses for Program Verification
inferred← citeshttps://doi.org/10.1145/1141277.1141280openalex-snapshot
Solving first-order constraints in the theory of finite or infinite trees
inferred← citeshttps://doi.org/10.1145/146585.146624openalex-snapshot
Efficient dataflow analysis of logic programs
inferred← citeshttps://doi.org/10.1145/2505879.2505901openalex-snapshot
Theory propagation and rational-trees
inferred← citeshttps://doi.org/10.1145/2535838.2535856openalex-snapshot
Closed type families with overlapping equations
inferred← citeshttps://doi.org/10.1145/2578855.2535856openalex-snapshot
Closed type families with overlapping equations
inferred← citeshttps://doi.org/10.1145/2837614.2837633openalex-snapshot
From MinX to MinC: semantics-driven decompilation of recursive datatypes
inferred← citeshttps://doi.org/10.1145/2914770.2837633openalex-snapshot
From MinX to MinC: semantics-driven decompilation of recursive datatypes
inferred← citeshttps://doi.org/10.1145/3704265openalex-snapshot
A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns
inferred← citeshttps://doi.org/10.1145/62029.62030openalex-snapshot
Unification: a multidisciplinary survey
inferred← citeshttps://doi.org/10.1184/r1/6490841openalex-snapshot
ALE : the attribute logic engine user's guide, version 2.0.1
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09909openalex-snapshot
Coinduction Plain and Simple
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0105020openalex-snapshot
A Logical Framework for Convergent Infinite Computations
inferred← citeshttps://doi.org/10.5802/roia.75openalex-snapshot
Contraintes du premier ordre dans l’algèbre des arbres finis ou infinis
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.