Lesson plan

PROSE modeling language

PROSE was the mathematical 4GL virtual machine that established the holistic modeling paradigm known as Synthetic Calculus (AKA MetaCalculus). A successor to the SLANG /CUE simulation and optimization language developed at TRW Systems, it was introduced in 1974 on Control Data supercomputers. It was the first commercial language to employ automatic differentiation (AD), which was optimized to loop in the instruction-stack of the CDC 6600 CPU. Although PROSE was a rich block-structured procedural language, its focus was the blending of simultaneous-variable mathematical systems such as: : implicit non-linear equations systems, ordinary differential-equations systems, and multidimensional optimization. Each of these kinds of system models were distinct and had operator templates to automate and solve them, added to the procedural syntax. These automated system problems were considered "holistic" because their unknowns were simultaneous, and they could not be reduced in formulation to solve piecewise, or by algebra manipulation (e.g. substitution), but had to be solved as wholes. And wholeness also pertained to algorithmic determinacy or mathematical "closure", which made solution convergence possible and certain in principle, if not corrupted by numerical instability.

Back to article

Article summary

PROSE was the mathematical 4GL virtual machine that established the holistic modeling paradigm known as Synthetic Calculus (AKA MetaCalculus). A successor to the SLANG /CUE simulation and optimization language developed at TRW Systems, it was introduced in 1974 on Control Data supercomputers. It was the first commercial language to employ automatic differentiation (AD), which was optimized to loop in the instruction-stack of the CDC 6600 CPU. Although PROSE was a rich block-structured procedural language, its focus was the blending of simultaneous-variable mathematical systems such as: : implicit non-linear equations systems, ordinary differential-equations systems, and multidimensional optimization. Each of these kinds of system models were distinct and had operator templates to automate and solve them, added to the procedural syntax. These automated system problems were considered "holistic" because their unknowns were simultaneous, and they could not be reduced in formulation to solve piecewise, or by algebra manipulation (e.g. substitution), but had to be solved as wholes. And wholeness also pertained to algorithmic determinacy or mathematical "closure", which made solution convergence possible and certain in principle, if not corrupted by numerical instability.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.