SIGN IN
SIGN UP
A precise relationship between the deductive power of forward and backward strictness analysis
Full Text:
PDF
Buy this Article
Authors:
Marc Neuberger
Prateek Mishra
Published in:
· Proceeding
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Pages 127-138
ACM
New York, NY
, USA
©1992
table of contents
ISBN:0-89791-481-3
doi>
10.1145/141471.141526
· Newsletter
ACM SIGPLAN Lisp Pointers
Homepage
Volume V Issue 1, Jan. 1992
Pages 127 - 138
ACM
New York, NY
, USA
table of contents
doi>
10.1145/141478.141526
1992 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 162
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
applicative programming
language classifications
languages
semantics of programming languages
specifying and verifying and reasoning about programs
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