Haskell overloading is DEXPTIME-complete-Reference-Cited by-同舟云学术

Haskell overloading is DEXPTIME-complete

Published:1994-10 Issue:2 Volume:52 Page:57-60
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Seidl Helmut

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference9 articles.

1. Logic programs as types of logic programs;Frühwirth;Proc. 6th Symp. on Logics in Computer Science,1991

2. Report on the programming language Haskell, A non-strict, purely functional language;Hudak;ACM SIGPLAN Notices,1992

3. An analysis of ML typability;Kfoury,1990

4. Deciding ML typability is complete for deterministic exponential time;Mairson;Proc. ACM Internat. Conf. on Principles of Programming Languages,1990

5. Type checking type classes;Nipkow;Proc. ACM Internat. Conf. on Principles of Programming Languages,1993

Cited by 58 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Proof Procedure for Separation Logic with Inductive Definitions and Data;Journal of Automated Reasoning;2023-09

2. Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

3. Restricted Unification in the DL $$\mathcal {FL}_0$$;Frontiers of Combining Systems;2021

4. Containment of Shape Expression Schemas for RDF;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019

5. Balancedness of MSO transductions in polynomial time;Information Processing Letters;2018-05