{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T16:51:23Z","timestamp":1771951883415,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,4,1]],"date-time":"1982-04-01T00:00:00Z","timestamp":386467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11430,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1982,4]]},"DOI":"10.1016\/0304-3975(82)90111-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"41-67","source":"Crossref","is-referenced-by-count":98,"title":["Mixed computation: potential applications and problems for study"],"prefix":"10.1016","volume":"18","author":[{"given":"A.P.","family":"Ershov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90111-6_BIB1","series-title":"Program Construction","first-page":"237","article-title":"Program development by stepwise transformations \u2014 the Project CIP","volume":"69","author":"Bauer","year":"1979"},{"key":"10.1016\/0304-3975(82)90111-6_BIB2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0004-3702(76)90011-4","article-title":"A partial evaluator and its use as a programming tool","volume":"7","author":"Beckman","year":"1976","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(82)90111-6_BIB3","series-title":"RC 5666","article-title":"A case study of a new compiling code generation technique","author":"Carter","year":"1975"},{"issue":"1","key":"10.1016\/0304-3975(82)90111-6_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00264597","article-title":"A synthesis of several sorting algorithms","volume":"11","author":"Darlington","year":"1978","journal-title":"Acta Informat."},{"issue":"1","key":"10.1016\/0304-3975(82)90111-6_BIB5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00263742","article-title":"A system which automatically improves programs","volume":"6","author":"Darlington","year":"1976","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90111-6_BIB6","article-title":"Why naive program transformation systems are unlikely to work","volume":"636","author":"Dijkstra","year":"1977","journal-title":"Manuscript EWD"},{"key":"10.1016\/0304-3975(82)90111-6_BIB7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1147\/sj.93.0166","article-title":"Code-generation technique for large-language compilers","volume":"3","author":"Elson","year":"1970","journal-title":"IBM System J."},{"issue":"1","key":"10.1016\/0304-3975(82)90111-6_BIB8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/321312.321314","article-title":"ALPHA \u2014 An automatic programming system of high efficiency","volume":"13","author":"Ershov","year":"1966","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0304-3975(82)90111-6_BIB9","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0020-0190(77)90078-3","article-title":"On the partial computation principle","volume":"6","author":"Ershov","year":"1977","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(82)90111-6_BIB10","series-title":"Formal Description of Programming Concepts","first-page":"391","article-title":"On the essence of compilation","author":"Ershov","year":"1977"},{"issue":"1","key":"10.1016\/0304-3975(82)90111-6_BIB11","first-page":"19","article-title":"Mixed computation in the class of recursive program schemata","volume":"4","author":"Ershov","year":"1978","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(82)90111-6_BIB12","series-title":"Software Engineering","first-page":"12","article-title":"The transformational approach in software engineering","author":"Ershov","year":"1979"},{"key":"10.1016\/0304-3975(82)90111-6_BIB13","series-title":"The British Lectures","author":"Ershov","year":"1980"},{"key":"10.1016\/0304-3975(82)90111-6_BIB14","series-title":"Constructing Quality Software","first-page":"99","article-title":"Design specifications for a quality compiler factory","author":"Ershov","year":"1978"},{"key":"10.1016\/0304-3975(82)90111-6_BIB15","series-title":"Mathematical Foundations of Computer Science 1977","first-page":"59","article-title":"Correctness of mixed computation in Algol-like programs","author":"Ershov","year":"1977"},{"issue":"5","key":"10.1016\/0304-3975(82)90111-6_BIB16","first-page":"45","article-title":"Partial evaluation of computation process \u2014 an approach to a compiler-compiler","volume":"2","author":"Futamura","year":"1971","journal-title":"Systems-Comput.-Controls"},{"key":"10.1016\/0304-3975(82)90111-6_BIB17","series-title":"Proc. 4th ACM Symposium on Principles of Programming Languages","first-page":"29","article-title":"A new strategy for code generation mdash; the general purpose optimizing compiler","author":"Harrison","year":"1977"},{"key":"10.1016\/0304-3975(82)90111-6_BIB18","first-page":"1","article-title":"Equivalence of free program schemata","volume":"1","author":"Itkin","year":"1978","journal-title":"Kibernetika"},{"key":"10.1016\/0304-3975(82)90111-6_BIB19","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(82)90111-6_BIB20","article-title":"Incremental Computation","volume":"8","author":"Lombardi","year":"1967"},{"key":"10.1016\/0304-3975(82)90111-6_BIB21","series-title":"The Programming Language LISP: Its Operation and Applications","first-page":"204","article-title":"LISP as the language for an incremental computer","author":"Lombardi","year":"1964"},{"key":"10.1016\/0304-3975(82)90111-6_BIB22","series-title":"Translation and Program Models","first-page":"69","article-title":"Obtaining language oriented parser systematically by means of mixed computation","author":"Ostrovsky","year":"1980"},{"issue":"2","key":"10.1016\/0304-3975(82)90111-6_BIB23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1093\/comjnl\/19.2.151","article-title":"On interpreter-oriented definitions of programming languages","volume":"19","author":"Pagan","year":"1976","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(82)90111-6_BIB24","series-title":"Program Construction","first-page":"322","article-title":"A study on transformational semantics","volume":"69","author":"Pepper","year":"1979"},{"key":"10.1016\/0304-3975(82)90111-6_BIB25","first-page":"92","article-title":"The Basic Refal and Its Implementation on Computing Machines (Methodological Recommendations)","author":"Refal","year":"1977"},{"key":"10.1016\/0304-3975(82)90111-6_BIB26","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"issue":"1","key":"10.1016\/0304-3975(82)90111-6_BIB27","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree-manipulating systems and Church-Rosser theorems","volume":"20","author":"Rosen","year":"1973","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0304-3975(82)90111-6_BIB28","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00289152","article-title":"\u00c4quivalente Transformationen f\u00fcr Flussdiagramme","volume":"10","author":"Sabelfeld","year":"1978","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90111-6_BIB29","series-title":"Programming Languages and Systems","first-page":"121","article-title":"Some optimizing transformations for standard schemata","author":"Sabelfeld","year":"1979"},{"issue":"2","key":"10.1016\/0304-3975(82)90111-6_BIB30","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0020-0190(80)90074-5","article-title":"The logic-termal equivalence is polynomial-time decidable","volume":"10","author":"Sabelfeld","year":"1980","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(82)90111-6_BIB31","unstructured":"S.L. Suslov, Personal communication (1979)."},{"key":"10.1016\/0304-3975(82)90111-6_BIB32","series-title":"Automated System for Construction Management","first-page":"36","article-title":"Equivalent transformations of Refal programs","author":"Turchin","year":"1974"},{"issue":"2","key":"10.1016\/0304-3975(82)90111-6_BIB33","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/954063.954069","article-title":"A supercompiler system based on the language REFAL","volume":"14","author":"Turchin","year":"1979","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0304-3975(82)90111-6_BIB34","series-title":"Lectures on Computable Functions","author":"Uspensky","year":"1960"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901116?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901116?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:55:04Z","timestamp":1555062904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582901116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["0304397582901116"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90111-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,4]]}}}