Complexity of kernel fun subtype checking (Q2817692)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6621869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of kernel fun subtype checking |
scientific article; zbMATH DE number 6621869 |
Statements
1 September 2016
0 references
polymorphism
0 references
subtyping
0 references
type checking
0 references
type theory
0 references
Complexity of kernel fun subtype checking (English)
0 references
0.8471323251724243
0 references
0.7354219555854797
0 references
0.7250896692276001
0 references
