Constraint Automata and the Complexity of Recursive Subtype Entailment

Fritz Henglein, Jakob Rehof. Constraint Automata and the Complexity of Recursive Subtype Entailment. In Kim Guldstrand Larsen, Sven Skyum, Glynn Winskel, editors, Automata, Languages and Programming, 25th International Colloquium, ICALP 98, Aalborg, Denmark, July 13-17, 1998, Proceedings. Volume 1443 of Lecture Notes in Computer Science, pages 616-627, Springer, 1998. [doi]

Abstract

Abstract is missing.