{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T16:53:38Z","timestamp":1791219218736,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540482819","type":"print"},{"value":"9783540482826","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11916277_11","type":"book-chapter","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T18:32:59Z","timestamp":1161109979000},"page":"150-166","source":"Crossref","is-referenced-by-count":12,"title":["An Executable Formalization of the HOL\/Nuprl Connection in the Metalogical Framework Twelf"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Sch\u00fcrmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark-Oliver","family":"Stehr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Allen, S.: A Non-Type-Theoretic Semantics for Type-Theoretic Language. PhD thesis, Cornell University (September 1987)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-30142-4_2","volume-title":"Theorem Proving in Higher Order Logics","author":"P. Anderson","year":"2004","unstructured":"Anderson, P., Pfenning, F.: Verifying uniqueness in a logical framework. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol.\u00a03223, pp. 18\u201333. Springer, Heidelberg (2004)"},{"key":"11_CR3","unstructured":"Barzilay, E., Allen, S.F., Constable, R.L.: Practical reflection in nuprl. In: Kolaitis, P. (ed.) Proceedings of 18th IEEE Symposium on Logic in Computer Science, Ottawa, Canada, June 22\u201325 (2003)"},{"key":"11_CR4","volume-title":"Implementing Mathematics with the Nuprl Development System","author":"R.L. Constable","year":"1986","unstructured":"Constable, R.L., Allen, S., Bromely, H., Cleveland, W., et al.: Implementing Mathematics with the Nuprl Development System. Prentice-Hall, Englewood Cliffs (1986)"},{"key":"11_CR5","volume-title":"Introduction to HOL: A theorem proving environment for higher order logic","author":"M.J.C. Gordon","year":"1993","unstructured":"Gordon, M.J.C., Melham, T.F.: Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, Cambridge (1993)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the Association for Computing Machinery\u00a040(1), 143\u2013184 (1993)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BFb0105410","volume-title":"Theorem Proving in Higher Order Logics","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Importing mathematics from HOL into Nuprl. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol.\u00a01125, pp. 267\u2013282. Springer, Heidelberg (1996)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BFb0014309","volume-title":"Algebraic Methodology and Software Technology","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Semantical foundations for embedding HOL in Nuprl. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol.\u00a01101, pp. 85\u2013101. Springer, Heidelberg (1996)"},{"key":"11_CR9","unstructured":"Howe, D.J.: A classical set-theoretic model of polymorphic extensional type theory (manuscript, 1997)"},{"key":"11_CR10","volume-title":"Proceedings of Frontiers of Combining Systems, FroCoS 1998, ILLC","author":"D.J. Howe","year":"1998","unstructured":"Howe, D.J.: Toward sharing libraries of mathematics between theorem provers. In: Proceedings of Frontiers of Combining Systems, FroCoS 1998, ILLC, University of Amsterdam, October 2\u20134, 1998. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"11_CR11","unstructured":"Howe, D.J.: Source Code of the HOL-Nuprl Translator (including Extensions to Nuprl) (January 1999)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: General logics. In: Ebbinghaus, H.-D., et al. (eds.) Proceedings of Logic Colloquium 1987, Granada, Spain, July 1987, pp. 275\u2013329. North-Holland, Amsterdam (1989)","DOI":"10.1016\/S0049-237X(08)70132-0"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-44755-5_23","volume-title":"Theorem Proving in Higher Order Logics","author":"P. Naumov","year":"2001","unstructured":"Naumov, P., Stehr, M.-O., Meseguer, J.: The HOL\/NuPRL proof translator \u2014 A practical approach to formal interoperability. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol.\u00a02152, pp. 329\u2013345. Springer, Heidelberg (2001)"},{"key":"11_CR14","series-title":"International Series of Monographs on Computer Science","volume-title":"Programming in Martin-L\u00f6f\u2019s Type Theory. An Introduction","author":"K. Petersson","year":"1990","unstructured":"Petersson, K., Smith, J., Nordstroem, B.: Programming in Martin-L\u00f6f\u2019s Type Theory. An Introduction. International Series of Monographs on Computer Science. Clarendon Press, Oxford (1990)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/LICS.1989.39186","volume-title":"Fourth Annual Symposium on Logic in Computer Science","author":"F. Pfenning","year":"1989","unstructured":"Pfenning, F.: Elf: A language for logic definition and verified meta-programming. In: Fourth Annual Symposium on Logic in Computer Science, Pacific Grove, California, June 1989, pp. 313\u2013322. IEEE Computer Society Press, Los Alamitos (1989)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction - CADE-16","author":"F. Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: System description: Twelf - A meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS, vol.\u00a01632, pp. 202\u2013206. Springer, Heidelberg (1999)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3-540-61055-3_44","volume-title":"Programming Languages and Systems - ESOP \u201996","author":"E. Rohwedder","year":"1996","unstructured":"Rohwedder, E., Pfenning, F.: Mode and termination checking for higher-order logic programs. In: Riis Nielson, H. (ed.) ESOP 1996. LNCS, vol.\u00a01058, pp. 296\u2013310. Springer, Heidelberg (1996)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/10930755_8","volume-title":"Theorem Proving in Higher Order Logics","author":"C. Sch\u00fcrmann","year":"2003","unstructured":"Sch\u00fcrmann, C., Pfenning, F.: A coverage checking algorithm for LF. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 120\u2013135. Springer, Heidelberg (2003)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrmann, C., Stehr, M.-O.: An executable formalization of the HOL\/Nuprl connection in the metalogical framework Twelf. Technical report, Yale University, Computer Science Department, YALEU\/DCS\/TR-1312 (2005)","DOI":"10.1007\/11916277_11"},{"key":"11_CR20","unstructured":"Stehr, M.-O., Naumov, P., Meseguer, J.: A proof-theoretic approach to HOL-Nuprl connection with applications to proof translation (extended abstract). In: WADT\/CoFI 2001, 15th International Workshop on Algebraic Development Techniques and General Workshop of the CoFI WG, Genova, Italy, April 1-3 (2001), http:\/\/formal.cs.uiuc.edu\/stehr\/biblio_stehr.html"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11916277_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:13Z","timestamp":1605643093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11916277_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540482819","9783540482826"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11916277_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}