Infinite set unification with application to categorial grammar

Studia Logica 58 (3):339-355 (1997)
  Copy   BIBTEX

Abstract

In this paper the notion of unifier is extended to the infinite set case. The proof of existence of the most general unifier of any infinite, unifiable set of types (terms) is presented. Learning procedure, based on infinite set unification, is described.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
73 (#217,881)

6 months
7 (#350,235)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Foundations of Logic Programming.J. W. Lloyd - 1987 - Journal of Symbolic Logic 52 (1):288-289.
Learning categorial grammar by unification with negative constraints.Jacek Marciniec - 1994 - Journal of Applied Non-Classical Logics 4 (2):181-200.

Add more references