The correctness of Newman's typability algorithm and some of its extensions (Q549191)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The correctness of Newman's typability algorithm and some of its extensions |
scientific article; zbMATH DE number 5918237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The correctness of Newman's typability algorithm and some of its extensions |
scientific article; zbMATH DE number 5918237 |
Statements
The correctness of Newman's typability algorithm and some of its extensions (English)
0 references
7 July 2011
0 references
simply typed lambda calculus
0 references
unification
0 references
typing algorithms
0 references
principal type
0 references
0.8617884516716003
0 references
0.836706280708313
0 references
0.7519486546516418
0 references
0.7308279871940613
0 references
