Efficient Type Inference for Higher-Order Binding-Time Analysis
Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research
Standard
Efficient Type Inference for Higher-Order Binding-Time Analysis. / Henglein, Fritz.
Lecture Notes in Computer Science, vol.523: Proc. Functional Programming Languages and Computer Architecture. Berlin : Springer, 1991. p. 448-472.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research
Harvard
Henglein, F 1991, Efficient Type Inference for Higher-Order Binding-Time Analysis. in Lecture Notes in Computer Science, vol.523: Proc. Functional Programming Languages and Computer Architecture. Springer, Berlin, pp. 448-472.
APA
Henglein, F. (1991). Efficient Type Inference for Higher-Order Binding-Time Analysis. In Lecture Notes in Computer Science, vol.523: Proc. Functional Programming Languages and Computer Architecture (pp. 448-472). Springer.
Vancouver
Henglein F. Efficient Type Inference for Higher-Order Binding-Time Analysis. In Lecture Notes in Computer Science, vol.523: Proc. Functional Programming Languages and Computer Architecture. Berlin: Springer. 1991. p. 448-472
Author
Bibtex
@inbook{45c7e77074d011dbbee902004c4f4f50,
title = "Efficient Type Inference for Higher-Order Binding-Time Analysis",
abstract = "Datalogi",
author = "Fritz Henglein",
year = "1991",
language = "English",
pages = "448--472",
booktitle = "Lecture Notes in Computer Science, vol.523: Proc. Functional Programming Languages and Computer Architecture",
publisher = "Springer",
address = "Switzerland",
}
RIS
TY - CHAP
T1 - Efficient Type Inference for Higher-Order Binding-Time Analysis
AU - Henglein, Fritz
PY - 1991
Y1 - 1991
N2 - Datalogi
AB - Datalogi
M3 - Book chapter
SP - 448
EP - 472
BT - Lecture Notes in Computer Science, vol.523: Proc. Functional Programming Languages and Computer Architecture
PB - Springer
CY - Berlin
ER -
ID: 291977