| Abstract: | Conclustions The paper formalizes two denotational models for mixed computation process in a structural programming language. A criterion of functional correctness is formulated and theorems are proved that show that the described models are functionally correct. The proposed models define more precisely the concept of mixed computations discussed in [1, 2], and make it, possible formally to prove their properties. Moreover, they can be regarded as formal specifications of the respective components of a mixed-computer software.Translated from Kibernetika, No. 1, pp. 16–27, 43, January–February, 1988. |
