J. Brown and L. Wallen. Representing unification in a logical framework. September 1995. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Proof-search in Type-theoretic Languages: An Introduction - Galmiche, Pym (2000) (1 citation) (Correct)
.... Pi by Elliot [44] and Pym [152, 143, 151] and have a significant impact in two main ways: such an algorithm allows to do automated theorem proving in LF s encoded logics but also to turn the Pi type checking algorithm into a type checking and term inference algorithm for the encoded languages [22]. But the drawbacks of nondeterminism and undecidability, inherent in the simply tyed case, were inherited by these algorithms. Therefore a deterministic, though incomplete, unification algorithm has been also proposed, which is based on a restriction of the occurrences of variables in simply ....
J. Brown and L. Wallen. Representing unification in a logical framework. September 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC