{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:42:45Z","timestamp":1648658565960},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,7,1]],"date-time":"1979-07-01T00:00:00Z","timestamp":299635200000},"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":12435,"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":[[1979,7]]},"DOI":"10.1016\/0304-3975(79)90005-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"39-65","source":"Crossref","is-referenced-by-count":9,"title":["Program transformations and algebraic semantics"],"prefix":"10.1016","volume":"9","author":[{"given":"Ir\u00e8ne","family":"Guessarian","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90005-7_BIB1","series-title":"The Theory of Parsing, Translation and Compiling","author":"Aho","year":"1973"},{"key":"10.1016\/0304-3975(79)90005-7_BIB2","series-title":"Solvable Cases of the Decision Problems","author":"Ackermann","year":"1962"},{"key":"10.1016\/0304-3975(79)90005-7_BIB3","series-title":"La construction de programmes structur\u00e9s","author":"Arsac","year":"1977"},{"key":"10.1016\/0304-3975(79)90005-7_BIB4","first-page":"250","article-title":"The translation of GOTO programs to WHILE programs","author":"Ashcroft","year":"1971"},{"key":"10.1016\/0304-3975(79)90005-7_BIB5","series-title":"Lattice Theory","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0304-3975(79)90005-7_BIB6","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(79)90005-7_BIB7","first-page":"137","article-title":"Algebraic families of interpretations","author":"Courcelle","year":"1976","journal-title":"17th Symp. on F.O.C.S., Houston"},{"key":"10.1016\/0304-3975(79)90005-7_BIB8","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0022-0000(78)90016-8","article-title":"On some classes of interpretations","volume":"17","author":"Courcelle","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90005-7_BIB9","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1137\/0205031","article-title":"Correct computation rules for recursive languages","volume":"5","author":"Downey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(79)90005-7_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(71)90018-4","article-title":"Notes on avoiding GOTO statements","volume":"1","author":"Floyd","year":"1971","journal-title":"Information Processing Letters"},{"key":"10.1016\/0304-3975(79)90005-7_BIB11","first-page":"133","article-title":"Les tests et leur caract\u00e9risation syntaxique","volume":"11","author":"Guessarian","year":"1977","journal-title":"RAIRO"},{"key":"10.1016\/0304-3975(79)90005-7_BIB12","series-title":"Proc. 3rd I.C.S.","first-page":"352","article-title":"Une m\u00e9thode syntaxique d`optimisation de programmes","author":"Guessarian","year":"1978"},{"key":"10.1016\/0304-3975(79)90005-7_BIB13","first-page":"189","article-title":"Semantic equivalence of program schemes and its syntactic characterization","author":"Guessarian","year":"1976","journal-title":"Proc. 3rd ICALP, Edinburgh"},{"key":"10.1016\/0304-3975(79)90005-7_BIB14","series-title":"Th\u00e8se d'Etat","article-title":"Sch\u00e9mas de programmes r\u00e9cursifs polyadiques: \u00e9quivalences et classes d'interpr\u00e9tations","author":"Guessarian","year":"1975"},{"key":"10.1016\/0304-3975(79)90005-7_BIB15","series-title":"Problems of Cybernetics","first-page":"82","article-title":"The logical schemes of algorithms","author":"Ianov","year":"1960"},{"key":"10.1016\/0304-3975(79)90005-7_BIB16","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0022-0000(70)80022-8","article-title":"On formalized computer programs","volume":"4","author":"Luckham","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90005-7_BIB17","article-title":"Models of LCF","author":"Milner","year":"1973","journal-title":"Stanford A.I. Lab. Memo. AIM\/CS 332"},{"key":"10.1016\/0304-3975(79)90005-7_BIB18","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/362588.362598","article-title":"Another recursion induction principle","volume":"14","author":"Morris","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(79)90005-7_BIB19","first-page":"256","article-title":"On the interpretation of recursive polyadic program schemes","author":"Nivat","year":"1975","journal-title":"Symposia Mathematica 15, Rome"},{"key":"10.1016\/0304-3975(79)90005-7_BIB20","first-page":"7","article-title":"Program equivalence and context-free grammars","author":"Rosen","year":"1972","journal-title":"13th SWAT"},{"key":"10.1016\/0304-3975(79)90005-7_BIB21","series-title":"Technical Monograph PRG-6","article-title":"Towards a mathematical semantics for computer languages","author":"Scott","year":"1971"},{"key":"10.1016\/0304-3975(79)90005-7_BIB22","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/S0022-0000(71)80036-3","article-title":"Translating recursion equations into flowcharts","volume":"5","author":"Strong","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90005-7_BIB23","series-title":"Th\u00e8se d'Etat","article-title":"Syntaxe, s\u00e9mantique et axiomatique d'un langage de programmation simple","author":"Vuillemin","year":"1974"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900057?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900057?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:23:42Z","timestamp":1555125822000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,7]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,7]]}},"alternative-id":["0304397579900057"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90005-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,7]]}}}