{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:13:33Z","timestamp":1770290013543,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540665366","type":"print"},{"value":"9783540481683","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48168-0_32","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:30:26Z","timestamp":1196508626000},"page":"453-468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":84,"title":["Monadic Presentations of Lambda Terms Using Generalized Inductive Types"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Altenkirch","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Reus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"32_CR1","unstructured":"T. Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh, November 1993."},{"key":"32_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0037095","volume-title":"Typed Lambda Calculi and Applications","author":"T. Altenkirch","year":"1993","unstructured":"T. Altenkirch. A formalization of the strong normalization proof for System F in LEGO. In J.F. Groote M. Bezem, editor, Typed Lambda Calculi and Applications, LNCS 664, pages 13\u201328, 1993."},{"key":"32_CR3","series-title":"Lect Notes Comput Sci","first-page":"343","volume-title":"Proceedings of CSL 98","author":"T. Altenkirch","year":"1998","unstructured":"T. Altenkirch. Logical relations and inductive\/coinductive types. Proceedings of CSL 98, LNCS 1584, pages 343\u2013354,1998."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"T. Altenkirch. Extensional equality in intensional type theory. In Proceedings of LICS 99, pages 412\u2013420, 1999.","DOI":"10.1109\/LICS.1999.782636"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"M. Abadi and G. Plotkin. A logic for parametric polymorphism. In Typed Lambda Calculi and Applications-TLCA\u2019 93, pages 361\u2013375, 1993.","DOI":"10.1007\/BFb0037118"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"F. Bellegarde and J. Hook. Substitution: A formal methods case study using monads and transformations. Science of Computer Programming, 23(2-3), 1994.","DOI":"10.1016\/0167-6423(94)00022-0"},{"key":"32_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0054285","volume-title":"Mathematics of Program Construction","author":"R. Bird","year":"1998","unstructured":"R. Bird and L. Meertens. Nested datatypes. In J. Jeuring, editor, Mathematics of Program Construction, number 1422 in LNCS, pages 52\u201367. Springer Verlag, 1998."},{"key":"32_CR8","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. Journal of Functional Programming, 9:77\u201391, 1999.","journal-title":"Journal of Functional Programming"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BF01211308","volume":"6","author":"P. Dybjer","year":"1994","unstructured":"P. Dybjer. Inductive families. Formal Aspects of Computing, 6(4):440\u2013465, 1994.","journal-title":"Formal Aspects of Computing"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"M. Emms and H. Leiss. Extending the type checker of Standard ML by polymorphic recursion. TCS, 212(1), 1999.","DOI":"10.1016\/S0304-3975(98)00139-X"},{"key":"32_CR11","unstructured":"M. Fiore, G. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proceedings of LICS 99, pages 193\u2013204,1999."},{"key":"32_CR12","unstructured":"J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"P. Hudak et al. Report on the programming language Haskell: a non-strict, purely functional language (version 1.2). ACM SIGPLAN Notices, 27(5), May 1992.","DOI":"10.1145\/130697.130699"},{"key":"32_CR14","unstructured":"R. Harper, D. MacQueen, and R. Milner. Standard ML. Technical Report ECS-LFCS-86-2, Department of Computer Science, University of Edinburgh, 1986."},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"M. Hofmann. Semantics of Logics of Computation, chapter Syntax and Semantics of Dependent Types. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511526619.004"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"M. Hofmann. Semantical analysis in higher order abstract syntax. In Proceedings of LICS 99, pages 204\u2013213, 1999.","DOI":"10.1109\/LICS.1999.782616"},{"key":"32_CR17","unstructured":"G. Huet. Constructive computation theory PART I. Notes de cours, 1992."},{"key":"32_CR18","unstructured":"Z. Luo and R. Pollack. The LEGO proof development system: A user\u2019s manual. LFCS report ECS-LFCS-92-211, University of Edinburgh, 1992."},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"E. Manes. Algebraic Theories, volume 26 of Graduate Texts in Mathematics. Springer Verlag, 1976.","DOI":"10.1007\/978-1-4612-9860-1"},{"key":"32_CR20","unstructured":"P. Martin-L\u00f6f. Intuitionistic Type Theory. Bibliopolis, 1984."},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"S. Mac Lane. Categories for the Working Mathematician. Springer Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"32_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BFb0037113","volume-title":"Proceedings TLCA\u201993","author":"J. McKinna","year":"1993","unstructured":"J. McKinna and R. Pollack. Pure type systems formalized. In Proceedings TLCA\u201993, LNCS 664, pages 289\u2013305, 1993."},{"key":"32_CR24","unstructured":"B. Reus and T. Altenkirch. The implementation of the ?-monad in LEGO. Available on the WWW at: http:\/\/www.informatik.uni-muenchen.de\/~reus\/drafts\/lambda.html, March 1999."},{"key":"32_CR25","volume-title":"4\u2019th Symposium on Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1989","unstructured":"P. Wadler. Theorems for free! In 4\u2019th Symposium on Functional Programming Languages and Computer Architecture, ACM, London, September 1989."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T03:46:34Z","timestamp":1737603994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}