The Complexity of Type Inference for Higher-Order Typed λ Calculi
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Fritz Henglein, Harry G. Mairson
The Complexity of Type Inference for Higher-Order Typed λ Calculi
POPL, 1991.

POPL 1991
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{POPL-1991-HengleinM,
	author        = "Fritz Henglein and Harry G. Mairson",
	booktitle     = "{Conference Record of the 18th Annual Symposium on Principles of Programming Languages}",
	doi           = "10.1145/99583.99602",
	editor        = "David S. Wise",
	isbn          = "0-89791-419-8",
	pages         = "119--130",
	publisher     = "{ACM Press}",
	title         = "{The Complexity of Type Inference for Higher-Order Typed λ Calculi}",
	year          = 1991,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.