{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:30:32Z","timestamp":1672428632815},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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":13712,"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":[[1976]]},"DOI":"10.1016\/0304-3975(76)90031-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"155-181","source":"Crossref","is-referenced-by-count":14,"title":["Least fixed points revisited"],"prefix":"10.1016","volume":"2","author":[{"given":"J.W.","family":"De Bakker","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90031-1_BIB1","article-title":"Recursive Procedures","volume":"24","author":"De Bakker","year":"1971"},{"key":"10.1016\/0304-3975(76)90031-1_BIB2","series-title":"Foundations of Computer Science","first-page":"1","article-title":"Fixed points in programming theory","volume":"63","author":"De Bakker","year":"1975"},{"key":"10.1016\/0304-3975(76)90031-1_BIB3","series-title":"Automata, Languages and Programming","first-page":"167","article-title":"A calculus for recursive program schemes","author":"De Bakker","year":"1973"},{"key":"10.1016\/0304-3975(76)90031-1_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0022-0000(75)80056-0","article-title":"On the completeness of the inductive assertion method","volume":"11","author":"De Bakker","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90031-1_BIB5","series-title":"Introduction to Combinatory Logic","author":"Hindley","year":"1972"},{"key":"10.1016\/0304-3975(76)90031-1_BIB6","series-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(76)90031-1_BIB7","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","article-title":"The mechanical evaluation of expressions","volume":"6","author":"Landin","year":"1964","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(76)90031-1_BIB8","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/355609.362336","article-title":"Inductive methods for proving properties of programs","volume":"16","author":"Manna","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(76)90031-1_BIB9","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1145\/361454.361460","article-title":"Fixpoint approach to the theory of computation","volume":"15","author":"Manna","year":"1972","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(76)90031-1_BIB10","series-title":"Computer Programming and Formal Systems","first-page":"33","article-title":"A basis for a mathematical theory of computation","author":"McCarthy","year":"1963"},{"key":"10.1016\/0304-3975(76)90031-1_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/800235.807067","article-title":"Implementation and applications of Scott's logic for computable functions","author":"Milner","year":"1972","journal-title":"Proc. of an ACM Conference on Proving Assertions about Programs"},{"key":"10.1016\/0304-3975(76)90031-1_BIB12","series-title":"Ph.D. Thesis","article-title":"Lambda-calculus models of programming languages","author":"Morris","year":"1968"},{"key":"10.1016\/0304-3975(76)90031-1_BIB13","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(76)90031-1_BIB14","series-title":"Report A74\/09","article-title":"On the interpretation of recursive program schemes","author":"Nivat","year":"1974"},{"key":"10.1016\/0304-3975(76)90031-1_BIB15","first-page":"59","article-title":"Fixpoint induction and proof of program semantics","volume":"5","author":"Park","year":"1970"},{"key":"10.1016\/0304-3975(76)90031-1_BIB16","series-title":"Automata, Languages and Programming","first-page":"34","article-title":"Recursion and parameter-mechanisms: an axiomatic approach","volume":"14","author":"De Roever","year":"1974"},{"key":"10.1016\/0304-3975(76)90031-1_BIB17","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"},{"key":"10.1016\/0304-3975(76)90031-1_BIB18","first-page":"169","article-title":"Outline of a mathematical theory of computation","author":"Scott","year":"1970","journal-title":"Proc. of the Fourth Annual Princeton Conference on Information Sciences and Systems"},{"key":"10.1016\/0304-3975(76)90031-1_BIB19","article-title":"A theory of programs","author":"Scott","year":"1969","journal-title":"IBM Seminar"},{"key":"10.1016\/0304-3975(76)90031-1_BIB20","series-title":"Proc. of the Symposium on Computers and Automata","first-page":"19","article-title":"Towards a mathematical semantics for computer languages","author":"Scott","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900311?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900311?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:54:12Z","timestamp":1555077252000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976]]}},"alternative-id":["0304397576900311"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90031-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}