Coinductive axiomatization of recursive type equality and subtyping
Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research
Standard
Coinductive axiomatization of recursive type equality and subtyping. / Brandt, Michael; Henglein, Fritz.
Proceedings of The 3rd International Conference on Typed Lambda Calculi and Applications. Springer, 1997. p. 63-81.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research
Harvard
Brandt, M & Henglein, F 1997, Coinductive axiomatization of recursive type equality and subtyping. in Proceedings of The 3rd International Conference on Typed Lambda Calculi and Applications. Springer, pp. 63-81.
APA
Brandt, M., & Henglein, F. (1997). Coinductive axiomatization of recursive type equality and subtyping. In Proceedings of The 3rd International Conference on Typed Lambda Calculi and Applications (pp. 63-81). Springer.
Vancouver
Brandt M, Henglein F. Coinductive axiomatization of recursive type equality and subtyping. In Proceedings of The 3rd International Conference on Typed Lambda Calculi and Applications. Springer. 1997. p. 63-81
Author
Bibtex
@inbook{3f04bda074cb11dbbee902004c4f4f50,
title = "Coinductive axiomatization of recursive type equality and subtyping",
author = "Michael Brandt and Fritz Henglein",
note = "Lecture Notes in Computer Science, Vol.1210",
year = "1997",
language = "English",
pages = "63--81",
booktitle = "Proceedings of The 3rd International Conference on Typed Lambda Calculi and Applications",
publisher = "Springer",
address = "Switzerland",
}
RIS
TY - CHAP
T1 - Coinductive axiomatization of recursive type equality and subtyping
AU - Brandt, Michael
AU - Henglein, Fritz
N1 - Lecture Notes in Computer Science, Vol.1210
PY - 1997
Y1 - 1997
M3 - Book chapter
SP - 63
EP - 81
BT - Proceedings of The 3rd International Conference on Typed Lambda Calculi and Applications
PB - Springer
ER -
ID: 229004