{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:05:25Z","timestamp":1649156725364},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":8843,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0890-5401(89)90069-2","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"168-226","source":"Crossref","is-referenced-by-count":1,"title":["A logic of recursion"],"prefix":"10.1016","volume":"81","author":[{"given":"V.Michele","family":"Abrusci","sequence":"first","affiliation":[]},{"given":"Gianfranco","family":"Mascari","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90069-2_BIB1","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1145\/6490.6494","article-title":"Countable nondeterminism and random assignment","volume":"33","author":"Apt","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(89)90069-2_BIB2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF00289263","article-title":"Proving correctness of nondeterministic programs in infinitary logic","volume":"15","author":"Back","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0890-5401(89)90069-2_BIB3","series-title":"Mathematical Foundations of Computer Science","first-page":"29","article-title":"Partial interpretations of higher order algebraic types","volume":"Vol. 233","author":"Broy","year":"1986"},{"key":"10.1016\/0890-5401(89)90069-2_BIB4","series-title":"Proceedings, 19th IBM Symposium on Foundations of Computer Science","first-page":"127","article-title":"Computable nondeterministic functions","author":"Chandra","year":"1979"},{"key":"10.1016\/0890-5401(89)90069-2_BIB5","author":"Dalhaus","year":"1985"},{"issue":"No. 5","key":"10.1016\/0890-5401(89)90069-2_BIB6","first-page":"419","article-title":"Calculabilit\u00e9 et bases de donn\u00e9es","volume":"6","author":"De Rougemont","year":"1987","journal-title":"Tech. Sci. Inform."},{"key":"10.1016\/0890-5401(89)90069-2_BIB7","series-title":"Information Processing 86","first-page":"1093","article-title":"Semantic programming","author":"Goncharov","year":"1986"},{"key":"10.1016\/0890-5401(89)90069-2_BIB8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0003-4843(81)90016-4","article-title":"\u03a012-logic, Part I","volume":"21","author":"Girard","year":"1981","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0890-5401(89)90069-2_BIB23","unstructured":"Girard, J.-Y. (in press), \u201cProof Theory and Logical Complexity,\u201d Vol. 2, Bibliopolis, Napoli."},{"key":"10.1016\/0890-5401(89)90069-2_BIB9","first-page":"387","article-title":"Some fixpoint techniquesin algebraic structures and applications to computer science","volume":"10","author":"Guessarian","year":"1987","journal-title":"Fund. Inform."},{"key":"10.1016\/0890-5401(89)90069-2_BIB10","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0019-9958(84)80045-5","article-title":"A programming language for the inductive sets, and applications","volume":"63","author":"Harel","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(89)90069-2_BIB11","series-title":"Proceedings, 12th Annual ACM Symposium on Principles of Programming Languages","first-page":"132","article-title":"Logical and mathematical reasoning about imperative programs","author":"Leivant","year":"1985"},{"key":"10.1016\/0890-5401(89)90069-2_BIB12","series-title":"Proceedings, Symposium on Logic in Computer Science","first-page":"239","article-title":"On the equivalence of weak second order and nonstandard time semantics for various program verification systems","author":"Makowsky","year":"1986"},{"key":"10.1016\/0890-5401(89)90069-2_BIB13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(85)90167-7","article-title":"While programs with nondeterministic assignments and the logic ALNA","volume":"40","author":"Mascari","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90069-2_BIB14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0022-0000(84)90027-8","article-title":"Equivalence among logics of programs","volume":"29","author":"Meyer","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(89)90069-2_BIB24","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, B., Tarlecki, A., and Wirsing, M., Algebraic specification with builtin domain constructions, in \u201cProceedings, CAAP'88\u201d (M. Dauchet and M. Nivat, Eds.), Lecture Notes in Comput. Sci. Vol. 132\u2013148, Springer-Verlag, Berlin.","DOI":"10.1007\/BFb0026101"},{"key":"10.1016\/0890-5401(89)90069-2_BIB15","series-title":"Computation and Proof Theory","first-page":"289","article-title":"Abstract recursion as a theory of algorithms","volume":"Vol. 1104","author":"Moschovakis","year":"1984"},{"key":"10.1016\/0890-5401(89)90069-2_BIB16","series-title":"Foundations of the theory of algorithms","author":"Moschovakis","year":"1986"},{"key":"10.1016\/0890-5401(89)90069-2_BIB17","series-title":"Types and partial functions","author":"Plotkin","year":"1985"},{"key":"10.1016\/0890-5401(89)90069-2_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(86)80027-4","article-title":"On specifications, theories and models with higher types","volume":"68","author":"Poign\u00e9","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(89)90069-2_BIB19","first-page":"142","author":"Rasiowa","year":"1982"},{"key":"10.1016\/0890-5401(89)90069-2_BIB20","series-title":"Harvey Friedman's Research on the Foundations of Mathematics","first-page":"285","article-title":"Algorithmic procedures, generalized Turing algorithms and elementary recursion theory","author":"Sheperdson","year":"1985"},{"key":"10.1016\/0890-5401(89)90069-2_BIB21","first-page":"95","article-title":"Continuous abstract types","volume":"9","author":"Tarlecki","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/0890-5401(89)90069-2_BIB22","series-title":"Symposium on Mathematical Foundations of Computer Science","first-page":"137","article-title":"Recursive program schemes and computable functionals","volume":"Vol. 45","author":"Trakhtenbrot","year":"1976"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900692?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900692?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T12:49:29Z","timestamp":1586004569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0890540189900692"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90069-2","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}