{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:28:26Z","timestamp":1743035306624,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642313738"},{"type":"electronic","value":"9783642313745"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31374-5_14","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T13:00:57Z","timestamp":1340629257000},"page":"202-215","source":"Crossref","is-referenced-by-count":7,"title":["Theory Presentation Combinators"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Carette","sequence":"first","affiliation":[]},{"given":"Russell","family":"O\u2019Connor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-14128-7_13","volume-title":"Intelligent Computer Mathematics","author":"A. Asperti","year":"2010","unstructured":"Asperti, A., Sacerdoti Coen, C.: Some Considerations on the Usability of Interactive Provers. In: Autexier, S., Calmet, J., Delahaye, D., Ion, P.D.F., Rideau, L., Rioboo, R., Sexton, A.P. (eds.) AISC 2010. LNCS, vol.\u00a06167, pp. 147\u2013156. Springer, Heidelberg (2010), \n                      http:\/\/dl.acm.org\/citation.cfm?id=1894483.1894498"},{"key":"14_CR2","unstructured":"Burstall, R.M., Goguen, J.A.: Putting theories together to make specifications. In: IJCAI, pp. 1045\u20131058 (1977)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-10007-5_41","volume-title":"Abstract Software Specifications","author":"R.M. Burstall","year":"1980","unstructured":"Burstall, R.M., Goguen, J.A.: The Semantics of Clear, a Specification Language. In: Bjorner, D. (ed.) Abstract Software Specifications. LNCS, vol.\u00a086, pp. 292\u2013332. Springer, Heidelberg (1980)"},{"key":"14_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-85110-3_19","volume-title":"Intelligent Computer Mathematics","author":"J. Carette","year":"2008","unstructured":"Carette, J., Farmer, W.M.: High-Level Theories. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC 2008, Calculemus 2008, and MKM 2008. LNCS (LNAI), vol.\u00a05144, pp. 232\u2013245. Springer, Heidelberg (2008)"},{"key":"14_CR5","unstructured":"Carette, J., Farmer, W.M., Jeremic, F., Maccio, V., O\u2019Connor, R., Tran, Q.: The mathscheme library: Some preliminary experiments. Tech. rep., University of Bologna, Italy (2011), uBLCS-2011-04"},{"issue":"5","key":"14_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.scico.2008.09.008","volume":"76","author":"J. Carette","year":"2011","unstructured":"Carette, J., Kiselyov, O.: Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code. Sci. Comput. Program.\u00a076(5), 349\u2013375 (2011)","journal-title":"Sci. Comput. Program."},{"key":"14_CR7","unstructured":"Carette, J., O\u2019Connor, R.: Theory Presentation Combinators (2012), \n                      http:\/\/arxiv.org\/abs\/1204.0053v2"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0168-0072(86)90053-9","volume":"32","author":"J. Cartmell","year":"1986","unstructured":"Cartmell, J.: Generalised algebraic theories and contextual categories. Annals of Pure and Applied Logic\u00a032, 209\u2013243 (1986), \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/0168007286900539","journal-title":"Annals of Pure and Applied Logic"},{"key":"14_CR9","unstructured":"CoFI (The Common Framework Initiative): Casl Reference Manual. LNCS, IFIP Series, vol. 2960. Springer (2004)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/3-540-55602-8_192","volume-title":"Automated Deduction - CADE-11","author":"W.M. Farmer","year":"1992","unstructured":"Farmer, W.M., Guttman, J.D., Thayer, F.J.: Little Theories. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, pp. 567\u2013581. Springer, Heidelberg (1992)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-03359-9_23","volume-title":"Theorem Proving in Higher Order Logics","author":"F. Garillot","year":"2009","unstructured":"Garillot, F., Gonthier, G., Mahboubi, A., Rideau, L.: Packaging Mathematical Structures. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol.\u00a05674, pp. 327\u2013342. Springer, Heidelberg (2009), \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-03359-9_23"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-45842-5_7","volume-title":"Types for Proofs and Programs","author":"H. Geuvers","year":"2002","unstructured":"Geuvers, H., Wiedijk, F., Zwanenburg, J.: A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol.\u00a02277, pp. 96\u2013111. Springer, Heidelberg (2002)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-14128-7_26","volume-title":"Intelligent Computer Mathematics","author":"A. Grabowski","year":"2010","unstructured":"Grabowski, A., Schwarzweller, C.: On Duplication in Mathematical Repositories. In: Autexier, S., Calmet, J., Delahaye, D., Ion, P., Rideau, L., Rioboo, R., Sexton, A. (eds.) AISC 2010. LNCS, vol.\u00a06167, pp. 300\u2013314. Springer, Heidelberg (2010)"},{"key":"14_CR14","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Categorical Logic and Type Theory","author":"B. Jacobs","year":"1999","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0141. North Holland, Amsterdam (1999)"},{"issue":"1-2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0304-3975(98)00232-1","volume":"247","author":"C. Oriat","year":"2000","unstructured":"Oriat, C.: Detecting equivalence of modular specifications with categorical diagrams. Theor. Comput. Sci.\u00a0247(1-2), 141\u2013190 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR16","unstructured":"Rabe, F., Kohlhase, M.: A Scalable Module System, \n                      http:\/\/kwarc.info\/frabe\/Research\/mmt.pdf"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Sacerdoti Coen, C., Tassi, E.: Nonuniform coercions via unification hints. In: Hirschowitz, T. (ed.) TYPES. EPTCS, vol.\u00a053, pp. 16\u201329 (2009)","DOI":"10.4204\/EPTCS.53.2"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0747-7171(06)80006-4","volume":"15","author":"D.R. Smith","year":"1993","unstructured":"Smith, D.R.: Constructing specification morphisms. Journal of Symbolic Computation\u00a015, 5\u20136 (1993)","journal-title":"Journal of Symbolic Computation"},{"key":"14_CR19","first-page":"251","volume-title":"Calculational System Design, Proceedings of the NATO Advanced Study Institute","author":"D.R. Smith","year":"1999","unstructured":"Smith, D.R.: Mechanizing the development of software. In: Broy, M., Steinbrueggen, R. (eds.) Calculational System Design, Proceedings of the NATO Advanced Study Institute, pp. 251\u2013292. IOS Press, Amsterdam (1999)"},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1017\/S0960129511000119","volume":"21","author":"B. Spitters","year":"2011","unstructured":"Spitters, B., van der Weegen, E.: Type classes for mathematics in type theory. Mathematical Structures in Computer Science\u00a021(4), 795\u2013825 (2011)","journal-title":"Mathematical Structures in Computer Science"},{"key":"14_CR21","unstructured":"Wiedijk, F.: Estimating the cost of a standard library for a mathematical proof checker (2001), \n                      http:\/\/www.cs.ru.nl\/~freek\/notes\/mathstdlib2.pdf"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31374-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T04:45:41Z","timestamp":1674103541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31374-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642313738","9783642313745"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31374-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}