Haskell overloading is DEXPTIME-complete
From MaRDI portal
Publication:1336737
DOI10.1016/0020-0190(94)00130-8zbMATH Open0835.68008OpenAlexW2001621593WikidataQ126322776 ScholiaQ126322776MaRDI QIDQ1336737FDOQ1336737
Authors: Helmut Seidl 
Publication date: 16 April 1996
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00130-8
Recommendations
General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)
Cites Work
Cited In (29)
- On the complexity of typechecking top-down XML transformations
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
- Unification of concept terms in description logics
- Restricted unification in the DL \(\mathcal{FL}_0\)
- An analysis of ML typability
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results
- Efficient inclusion checking for deterministic tree automata and XML schemas
- Queries on XML streams with bounded delay and concurrency
- Alternating two-way AC-tree automata
- Deciding \(\mathcal H_1\) by resolution
- A proof procedure for separation logic with inductive definitions and data
- Tree tuple languages from the logic programming point of view
- Typechecking top-down XML transformations: Fixed input or output schemas
- Tree automata with one memory set constraints and cryptographic protocols
- Parameterized Verification of Communicating Automata under Context Bounds
- Ground reducibility is EXPTIME-complete
- Transducer-based analysis of cryptographic protocols
- Tree automata with equality constraints modulo equational theories
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers
- Ramsey quantifiers over automatic structures: complexity and applications to verification
- Rigid tree automata and applications
- Rigid Tree Automata
- Lower bounds on type checking overloading
- Set constraints with intersection
- Unification modulo ACUI plus distributivity axioms
- RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION
- A survey on decidable equivalence problems for tree transducers
- Balancedness of MSO transductions in polynomial time
- Title not available (Why is that?)
Uses Software
This page was built for publication: Haskell overloading is DEXPTIME-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336737)
