SIGN IN
SIGN UP
Higher-order functors with transparent signatures
Full Text:
PDF
Buy this Article
Author:
Sandip K. Biswas
Department of CIS, University of Pennsylvania, Philadelphia, PA
Published in:
· Proceeding
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pages 154-163
ACM
New York, NY
, USA
©1995
table of contents
ISBN:0-89791-692-1
doi>
10.1145/199448.199478
1995 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 7
· Downloads (cumulative): 196
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
POPL '14
Share:
|
Tags:
algorithms
languages
modules and interfaces
semantics
standard ml
syntax
theory
verification
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