{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:50Z","timestamp":1725493490081},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403326"},{"type":"electronic","value":"9783540449041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44904-3_4","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T05:49:32Z","timestamp":1193550572000},"page":"46-59","source":"Crossref","is-referenced-by-count":5,"title":["Inductive Types in the Calculus of Algebraic Constructions"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Blanqui","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"4_CR1","series-title":"Technical Report","volume-title":"Termination checking with types","author":"A. Abel","year":"2002","unstructured":"A. Abel. Termination checking with types. Technical Report 0201, Ludwig Maximilians Universit\u00e4t, M\u00fcnchen, Germany, 2002."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"F. Barbanera, M. Fern\u00e1ndez, and H. Geuvers. Modularity of strong normalization and confluence in the algebraic-\u03bb-cube. In Proceedings of the 9th IEEE Symposium on Logic in Computer Science, 1994.","DOI":"10.1109\/LICS.1994.316049"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"key":"4_CR4","unstructured":"F. Blanqui. Definitions by rewriting in the Calculus of Constructions (extended abstract). In Proceedings of the 16th IEEE Symposium on Logic in Computer Science, 2001."},{"key":"4_CR5","volume-title":"Th\u00e9orie des Types et R\u00e9criture","author":"F. Blanqui","year":"2001","unstructured":"F. Blanqui. Th\u00e9orie des Types et R\u00e9criture. PhD thesis, Universit\u00e9 Paris XI, Orsay, France, 2001. Available in english as \u201cType Theory and Rewriting\u201d."},{"key":"4_CR6","unstructured":"F. Blanqui. Definitions by rewriting in the Calculus of Constructions, 2003. Journal submission, 68 pages."},{"key":"4_CR7","unstructured":"F. Blanqui. A short and flexible strong normalization proof for the Calculus of Algebraic Constructions with curried rewriting, 2003. Draft."},{"key":"4_CR8","unstructured":"T. Coquand. Pattern matching with dependent types. In Proceedings of the International Workshop on Types for Proofs and Programs, 1992. http:\/\/www.lfcs.informatics.ed.ac.uk\/research\/types-bra\/proc\/ ."},{"issue":"2\u20133","key":"4_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2\u20133):95\u2013120, 1988.","journal-title":"Information and Computation"},{"key":"4_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the International Conference on Computer Logic","author":"T. Coquand","year":"1988","unstructured":"T. Coquand and C. Paulin-Mohring. Inductively defined types. In Proceedings of the International Conference on Computer Logic, Lecture Notes in Computer Science 417, 1988."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.2307\/2586554","volume":"65","author":"P. Dybjer","year":"2000","unstructured":"P. Dybjer. A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic, 65(2):525\u2013549, 2000.","journal-title":"Journal of Symbolic Logic"},{"key":"4_CR13","unstructured":"J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1988."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(99)00036-8","volume":"70","author":"R. Harper","year":"1999","unstructured":"R. Harper and J. Mitchell. Parametricity and variants of Girard\u2019s J operator. Information Processing Letters, 70:1\u20135, 1999.","journal-title":"Information Processing Letters"},{"key":"4_CR15","unstructured":"J.-P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science, 1991."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J.W. Klop","year":"1993","unstructured":"J.W. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science, 121:279\u2013308, 1993.","journal-title":"Theoretical Computer Science"},{"key":"4_CR17","volume-title":"Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types","author":"R. Matthes","year":"1998","unstructured":"R. Matthes. Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types. PhD thesis, Ludwig Maximilians Universit\u00e4t, M\u00fcnchen, Germany, 1998."},{"key":"4_CR18","volume-title":"Dependently typed functional programs and their proofs","author":"C. McBride","year":"1999","unstructured":"C. McBride. Dependently typed functional programs and their proofs. PhD thesis, University of Edinburgh, United Kingdom, 1999."},{"key":"4_CR19","volume-title":"Inductive Definition in Type Theory","author":"N. P. Mendler","year":"1987","unstructured":"N. P. Mendler. Inductive Definition in Type Theory. PhD thesis, Cornell University, United States, 1987."},{"key":"4_CR20","unstructured":"C. Paulin-Mohring. Personal communication, 2001."},{"issue":"3\u20135","key":"4_CR21","first-page":"341","volume":"13","author":"R. Pollack","year":"2002","unstructured":"R. Pollack. Dependently typed records in type theory. Formal Aspects of Computing, 13(3\u20135):341\u2013363, 2002.","journal-title":"Formal Aspects of Computing"},{"key":"4_CR22","volume-title":"The Coq Proof Assistant Reference Manual \u2014 Version 7.3","author":"Coq Development Team","year":"2002","unstructured":"Coq Development Team. The Coq Proof Assistant Reference Manual \u2014 Version 7.3. INRIA Rocquencourt, France, 2002. http:\/\/coq.inria.fr\/ ."},{"key":"4_CR23","volume-title":"Une Th\u00e9orie des Constructions Inductives","author":"B. Werner","year":"1994","unstructured":"B. Werner. Une Th\u00e9orie des Constructions Inductives. PhD thesis, Universit\u00e9 Paris VII, France, 1994."}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44904-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T18:54:41Z","timestamp":1708282481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44904-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403326","9783540449041"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-44904-3_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}