A comparison of reduction in APL with polyarity in LISP

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: David S. Touretzky Computer Science Department, Carnegie-Mellon University, Schenley Park, Pittsburgh, PA
Published in:
Cover Image
 
· Proceeding
APL '83 Proceedings of the international conference on APL
Pages 259-263
ACM New York, NY, USA ©1983
table of contents ISBN:0-89791-095-8 doi>10.1145/800062.801225
· Newsletter
ACM SIGAPL APL Quote Quad Homepage
Volume 13 Issue 3, March 1983
Pages 259 - 263
ACM New York, NY, USA
table of contents doi>10.1145/390005.801225
A comparison of reduction in APL with polyarity in LISP Published by ACM 1983 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 6
· Downloads (cumulative): 206
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder