Haskell overloading is DEXPTIME-complete (Q1336737): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q126322776, #quickstatements; #temporary_batch_1721940658196 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4027630 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deciding equivalence of finite tree automata / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126322776 / rank | |||
Normal rank | |||
Latest revision as of 22:52, 25 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Haskell overloading is DEXPTIME-complete |
scientific article |
Statements
Haskell overloading is DEXPTIME-complete (English)
0 references
16 April 1996
0 references
DEXPTIME
0 references
complexity analysis
0 references
Haskell type system
0 references
