{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:12:39Z","timestamp":1725631959754},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615873"},{"type":"electronic","value":"9783540706410"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0105413","type":"book-chapter","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T21:17:00Z","timestamp":1320873420000},"page":"315-330","source":"Crossref","is-referenced-by-count":1,"title":["Using lattice theory in higher order logic"],"prefix":"10.1007","author":[{"given":"Linas","family":"Laibinis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,29]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/BF00291051","volume":"25","author":"R.J.R. Back","year":"1988","unstructured":"R.J.R. Back. A calculus of refinements for program derivations. Acta Informatica, 25:593\u2013624, 1988.","journal-title":"Acta Informatica"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF00259469","volume":"27","author":"R.J.R. Back","year":"1990","unstructured":"R.J.R. Back and J. von Wright. Duality in specification languages: a latticetheoretical approach. Acta Informatica, 27:583\u2013625, 1990.","journal-title":"Acta Informatica"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01888227","volume":"2","author":"R.J.R. Back","year":"1990","unstructured":"R.J.R. Back and J. von Wright. Refinement concepts formalised in higher-order logic. Formal Aspects of Computing, 2:247\u2013272, 1990.","journal-title":"Formal Aspects of Computing"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"M.J.C. Gordon. HOL: A proof generating system for higher-order logic. In VLSI Specification, Verification and Synthesis. Kluwer Academic Publishers, 1988.","DOI":"10.1007\/978-1-4613-2007-4_3"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"M.J.C. Gordon, R. Milner and C. Wadsworth. Edinburgh LCF: A mechanised logic of computation. In LNCS 78. Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09724-4"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"J. Grundy. Window Inference in the HOL System. In Proc. of the Int. Workshop on the HOL Theorem Proving System and Its Applications, Aug. 1991. IEEE Computer Society Press.","DOI":"10.1109\/HOL.1991.596285"},{"key":"21_CR7","unstructured":"E. Gunter. Doing algebra in higher order logic. In the HOL system documentation, Cambridge, 1990."},{"key":"21_CR8","unstructured":"E. Gunter. The Implementation and Use of Abstract Theories in HOL In Proc. of the Third HOL Users Meeting, Aarhus, Denmark, October 1990. Technical Report DAIMI PB \u2014 340, 1990."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"T. L\u00e5ngbacka, R. Ruk\u0161\u0117nas and J. von Wright. TkWinHOL: A tool for doing window inference in HOL. In LNCS 971, 245\u2013260. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60275-5_69"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"F. Regensburger. HOLCF: Higher Order Logic of Computable Functions. In LNCS 971, 293\u2013307. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60275-5_72"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1093\/logcom\/3.1.47","volume":"1","author":"P.J. Robinson","year":"1993","unstructured":"P.J. Robinson and J. Staples. Formalising the hierarchical structure of practical mathematical reasoning. Logic and Computation, 1:47\u201361, 1993.","journal-title":"Logic and Computation"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"P.J. Windley. Abstract Theories in HOL. In Proc. of the Int. Workshop on the HOL Theorem Proving System and Its Applications, September 1992. IFIP Transactions A-20, 197\u2013210.","DOI":"10.1016\/B978-0-444-89880-7.50019-X"},{"key":"21_CR13","volume-title":"Technical Report 136, Reports on Computer Science and Mathematics","author":"J. Wright von","year":"1992","unstructured":"J. von Wright. Doing Lattice Theory in Higher Order Logic. In Technical Report 136, Reports on Computer Science and Mathematics, Series A. \u00c5bo Akademi, Turku, 1992."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"J. von Wright. Program refinement by theorem prover. In Proc. 6th Refinement Workshop, London, January 1994. Springer-Verlag.","DOI":"10.1007\/978-1-4471-3240-0_7"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0105413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T09:44:19Z","timestamp":1560937459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0105413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615873","9783540706410"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0105413","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}