Jump to content

PROSE modeling language

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Beartham (talk | contribs) at 18:09, 16 October 2013 (Created page with 'PROSE was the mathematical 4GL virtual machine which established the holistic modeling paradigm known as Synthetic Calculus (AKA MetaCalculus). A successor to th...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

PROSE was the mathematical 4GL virtual machine which established the holistic modeling paradigm known as Synthetic Calculus (AKA MetaCalculus). A successor to the SLANG 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.

Yet AD was applied in nestable iterative holons in PROSE semantics, giving rise to a threefold alphabet of holistic operator templates for very-high-order mathematical modeling:

Optimization:

FIND simultaneous-unknowns IN model-subroutine BY solver-engine :Indented line

    [HOLDING inequality-constraint-variables] :Indented line     
    [MATCHING equality-constraint-variables] :Indented line     
    TO MAXIMIZE|MINIMIZE objective-variable :Indented line     

Correlation:

FIND simultaneous-unknowns IN model-subroutine BY solver-engine :Indented line

    TO MATCH equality-constraint-variables :Indented line     

Simulation:

INITIATE solver-engine FOR model-subroutine EQUATIONS rate-variables/level-variables :Indented line

    OF independent-variable STEP increment-variable TO limit-variable :Indented line     

INTEGRATE model-subroutine BY solver-engine :Indented line

These three operator templates crerated dynamic holons encapsulating an equations model subroutine hierarchy which could contain other nested holons, because the model subroutines could contain any of the operator templates encapsulating sub-problems. Each holon in the holarchy had a solver algorithm engine, which could be interchanged with others in it holon class.