Haskell overloading is DEXPTIME-complete
- 1 October 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 52 (2) , 57-60
- https://doi.org/10.1016/0020-0190(94)00130-8
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Deciding equivalence of finite tree automataPublished by Springer Nature ,2005
- Report on the programming language HaskellACM SIGPLAN Notices, 1992
- On the complexity of ML typability with overloadingPublished by Springer Nature ,1991