{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:04:15Z","timestamp":1725595455574},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226724"},{"type":"electronic","value":"9783642226731"}],"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-22673-1_8","type":"book-chapter","created":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T07:49:15Z","timestamp":1310543355000},"page":"107-122","source":"Crossref","is-referenced-by-count":7,"title":["A Foundational View on Integration Problems"],"prefix":"10.1007","author":[{"given":"Florian","family":"Rabe","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kohlhase","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Sacerdoti Coen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48167-2_1","volume-title":"Types for Proofs and Programs","author":"P. Aczel","year":"1999","unstructured":"Aczel, P.: On relating type theories and set theories. In: Altenkirch, T., Naraschewski, W., Reus, B. (eds.) TYPES 1998. LNCS, vol.\u00a01657, pp. 1\u201318. Springer, Heidelberg (1999)"},{"key":"8_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73086-6_14","volume-title":"Towards Mechanized Mathematical Assistants","author":"A. Asperti","year":"2007","unstructured":"Asperti, A., Tassi, E.: Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case. In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds.) MKM\/CALCULEMUS 2007. LNCS (LNAI), vol.\u00a04573, pp. 146\u2013160. Springer, Heidelberg (2007)"},{"key":"8_CR3","volume-title":"Coq\u2019Art: The Calculus of Inductive Constructions","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Coq\u2019Art: The Calculus of Inductive Constructions. Springer, Heidelberg (2004)"},{"key":"8_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-71070-7_14","volume-title":"Automated Reasoning","author":"C. Benzm\u00fcller","year":"2008","unstructured":"Benzm\u00fcller, C., Paulson, L., Theiss, F., Fietzke, A.: LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 162\u2013170. Springer, Heidelberg (2008)"},{"key":"8_CR5","volume-title":"Combinatory Logic","author":"H. Curry","year":"1958","unstructured":"Curry, H., Feys, R.: Combinatory Logic. North-Holland, Amsterdam (1958)"},{"key":"8_CR6","unstructured":"Carette, J., Farmer, W., Wajs, J.: Trustable Communication between Mathematics Systems. In: Hardin, T., Rioboo, R. (eds.) Proceedings of Calculemus, pp. 58\u201368 (2003)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(96)00160-0","volume":"173","author":"M. Cerioli","year":"1997","unstructured":"Cerioli, M., Meseguer, J.: I Borrow Your Logic (Transporting Logical Structures along Maps). Theoretical Computer Science\u00a0173, 311\u2013347 (1997)","journal-title":"Theoretical Computer Science"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-44557-9_8","volume-title":"Types for Proofs and Programs","author":"D. Delahaye","year":"2000","unstructured":"Delahaye, D.: Information Retrieval in a Coq Proof Library Using Type Isomorphisms. In: Coquand, T., Nordstr\u00f6m, B., Dybjer, P., Smith, J. (eds.) TYPES 1999. LNCS, vol.\u00a01956, pp. 131\u2013147. Springer, Heidelberg (2000)"},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.jsc.2004.12.004","volume":"39","author":"D. Delahaye","year":"2005","unstructured":"Delahaye, D., Mayero, M.: Dealing with Algebraic Expressions over a Field in Coq using Maple. Journal of Symbolic Computation\u00a039(5), 569\u2013592 (2005)","journal-title":"Journal of Symbolic Computation"},{"key":"8_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-540-25984-8_35","volume-title":"Automated Reasoning","author":"W. Farmer","year":"2004","unstructured":"Farmer, W.: Formalizing Undefinedness Arising in Calculus. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 475\u2013489. Springer, Heidelberg (2004)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"J. Goguen","year":"1992","unstructured":"Goguen, J., Burstall, R.: Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery\u00a039(1), 95\u2013146 (1992)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","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":"8_CR13","first-page":"479","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism","author":"W. Howard","year":"1980","unstructured":"Howard, W.: The formulas-as-types notion of construction. In: To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, pp. 479\u2013490. Academic Press, London (1980)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/10722086_7","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"U. Hustadt","year":"2000","unstructured":"Hustadt, U., Schmidt, R.: MSPASS: Modal Reasoning by Translation and First-Order Resolution. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol.\u00a01847, pp. 67\u201371. Springer, Heidelberg (2000)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1023\/A:1006023127567","volume":"21","author":"J. Harrison","year":"1998","unstructured":"Harrison, J., Th\u00e9ry, L.: A Skeptic\u2019s Approach to Combining HOL and Maple. Journal of Automated Reasoning\u00a021, 279\u2013294 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Iancu, M., Rabe, F.: Formalizing Foundations of Mathematics. Mathematical Structures in Computer Science (to appear 2011), \n                    \n                      http:\/\/kwarc.info\/frabe\/Research\/IR_foundations_10.pdf","DOI":"10.1017\/S0960129511000144"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-14128-7_32","volume-title":"Intelligent Computer Mathematics","author":"M. Kohlhase","year":"2010","unstructured":"Kohlhase, M., Rabe, F., Zholudev, V.: Towards MKM in the Large: Modular Representation and Scalable Software Architecture. In: Autexier, S., Calmet, J., Delahaye, D., Ion, P., Rideau, L., Rioboo, R., Sexton, A. (eds.) AISC 2010. LNCS, vol.\u00a06167, pp. 370\u2013384. Springer, Heidelberg (2010)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-14052-5_23","volume-title":"Interactive Theorem Proving","author":"A. Krauss","year":"2010","unstructured":"Krauss, A., Schropp, A.: A Mechanized Translation from Higher-Order Logic to Set Theory. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol.\u00a06172, pp. 323\u2013338. Springer, Heidelberg (2010)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-14052-5_22","volume-title":"Interactive Theorem Proving","author":"C. Keller","year":"2010","unstructured":"Keller, C., Werner, B.: Importing HOL Light into Coq. In: Kaufmann, M., Paulson, L. (eds.) ITP 2010. LNCS, vol.\u00a06172, pp. 307\u2013322. Springer, Heidelberg (2010)"},{"key":"8_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/11814771_18","volume-title":"Automated Reasoning","author":"S. McLaughlin","year":"2006","unstructured":"McLaughlin, S.: An Interpretation of Isabelle\/HOL in HOL Light. In: Shankar, N., Furbach, U. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 192\u2013204. Springer, Heidelberg (2006)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/10721959_37","volume-title":"Automated Deduction - CADE-17","author":"A. Meier","year":"2000","unstructured":"Meier, A.: System Description: TRAMP: Transformation of Machine-Found Proofs into ND-Proofs at the Assertion Level. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 460\u2013464. Springer, Heidelberg (2000)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-71209-1_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Mossakowski","year":"2007","unstructured":"Mossakowski, T., Maeder, C., L\u00fcttich, K.: The Heterogeneous Tool Set. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 519\u2013522. Springer, Heidelberg (2007)"},{"key":"8_CR23","unstructured":"MoWGLI Project Deliverables (2004), \n                    \n                      http:\/\/mowgli.cs.unibo.it\/html_no_frames\/deliverables\/index.html"},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10817-007-9085-y","volume":"40","author":"J. Meng","year":"2008","unstructured":"Meng, J., Paulson, L.: Translating Higher-Order Clauses to First-Order Clauses. Journal of Automated Reasoning\u00a040(1), 35\u201360 (2008)","journal-title":"Journal of Automated Reasoning"},{"key":"8_CR25","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., Meseguer, J.: The hOL\/NuPRL proof translator (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":"8_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11814771_27","volume-title":"Automated Reasoning","author":"S. Obua","year":"2006","unstructured":"Obua, S., Skalberg, S.: Importing HOL into Isabelle\/HOL. In: Shankar, N., Furbach, U. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 298\u2013302. Springer, Heidelberg (2006)"},{"key":"8_CR27","unstructured":"Pfenning, F., Sch\u00fcrmann, C., Kohlhase, M., Shankar, N., Owre, S.: The Logosphere Project (2003), \n                    \n                      http:\/\/www.logosphere.org\/"},{"key":"8_CR28","unstructured":"Rabe, F., Kohlhase, M.: A Scalable Module System, (2011), \n                    \n                      http:\/\/arxiv.org\/abs\/1105.0548\n                    \n                    \n                   (under review)"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/10720084_9","volume-title":"Frontiers of Combining Systems","author":"V. Sorge","year":"2000","unstructured":"Sorge, V.: Non-trivial Symbolic Computations in Proof Planning. In: Kirchner, H. (ed.) FroCos 2000. LNCS, vol.\u00a01794, pp. 121\u2013135. Springer, Heidelberg (2000)"},{"key":"8_CR30","unstructured":"Trac, S., Sutcliffe, G., Pease, A.: Integration of the TPTPWorld into SigmaKEE. In: Konev, B., Schmidt, R., Schulz, S. (eds.) Practical Aspects of Automated Reasoning. CEUR Workshop Proceedings, vol.\u00a0373 (2008)"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/BFb0014566","volume-title":"Theoretical Aspects of Computer Software","author":"B. Werner","year":"1997","unstructured":"Werner, B.: Sets in types, types in sets. In: Abadi, M., Ito, T. (eds.) TACS 1997. LNCS, vol.\u00a01281, pp. 530\u2013546. Springer, Heidelberg (1997)"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-540-24849-1_24","volume-title":"Types for Proofs and Programs","author":"F. Wiedijk","year":"2004","unstructured":"Wiedijk, F.: Formal Proof Sketches. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol.\u00a03085, pp. 378\u2013393. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22673-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T21:33:12Z","timestamp":1553895192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22673-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226724","9783642226731"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22673-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}