Haskell overloading is DEXPTIME-complete (Q1336737): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q126322776, #quickstatements; #temporary_batch_1721940658196 |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Haskell / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00130-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2001621593 / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
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