{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:32:30Z","timestamp":1742985150554,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948201"},{"type":"electronic","value":"9783319948218"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94821-8_19","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T13:25:55Z","timestamp":1530624355000},"page":"324-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["CalcCheck: A Proof Checker for Teaching the \u201cLogical Approach to Discrete Math\u201d"],"prefix":"10.1007","author":[{"given":"Wolfram","family":"Kahl","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"issue":"5","key":"19_CR1","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00165-009-0136-5","volume":"22","author":"R-J Back","year":"2010","unstructured":"Back, R.-J.: Structured derivations: A unified proof style for teaching mathematics. Formal Aspects Comput. 22(5), 629\u2013661 (2010). \nhttps:\/\/doi.org\/10.1007\/s00165-009-0136-5","journal-title":"Formal Aspects Comput."},{"key":"19_CR2","unstructured":"Back, R.-J., Bos, V., Eriksson, J.: MathEdit: Tool support for structured calculational proofs. TUCS Technical report 854, Turku Centre for Computer Science (2007)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-62075-6_19","volume-title":"Intelligent Computer Mathematics","author":"NC Carter","year":"2017","unstructured":"Carter, N.C., Monks, K.G.: A web-based toolkit for mathematical word processing applications with semantics. In: Geuvers, H., England, M., Hasan, O., Rabe, F., Teschke, O. (eds.) CICM 2017. LNCS (LNAI), vol. 10383, pp. 272\u2013291. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-62075-6_19"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Ekblad, A.: High-performance client-side web applications through Haskell EDSLs. In: Mainland, G., (ed) Proceedings 9th International Symposium on Haskell, Haskell 2016, pp. 62\u201373. ACM (2016). \nhttps:\/\/doi.org\/10.1145\/2976002.2976015","DOI":"10.1145\/2976002.2976015"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-60858-2_16","volume-title":"Mathematical Methods in Program Development","author":"D Gries","year":"1997","unstructured":"Gries, D.: Foundations for calculational logic. In: Broy, M., Schieder, B. (eds.) Mathematical Methods in Program Development, pp. 83\u2013126. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/978-3-642-60858-2_16"},{"key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3837-7","volume-title":"A Logical Approach to Discrete Math. Monographs in Computer Science","author":"D Gries","year":"1993","unstructured":"Gries, D., Schneider, F.B.: A Logical Approach to Discrete Math. Monographs in Computer Science. Springer, New York (1993). \nhttps:\/\/doi.org\/10.1007\/978-1-4757-3837-7"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0020-0190(94)00198-8","volume":"53","author":"D Gries","year":"1995","unstructured":"Gries, D., Schneider, F.B.: Equational propositional logic. Inform. Process. Lett. 53, 145\u2013152 (1995). \nhttps:\/\/doi.org\/10.1016\/0020-0190(94)00198-8","journal-title":"Inform. Process. Lett."},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-25379-9_17","volume-title":"Certified Programs and Proofs","author":"W Kahl","year":"2011","unstructured":"Kahl, W.: The teaching tool CalcCheck a proof-checker for Gries and Schneider\u2019s \u201cLogical Approach to Discrete Math\u201d. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol. 7086, pp. 216\u2013230. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25379-9_17"},{"key":"19_CR9","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. Ph.D. thesis, Department of Computer Science and Engineering, Chalmers University of Technology (2007). \nhttp:\/\/wiki.portal.chalmers.se\/agda\/pmwiki.php"},{"key":"19_CR10","unstructured":"Spivey, J.M.: The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science. Prentice Hall (1989)"},{"key":"19_CR11","unstructured":"Spivey, M.: The fuzz type-checker for Z, Version 3.4.1, and the fuzz Manual, 2nd edn. (2008). \nhttp:\/\/spivey.oriel.ox.ac.uk\/corner\/Fuzz\n\n. Accessed 15 April 2018"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0304-3975(93)90240-T","volume":"112","author":"CL Talcott","year":"1993","unstructured":"Talcott, C.L.: A theory of binding structures and applications to rewriting. Theoret. Comput. Sci. 112, 68\u201381 (1993). \nhttps:\/\/doi.org\/10.1016\/0304-3975(93)90240-T","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94821-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,11]],"date-time":"2018-09-11T18:37:00Z","timestamp":1536691020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94821-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948201","9783319948218"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94821-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ITP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Interactive Theorem Proving","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/itp2018.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}