Principal type

From Wikipedia, the free encyclopedia

 This article is orphaned as few or no other articles link to it.
Please help introduce links in articles on related topics. (November 2006)

In Type theory, the Principal type of an expression is the most general possible type given an expression.

One way to compute the Principal type of an expression is by deploying Robinson's unification algorithm, which is used by Prolog.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.