SIGN IN
SIGN UP
Finite Differencing of Computable Expressions
Full Text:
Pdf
Buy this Article
Authors:
Robert Paige
Department of Computer Science, Hill Center for the Mathematical Sciences, Rutgers--The State University of New Jersey, Busch Campus, New Brunswick, NJ
Shaye Koenig
Department of Computer Science, Hill Center for the Mathematical Sciences, Rutgers--The State University of New Jersey, Busch Campus, New Brunswick, NJ
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 4 Issue 3, July 1982
Pages 402-454
ACM
New York, NY
, USA
table of contents
doi>
10.1145/357172.357177
1982 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 17
· Downloads (cumulative): 718
· Citation Count: 89
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
concurrent programming
design
finite difference methods
languages
optimization
performance
setl
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