unification with evalution

Hello net,


I am looking for literature on unification, where part of the expressions
can be generated by function applications. For example, the following two
expressions should unify:


Int -> Int
and
f(Int)


where f(x) = x -> x. The unification algorithm should also be able to
unify two applications, without actual evaluation of the expressions. For
example:


f(Int)
should unify with
T(Int)


where T is a variable. This is especially important in the context of
recursive functions.


Can anybody who knows about papers, books or other literature on this
subject please Email me. I'll summarise for the net if there is interest.


Rene.
--
Rene Dekker Delft University of Technology dekker@dutiba.tudelft.nl
--

Return to the comp.compilers page.
Search the comp.compilers archives again.