The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505)
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 undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types |
scientific article; zbMATH DE number 6110713
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types |
scientific article; zbMATH DE number 6110713 |
Statements
The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (English)
0 references
27 November 2012
0 references
lambda calculus
0 references
type checking
0 references
partial type inference
0 references
second-order unification
0 references
undecidability
0 references
Curry-style type system
0 references
Church-style type system
0 references
finitely stratified polymorphic types
0 references
System F
0 references
0.9602733850479126
0 references
0.8523758053779602
0 references
0.8055516481399536
0 references
