Haskell overloading is dexptime-complete (1994)

Cached

Download Links

by Helmut Seidl , Fachbereich Informatik
Venue:Information Processing Letters
Citations:43 - 0 self

Documents Related by Co-Citation

95 Logic programs as types for logic programs – Frühwirth - 1991
78 Deciding equivalence of finite tree automata – H Seidl - 1990
94 A Finite Presentation Theorem for Approximating Logic Programs – Nevin Heintze, Joxan Jaffar - 1990
10 Set-Based Analysis for Logic Programming and Tree Automata – Jm. Talbot, S. Tison, P. Devienne - 1997
107 Regular Tree and Regular Hedge Languages over Unranked Alphabets: Version 1 – Anne Brüggemann-Klein, Makoto Murata, Derick Wood - 2001
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
755 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
35 Set Constraints and Set-Based Analysis – Nevin Heintze, Joxan Jaffar - 1994
157 Typechecking for XML Transformers – Tova Milo, Dan Suciu, Victor Vianu - 2000
118 DTD Inference for Views of XML Data – Yannis Papakonstantinou, Victor Vianu - 1999
302 Word problems requiring exponential time – L J Stockmeyer, A R Meyer - 1973
101 One-Unambiguous Regular Languages – Anne Brüggemann-Klein, Derick Wood - 1997
49 Bussche, DTDs versus XML Schema: a practical study – G J Bex, F Neven, J V
189 Taxonomy of xml schema languages using formal language theory – Makoto Murata, Dongwon Lee, Murali Mani - 2001
84 Lower bounds for natural proof systems – D Kozen - 1977
14 J.L.: Automata for reduction properties solving – M Dauchet, A C Caron, Coquidé - 1995
67 The complexity of set constraints – Er Aiken, Dexter Kozen, Moshe Vardi - 1993
41 Equality and Disequality Constraints on Direct Subterms in Tree Automata – B Bogaert, S Tison - 1992
14 Typing Abstractions and Management in a Component Framework – Frederic Doucet, Sandeep K. Shukla, Rajesh K. Gupta - 2003