{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:46Z","timestamp":1725457006194},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540074168"},{"type":"electronic","value":"9783540379447"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/bfb0029518","type":"book-chapter","created":{"date-parts":[[2005,12,6]],"date-time":"2005-12-06T14:42:57Z","timestamp":1133880177000},"page":"27-61","source":"Crossref","is-referenced-by-count":4,"title":["Least fixed points revisited"],"prefix":"10.1007","author":[{"given":"J. W.","family":"de Bakker","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,11,22]]},"reference":[{"key":"3_CR1","volume-title":"Mathematical Centre Tracts 24","author":"J.W. Bakker De","year":"1971","unstructured":"DE BAKKER, J.W., Recursive Procedures, Mathematical Centre Tracts 24, Mathematisch Centrum, Amsterdam, 1971."},{"key":"3_CR2","unstructured":"DE BAKKER, J.W., Fixed points in programming theory, in: Foundations of Computer Science (J.W. de Bakker, ed.), p.1\u201349, Mathematical Centre Tracts 63, Mathematisch Centrum, 1975."},{"key":"3_CR3","first-page":"167","volume-title":"Automata, Languages and Programming","author":"J.W. Bakker De","year":"1973","unstructured":"DE BAKKER, J.W. & W.P. DE ROEVER, A calculus for recursive program schemes, in: Automata, Languages and Programming (M. Nivat, ed.), p.167\u2013196, North-Holland, Amsterdam, 1973."},{"key":"3_CR4","unstructured":"DE BAKKER, J.W. &. L.G.L.T. MEERTENS, On the completeness of the inductive assertion method, to appear in J. of Comp. Syst. Sciences."},{"key":"3_CR5","volume-title":"Introduction to Combinatory Logic","author":"J.R. Hindley","year":"1972","unstructured":"HINDLEY, J.R., B. LERCHER & J.P. SELDIN, Introduction to Combinatory Logic, Cambridge University Press, Cambridge, 1972."},{"key":"3_CR6","volume-title":"Introduction to Metamathematics","author":"S.C. Rleene","year":"1952","unstructured":"RLEENE, S.C., Introduction to Metamathematics, North-Holland, Amsterdam, 1952."},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"LANDIN, P.J., The mechanical evaluation of expressions, Comp. J, 6 (1964), p.308\u2013320.","journal-title":"Comp. J"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/355609.362336","volume":"16","author":"Z. Manna","year":"1973","unstructured":"MANNA, Z., S. NESS & J. VUILLEMIN, Inductive methods for proving properties of programs, CACM, 16 (1973), p.491\u2013502.","journal-title":"CACM"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1145\/361454.361460","volume":"15","author":"Z. Manna","year":"1972","unstructured":"MANNA, Z. & J. VUILLEMIN, Fixpoint approach to the theory of computation, CACM, 15 (1972), p.528\u2013536.","journal-title":"CACM"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0049-237X(08)72018-4","volume-title":"Computer Programming and Formal Systems","author":"J. McCarthy","year":"1963","unstructured":"McCARTHY, J., A basis for a mathematical theory of computation, in: Computer Programming and Formal Systems (P. Braffort & D. Hirschberg, eds.), p.33\u201370, North-Holland, Amsterdam, 1963."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"MILNER, R., Implementation and applications of Scott's logic for computable functions, in: Proc. of an ACM Conference on Proving Assertions about Programs, p.1\u20136, ACM, 1972.","DOI":"10.1145\/800235.807067"},{"key":"3_CR12","unstructured":"MORRIS, J.H., Lambda-calculus models of programming languages, Ph.D Thesis, M.I.T., 1968."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/362588.362598","volume":"14","author":"J.H. Morris","year":"1971","unstructured":"MORRIS, J.H., Another recursion induction principle, CACM, 14 (1971), p.351\u2013354.","journal-title":"CACM"},{"key":"3_CR14","volume-title":"Report A74\/09","author":"M. Nivat","year":"1974","unstructured":"NIVAT, M., On the interpretation of recursive program schemes, Report A74\/09, Saarland University, Saarbr\u00fccken, 1974."},{"key":"3_CR15","unstructured":"PARK, D., Fixpoint induction and proof of program semantics, in: Machine Intelligence, Vol. 5 (B. Meltzer & D. Michie, eds.) p.59\u201378, Edinburgh University Press, 1970."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science Vol. 14","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-662-21545-6_4","volume-title":"Automata, Languages and Programming","author":"W.P. Roever De","year":"1974","unstructured":"DE ROEVER, W.P., Recursion and parameter-mechanisms: an axiomatic approach, in: Automata, Languages and Programming (J. Loeckx, ed.), p.34\u201365, Lecture Notes in Computer Science Vol. 14, Springer-Verlag, Berlin etc., 1974."},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B.K. Rosen","year":"1973","unstructured":"ROSEN, B.K., Tree-manipulating systems and Church-Rosser theorems, J.ACM, 20 (1973), p.160\u2013187.","journal-title":"J.ACM"},{"key":"3_CR18","unstructured":"SCOTT, D., Outline of a mathematical theory of computation, in: Proc. of the Fourth Annual Princeton Conference on Information Sciences and Systems, p.169\u2013176, Princeton, 1970."},{"key":"3_CR19","unstructured":"SCOTT, D. & J.W. DE BAKKER, A theory of programs, unpublished notes, IBM Seminar, Vienna, 1969."},{"key":"3_CR20","unstructured":"SCOTT, D. & C. STRACHEY, Towards a mathematical semantics for computer languages, in: Proc. of the Symposium on Computers and Automata (J. Fox, ed.), p.19\u201346, Polytechnic Inst. of Brooklyn, 1971."}],"container-title":["Lecture Notes in Computer Science","\u03bb-Calculus and Computer Science Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T12:35:10Z","timestamp":1549456510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074168","9783540379447"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0029518","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}