{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:57:47Z","timestamp":1752983867330},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0096-0551(89)90004-0","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"181-191","source":"Crossref","is-referenced-by-count":5,"title":["What about the natural numbers?"],"prefix":"10.1016","volume":"14","author":[{"given":"Colin","family":"Runciman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(89)90004-0_BIB1","series-title":"The C Programming Language","author":"Kernighan","year":"1988"},{"key":"10.1016\/0096-0551(89)90004-0_BIB2","series-title":"Programming in Modula-2","author":"Wirth","year":"1983"},{"key":"10.1016\/0096-0551(89)90004-0_BIB3","series-title":"ACM Conf. on LISP and Functional Programming","first-page":"162","article-title":"Exact real arithmetic: A case study in higher order programming","author":"Boehm","year":"1986"},{"key":"10.1016\/0096-0551(89)90004-0_BIB4","series-title":"ACM Conf. on LISP and Functional Programming","first-page":"14","article-title":"Exact real computer arithmetic with continued fractions","author":"Vuillemin","year":"1988"},{"key":"10.1016\/0096-0551(89)90004-0_BIB5","series-title":"Functional Programming and its Applications","article-title":"Recursion equations as a programming language","author":"Turner","year":"1982"},{"key":"10.1016\/0096-0551(89)90004-0_BIB6","series-title":"ACM Conf. on Functional Programming Languages and Computer Architecture","first-page":"85","article-title":"The semantic elegance of applicative languages","author":"Turner","year":"1981"},{"key":"10.1016\/0096-0551(89)90004-0_BIB7","series-title":"Introduction to Functional Programming","author":"Bird","year":"1988"},{"key":"10.1016\/0096-0551(89)90004-0_BIB8","series-title":"ACM Symp. on LISP and Functional Programming","first-page":"184","article-title":"A proposal for standard ML","author":"Milner","year":"1984"},{"issue":"4","key":"10.1016\/0096-0551(89)90004-0_BIB9","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive functions of symbolic expressions and their computation by machine, Part I","volume":"3","author":"McCarthy","year":"1960","journal-title":"Commun. ACM"},{"key":"10.1016\/0096-0551(89)90004-0_BIB10","series-title":"Proc. 3rd Int. Colloq. on Automata, Languages and Programming","article-title":"CONS should not evaluate its arguments","author":"Friedman","year":"1976"},{"key":"10.1016\/0096-0551(89)90004-0_BIB11","series-title":"3rd ACM Symp. on Principles of Programming Languages","first-page":"95","article-title":"A lazy evaluator","author":"Henderson","year":"1976"},{"key":"10.1016\/0096-0551(89)90004-0_BIB12","series-title":"Tools and Notions for Program Construction","article-title":"Functional programming and proofs of program correctness","author":"Turner","year":"1982"},{"key":"10.1016\/0096-0551(89)90004-0_BIB13","series-title":"Pascal User Manual and Report","author":"Wirth","year":"1975"},{"key":"10.1016\/0096-0551(89)90004-0_BIB14","series-title":"Algorithmics","author":"Harel","year":"1987"},{"key":"10.1016\/0096-0551(89)90004-0_BIB15","article-title":"Why functional programming matters","author":"Hughes","year":"1984","journal-title":"Chalmers University, Goteborg, Sweden: Report PMG-40"},{"key":"10.1016\/0096-0551(89)90004-0_BIB16","series-title":"Abstract Interpretation of Declarative Languages","year":"1987"},{"key":"10.1016\/0096-0551(89)90004-0_BIB17","series-title":"Functional Programming Languages and Computer Architecture","article-title":"Strictness analysis\u2014A practical approach","author":"Clack","year":"1985"},{"key":"10.1016\/0096-0551(89)90004-0_BIB18","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-19020-1_26","article-title":"Path semantics","author":"Bloss","year":"1988"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900040?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900040?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T07:23:25Z","timestamp":1552634605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055189900040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0096055189900040"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(89)90004-0","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}