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.
| Property | Value |
|---|
| dbpprop:abstract
|
- 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.
|
| dbpprop:hasPhotoCollection
| |
| rdfs:comment
|
- 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.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
![[RDF Data]](/statics/sw-cube.png)
