Correctness of mixed computation in ALGOL-like programs

  • A. P. Ershov
  • V. E. Itkin
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


Three schemes of mixed computation have been defined and studied: mix, \(\overline{\overline {mix}} and\mathop {mix}\limits^\bigcirc\). For a given R1, the following inclusions take place: \(ssv (mix) \subseteq ssv (\overline{\overline {mix}} ) \subseteq ssv\mathop {(mix}\limits^\bigcirc )\). The processes \(\overline{\overline {mix}} and\mathop {mix}\limits^\bigcirc\)are correct in the general case, mix is more effective but requires a kind of memory protection.

In all three processes, suspended statements and trains are attached to the extending residual program without any modification. However, an evaluation of some functional and predicate terms is possible in a suspended statement or train that can greatly simplify the residual program. This and some other optimizations in mixed computation are the subject of further study.


Residual Program Operational Vertex Process Comp Functional Term Suspended Statement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A.P.Ershov. On the principle of partial computation. Information Processing Letters, 1977, No. 2.Google Scholar
  2. 2.
    A.P.Ershov. On the essence of compilation. IFIP Working Conference on "Formal description of programming concepts". S.Andrews, Canada, August, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • A. P. Ershov
    • 1
  • V. E. Itkin
    • 1
  1. 1.Computing Center, Siberian DivisionUSSR Academy of SciencesNovosibirsk

Personalised recommendations