{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T08:16:16Z","timestamp":1778400976666,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540619376","type":"print"},{"value":"9783540495673","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0031814","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:59:01Z","timestamp":1134266341000},"page":"265-269","source":"Crossref","is-referenced-by-count":183,"title":["HOL Light: A tutorial introduction"],"prefix":"10.1007","author":[{"given":"John","family":"Harrison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"19_CR1","first-page":"129","volume-title":"volume A-10 of IFIP Transactions A: Computer Science and Technology","author":"R. Boulton","year":"1993","unstructured":"R. Boulton et al. Experience with embedding hardware description languages in HOL. In V. Stavridou, T. F. Melham, and R. T. Boute, editors, Proceedings of the IFIP TC10\/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience, volume A-10 of IFIP Transactions A: Computer Science and Technology, pages 129\u2013156, Nijmegen, The Netherlands, 1993. North-Holland."},{"key":"19_CR2","volume-title":"Technical Report 77","author":"M. J. C. Gordon","year":"1985","unstructured":"M. J. C. Gordon. Why higher-order logic is a good formalism for specifying and verifying hardware. Technical Report 77, University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK, 1985."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"M. J. C. Gordon. Mechanizing programming logics in higher order logic. In G. Birtwistle and P. A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving, pages 387\u2013439. Springer-Verlag, 1989.","DOI":"10.1007\/978-1-4612-3658-0_10"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of Lecture Notes in Computer Science. Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09724-4"},{"key":"19_CR5","unstructured":"F. K. Hanna and N. Daeche. Specification and verification using higher-order logic: A case study. In G. Milne and P. A. Subrahmanyam, editors, Formal Aspects of VLSI Design: Proceedings of the 1985 Edinburgh Workshop on VLSI, pages 179\u2013213, 1986."},{"key":"19_CR6","volume-title":"ANSI\/IEEE Standard 754-1985","author":"IEEE","year":"1985","unstructured":"IEEE. Standard for binary floating point arithmetic. ANSI\/IEEE Standard 754-1985, The Institute of Electrical and Electronic Engineers, Inc., 345 East 47th Street, New York, NY 10017, USA, 1985."},{"key":"19_CR7","first-page":"748","volume-title":"volume 607 of Lecture Notes in Computer Science","author":"S. Owre","year":"1992","unstructured":"S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Computer Science, pages 748\u2013752, Saratoga, NY, 1992. Springer-Verlag."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"L. C. Paulson. Logic and computation: interactive proof with Cambridge LCF. Number 2 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1987.","DOI":"10.1017\/CBO9780511526602"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"L. C. Paulson. Isabelle: a generic theorem prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994. With contributions by Tobias Nipkow.","DOI":"10.1007\/BFb0030541"},{"key":"19_CR10","unstructured":"G. St\u00e5lmarck. System for determining prepositional logic theorems by applying values and rules to triplets that are generated from Boolean formula. United States Patent number 5,276,897; see also Swedish Patent 467 076, 1994."},{"key":"19_CR11","first-page":"136","volume":"6","author":"A. Trybulec","year":"1978","unstructured":"A. Trybulec. The Mizar-QC\/6000 logic information language. ALLC Bulletin (Association for Literary and Linguistic Computing), 6:136\u2013140, 1978.","journal-title":"ALLC Bulletin (Association for Literary and Linguistic Computing)"},{"key":"19_CR12","unstructured":"P. Weis and X. Leroy. Le langage Caml. InterEditions, 1993. See also the CAML Web page: http:\/\/pauillac.inria.fr\/caml\/."}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Computer-Aided Design"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T11:27:49Z","timestamp":1548070069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540619376","9783540495673"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0031814","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}