{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:46:42Z","timestamp":1742975202395,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642228629"},{"type":"electronic","value":"9783642228636"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22863-6_22","type":"book-chapter","created":{"date-parts":[[2011,8,8]],"date-time":"2011-08-08T05:47:55Z","timestamp":1312782475000},"page":"297-311","source":"Crossref","is-referenced-by-count":13,"title":["Mechanised Computability Theory"],"prefix":"10.1007","author":[{"given":"Michael","family":"Norrish","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus: its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus: its Syntax and Semantics, revised edn. Studies in Logic and the Foundations of Mathematics, revised edition, vol.\u00a0103. Elsevier, Amsterdam (1984)","edition":"2"},{"key":"22_CR2","unstructured":"Harrison, J.: HOL Light system, \n                    \n                      http:\/\/www.cl.cam.ac.uk\/~jrh13\/hol-light\/"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10990-006-8745-7","volume":"19","author":"M. Norrish","year":"2006","unstructured":"Norrish, M.: Mechanising \u03bb-calculus using a classical first order theory of terms with permutations. Higher Order and Symbolic Computation\u00a019, 169\u2013195 (2006)","journal-title":"Higher Order and Symbolic Computation"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-74591-4_16","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Norrish","year":"2007","unstructured":"Norrish, M., Vestergaard, R.: Proof pearl: De\u00a0bruijn terms really do work. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol.\u00a04732, pp. 207\u2013222. Springer, Heidelberg (2007)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11541868_16","volume-title":"Theorem Proving in Higher Order Logics","author":"R. O\u2019Connor","year":"2005","unstructured":"O\u2019Connor, R.: Essential incompleteness of arithmetic verified by coq. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 245\u2013260. Springer, Heidelberg (2005)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"22_CR7","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569883","volume-title":"Metamathematics, Machines and G\u00f6del\u2019s Proof","author":"N. Shankar","year":"1994","unstructured":"Shankar, N.: Metamathematics, Machines and G\u00f6del\u2019s Proof. Cambridge Tracts in Theoretical Computer Science, vol.\u00a038. Cambridge University Press, Cambridge (1994)"},{"key":"22_CR8","first-page":"317","volume-title":"Papers Presented at the Second Annual Workshop on Logical Environments","author":"N. Szasz","year":"1993","unstructured":"Szasz, N.: A machine checked proof that Ackermann\u2019s function is not primitive recursive. In: Papers Presented at the Second Annual Workshop on Logical Environments, New York, NY, USA, pp. 317\u2013338. Cambridge University Press, Cambridge (1993)"},{"key":"22_CR9","unstructured":"Gregory Taylor, R.: Ackermann\u2019s function is not primitive recursive, \n                    \n                      http:\/\/home.manhattan.edu\/~gregory.taylor\/thcomp\/pdf-files\/ackerman.pdf\n                    \n                    \n                   (Most recently accessed on 16, February\u00a02011)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1877714.1877721","volume":"12","author":"C. Urban","year":"2011","unstructured":"Urban, C., Cheney, J., Berghofer, S.: Mechanizing the metatheory of LF. ACM Transactions on Computational Logic\u00a012, 1\u201342 (2011)","journal-title":"ACM Transactions on Computational Logic"},{"key":"22_CR11","unstructured":"Zammit, V.: On the Readability of Machine Checkable Formal Proofs. PhD thesis, University of Kent at Canterbury (March 1999)"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22863-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T02:39:59Z","timestamp":1553999999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22863-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642228629","9783642228636"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22863-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}