Unification (computer science)

Known as: Unification (computing), Syntactic unification, Unification 
In logic and computer science, unification is an algorithmic process of solving equations between symbolic expressions. Depending on which… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In November 2000, the OMG made public the MDA™initiative, a particular variant of a new global trend called MDE (Model Driven… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a generalisation of first-order unification to the practically important case of equations between terms involving… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper describes a new algorithm for flow and context insensitive pointer analysis of C programs. Our studies show that the… (More)
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The modeling of spatial discontinuities for problems such as surface recovery, segmentation, image reconstruction, and optical… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Unification problems are identified with conjunctions of equations between simply typed λ-terms where free variables in the… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A meta programming language must be able to represent and manipulate such syntactic structures as programs, formulas, types, and… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Well, someone can decide by themselves what they want to do and need to do but sometimes, that kind of person will need some… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
The unification problem in f'mst-order predicate calculus is described in general terms as the solution of a system of equations… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Fay has described in 12,3] a complete T-unilication for equational theories T which possess a complete set of reductions as… (More)
Is this relevant?