{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:12:28Z","timestamp":1725577948806},"publisher-location":"Berlin, Heidelberg","reference-count":48,"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_4","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T14:35:02Z","timestamp":1151505302000},"page":"10-28","source":"Crossref","is-referenced-by-count":3,"title":["Towards Generic Programming with Sized Types"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Abel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44904-3_1","volume-title":"Typed Lambda Calculi and Applications","author":"A. Abel","year":"2003","unstructured":"Abel, A.: Termination and guardedness checking with continuous types. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 1\u201315. Springer, Heidelberg (2003)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1051\/ita:2004015","volume":"38","author":"A. Abel","year":"2004","unstructured":"Abel, A.: Termination checking with types. Theor. Inform. and Appl.\u00a038, 277\u2013319 (2004)","journal-title":"Theor. Inform. and Appl."},{"key":"4_CR3","unstructured":"Abel, A.: A Polymorphic Lambda-Calculus with Sized Higher-Order Types. PhD thesis, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen (2006), Draft available at: http:\/\/www.tcs.ifi.lmu.de\/~abel\/diss.pdf"},{"key":"4_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 schemes for higher-order and nested datatypes. Theor. Comput. Sci.\u00a0333, 3\u201366 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR5","first-page":"1","volume-title":"Proc. of IFIP TC2\/WG2.1 Working Conf. on Generic Programming, WCGP 2002. IFIP Conf. Proceedings","author":"T. Altenkirch","year":"2003","unstructured":"Altenkirch, T., McBride, C.: Generic programming within dependently typed programming. In: Gibbons, J., Jeuring, J. (eds.) Proc. of IFIP TC2\/WG2.1 Working Conf. on Generic Programming, WCGP 2002. IFIP Conf. Proceedings, vol.\u00a0243, pp. 1\u201320. Kluwer, Dordrecht (2003)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-48168-0_32","volume-title":"Computer Science Logic","author":"T. Altenkirch","year":"1999","unstructured":"Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 453\u2013468. Springer, Heidelberg (1999)"},{"key":"4_CR7","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 \u2014 an introduction. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol.\u00a01608, pp. 28\u2013115. Springer, Heidelberg (1999)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129503003943","volume":"14","author":"G. Barthe","year":"2004","unstructured":"Barthe, G., Frade, M.J., Gim\u00e9nez, E., Pinto, L., Uustalu, T.: Type-based termination of recursive definitions. Math. Struct. in Comput. Sci.\u00a014, 1\u201345 (2004)","journal-title":"Math. Struct. in Comput. Sci."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11417170_7","volume-title":"Typed Lambda Calculi and Applications","author":"G. Barthe","year":"2005","unstructured":"Barthe, G., Gr\u00e9goire, B., Pastawski, F.: Practical inference for type-based termination in a polymorphic setting. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 71\u201385. Springer, Heidelberg (2005)"},{"key":"4_CR10","first-page":"265","volume":"10","author":"M. Benke","year":"2003","unstructured":"Benke, M., Dybjer, P., Jansson, P.: Universes for generic programs and proofs in dependent type theory. Nord. J.\u00a0of Comput.\u00a010, 265\u2013289 (2003)","journal-title":"Nord. J.\u00a0of Comput."},{"key":"4_CR11","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)"},{"key":"4_CR12","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 Asp. Comput.\u00a011, 200\u2013222 (1999)","journal-title":"Formal Asp. Comput."},{"key":"4_CR13","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. Funct. Program.\u00a09, 77\u201391 (1999)","journal-title":"J. Funct. Program."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-540-25979-4_2","volume-title":"Rewriting Techniques and Applications","author":"F. Blanqui","year":"2004","unstructured":"Blanqui, F.: A type-based termination criterion for dependently-typed higher-order rewrite systems. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 24\u201339. Springer, Heidelberg (2004)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/11538363_11","volume-title":"Computer Science Logic","author":"F. Blanqui","year":"2005","unstructured":"Blanqui, F.: Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 135\u2013150. Springer, Heidelberg (2005)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/317636.317906","volume-title":"Proc.of 4th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 1999","author":"K. Crary","year":"1999","unstructured":"Crary, K., Weirich, S.: Flexible type analysis. In: Proc.of 4th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 1999, pp. 233\u2013248. ACM Press, New York (1999)"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/289423.289459","volume-title":"Proc. of 3rd ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 1998","author":"K. Crary","year":"1998","unstructured":"Crary, K., Weirich, S., Morrisett, J.G.: Intensional polymorphism in type-erasure semantics. In: Proc. of 3rd ACM SIGPLAN Int. Conf. on Functional Programming, ICFP 1998, pp. 301\u2013312. ACM Press, New York (1998)"},{"key":"4_CR18","unstructured":"Frade, M.J.: Type-Based Termination of Recursive Definitions and Constructor Subtyping in Typed Lambda Calculi. PhD thesis, Dep. de Inform\u00e1tica, Universidade do Minho (2003)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25979-4_15","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 210\u2013220. Springer, Heidelberg (2004)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BFb0055070","volume-title":"Automata, Languages and Programming","author":"E. Gim\u00e9nez","year":"1998","unstructured":"Gim\u00e9nez, E.: Structural recursive definitions in type theory. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 397\u2013408. Springer, Heidelberg (1998)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/199448.199475","volume-title":"Conf. Record of 22nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1995","author":"R. Harper","year":"1995","unstructured":"Harper, R., Morrisett, J.G.: Compiling polymorphism using intensional type analysis. In: Conf. Record of 22nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1995, pp. 130\u2013141. ACM Press, New York (1995)"},{"key":"4_CR22","unstructured":"Hinze, R.: Numerical representations as higher-order nested datatypes. Technical Report IAI-TR-98-12, Institut f\u00fcr Informatik III, Universit\u00e4t Bonn (1998)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/10705424_2","volume-title":"Functional and Logic Programming","author":"R. Hinze","year":"1999","unstructured":"Hinze, R.: Polytypic programming with ease (extended abstract). In: Middeldorp, A. (ed.) FLOPS 1999. LNCS, vol.\u00a01722, pp. 21\u201336. Springer, Heidelberg (1999)"},{"key":"4_CR24","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, 327\u2013351 (2000)","journal-title":"J. of Funct. Program."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/325694.325709","volume-title":"Proc. of 27th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2000","author":"R. Hinze","year":"2000","unstructured":"Hinze, R.: A new approach to generic functional programming. In: Proc. of 27th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2000, pp. 119\u2013132. ACM Press, New York (2000)"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1017\/S095679680100404X","volume":"11","author":"R. Hinze","year":"2001","unstructured":"Hinze, R.: Manufacturing datatypes. J. of Funct. Program.\u00a011, 493\u2013524 (2001)","journal-title":"J. of Funct. Program."},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0167-6423(02)00025-4","volume":"43","author":"R. Hinze","year":"2002","unstructured":"Hinze, R.: Polytypic values possess polykinded types. Sci. of Comput. Program.\u00a043, 129\u2013159 (2002)","journal-title":"Sci. of Comput. Program."},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-45191-4_2","volume-title":"Generic Programming","author":"R. Hinze","year":"2003","unstructured":"Hinze, R., Jeuring, J.: Generic haskell: Applications. In: Backhouse, R., Gibbons, J. (eds.) Generic Programming. LNCS, vol.\u00a02793, pp. 57\u201396. Springer, Heidelberg (2003)"},{"key":"4_CR29","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)"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.scico.2003.07.001","volume":"51","author":"R. Hinze","year":"2004","unstructured":"Hinze, R., Jeuring, J., L\u00f6h, A.: Type-indexed data types. Sci. of Comput. Program.\u00a051, 117\u2013151 (2004)","journal-title":"Sci. of Comput. Program."},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1145\/237721.240882","volume-title":"Conf. Record of 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1996","author":"J. Hughes","year":"1996","unstructured":"Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: Conf. Record of 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1996, pp. 410\u2013423. ACM Press, New York (1996)"},{"key":"4_CR32","unstructured":"INRIA: The Coq Proof Assistant Reference Manual, version 8.0 edition (2004), http:\/\/coq.inria.fr\/doc\/main.html"},{"key":"4_CR33","unstructured":"Jansson, P.: Functional Polytypic Programming. PhD thesis, Dept. of Computing Science, Chalmers University of Technology (2000)"},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1145\/263699.263763","volume-title":"Conf. Record of 24th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1997","author":"P. Jansson","year":"1997","unstructured":"Jansson, P., Jeuring, J.: PolyP\u2014a polytypic programming extension. In: Conf. Record of 24th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1997, pp. 470\u2013482. ACM Press, New York (1997)"},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0167-6423(01)00020-X","volume":"43","author":"P. Jansson","year":"2002","unstructured":"Jansson, P., Jeuring, J.: Polytypic data conversion programs. Sci. of Comput. Program.\u00a043, 35\u201375 (2002)","journal-title":"Sci. of Comput. Program."},{"key":"4_CR36","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 Asp. of Comput.\u00a016, 19\u201335 (2004)","journal-title":"Formal Asp. of Comput."},{"key":"4_CR37","first-page":"30","volume-title":"Proc. of 2nd Ann. IEEE Symp. on Logic in Computer Science, LICS 1987","author":"N.P. Mendler","year":"1987","unstructured":"Mendler, N.P.: Recursive types and type constraints in second-order lambda calculus. In: Proc. of 2nd Ann. IEEE Symp. on Logic in Computer Science, LICS 1987, pp. 30\u201336. IEEE Computer Soc. Press, Los Alamitos (1987)"},{"key":"4_CR38","unstructured":"Norell, U.: Functional Generic Programming and Type Theory. Master\u2019s thesis, Computing Science, Chalmers University of Technology (2002), Available from: http:\/\/www.cs.chalmers.se\/~ulfn"},{"key":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-27861-0_11","volume-title":"Implementation of Functional Languages","author":"U. Norell","year":"2004","unstructured":"Norell, U., Jansson, P.: Polytypic programming in Haskell. In: Trinder, P., Michaelson, G.J., Pe\u00f1a, R. (eds.) IFL 2003. LNCS, vol.\u00a03145, pp. 168\u2013184. Springer, Heidelberg (2004)"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-540-27764-4_17","volume-title":"Mathematics of Program Construction","author":"U. Norell","year":"2004","unstructured":"Norell, U., Jansson, P.: Prototyping generic programming in template haskell. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 314\u2013333. Springer, Heidelberg (2004)"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely Functional Data Structures. Ph.D. thesis, Carnegie Mellon University (1996)","DOI":"10.1007\/3-540-61628-4_5"},{"key":"4_CR42","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":"4_CR43","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1017\/S0956796899003494","volume":"9","author":"C. Okasaki","year":"1999","unstructured":"Okasaki, C.: Red-black trees in a functional setting. J. of Funct. Program.\u00a09, 471\u2013477 (1999)","journal-title":"J. of Funct. Program."},{"key":"4_CR44","unstructured":"Pareto, L.: Types for Crash Prevention. PhD thesis, Dept. of Computing Science, Chalmers University of Technology (2000)"},{"key":"4_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-48256-3_5","volume-title":"Theorem Proving in Higher Order Logics","author":"H. Pfeifer","year":"1999","unstructured":"Pfeifer, H., Rue\u00df, H.: Polytypic proof construction. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.) TPHOLs 1999. LNCS, vol.\u00a01690, pp. 55\u201372. Springer, Heidelberg (1999)"},{"key":"4_CR46","volume-title":"Types and Programming Languages","author":"B.C. Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"4_CR47","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/641888.641889","volume":"25","author":"B. Saha","year":"2003","unstructured":"Saha, B., Trifonov, V., Shao, Z.: Intensional analysis of quantified types. ACM Trans. on Program. Lang. and Syst.\u00a025, 159\u2013209 (2003)","journal-title":"ACM Trans. on Program. Lang. and Syst."},{"key":"4_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11575467_19","volume-title":"Programming Languages and Systems","author":"D. Sereni","year":"2005","unstructured":"Sereni, D., Jones, N.D.: Termination analysis of higher-order functional programs. In: Yi, K. (ed.) APLAS 2005. LNCS, vol.\u00a03780, pp. 281\u2013297. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11783596_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:54Z","timestamp":1605643674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11783596_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540356318","9783540356325"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/11783596_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}