{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:42Z","timestamp":1725663882681},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581567"},{"type":"electronic","value":"9783540484677"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58156-1_69","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:24:57Z","timestamp":1330269897000},"page":"826-830","source":"Crossref","is-referenced-by-count":4,"title":["Mollusc a general proof-development shell for sequent-based logics"],"prefix":"10.1007","author":[{"given":"Bradley L.","family":"Richards","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ina","family":"Kraan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Smaill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geraint A.","family":"Wiggins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"69_CR1","doi-asserted-by":"crossref","unstructured":"[Bundy et al 90] A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam system. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 647\u2013648. Springer-Verlag, 1990. Lecture Notes in Artificial Intelligence No. 449. Also available from Edinburgh as DAI Research Paper 507.","DOI":"10.1007\/3-540-52885-7_123"},{"key":"69_CR2","unstructured":"[Constable et al 86] R.L. Constable, S.F. Allen, H.M. Bromley, et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986."},{"key":"69_CR3","doi-asserted-by":"crossref","unstructured":"[Gordon et al 79] M.J. Gordon, A.J. Milner, and C.P. Wadsworth. Edinburgh LCF \u2014 A mechanised logic of computation, volume 78 of Lecture Notes in Computer Science. Springer Verlag, 1979.","DOI":"10.1007\/3-540-09724-4"},{"key":"69_CR4","unstructured":"[Harper et al 87] R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. In Proc. of the Second Symposium on Logic in Computer Science, 1987."},{"key":"69_CR5","doi-asserted-by":"crossref","unstructured":"G. Huet and G.D. Plotkin. Logical Frameworks. CUP, 1991.","DOI":"10.1017\/CBO9780511569807"},{"key":"69_CR6","unstructured":"I. Kraan. Proof Planning for Logic Program Synthesis. Unpublished PhD thesis, Department of Artificial Intelligence, University of Edinburgh, 1994. Submitted February 1994."},{"key":"69_CR7","first-page":"153","volume-title":"Constructive mathematics and computer programming","author":"P. Martin-L\u00f6f","year":"1982","unstructured":"Per Martin-L\u00f6f. Constructive mathematics and computer programming. In 6th International Congress for Logic, Methodology and Philosophy of Science, pages 153\u2013175, Hanover, August 1979. Published by North Holland, Amsterdam. 1982."},{"key":"69_CR8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00248324","volume":"5","author":"L. Paulson","year":"1989","unstructured":"L. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5:363\u2013397, 1989.","journal-title":"Journal of Automated Reasoning"},{"key":"69_CR9","unstructured":"B. L. Richards. Mollusc user's guide version 1.1. DAI Technical paper 23, University of Edinburgh, September 1993."},{"key":"69_CR10","first-page":"351","volume-title":"Proceedings of JICSLP-92","author":"G. A. Wiggins","year":"1992","unstructured":"G. A. Wiggins. Synthesis and transformation of logic programs in the Whelk proof development system. In K. R. Apt, editor, Proceedings of JICSLP-92, pages 351\u2013368. M.I.T. Press, Cambridge, MA, 1992."}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-12"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58156-1_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:17:47Z","timestamp":1605647867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58156-1_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581567","9783540484677"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-58156-1_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}