登入選單
返回Google圖書搜尋
An Approach to Handling Polymorphic Types in Higher Order Unification
註釋"The higher order unification procedure as formulated by Huet unifies terms in the simple theory of types. In this language types are expressed in a very weak language (no quantification, "->" being the only operator). In many applications a stronger type-system is desirable. Lambda Prolog, e.g. uses a type system that is in some ways similar to that of ML. This type-system uses implicitly universally quantified variables in the type-expressions. It is not trivial to reformulate the higher order unification procedure for such a theory