The Complexity of Type Inference for Higher-Order Typed Lambda Calculi
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. / Henglein, Fritz; Mairson, Harry.
In: Journal of Functional Programming (JFP), Vol. 4, No. 4, 1994, p. 435--477.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
Henglein, F & Mairson, H 1994, 'The Complexity of Type Inference for Higher-Order Typed Lambda Calculi', Journal of Functional Programming (JFP), vol. 4, no. 4, pp. 435--477.
APA
Henglein, F., & Mairson, H. (1994). The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. Journal of Functional Programming (JFP), 4(4), 435--477.
Vancouver
Henglein F, Mairson H. The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. Journal of Functional Programming (JFP). 1994;4(4):435--477.
Author
Bibtex
@article{73e23730049b11ddbee902004c4f4f50,
title = "The Complexity of Type Inference for Higher-Order Typed Lambda Calculi",
author = "Fritz Henglein and Harry Mairson",
year = "1994",
language = "English",
volume = "4",
pages = "435----477",
journal = "Journal of Functional Programming (JFP)",
publisher = "Cambridge University Press",
number = "4",
}
RIS
TY - JOUR
T1 - The Complexity of Type Inference for Higher-Order Typed Lambda Calculi
AU - Henglein, Fritz
AU - Mairson, Harry
PY - 1994
Y1 - 1994
M3 - Journal article
VL - 4
SP - 435
EP - 477
JO - Journal of Functional Programming (JFP)
JF - Journal of Functional Programming (JFP)
IS - 4
ER -
ID: 3531184