The Complexity of Type Inference for Higher-Order typed Lambda-Calculi
Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning
Standard
The Complexity of Type Inference for Higher-Order typed Lambda-Calculi. / Henglein, Fritz; Mairson, Harry.
Proc.18th. ACM Symp. on Pronciples of Programming Languages. New York : Association for Computing Machinery, 1991. s. 119-130.Publikation: Bidrag til bog/antologi/rapport › Bidrag til bog/antologi › Forskning
Harvard
Henglein, F & Mairson, H 1991, The Complexity of Type Inference for Higher-Order typed Lambda-Calculi. i Proc.18th. ACM Symp. on Pronciples of Programming Languages. Association for Computing Machinery, New York, s. 119-130.
APA
Henglein, F., & Mairson, H. (1991). The Complexity of Type Inference for Higher-Order typed Lambda-Calculi. I Proc.18th. ACM Symp. on Pronciples of Programming Languages (s. 119-130). Association for Computing Machinery.
Vancouver
Henglein F, Mairson H. The Complexity of Type Inference for Higher-Order typed Lambda-Calculi. I Proc.18th. ACM Symp. on Pronciples of Programming Languages. New York: Association for Computing Machinery. 1991. s. 119-130
Author
Bibtex
@inbook{45bb645074d011dbbee902004c4f4f50,
title = "The Complexity of Type Inference for Higher-Order typed Lambda-Calculi",
abstract = "Datalogi",
author = "Fritz Henglein and Harry Mairson",
year = "1991",
language = "English",
pages = "119--130",
booktitle = "Proc.18th. ACM Symp. on Pronciples of Programming Languages",
publisher = "Association for Computing Machinery",
}
RIS
TY - CHAP
T1 - The Complexity of Type Inference for Higher-Order typed Lambda-Calculi
AU - Henglein, Fritz
AU - Mairson, Harry
PY - 1991
Y1 - 1991
N2 - Datalogi
AB - Datalogi
M3 - Book chapter
SP - 119
EP - 130
BT - Proc.18th. ACM Symp. on Pronciples of Programming Languages
PB - Association for Computing Machinery
CY - New York
ER -
ID: 291973