ACM Home Page
Please provide us with feedback. Feedback
Constraint-type statements in programming languages
Full text PdfPdf (338 KB)
Source
Communications of the ACM archive
Volume 7 ,  Issue 10  (October 1964) table of contents
Pages: 587 - 588  
Year of Publication: 1964
ISSN:0001-0782
Author
M. V. Wilkes  Univ. Mathematical Laboratory, Cambridge, England
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 18,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/364888.364967
What is a DOI?

ABSTRACT

A proposal is made for including in a programming language statements which imply relations between variables but which are not explicit assignment statements. The compiler sets up a Newtonian iteration making use for the purpose of a routine for formal differentiation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1