{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:05Z","timestamp":1725460025105},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540582770"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0049339","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T18:58:16Z","timestamp":1141671496000},"page":"305-317","source":"Crossref","is-referenced-by-count":2,"title":["Program transformation and proof transformation"],"prefix":"10.1007","author":[{"given":"Wilfried","family":"Sieg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanley S.","family":"Wainer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"P. Anderson, Program Derivation by Proof Transformation, Carnegie Mellon Technical Report CS-93\u2013206, 1993."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"L. Colson, About Primitive Recursive Algorithms, in Proceedings ICALP '89, Springer Lecture Notes in Computer Science 372, 194\u2013206.","DOI":"10.1007\/BFb0035761"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0890-5401(92)90027-D","volume":"99","author":"M.V. Fairtlough","year":"1992","unstructured":"M.V. Fairtlough and S.S. Wainer, Ordinal Complexity of Recursive Definitions, Information and Computation Vol. 99, 1992, 123\u2013153.","journal-title":"Information and Computation"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"S. Feferman, Logics for Termination and Correctness of Functional Programs II, Logics of Strength PRA, in \u201dProof Theory\u201d, Eds. P.Aczel, H. Simmons, S. Wainer; Cambridge 1992, 195\u2013225.","DOI":"10.1017\/CBO9780511896262.009"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"J.Y. Girard, Linear Logic, Theor. Comp. Science Vol.50, 1987, 1\u2013102.","journal-title":"Theor. Comp. Science"},{"key":"20_CR6","unstructured":"C. Goad, Computational Uses of the Manipulation of Formal Proofs, Stanford Technical Report CS-80\u2013819, 1980."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"P. Madden, Automatic Program Optimization through Proof Transformation, Proc. 11th. Intl. Conf. on Automatic Deduction, Ed. D. Kapur, Springer-Verlag LNAI 607, 1992, 446\u2013460.","DOI":"10.1007\/3-540-55602-8_183"},{"key":"20_CR8","unstructured":"R. P\u00e9ter, Recursive Functions, Academic Press 1967."},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1090\/conm\/106\/1057826","volume":"106","author":"F. Pfenning","year":"1990","unstructured":"F. Pfenning, Program Development through Proof Transformation, AMS Contemporary Mathematics Vol.106, 1990, 251\u2013262.","journal-title":"AMS Contemporary Mathematics"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"H. Schwichtenberg, Proofs as Programs, in \u201dProof Theory\u201d, Eds. P.Aczel, H. Simmons, S. Wainer; Cambridge 1992, 79\u2013113.","DOI":"10.1017\/CBO9780511896262.005"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01621477","volume":"30","author":"W. Sieg","year":"1991","unstructured":"W. Sieg, Herbrand Analyses, Archive Math Logic Vol.30, 1991, 409\u2013441.","journal-title":"Archive Math Logic"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"S.S. Wainer, Four Lectures on Primitive Recursion, in \u201dLogic and Algebra of Specification\u201d, Eds. F. Bauer, W. Brauer, H. Schwichtenberg; Springer-Verlag ASI Series F Vol. 94, 1993, 377\u2013410.","DOI":"10.1007\/978-3-642-58041-3_10"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049339.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:47Z","timestamp":1607550947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540582770"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0049339","relation":{},"subject":[]}}