Pages that link to "Item:Q1336737"
From MaRDI portal
The following pages link to Haskell overloading is DEXPTIME-complete (Q1336737):
Displayed 20 items.
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Rigid tree automata and applications (Q553317) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Tree tuple languages from the logic programming point of view (Q877842) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- Deciding \(\mathcal H_1\) by resolution (Q1041797) (← links)
- Lower bounds on type checking overloading (Q1350740) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- Unification modulo ACUI plus distributivity axioms (Q1774555) (← links)
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers (Q1854455) (← links)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically (Q2484410) (← links)
- Set constraints with intersection (Q2506490) (← links)
- Rigid Tree Automata (Q3618602) (← links)
- Unification of concept terms in description logics (Q5929707) (← links)