book chapter · Lecture notes in computer science · 2003
A Logical Algorithm for ML Type Inference
Cited by 3Abstract and details only
Abstract
The index has no abstract for this paper. The publisher’s page may have one.
Cite this paper
McAllester, D. (2003). A Logical Algorithm for ML Type Inference. Lecture notes in computer science, 436–451. https://doi.org/10.1007/3-540-44881-0_31
McAllester, David. “A Logical Algorithm for ML Type Inference.” Lecture notes in computer science, 2003, pp. 436–51, https://doi.org/10.1007/3-540-44881-0_31.
McAllester, David. 2003. “A Logical Algorithm for ML Type Inference.” Lecture notes in computer science: 436–51. https://doi.org/10.1007/3-540-44881-0_31.
McAllester, D. (2003) ‘A Logical Algorithm for ML Type Inference’, Lecture notes in computer science, pp. 436–451. Available at: https://doi.org/10.1007/3-540-44881-0_31.
@incollection{mcallester2003logical,
title = {{A Logical Algorithm for ML Type Inference}},
author = {McAllester, David},
booktitle = {Lecture notes in computer science},
pages = {436--451},
year = {2003},
doi = {10.1007/3-540-44881-0_31}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
The Ackermann functions are not optimal, but by how much?
Harold Simmons · Journal of Symbolic Logic · 2010
Cited by 1
Optimizing Ackermann's function by incrementalization
Yanhong A. Liu, Scott D. Stoller · ACM SIGPLAN Notices · 2003
Cited by 2
A Logical Algorithm for ML Type Inference
David McAllester · Lecture notes in computer science · 2003
Cited by 5
Specifying type systems
Dieter Nazareth · Lecture notes in computer science · 1996
Cited by 0