SIGN IN
SIGN UP
Type inference with polymorphic recursion
Full Text:
Pdf
Buy this Article
Author:
Fritz Henglein
University of Copenhagen
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 15 Issue 2, April 1993
Pages 253 - 289
ACM
New York, NY
, USA
table of contents
doi>
10.1145/169701.169692
1993 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 40
· Downloads (cumulative): 896
· Citation Count: 71
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
data types and structures
design
lambda calculus and related systems
languages
polymorphism
recursion
semiunification
theory
type inference
type structure
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder