{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T04:10:16Z","timestamp":1741320616015,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_14","type":"book-chapter","created":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T11:49:15Z","timestamp":1310557755000},"page":"196-211","source":"Crossref","is-referenced-by-count":2,"title":["Interleaving Strategies"],"prefix":"10.1007","author":[{"given":"Bastiaan","family":"Heeren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Jeuring","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s11786-010-0025-6","volume":"3","author":"D. Aspinall","year":"2010","unstructured":"Aspinall, D., Denney, E., L\u00fcth, C.: Tactics for hierarchical proof. Mathematics in Computer Science\u00a03(3), 309\u2013330 (2010)","journal-title":"Mathematics in Computer Science"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1017\/S0956796804005143","volume":"14","author":"A.I. Baars","year":"2004","unstructured":"Baars, A.I., L\u00f6h, A., Swierstra, S.D.: Parsing permutation phrases. Journal of Functional Programming\u00a014, 635\u2013646 (2004)","journal-title":"Journal of Functional Programming"},{"key":"14_CR3","first-page":"89","volume-title":"Computer-Human Interaction in Symbolic Computation","author":"M.J. Beeson","year":"1998","unstructured":"Beeson, M.J.: Design principles of MathPert: Software to support education in algebra and calculus. In: Kajler, N. (ed.) Computer-Human Interaction in Symbolic Computation, pp. 89\u2013115. Springer, Heidelberg (1998)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science\u00a037, 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bundy, A.: The use of explicit plans to guide inductive proofs. In: International conference on automated deduction, pp. 111\u2013120 (1988)","DOI":"10.1007\/BFb0012826"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Claessen, K., Hughes, J.: QuickCheck: A lightweight tool for random testing of Haskell programs. In: ICFP 2000, pp. 268\u2013279 (2000)","DOI":"10.1145\/351240.351266"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-662-05148-1_16","volume-title":"Algebra, Geometry and Software Systems","author":"A. Cohen","year":"2003","unstructured":"Cohen, A., Cuypers, H., Reinaldo Barreiro, E., Sterk, H.: Interactive mathematical documents on the web. In: Algebra, Geometry and Software Systems, pp. 289\u2013306. Springer, Heidelberg (2003)"},{"key":"14_CR8","unstructured":"Doorman, M., Drijvers, P., Boon, P., van Gisbergen, S., Gravemeijer, K.: Design and implementation of a computer supported learning environment for mathematics. In: Earli 2009 SIG20 invited Symposium Issues in designing and implementing computer supported inquiry learning environments (2009)"},{"key":"14_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04293-9","volume-title":"Introduction to Process Algebra","author":"W. Fokkink","year":"2000","unstructured":"Fokkink, W.: Introduction to Process Algebra. Springer, Heidelberg (2000)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Gerdes, A., Heeren, B., Jeuring, J.: Constructing Strategies for Programming. In: Cordeiro, J., et al. (eds.) Proceedings of the First International Conference on Computer Supported Education, pp. 65\u201372. INSTICC Press (March 2009)","DOI":"10.5220\/0001973500650072"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Gerdes, A., Heeren, B., Jeuring, J.: Properties of Exercise Strategies. In: Proceedings of IWS 2010: 1st International Workshop on Strategies in Rewriting, Proving, and Programming. Electronic Proceedings in Theoretical Computer Science (2011)","DOI":"10.4204\/EPTCS.44.2"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-14128-7_27","volume-title":"Intelligent Computer Mathematics","author":"B. Heeren","year":"2010","unstructured":"Heeren, B., Jeuring, J.: Adapting mathematical domain reasoners. 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. 315\u2013330. Springer, Heidelberg (2010)"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s11786-010-0027-4","volume":"3","author":"B. Heeren","year":"2010","unstructured":"Heeren, B., Jeuring, J., Gerdes, A.: Specifying rewrite strategies for interactive exercises. Mathematics in Computer Science\u00a03(3), 349\u2013370 (2010)","journal-title":"Mathematics in Computer Science"},{"key":"14_CR14","volume-title":"Communicating sequential processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Prentice-Hall, Inc., Englewood Cliffs (1985)"},{"issue":"5","key":"14_CR15","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0956796897002864","volume":"7","author":"G. Huet","year":"1997","unstructured":"Huet, G.: The zipper. Journal of Functional Programming\u00a07(5), 549\u2013554 (1997)","journal-title":"Journal of Functional Programming"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-21350-2_18","volume-title":"Third International Congress on Tools for Teaching Logic","author":"J. Lodder","year":"2011","unstructured":"Lodder, J., Heeren, B.: A teaching tool for proving equivalences between logical formulae. In: Soler-Toscano, F. (ed.) TICTTL 2011. LNCS, vol.\u00a06680, pp. 154\u2013161. Springer, Heidelberg (2011)"},{"key":"14_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-24844-6_12","volume-title":"Artificial Intelligence and Soft Computing - ICAISC 2004","author":"E. Melis","year":"2004","unstructured":"Melis, E., Siekmann, J.: ActiveMath: An intelligent tutoring system for mathematics. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol.\u00a03070, pp. 91\u2013101. Springer, Heidelberg (2004)"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Isabelle\/HOL","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T. (eds.): Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"14_CR19","unstructured":"Peyton Jones, S., et al.: Haskell 98, Language and Libraries. The Revised Report. Cambridge University Press, A special issue of the Journal of Functional Programming, (2003), http:\/\/www.haskell.org\/"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-03153-3_6","volume-title":"Language Engineering and Rigorous Software Development","author":"S.D. Swierstra","year":"2009","unstructured":"Swierstra, S.D.: Combinator parsing: A short tutorial. In: Bove, A., Barbosa, L.S., Pardo, A., Pinto, J.S. (eds.) Language Engineering and Rigorous Software Development. LNCS, vol.\u00a05520, pp. 252\u2013300. Springer, Heidelberg (2009)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Visser, E., Benaissa, Z.A., Tolmach, A.: Building program optimizers with rewriting strategies. In: ICFP 1998, pp. 13\u201326 (1998)","DOI":"10.1145\/289423.289425"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T02:29:04Z","timestamp":1741314544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22673-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226724","9783642226731"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22673-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}