Efficient recursive subtyping (Q4847313)
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 798805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient recursive subtyping |
scientific article; zbMATH DE number 798805 |
Statements
Efficient recursive subtyping (English)
0 references
25 October 1995
0 references
subtyping in the presence of recursive types
0 references
\(\lambda\)-calculus
0 references
algorithm
0 references
emptiness problem
0 references
finite automata
0 references
orderings based on contravariance
0 references
0.8047669529914856
0 references
0.8010444045066833
0 references
0.8003494143486023
0 references
0.7807791829109192
0 references
0.7675077319145203
0 references
