Haskell overloading is DEXPTIME-complete
From MaRDI portal
Publication:1336737
DOI10.1016/0020-0190(94)00130-8zbMath0835.68008OpenAlexW2001621593WikidataQ126322776 ScholiaQ126322776MaRDI QIDQ1336737
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
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)
Related Items
Restricted unification in the DL \(\mathcal{FL}_0\), Parameterized Verification of Communicating Automata under Context Bounds, Ground reducibility is EXPTIME-complete, Alternating two-way AC-tree automata, Lower bounds on type checking overloading, Tree tuple languages from the logic programming point of view, A proof procedure for separation logic with inductive definitions and data, Tree automata with equality constraints modulo equational theories, Balancedness of MSO transductions in polynomial time, Typechecking top-down XML transformations: Fixed input or output schemas, Transducer-based analysis of cryptographic protocols, Unification of concept terms in description logics, Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically, Queries on XML streams with bounded delay and concurrency, Rigid tree automata and applications, Tree automata with one memory set constraints and cryptographic protocols, On the complexity of typechecking top-down XML transformations, Unification modulo ACUI plus distributivity axioms, Set constraints with intersection, A Survey on Decidable Equivalence Problems for Tree Transducers, Rigid Tree Automata, Decidability and complexity of simultaneous rigid E-unification with one variable and related results, Efficient inclusion checking for deterministic tree automata and XML schemas, Deciding \(\mathcal H_1\) by resolution, RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION, The complexity of the exponential output size problem for top-down and bottom-up tree transducers
Uses Software
Cites Work
