Haskell overloading is DEXPTIME-complete

Helmut Seidl

doi:10.1016/0020-0190(94)00130-8

Haskell overloading is DEXPTIME-complete

Helmut Seidl

Saarland University

Research output: Contribution to journal › Article › peer-review

64 Scopus citations

Original language	English
Pages (from-to)	57-60
Number of pages	4
Journal	Information Processing Letters
Volume	52
Issue number	2
DOIs	https://doi.org/10.1016/0020-0190(94)00130-8
State	Published - 28 Oct 1994
Externally published	Yes

Keywords

Computational complexity
Emptiness
Haskell type classes

Access to Document

10.1016/0020-0190(94)00130-8

Cite this

@article{4d8bd5c39e9042c0bdd338e8100629c5,

title = "Haskell overloading is DEXPTIME-complete",

keywords = "Computational complexity, Emptiness, Haskell type classes",

author = "Helmut Seidl",

year = "1994",

month = oct,

day = "28",

doi = "10.1016/0020-0190(94)00130-8",

language = "English",

volume = "52",

pages = "57--60",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Haskell overloading is DEXPTIME-complete

AU - Seidl, Helmut

PY - 1994/10/28

Y1 - 1994/10/28

KW - Computational complexity

KW - Emptiness

KW - Haskell type classes

UR - http://www.scopus.com/inward/record.url?scp=0028523063&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(94)00130-8

DO - 10.1016/0020-0190(94)00130-8

M3 - Article

AN - SCOPUS:0028523063

SN - 0020-0190

VL - 52

SP - 57

EP - 60

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

Haskell overloading is DEXPTIME-complete

Keywords

Access to Document

Other files and links

Cite this