Constraint-type statements in programming languages

Authors:
M. V. Wilkes
Affiliations:
Univ. Mathematical Laboratory, Cambridge, England
Venue:
Communications of the ACM
Year:
1964

Citing 1
Cited 5

Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM

Constraints in constructive solid geometry

I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
Blocks—a new datatype for SNOBOL4

Communications of the ACM
The role of programming in a Ph.D. computer science program

Communications of the ACM
Translator writing systems

Communications of the ACM
An algorithm for selecting and sequencing statements as a basis for a problem-oriented programming system

ACM '66 Proceedings of the 1966 21st national conference

Quantified Score

Hi-index	48.26

Visualization

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.