Constraint Automata and the Complexity of Recursive Subtype Entailment, Lecture Notes in Computer Science, Vol.1443

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearch

Standard

Constraint Automata and the Complexity of Recursive Subtype Entailment, Lecture Notes in Computer Science, Vol.1443. / Henglein, Fritz; Rehof, Jakob.

Proceedings of the 25th International Coll. on Automata, Languages and Programming (ICALP). Springer, 1998. p. 616-627.

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearch

Harvard

Henglein, F & Rehof, J 1998, Constraint Automata and the Complexity of Recursive Subtype Entailment, Lecture Notes in Computer Science, Vol.1443. in Proceedings of the 25th International Coll. on Automata, Languages and Programming (ICALP). Springer, pp. 616-627.

APA

Henglein, F., & Rehof, J. (1998). Constraint Automata and the Complexity of Recursive Subtype Entailment, Lecture Notes in Computer Science, Vol.1443. In Proceedings of the 25th International Coll. on Automata, Languages and Programming (ICALP) (pp. 616-627). Springer.

Vancouver

Henglein F, Rehof J. Constraint Automata and the Complexity of Recursive Subtype Entailment, Lecture Notes in Computer Science, Vol.1443. In Proceedings of the 25th International Coll. on Automata, Languages and Programming (ICALP). Springer. 1998. p. 616-627

Author

Henglein, Fritz ; Rehof, Jakob. / Constraint Automata and the Complexity of Recursive Subtype Entailment, Lecture Notes in Computer Science, Vol.1443. Proceedings of the 25th International Coll. on Automata, Languages and Programming (ICALP). Springer, 1998. pp. 616-627

Bibtex

@inbook{41d4c30074ca11dbbee902004c4f4f50,
title = "Constraint Automata and the Complexity of Recursive Subtype Entailment, Lecture Notes in Computer Science, Vol.1443",
author = "Fritz Henglein and Jakob Rehof",
year = "1998",
language = "English",
pages = "616--627",
booktitle = "Proceedings of the 25th International Coll. on Automata, Languages and Programming (ICALP)",
publisher = "Springer",
address = "Switzerland",

}

RIS

TY - CHAP

T1 - Constraint Automata and the Complexity of Recursive Subtype Entailment, Lecture Notes in Computer Science, Vol.1443

AU - Henglein, Fritz

AU - Rehof, Jakob

PY - 1998

Y1 - 1998

M3 - Book chapter

SP - 616

EP - 627

BT - Proceedings of the 25th International Coll. on Automata, Languages and Programming (ICALP)

PB - Springer

ER -

ID: 214079