{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:10:43Z","timestamp":1725577843669},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540356318"},{"type":"electronic","value":"9783540356325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11783596_18","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T14:35:02Z","timestamp":1151505302000},"page":"299-315","source":"Crossref","is-referenced-by-count":1,"title":["A Datastructure for Iterated Powers"],"prefix":"10.1007","author":[{"given":"Ralph","family":"Matthes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","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. Theor. Comput. Sci.\u00a0342(1), 3\u201327 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-39185-1_1","volume-title":"Types for Proofs and Programs","author":"A. Abel","year":"2003","unstructured":"Abel, A., Matthes, R. (Co-)Iteration for higher-order nested datatypes. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol.\u00a02646, pp. 1\u201320. Springer, Heidelberg (2003)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-36576-1_4","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Abel","year":"2003","unstructured":"Abel, A., Matthes, R., Uustalu, T.: Generalized iteration and coiteration for higher-order nested datatypes. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 54\u201369. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.10.017","volume":"333","author":"A. Abel","year":"2005","unstructured":"Abel, A., Matthes, R., Uustalu, T.: Iteration and coiteration schemes for higher-order and nested datatypes. Theor. Comput. Sci.\u00a0333(1-2), 3\u201366 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/10704973_2","volume-title":"Advanced Functional Programming","author":"R. Backhouse","year":"1999","unstructured":"Backhouse, R., Jansson, P., Jeuring, J., Meertens, L.: Generic programming\u2014an introduction. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol.\u00a01608, pp. 28\u2013115. Springer, Heidelberg (1999)"},{"key":"18_CR6","volume-title":"Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. In: Coq\u2019Art: The Calculus of Inductive Constructions. Springer, Heidelberg (2004)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0054285","volume-title":"Mathematics of Program Construction","author":"R. Bird","year":"1998","unstructured":"Bird, R., Meertens, L.: Nested datatypes. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol.\u00a01422, pp. 52\u201367. Springer, Heidelberg (1998)"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s001650050047","volume":"11","author":"R. Bird","year":"1999","unstructured":"Bird, R., Paterson, R.: Generalised folds for nested datatypes. Formal Aspects of Comput.\u00a011(2), 200\u2013222 (1999)","journal-title":"Formal Aspects of Comput."},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1017\/S0956796899003366","volume":"9","author":"R.S. Bird","year":"1999","unstructured":"Bird, R.S., Paterson, R.: De Bruijn notation as a nested datatype. J. of Functional Programming\u00a09(1), 77\u201391 (1999)","journal-title":"J. of Functional Programming"},{"key":"18_CR10","unstructured":"Girard, J.-Y.: Interpr\u00e9tation fonctionnelle et \u00e9limination des coupures dans l\u2019arithm\u00e9tique d\u2019ordre sup\u00e9rieur. Doctorat d\u2019\u00c9tat. Universit\u00e9 de Paris VII (1972)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/10722010_2","volume-title":"Mathematics of Program Construction","author":"R. Hinze","year":"2000","unstructured":"Hinze, R.: Polytypic values possess polykinded types. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 2\u201327. Springer, Heidelberg (2000)"},{"key":"18_CR12","unstructured":"Hinze, R.: Efficient generalized folds. In: Jeuring, J. (ed.) Proc. of 2nd Wksh. on Generic Programming, WGP 2000, Univ. Utrecht (2000)"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1017\/S0956796800003713","volume":"10","author":"R. Hinze","year":"2000","unstructured":"Hinze, R.: Generalizing generalized tries. J. of Funct. Program.\u00a010(4), 327\u2013351 (2000)","journal-title":"J. of Funct. Program."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45191-4_1","volume-title":"Generic Programming","author":"R. Hinze","year":"2003","unstructured":"Hinze, R., Jeuring, J.: Generic haskell: Practice and theory. In: Backhouse, R., Gibbons, J. (eds.) Generic Programming. LNCS, vol.\u00a02793, pp. 1\u201356. Springer, Heidelberg (2003)"},{"issue":"2","key":"18_CR15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1017\/S0956796899003640","volume":"10","author":"P.F. Hoogendijk","year":"2000","unstructured":"Hoogendijk, P.F., de Moor, O.: Container types categorically. J. of Funct. Program.\u00a010(2), 91\u2013225 (2000)","journal-title":"J. of Funct. Program."},{"key":"18_CR16","unstructured":"L\u00f6h, A.: Exploring Generic Haskell. Proefschrift (PhD thesis). Institute for Programming Research and Algorithmics, Universiteit Utrecht, 331 pages (2004)"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00165-003-0013-6","volume":"16","author":"C. Martin","year":"2004","unstructured":"Martin, C., Gibbons, J., Bayley, I.: Disciplined, efficient, generalised folds for nested datatypes. Formal Aspects of Comput.\u00a016(1), 19\u201335 (2004)","journal-title":"Formal Aspects of Comput."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Matthes, R.: Coq development for A Datastructure for Iterated Powers (2006), \n                    \n                      http:\/\/www.irit.fr\/~Ralph.Matthes\/Coq\/MPC06\/","DOI":"10.1007\/11783596_18"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-45842-5_13","volume-title":"Types for Proofs and Programs","author":"C. McBride","year":"2002","unstructured":"McBride, C.: Elimination with a motive. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol.\u00a02277, pp. 197\u2013216. Springer, Heidelberg (2002)"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/317636.317781","volume-title":"Proc. of 4th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 1999","author":"C. Okasaki","year":"1999","unstructured":"Okasaki, C.: From fast exponentiation to square matrices: an adventure in types. In: Proc. of 4th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 1999, pp. 28\u201335. ACM Press, New York (1999)"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/11541868_18","volume-title":"Theorem Proving in Higher Order Logics","author":"N. Oury","year":"2005","unstructured":"Oury, N.: Extensionality in the calculus of constructions. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 278\u2013293. Springer, Heidelberg (2005)"},{"key":"18_CR22","unstructured":"Rodriguez, D.: Verification of (co)iteration schemes for nested datatypes in Coq. Student project, Inst. f\u00fcr Informatik, LMU M\u00fcnchen (2006), Available from: \n                    \n                      http:\/\/www.tcs.ifi.lmu.de\/~rodrigue\/project.html"},{"key":"18_CR23","unstructured":"The Coq Development Team: The Coq Proof Assistant Reference Manual Version 8.0. Project LogiCal, INRIA (2005), System, available from: \n                    \n                      http:\/\/coq.inria.fr\/"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/99370.99404","volume-title":"Proc. of 4th Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA 1989","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for free! In: Proc. of 4th Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA 1989, pp. 347\u2013359. ACM Press, New York (1989)"},{"key":"18_CR25","unstructured":"Xi, H.: Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University (1998)"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11783596_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:51Z","timestamp":1605643671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11783596_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540356318","9783540356325"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11783596_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}