A straightforward denotational semantics for non-determinate data flow programs

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Paul R. Kosinski IBM Thomas J. Watson Research Center, Yorktown Heights, New York and Massachusetts Institute of Technology, Cambridge, Massachusetts
Published in:
· Proceeding
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Pages 214-221
ACM New York, NY, USA ©1978
table of contents doi>10.1145/512760.512783
A straightforward denotational semantics for non-determinate data flow programs Published by ACM 1978 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 11
· Downloads (cumulative): 173
· Citation Count: 8


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