SIGN IN
SIGN UP
Polymorphic type inference and abstract data types
Full Text:
PDF
Buy this Article
Authors:
Konstantin Läufer
Loyola Univ., Chicago, IL
Martin Odersky
Univ. Karlsruhe, Karlsruhe, Germany
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 16 Issue 5, Sept. 1994
Pages 1411-1430
ACM
New York, NY
, USA
table of contents
doi>
10.1145/186025.186031
1994 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 21
· Downloads (cumulative): 470
· Citation Count: 36
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
abstract data types
applicative languages
denotational semantics
dynamic dispatching
existentially quantified types
first-class abstract types
languages
modules, packages
polymorphism
theory
type inference
type structure
universally quantified types
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