{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:53:14Z","timestamp":1743072794282,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11780342_51","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"505-515","source":"Crossref","is-referenced-by-count":3,"title":["Partial Recursive Functions in Martin-L\u00f6f Type Theory"],"prefix":"10.1007","author":[{"given":"Anton","family":"Setzer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"51_CR1","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(4), 671\u2013708 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"key":"51_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/11417170_10","volume-title":"Typed Lambda Calculi and Applications","author":"A. Bove","year":"2005","unstructured":"Bove, A., Capretta, V.: Recursive functions with higher order domains. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 116\u2013130. Springer, Heidelberg (2005)"},{"issue":"2","key":"51_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-1(2:1)2005","volume":"1","author":"V. Capretta","year":"2005","unstructured":"Capretta, V.: General recursion via coinductive types. Logical Methods in Computer Science\u00a01(2), 1\u201318 (2005)","journal-title":"Logical Methods in Computer Science"},{"key":"51_CR4","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)"},{"key":"51_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45504-3_7","volume-title":"Proof Theory in Computer Science","author":"P. Dybjer","year":"2001","unstructured":"Dybjer, P., Setzer, A.: Indexed induction-recursion. In: Kahle, R., Schroeder-Heister, P., St\u00e4rk, R.F. (eds.) PTCS 2001. LNCS, vol.\u00a02183, pp. 93\u2013113. Springer, Heidelberg (2001)"},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0168-0072(02)00096-9","volume":"124","author":"P. Dybjer","year":"2003","unstructured":"Dybjer, P., Setzer, A.: Induction-recursion and initial algebras. Annals of Pure and Applied Logic\u00a0124, 1\u201347 (2003)","journal-title":"Annals of Pure and Applied Logic"},{"key":"51_CR7","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\u201349 (2006)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"51_CR8","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 Comp.\u00a06, 440\u2013465 (1994)","journal-title":"Formal Aspects of Comp."},{"issue":"2","key":"51_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.2307\/2586554","volume":"65","author":"P. Dybjer","year":"2000","unstructured":"Dybjer, P.: A general formulation of simultaneous inductive-recursive definitions in type theory. Journal of Symbolic Logic\u00a065(2), 525\u2013549 (2000)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:17:38Z","timestamp":1552346258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11780342_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}