Abstract
Using the dependently-typed programming language Agda, we formalise a category of algebraic contexts with relational homomorphisms presented by [Jip12], [Mos13]. We do this in the abstract setting of locally ordered categories with converse (OCCs) with residuals and direct powers, without requiring meets (as in allegories) or joins (as in Kleene categories). The abstract formalisation has the advantage that it can be used both for theoretical reasoning, and for executable implementations, by instantiating it with appropriate choices of concrete OCCs.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Augustsson, L.: Equality proofs in Cayenne (1999), http://tinyurl.com/Aug99eqproof (accessed January 3, 2014)
Berghammer, R., Schmidt, G., Zierer, H.: Symmetric Quotients. Technical Report TUM-INFO 8620, Technische Universität München, Fakultät für Informatik, 18 p. (1986)
Berghammer, R., Schmidt, G., Zierer, H.: Symmetric Quotients and Domain Constructions. Inform. Process. Lett. 33, 163–168 (1989)
Bird, R.S., de Moor, O.: Algebra of Programming. International Series in Computer Science, vol. 100. Prentice Hall (1997)
Danielsson, N.A. et al.: Agda Standard Library, Version 0.7 (2013), http://tinyurl.com/AgdaStdlib
Erné, M.: Categories of Contexts (2005) (preprint), http://www.iazd.uni-hannover.de/~erne/preprints/CatConts.pdf
Freyd, P.J., Scedrov, A.: Categories, Allegories. North-Holland Mathematical Library, vol. 39. North-Holland, Amsterdam (1990)
Hitzler, P., Krötzsch, M., Zhang, G.-Q.: A Categorical View on Algebraic Lattices in Formal Concept Analysis. Fund. Inform. 74, 301–328 (2006)
Jipsen, P.: Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings. In: [KG12], pp. 195–206
Kahl, W.: Calculational Relation-Algebraic Proofs in Isabelle/Isar. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS/AKA 2003. LNCS, vol. 3051, pp. 178–190. Springer, Heidelberg (2004)
Kahl, W.: Refactoring Heterogeneous Relation Algebras around Ordered Categories and Converse. J. Relational Methods in Comp. Sci. 1, 277–313 (2004)
Kahl, W.: Relational Semigroupoids: Abstract Relation-Algebraic Interfaces for Finite Relations between Infinite Types. J. Logic and Algebraic Programming 76, 60–89 (2008)
Kahl, W.: Collagories: Relation-Algebraic Reasoning for Gluing Constructions. J. Logic and Algebraic Programming 80, 297–338 (2011)
Kahl, W.: Dependently-Typed Formalisation of Relation-Algebraic Abstractions. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol. 6663, pp. 230–247. Springer, Heidelberg (2011)
Kahl, W.: Towards Certifiable Implementation of Graph Transformation via Relation Categories. In: [KG12], pp. 82–97
Kahl, W., Griffin, T.G. (eds.): RAMICS 2012. LNCS, vol. 7560. Springer, Heidelberg (2012)
Kahl, W.: Relation-Algebraic Theories in Agda — RATH-Agda-2.0.0. Mechanically checked Agda theories available for download, with 456 pages literate document output (2014), http://RelMiCS.McMaster.ca/RATH-Agda/
Moshier, M.A.: A Relational Category of Polarities (2013) (unpublished draft)
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)
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. 3626, pp. 1–33. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kahl, W. (2014). A Mechanised Abstract Formalisation of Concept Lattices. In: Höfner, P., Jipsen, P., Kahl, W., Müller, M.E. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2014. Lecture Notes in Computer Science, vol 8428. Springer, Cham. https://doi.org/10.1007/978-3-319-06251-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-06251-8_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06250-1
Online ISBN: 978-3-319-06251-8
eBook Packages: Computer ScienceComputer Science (R0)