{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T17:25:31Z","timestamp":1778520331216,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642284113","type":"print"},{"value":"9783642284120","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28412-0_17","type":"book-chapter","created":{"date-parts":[[2012,2,18]],"date-time":"2012-02-18T04:14:28Z","timestamp":1329538468000},"page":"270-286","source":"Crossref","is-referenced-by-count":3,"title":["Proving Properties about Functions on Lists Involving Element Tests"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Seidel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janis","family":"Voigtl\u00e4nder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-36576-1_2","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Abbott","year":"2003","unstructured":"Abbott, M., Altenkirch, T., Ghani, N.: Categories of Containers. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 23\u201338. Springer, Heidelberg (2003)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.002","volume":"342","author":"M. Abbott","year":"2005","unstructured":"Abbott, M., Altenkirch, T., Ghani, N.: Containers: Constructing strictly positive types. Theoretical Computer Science\u00a0342(1), 3\u201327 (2005)","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-11957-6_8","volume-title":"Programming Languages and Systems","author":"J.-P. Bernardy","year":"2010","unstructured":"Bernardy, J.-P., Jansson, P., Claessen, K.: Testing Polymorphic Properties. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol.\u00a06012, pp. 125\u2013144. Springer, Heidelberg (2010)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48242-3_1","volume-title":"Logic Programming and Automated Reasoning","author":"A. Bundy","year":"1999","unstructured":"Bundy, A., Richardson, J.: Proofs about Lists Using Ellipsis. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol.\u00a01705, pp. 1\u201312. Springer, Heidelberg (1999)"},{"issue":"2-3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0167-6423(95)00015-1","volume":"25","author":"C.B. Jay","year":"1995","unstructured":"Jay, C.B.: A semantics for shape. Science of Computer Programming\u00a025(2-3), 251\u2013283 (1995)","journal-title":"Science of Computer Programming"},{"key":"17_CR6","unstructured":"Peyton Jones, S.L. (ed.): Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press (2003)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-78969-7_9","volume-title":"Functional and Logic Programming","author":"R. Prince","year":"2008","unstructured":"Prince, R., Ghani, N., McBride, C.: Proving Properties about Lists Using Containers. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 97\u2013112. Springer, Heidelberg (2008)"},{"key":"17_CR8","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: Proc. of Information Processing, pp. 513\u2013523. Elsevier (1983)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Theorems for free! In: Proc. of FPCA 1989, pp. 347\u2013359. ACM (1989)","DOI":"10.1145\/99370.99404"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Wadler, P., Blott, S.: How to make ad-hoc polymorphism less ad hoc. In: Proc. of POPL 1989, pp. 60\u201376. ACM (1989)","DOI":"10.1145\/75277.75283"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28412-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:04:36Z","timestamp":1548529476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28412-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642284113","9783642284120"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28412-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}