{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:45:26Z","timestamp":1774046726647,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642031526","type":"print"},{"value":"9783642031533","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03153-3_2","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T02:11:14Z","timestamp":1248660674000},"page":"57-99","source":"Crossref","is-referenced-by-count":30,"title":["Dependent Types at Work"],"prefix":"10.1007","author":[{"given":"Ana","family":"Bove","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Dybjer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-78969-7_2","volume-title":"Functional and Logic Programming","author":"A. Abel","year":"2008","unstructured":"Abel, A., Coquand, T., Dybjer, P.: On the algebraic foundation of proof assistants for intuitionistic type theory. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 3\u201313. Springer, Heidelberg (2008)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-70594-9_4","volume-title":"Mathematics of Program Construction","author":"A. Abel","year":"2008","unstructured":"Abel, A., Coquand, T., Dybjer, P.: Verifying a semantic beta-eta-conversion test for Martin-L\u00f6f type theory. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol.\u00a05133, pp. 29\u201356. Springer, Heidelberg (2008)"},{"key":"2_CR3","unstructured":"Agda wiki (2008), appserv.cs.chalmers.se\/users\/ulfn\/wiki\/agda.php"},{"key":"2_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Develpment. Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Develpment. Coq\u2019Art: The Calculus of Inductive Constructions. Springer, Heidelberg (2004)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1017\/S0960129505004822","volume":"15","author":"A. Bove","year":"2005","unstructured":"Bove, A., Capretta, V.: Modelling general recursion in type theory. Mathematical Structures in Computer Science\u00a015, 671\u2013708 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"key":"2_CR6","volume-title":"Implementing Mathematics with the NuPRL Proof Development System","author":"R.L. Constable","year":"1986","unstructured":"Constable, R.L., et al.: Implementing Mathematics with the NuPRL Proof Development System. Prentice-Hall, Englewood Cliffs (1986)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/CBO9780511569807.011","volume-title":"Logical Frameworks","author":"T. Coquand","year":"1991","unstructured":"Coquand, T.: An algorithm for testing conversion in type theory. In: Logical Frameworks, pp. 255\u2013279. Cambridge University Press, Cambridge (1991)"},{"key":"2_CR8","first-page":"139","volume-title":"From Semantics to Computer Science: Essays in Honor of Gilles Kahn","author":"T. Coquand","year":"2008","unstructured":"Coquand, T., Kinoshita, Y., Nordstr\u00f6m, B., Takeyama, M.: A simple type-theoretic language: Mini-tt. In: Levy, J.-J., Bertot, Y., Huet, G., Plotkin, G. (eds.) From Semantics to Computer Science: Essays in Honor of Gilles Kahn, pp. 139\u2013164. Cambridge University Press, Cambridge (2008)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1017\/CBO9780511569807.012","volume-title":"Logical Frameworks","author":"P. Dybjer","year":"1991","unstructured":"Dybjer, P.: Inductive sets and families in Martin-L\u00f6f\u2019s type theory and their set-theoretic semantics. In: Logical Frameworks, pp. 280\u2013306. Cambridge University Press, Cambridge (1991)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BF01211308","volume":"6","author":"P. Dybjer","year":"1994","unstructured":"Dybjer, P.: Inductive families. Formal Aspects of Computing\u00a06, 440\u2013465 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Dybjer, P.: A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic\u00a065(2) (June 2000)","DOI":"10.2307\/2586554"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-48959-2_11","volume-title":"Typed Lambda Calculi and Applications","author":"P. Dybjer","year":"1999","unstructured":"Dybjer, P., Setzer, A.: A finite axiomatization of inductive-recursive definitions. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 129\u2013146. Springer, Heidelberg (1999)"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jlap.2005.07.001","volume":"66","author":"P. Dybjer","year":"2006","unstructured":"Dybjer, P., Setzer, A.: Indexed induction-recursion. Journal of Logic and Algebraic Programming\u00a066(1), 1\u201349 (2006)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0049-237X(08)70843-7","volume-title":"Proceedings of the Second Scandinavian Logic Symposium","author":"J.Y. Girard","year":"1971","unstructured":"Girard, J.Y.: Une extension de l\u2019interpr\u00e9tation de G\u00f6del \u00e0 l\u2019analyse, et son application \u00e0 l\u2019elimination des coupures dans l\u2019analyse et la th\u00e9orie des types. In: Fenstad, J.E. (ed.) Proceedings of the Second Scandinavian Logic Symposium, pp. 63\u201392. North-Holland Publishing Company, Amsterdam (1971)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"G\u00f6del, K.: \u00dcber eine bisher noch nicht benutze erweitrung des finiten standpunktes. Dialectica\u00a012 (1958)","DOI":"10.1111\/j.1746-8361.1958.tb01464.x"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Hinze, R.: A new approach to generic functional programming. In: Proceedings of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Massachusetts (January 2000)","DOI":"10.1145\/325694.325709"},{"key":"2_CR17","first-page":"470","volume-title":"POPL 1997","author":"P. Jansson","year":"1997","unstructured":"Jansson, P., Jeuring, J.: PolyP \u2014 a polytypic programming language extension. In: POPL 1997, pp. 470\u2013482. ACM Press, New York (1997)"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0049-237X(08)70847-4","volume-title":"Proceedings of the Second Scandinavian Logic Symposium","author":"P. Martin-L\u00f6f","year":"1971","unstructured":"Martin-L\u00f6f, P.: Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions. In: Fenstad, J.E. (ed.) Proceedings of the Second Scandinavian Logic Symposium, pp. 179\u2013216. North-Holland Publishing Company, Amsterdam (1971)"},{"key":"2_CR19","first-page":"73","volume-title":"Logic Colloquium 1973","author":"P. Martin-L\u00f6f","year":"1975","unstructured":"Martin-L\u00f6f, P.: An Intuitionistic Theory of Types: Predicative Part. In: Rose, H.E., Shepherdson, J.C. (eds.) Logic Colloquium 1973, pp. 73\u2013118. North-Holland Publishing Company, Amsterdam (1975)"},{"key":"2_CR20","first-page":"153","volume-title":"Logic, Methodology and Philosophy of Science, VI, 1979","author":"P. Martin-L\u00f6f","year":"1982","unstructured":"Martin-L\u00f6f, P.: Constructive mathematics and computer programming. In: Logic, Methodology and Philosophy of Science, VI, 1979, pp. 153\u2013175. North-Holland, Amsterdam (1982)"},{"key":"2_CR21","unstructured":"Martin-L\u00f6f, P.: Intuitionistic Type Theory. Bibliopolis (1984)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/11546382_3","volume-title":"Advanced Functional Programming","author":"C. McBride","year":"2005","unstructured":"McBride, C.: Epigram: Practical programming with dependent types. In: Vene, V., Uustalu, T. (eds.) AFP 2004. LNCS, vol.\u00a03622, pp. 130\u2013170. Springer, Heidelberg (2005)"},{"key":"2_CR23","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML","author":"R. Milner","year":"1997","unstructured":"Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML. MIT Press, Cambridge (1997)"},{"key":"2_CR24","volume-title":"Programming in Martin-L\u00f6f\u2019s Type Theory. An Introduction","author":"B. Nordstr\u00f6m","year":"1990","unstructured":"Nordstr\u00f6m, B., Petersson, K., Smith, J.M.: Programming in Martin-L\u00f6f\u2019s Type Theory. An Introduction. Oxford University Press, Oxford (1990)"},{"key":"2_CR25","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-412 96 G\u00f6teborg, Sweden (September 2007)"},{"key":"2_CR26","volume-title":"Haskell 98 Language and Libraries The Revised Report","year":"2003","unstructured":"Peyton Jones, S. (ed.): Haskell 98 Language and Libraries The Revised Report. Cambridge University Press, Cambridge (2003)"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1159803.1159811","volume-title":"ICFP 2006: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming","author":"S. Peyton Jones","year":"2006","unstructured":"Peyton Jones, S., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unification-based type inference for GADTs. In: ICFP 2006: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, pp. 50\u201361. ACM Press, New York (2006)"},{"key":"2_CR28","unstructured":"Pfenning, F., Xi, H.: Dependent Types in practical programming. In: Proc. 26th ACM Symp. on Principles of Prog. Lang., pp. 214\u2013227 (1999)"},{"issue":"3","key":"2_CR29","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci.\u00a05(3), 225\u2013255 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR30","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BFb0060636","volume-title":"Symposium on Automatic Demonstration","author":"D. Scott","year":"1970","unstructured":"Scott, D.: Constructive validity. In: Symposium on Automatic Demonstration. Lecture Notes in Mathematics, vol.\u00a0125, pp. 237\u2013275. Springer, Berlin (1970)"},{"issue":"1-2","key":"2_CR31","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(00)00053-0","volume":"248","author":"W. Taha","year":"2000","unstructured":"Taha, W., Sheard, T.: Metaml and multi-stage programming with explicit annotations. Theor. Comput. Sci.\u00a0248(1-2), 211\u2013242 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR32","unstructured":"The Coq development team. The Coq proof assistant (2008), coq.inria.fr\/"},{"key":"2_CR33","volume-title":"Type Theory and Functional Programming","author":"S. Thompson","year":"1991","unstructured":"Thompson, S.: Type Theory and Functional Programming. Addison-Wesley, Reading (1991)"},{"key":"2_CR34","unstructured":"Wahlstedt, D.: Dependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion. PhD thesis, Chalmers University of Technology (2007) ISBN 978-91-7291-979-2"}],"container-title":["Lecture Notes in Computer Science","Language Engineering and Rigorous Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03153-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T14:08:29Z","timestamp":1558447709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03153-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642031526","9783642031533"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03153-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}