The Complexity of Subtype Entailment for Simple Types
Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning
Standard
The Complexity of Subtype Entailment for Simple Types. / Henglein, Fritz; Rehof, Niels Jakob.
Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS). Warszawa, Polen : IEEE Computer Society Press, 1997. s. 352-361.Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning
Harvard
Henglein, F & Rehof, NJ 1997, The Complexity of Subtype Entailment for Simple Types. i Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Warszawa, Polen, s. 352-361.
APA
Henglein, F., & Rehof, N. J. (1997). The Complexity of Subtype Entailment for Simple Types. I Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS) (s. 352-361). IEEE Computer Society Press.
Vancouver
Henglein F, Rehof NJ. The Complexity of Subtype Entailment for Simple Types. I Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS). Warszawa, Polen: IEEE Computer Society Press. 1997. s. 352-361
Author
Bibtex
@inbook{1c55319074cb11dbbee902004c4f4f50,
title = "The Complexity of Subtype Entailment for Simple Types",
author = "Fritz Henglein and Rehof, {Niels Jakob}",
year = "1997",
language = "English",
pages = "352--361",
booktitle = "Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS)",
publisher = "IEEE Computer Society Press",
}
RIS
TY - CHAP
T1 - The Complexity of Subtype Entailment for Simple Types
AU - Henglein, Fritz
AU - Rehof, Niels Jakob
PY - 1997
Y1 - 1997
M3 - Book chapter
SP - 352
EP - 361
BT - Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS)
PB - IEEE Computer Society Press
CY - Warszawa, Polen
ER -
ID: 227676