{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:03:44Z","timestamp":1750309424569},"reference-count":8,"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)90034-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"225-247","source":"Crossref","is-referenced-by-count":6,"title":["Relationships between classes of monotonic functions"],"prefix":"10.1016","volume":"2","author":[{"given":"Mark B","family":"Trakhtenbrot","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/0304-3975(76)90034-7_BIB1","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)90034-7_BIB2","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)90034-7_BIB3","series-title":"Record of Project MAC Conference on Concurrent Systems and Parallel Computation","first-page":"119","article-title":"Comparative schematology","author":"Paterson","year":"1970"},{"key":"10.1016\/0304-3975(76)90034-7_BIB4","series-title":"Proc. Symp. on \u03bb-Calculus and Computer Science Theory","first-page":"312","article-title":"Sequentially and parallely computable functionals (extended abstract)","volume":"37","author":"Sazonov","year":"1975"},{"key":"10.1016\/0304-3975(76)90034-7_BIB5","series-title":"A type-theoretical alternative to CUCH, ISWIM, OWHY","author":"Scott","year":"1969"},{"key":"10.1016\/0304-3975(76)90034-7_BIB6","series-title":"Outline of a mathematical theory of computation","author":"Scott","year":"1970"},{"key":"10.1016\/0304-3975(76)90034-7_BIB7","series-title":"System and Theoretical Programming","first-page":"188","article-title":"On interpreted functions in program schemata","author":"Trakhtenbrot","year":"1973"},{"key":"10.1016\/0304-3975(76)90034-7_BIB8","series-title":"Ph.D. Thesis","article-title":"Proof techniques for recursive programs","author":"Vuillemin","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900347?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900347?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:21:03Z","timestamp":1555111263000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976]]}},"alternative-id":["0304397576900347"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90034-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}