{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:27:58Z","timestamp":1725791278841},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319062501"},{"type":"electronic","value":"9783319062518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06251-8_15","type":"book-chapter","created":{"date-parts":[[2014,4,8]],"date-time":"2014-04-08T01:32:39Z","timestamp":1396920759000},"page":"242-260","source":"Crossref","is-referenced-by-count":1,"title":["A Mechanised Abstract Formalisation of Concept Lattices"],"prefix":"10.1007","author":[{"given":"Wolfram","family":"Kahl","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Augustsson, L.: Equality proofs in Cayenne (1999), \n                    \n                      http:\/\/tinyurl.com\/Aug99eqproof\n                    \n                    \n                   (accessed January 3, 2014)"},{"key":"15_CR2","unstructured":"Berghammer, R., Schmidt, G., Zierer, H.: Symmetric Quotients. Technical Report TUM-INFO 8620, Technische Universit\u00e4t M\u00fcnchen, Fakult\u00e4t f\u00fcr Informatik, 18 p. (1986)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0020-0190(89)90197-X","volume":"33","author":"R. Berghammer","year":"1989","unstructured":"Berghammer, R., Schmidt, G., Zierer, H.: Symmetric Quotients and Domain Constructions. Inform. Process. Lett.\u00a033, 163\u2013168 (1989)","journal-title":"Inform. Process. Lett."},{"key":"15_CR4","unstructured":"Bird, R.S., de Moor, O.: Algebra of Programming. International Series in Computer Science, vol.\u00a0100. Prentice Hall (1997)"},{"key":"15_CR5","unstructured":"Danielsson, N.A. et al.: Agda Standard Library, Version 0.7 (2013), \n                    \n                      http:\/\/tinyurl.com\/AgdaStdlib"},{"key":"15_CR6","unstructured":"Ern\u00e9, M.: Categories of Contexts (2005) (preprint), \n                    \n                      http:\/\/www.iazd.uni-hannover.de\/~erne\/preprints\/CatConts.pdf"},{"key":"15_CR7","unstructured":"Freyd, P.J., Scedrov, A.: Categories, Allegories. North-Holland Mathematical Library, vol.\u00a039. North-Holland, Amsterdam (1990)"},{"key":"15_CR8","first-page":"301","volume":"74","author":"P. Hitzler","year":"2006","unstructured":"Hitzler, P., Kr\u00f6tzsch, M., Zhang, G.-Q.: A Categorical View on Algebraic Lattices in Formal Concept Analysis. Fund. Inform.\u00a074, 301\u2013328 (2006)","journal-title":"Fund. Inform."},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-33314-9_13","volume-title":"Relational and Algebraic Methods in Computer Science","author":"P. Jipsen","year":"2012","unstructured":"Jipsen, P.: Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings. In: [KG12], pp. 195\u2013206"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Kahl, W.: Calculational Relation-Algebraic Proofs in Isabelle\/Isar. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS\/AKA 2003. LNCS, vol.\u00a03051, pp. 178\u2013190. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24771-5_16"},{"key":"15_CR11","first-page":"277","volume":"1","author":"W. Kahl","year":"2004","unstructured":"Kahl, W.: Refactoring Heterogeneous Relation Algebras around Ordered Categories and Converse. J. Relational Methods in Comp. Sci.\u00a01, 277\u2013313 (2004)","journal-title":"J. Relational Methods in Comp. Sci."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jlap.2007.10.008","volume":"76","author":"W. Kahl","year":"2008","unstructured":"Kahl, W.: Relational Semigroupoids: Abstract Relation-Algebraic Interfaces for Finite Relations between Infinite Types. J. Logic and Algebraic Programming\u00a076, 60\u201389 (2008)","journal-title":"J. Logic and Algebraic Programming"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.jlap.2011.04.006","volume":"80","author":"W. Kahl","year":"2011","unstructured":"Kahl, W.: Collagories: Relation-Algebraic Reasoning for Gluing Constructions. J. Logic and Algebraic Programming\u00a080, 297\u2013338 (2011)","journal-title":"J. Logic and Algebraic Programming"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-21070-9_18","volume-title":"Relational and Algebraic Methods in Computer Science","author":"W. Kahl","year":"2011","unstructured":"Kahl, W.: Dependently-Typed Formalisation of Relation-Algebraic Abstractions. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol.\u00a06663, pp. 230\u2013247. Springer, Heidelberg (2011)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-33314-9_6","volume-title":"Relational and Algebraic Methods in Computer Science","author":"W. Kahl","year":"2012","unstructured":"Kahl, W.: Towards Certifiable Implementation of Graph Transformation via Relation Categories. In: [KG12], pp. 82\u201397"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Relational and Algebraic Methods in Computer Science","year":"2012","unstructured":"Kahl, W., Griffin, T.G. (eds.): RAMICS 2012. LNCS, vol.\u00a07560. Springer, Heidelberg (2012)"},{"key":"15_CR17","unstructured":"Kahl, W.: Relation-Algebraic Theories in Agda \u2014 RATH-Agda-2.0.0. Mechanically checked Agda theories available for download, with 456 pages literate document output (2014), \n                    \n                      http:\/\/RelMiCS.McMaster.ca\/RATH-Agda\/"},{"key":"15_CR18","unstructured":"Moshier, M.A.: A Relational Category of Polarities (2013) (unpublished draft)"},{"key":"15_CR19","unstructured":"Norell, U.: Towards a Practical Programming Language Based on Dependent Type Theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology (2007)"},{"key":"15_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11528784_1","volume-title":"Formal Concept Analysis","author":"R. Wille","year":"2005","unstructured":"Wille, R.: Formal Concept Analysis as Mathematical Theory of Concepts and Concept Hierarchies. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol.\u00a03626, pp. 1\u201333. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06251-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T14:24:44Z","timestamp":1558880684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06251-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319062501","9783319062518"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06251-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}