{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:02Z","timestamp":1725664202023},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_58","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:28:26Z","timestamp":1330273706000},"page":"449-463","source":"Crossref","is-referenced-by-count":0,"title":["Mechanical elimination of commutative redundancy"],"prefix":"10.1007","author":[{"given":"Hessam","family":"Khoshnevisan","sequence":"first","affiliation":[]},{"given":"Mohamad","family":"Afshar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"8","key":"29_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. W. Backus","year":"1978","unstructured":"J W Backus. Can programming be liberated from the von neumann style? Communications of the ACM, 21(8):613\u2013641, 1978.","journal-title":"Communications of the ACM"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"J W Backus. The algebra of functional programs: function level reasoning, linear equations and extended definitions, volume 107, chapter 1, pages 1\u201343. Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10699-5_91"},{"key":"29_CR3","unstructured":"R Bailey, A J Field, and H Khoshnevisan. Efficient implementation of functional programs. Research Report, Imperial College, 1986."},{"issue":"4","key":"29_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/356827.356831","volume":"12","author":"R. S. Bird","year":"1980","unstructured":"R S Bird. Tabulation techniques for recursive programs. ACM Computing Surveys, 12(4):403\u2013417, 1980.","journal-title":"ACM Computing Surveys"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"R S Bird. Improving programs by the introduction of recursion. Communications of the ACM, 20(1):856\u2013863, 77.","DOI":"10.1145\/359863.359889"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"R M Burstall and J D Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1), 1977.","DOI":"10.1145\/321992.321996"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/2166.2167","volume":"5","author":"N. H. Cohen","year":"1983","unstructured":"N H Cohen. Eliminating redundant recursive calls. ACM Transactions on Programming Languages and Systems, 5:265\u2013269, 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"J Darlington. A synthesis of several sorting programs. Acta Informatica, 11(1), 1978.","DOI":"10.1007\/BF00264597"},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1093\/comjnl\/35.2.138","volume":"35","author":"P. G. Harrison","year":"1992","unstructured":"P G Harrison, and H Khoshnevisan. The mechanical transformation of data types. The Computer Journal, 35(2):138\u2013146, 1992.","journal-title":"The Computer Journal"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(92)90213-Y","volume":"93","author":"P. G. Harrison","year":"1992","unstructured":"P G Harrison, and H Khoshnevisan. A new approach to recursion removal. Theoretical Computer Science, 93:91\u2013113, 1992.","journal-title":"Theoretical Computer Science"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01185679","volume":"29","author":"P. G. Harrison","year":"1992","unstructured":"P G Harrison, and H Khoshnevisan. On the synthesis of function inverses. Acta Informatica, 29:211\u2013239, 1992.","journal-title":"Acta Informatica"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02983374","volume":"28","author":"H Khoshnevisan","year":"1990","unstructured":"H Khoshnevisan. Efficient memo-table management strategies. Acta Informatica, 28:43\u201381, 1990.","journal-title":"Acta Informatica"},{"key":"29_CR13","first-page":"119","volume-title":"Comparative schematology, record of project mac","author":"M. S. Paterson","year":"1970","unstructured":"M S Paterson, and C E Hewitt. Comparative schematology, record of project mac. In Proceedings: Conference on Concurrent Systems and Parallel Computation, Woods Hole, Mass, pages 119\u2013127, June 1970."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:22:26Z","timestamp":1605648146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}