{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T08:13:56Z","timestamp":1672474436354},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,10,1]],"date-time":"1979-10-01T00:00:00Z","timestamp":307584000000},"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":12343,"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":[[1979,10]]},"DOI":"10.1016\/0304-3975(79)90034-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"329-345","source":"Crossref","is-referenced-by-count":30,"title":["Mechanizing structural induction part I: Formal system"],"prefix":"10.1016","volume":"9","author":[{"given":"Raymond","family":"Aubin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90034-3_BIB1","series-title":"Ph.D. thesis","article-title":"Mechanizing structural induction","author":"Aubin","year":"1976"},{"issue":"3","key":"10.1016\/0304-3975(79)90034-3_BIB2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(79)90035-5","article-title":"Mechanizing structural induction, part II: Strategies","volume":"9","author":"Aubin","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90034-3_BIB3","first-page":"511","article-title":"A lemma driven automatic theorem prover for recursive function theory","author":"Boyer","year":"1977","journal-title":"Proc. 5th International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0304-3975(79)90034-3_BIB4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/321864.321875","article-title":"Proving theorems about LISP functions","volume":"22","author":"Boyer","year":"1975","journal-title":"J.ACM"},{"key":"10.1016\/0304-3975(79)90034-3_BIB5","series-title":"STAN-CS-74-443","article-title":"Embedding heuristic problem solving methods in a mechanical theorem prover","author":"Brotz","year":"1974"},{"key":"10.1016\/0304-3975(79)90034-3_BIB6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","article-title":"Proving properties of programs by structural induction","volume":"12","author":"Burstall","year":"1969","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(79)90034-3_BIB7","series-title":"Ph.D. thesis","article-title":"A practical formal semantic definition and verification system for TYPED LISP","author":"Cartwright","year":"1976"},{"key":"10.1016\/0304-3975(79)90034-3_BIB8","series-title":"Proc. Third Int. Coll. Automata, Languages and Programming","first-page":"228","article-title":"User-defined data types as an aid to verifying LISP programs","author":"Cartwright","year":"1976"},{"key":"10.1016\/0304-3975(79)90034-3_BIB9","series-title":"Universal Algebra","author":"Cohn","year":"1965"},{"key":"10.1016\/0304-3975(79)90034-3_BIB10","author":"Gentzen","year":"1955"},{"key":"10.1016\/0304-3975(79)90034-3_BIB11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF00976239","article-title":"Recursive data structures","volume":"4","author":"Hoare","year":"1975","journal-title":"Internat. J. Comput. Information Sci."},{"key":"10.1016\/0304-3975(79)90034-3_BIB12","first-page":"127","article-title":"Untersuchungen zum Pradikatenkalkul","volume":"10","author":"Ketonen","year":"1945","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(79)90034-3_BIB13","series-title":"Actes coll. Construction, Am\u00e9lioration et V\u00e9rification de Programmes","first-page":"371","article-title":"A logic for computable functions with reflexive and polymorphic types","author":"Milner","year":"1975"},{"key":"10.1016\/0304-3975(79)90034-3_BIB14","series-title":"Ph.D. thesis","article-title":"Computational logic: structure sharing and proof of program properties","author":"Moore","year":"1973"},{"key":"10.1016\/0304-3975(79)90034-3_BIB15","series-title":"Recursive Functions","author":"Peter","year":"1967"},{"key":"10.1016\/0304-3975(79)90034-3_BIB16","series-title":"Introduction to Discrete Structures","author":"Preparata","year":"1973"},{"key":"10.1016\/0304-3975(79)90034-3_BIB17","series-title":"Mathematical Logic","author":"Robbin","year":"1969"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900343?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900343?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:23:58Z","timestamp":1555111438000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,10]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,10]]}},"alternative-id":["0304397579900343"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90034-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,10]]}}}