{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:40:20Z","timestamp":1759333220983},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540371878"},{"type":"electronic","value":"9783540371885"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814771_48","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T15:44:21Z","timestamp":1160063061000},"page":"589-603","source":"Crossref","is-referenced-by-count":32,"title":["Partial Recursive Functions in Higher-Order Logic"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Krauss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11737414_9","volume-title":"Functional and Logic Programming","author":"G. Barthe","year":"2006","unstructured":"Barthe, G., Forest, J., Pichardie, D., Rusu, V.: Defining and reasoning about recursive functions: a practical tool for the Coq proof assistant. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol.\u00a03945, Springer, Heidelberg (2006)"},{"key":"48_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48256-3_3","volume-title":"Theorem Proving in Higher Order Logics","author":"S. Berghofer","year":"1999","unstructured":"Berghofer, S., Wenzel, M.: Inductive datatypes in HOL - lessons learned in formal-logic engineering. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.) TPHOLs 1999. LNCS, vol.\u00a01690, pp. 19\u201336. Springer, Heidelberg (1999)"},{"key":"48_CR3","series-title":"Texts in theoretical comp. science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive theorem proving and program development: Coq\u2019Art: the calculus of inductive constructions","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive theorem proving and program development: Coq\u2019Art: the calculus of inductive constructions. Texts in theoretical comp. science. Springer, Heidelberg (2004)"},{"issue":"4","key":"48_CR4","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":"48_CR5","volume-title":"A Computational Logic","author":"R.S. Boyer","year":"1979","unstructured":"Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press, New York (1979)"},{"key":"48_CR6","unstructured":"Dubois, C., Donzeau-Gouge, V.: A step towards the mechanization of partial functions: domains as inductive predicates. In: CADE-15 Workshop on mechanization of partial functions (1998)"},{"issue":"1","key":"48_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1005797629953","volume":"19","author":"J. Giesl","year":"1997","unstructured":"Giesl, J.: Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning\u00a019(1), 1\u201329 (1997)","journal-title":"Journal of Automated Reasoning"},{"key":"48_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/11559306_12","volume-title":"Frontiers of Combining Systems","author":"J. Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol.\u00a03717, pp. 216\u2013231. Springer, Heidelberg (2005)"},{"volume-title":"Introduction to HOL: A theorem proving environment for higher order logic","year":"1993","key":"48_CR9","unstructured":"Gordon, M., Melham, T. (eds.): Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, Cambridge (1993)"},{"key":"48_CR10","unstructured":"Harrison, J.: The HOL Light theorem prover, \n                    \n                      http:\/\/www.cl.cam.ac.uk\/users\/jrh\/hol-light"},{"key":"48_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/10930755_17","volume-title":"Theorem Proving in Higher Order Logics","author":"S. Krsti\u0107","year":"2003","unstructured":"Krsti\u0107, S., Matthews, J.: Inductive invariants for nested recursion. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 253\u2013269. Springer, Heidelberg (2003)"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 81\u201392 (2001)","DOI":"10.1145\/360204.360210"},{"issue":"2","key":"48_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/B:JARS.0000009505.07087.34","volume":"31","author":"P. Manolios","year":"2003","unstructured":"Manolios, P., Moore, J.S.: Partial functions in ACL2. J. Autom. Reasoning\u00a031(2), 107\u2013127 (2003)","journal-title":"J. Autom. Reasoning"},{"issue":"10","key":"48_CR14","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1093\/comjnl\/40.10.640","volume":"40","author":"O. M\u00fcller","year":"1997","unstructured":"M\u00fcller, O., Slind, K.: Treating partiality in a logic of total functions. The Computer Journal\u00a040(10), 640\u2013652 (1997)","journal-title":"The Computer Journal"},{"key":"48_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"48_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-58156-1_11","volume-title":"Automated Deduction - CADE-12","author":"L.C. Paulson","year":"1994","unstructured":"Paulson, L.C.: A fixedpoint approach to implementing (co)inductive definitions. In: Bundy, A. (ed.) CADE 1994. LNCS, vol.\u00a0814, pp. 148\u2013161. Springer, Heidelberg (1994)"},{"key":"48_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BFb0105417","volume-title":"Theorem Proving in Higher Order Logics","author":"K. Slind","year":"1996","unstructured":"Slind, K.: Function definition in Higher-Order Logic. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol.\u00a01125, pp. 381\u2013397. Springer, Heidelberg (1996)"},{"key":"48_CR18","unstructured":"Slind, K.: Reasoning About Terminating Functional Programs. PhD thesis, Institut f\u00fcr Informatik, TU M\u00fcnchen (1999)"},{"key":"48_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/3-540-44659-1_31","volume-title":"Theorem Proving in Higher Order Logics","author":"K. Slind","year":"2000","unstructured":"Slind, K.: Another look at nested recursion. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol.\u00a01869, pp. 498\u2013518. Springer, Heidelberg (2000)"},{"key":"48_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/11532231_4","volume-title":"Automated Deduction \u2013 CADE-20","author":"C. Urban","year":"2005","unstructured":"Urban, C., Tasson, C.: Nominal techniques in Isabelle\/HOL. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 38\u201353. Springer, Heidelberg (2005)"},{"issue":"1","key":"48_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0004-3702(94)90063-9","volume":"71","author":"C. Walther","year":"1994","unstructured":"Walther, C.: On proving the termination of algorithms by machine. Artif. Intell.\u00a071(1), 101\u2013157 (1994)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814771_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:27:37Z","timestamp":1619508457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814771_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371878","9783540371885"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11814771_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}