Abstract
Three schemes of mixed computation have been defined and studied: mix, (Formula Presented). For a given R1, the following inclusions take place: (Formula Presented.). The processes (Formula Presented.) 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.
Cite
CITATION STYLE
Ershov, A. P., & Itkin, V. E. (1977). Correctness of mixed computation in ALGOL-like programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 53 LNCS, pp. 59–77). Springer Verlag. https://doi.org/10.1007/3-540-08353-7_128
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
