{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:42:13Z","timestamp":1725486133513},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008972"},{"type":"electronic","value":"9783540365761"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36576-1_4","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:42:17Z","timestamp":1181616137000},"page":"54-69","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Generalized Iteration and Coiteration for Higher-Order Nested Datatypes"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Abel","sequence":"first","affiliation":[]},{"given":"Ralph","family":"Matthes","sequence":"additional","affiliation":[]},{"given":"Tarmo","family":"Uustalu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"4_CR1","unstructured":"A. Abel.Termination checking with types.Technical Report 0201,Inst. f\u00fcr Infor-matik,Ludwigs-Maximilians-Univ. M\u00fcnchen,2002."},{"key":"4_CR2","unstructured":"A. Abel and R. Matthes.(Co-)iteration for higher-order nested datatypes. To appear in H. Geuvers, F. Wiedijk,eds.,Post-Conf. Proc. of IST WG TYPES 2nd Ann. Meeting, TYPES\u201902 Lect. Notes in Comput. Sci.Springer-Verlag."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"T. Altenkirch and C. McBride.Generic programming within dependently typed programming.To appear in J. Gibbons and J. Jeuring,Proc. of IFIP TC2 WC on Generic Programming, WCGP 2002 Kluwer Acad.Publishers.","DOI":"10.1007\/978-0-387-35672-3_1"},{"key":"4_CR4","unstructured":"T. Altenkirch and B. Reus.Monadic presentations of lambda terms using general-ized inductive types.In J. Flum and M. Rodr\u00edguez-Artalejo,eds.,Proc. of 13th Int. Wksh. on Computer Science Logic, CSL\u201999 vol.1683 of Lect. Notes in Comput. Sci.pp.53\u2013468.Springer-Verlag,1999."},{"key":"4_CR5","unstructured":"G. Barthe, M.J. Frade, E. Gim\u00e9nez, L. Pinto,and T. Uustalu.Type-based termi-nation of recursive definitions.Math. Struct. in Comput. Sci., to appear."},{"key":"4_CR6","unstructured":"R. Bird, J. Gibbons,and G. Jones.Program optimisation,naturally.In J. Davies, B. Roscoe, J. Woodcock,eds.,Millenial Perspectives in Computer Science. Pal-grave,2000."},{"key":"4_CR7","unstructured":"R. Bird and L. Meertens.Nested datatypes.In J. Jeuring,ed.,Proc. of 4th Int. Conf. on Mathematics of Program Construction, MPC\u201998, vol.1422 of Lect. Notes in Comput. Sci., pp.52\u201367.Springer-Verlag,1998."},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s001650050047","volume":"11","author":"R. Bird","year":"1999","unstructured":"R. Bird and R. Paterson.Generalised folds for nested datatypes.Formal Aspects of Comput., 11(2):200\u2013222,1999.","journal-title":"Formal Aspects of Comput."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1017\/S0956796899003366","volume":"9","author":"R. Bird","year":"1999","unstructured":"R. Bird and R. Paterson.De Bruijn notation as a nested datatype. J. of Funct. Program., 9(1):77\u201391,1999.","journal-title":"J. of Funct. Program."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"E. Gim\u00e9nez.Structural recursive definitions in type theory.In Proc. of 25th Int. Coll. on Automata, Languages and Programming, ICALP\u201998, vol.1443 of Lect. Notes in Comput. Sci., pp.397\u2013408.Springer-Verlag,1998.","DOI":"10.1007\/BFb0055070"},{"key":"4_CR11","unstructured":"R. Hinze.Efficient generalized folds.In J. Jeuring,ed.,Proc.of 2nd Wksh. on Generic Programming, WGP 2000, Tech. Report UU-CS-2000-19, Dept.of Comput.Sci.,Utrecht Univ., pp.1\u201316.2000."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"R. Hinze.Manufacturing datatypes. J. of Funct. Program.11(5):493\u2013524,2001.","DOI":"10.1017\/S095679680100404X"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"R. Hinze.Polytypic values possess polykinded types. Sci. of Comput. Program. 43(2\u20133):129\u2013159, 2002.","DOI":"10.1016\/S0167-6423(02)00025-4"},{"key":"4_CR14","unstructured":"C. B. Jay.Distinguishing data structures and functions:The constructor calculus and functorial types.In S. Abramsky,ed.,Proc. of 5th Int. Conf. on Typed Lambda Calculi and Appl., TLCA\u201901, vol. 2044 of Lect. Notes in Comput. Sci., pp.217\u2013239. Berlin,2001."},{"key":"4_CR15","unstructured":"C. Martin, J. Gibbons and I. Bayley.Disciplined,efficient,generalised folds for nested datatypes.Submitted."},{"key":"4_CR16","unstructured":"R. Matthes.Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types. PhD thesis,Ludwig-Maximilians-Univ.M\u00fcnchen,1998."},{"key":"4_CR17","unstructured":"R. Matthes.Monotone inductive and coinductive constructors of rank 2.In L. Fribourg,ed.,Proc. of 15th Int. Wksh. on Computer Science Logic, CSL 2001 vol.2142 of Lect. Notes in Comput. Sci., pp.600\u2013614.Springer-Verlag, 2001."},{"key":"4_CR18","unstructured":"N. P. Mendler.Recursive types and type constraints in second-order lambda cal-culus.In Proc. of 2nd Ann. IEEE Symp. on Logic in Computer Science, LICS\u201987, pp.30\u201336. IEEE CS Press, 1987."},{"issue":"1\u20132","key":"4_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0168-0072(91)90069-X","volume":"51","author":"N. P. Mendler","year":"1991","unstructured":"N. P. Mendler.Inductive types and type constraints in the second-order lambda calculus.Ann. of Pure and Appl. Logic 51(1\u20132):159\u2013172,1991.","journal-title":"Ann. of Pure and Appl. Logic"},{"key":"4_CR20","unstructured":"S. Mac Lane.Categories for the Working Mathematician vol.5 of Graduate Texts in Mathematics 2nd ed.Springer-Verlag, 1998."},{"key":"4_CR21","unstructured":"T. Uustalu and V. Vene.A cube of proof systems for the intuitionistic predicate \u03bc-,\u03bd-logic.In M. Haveraaen and O. Owe,eds.,Selected Papers from the 8th Nordic Wksh. on Programming Theory, NWPT\u2019 96 Res.Rep. 248,Dept.of Informatics, Univ.of Oslo,pp.237\u2013246,1997."},{"key":"4_CR22","unstructured":"T. Uustalu and V. Vene.Coding recursion \u00e0 la Mendler (extended abstract).In J. Jeuring,ed.,Proc. of 2nd Wksh. on Generic Programming, WGP 2000 Tech. Rep.UU-CS-2000-19,Dept.of Comput.Sci.,Utrecht Univ.,pp.69\u201385.2000."},{"key":"4_CR23","unstructured":"T. Uustalu and V. Vene.The dual of substitution is redecoration.In K. Hammond and S. Curtis,eds.,Trends in Funct. Programming 3 pp.99\u2013110.Intellect,2002."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36576-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T04:23:47Z","timestamp":1581308627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36576-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008972","9783540365761"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36576-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}