Skip to main content
SpringerLink
Log in
Book cover

International Conference on Relational and Algebraic Methods in Computer Science

RAMICS 2015: Relational and Algebraic Methods in Computer Science pp 151–168Cite as

Mechanised Relation-Algebraic Order Theory in Ordered Categories without Meets

  • Conference paper
  • First Online:

  • 407 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9348))

Abstract

In formal concept analysis, complete lattices of “concepts” are represented by entity-attribute relations called “contexts”. Using the dependently-typed programming language Agda, we build on a previous formalisation of the category of contexts to obtain a fully verified abstract implementation of the duality between contexts and complete lattices in the abstract setting of locally ordered categories with converse, residuals, symmetric quotients, and direct powers.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berghammer, R., Schmidt, G., Zierer, H.: Symmetric Quotients. Technical Report TUM-INFO 8620, TU München, Fak. Informatik, 18 p. (1986)

    Google Scholar 

  2. Berghammer, R., Schmidt, G., Zierer, H.: Symmetric Quotients and Domain Constructions. Inform. Process. Lett. 33, 163–168 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bird, R.S., de Moor, O.: Algebra of Programming, International Series in Computer Science, vol. 100. Prentice Hall (1997)

    Google Scholar 

  4. Freyd, P.J., Scedrov, A.: Categories, Allegories, North-Holland Mathematical Library, vol. 39. North-Holland, Amsterdam (1990)

    MATH  Google Scholar 

  5. Furusawa, H., Kahl, W.: A Study on Symmetric Quotients. Technical Report 1998-06, Fakultät für Informatik, Univ. der Bundeswehr München (1998)

    Google Scholar 

  6. Jipsen, P.: Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings. In: Kahl, W., Griffin, T.G. (eds.) RAMICS 2012. LNCS, vol. 7560, pp. 195–206. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  7. Kahl, W.: Refactoring Heterogeneous Relation Algebras around Ordered Categories and Converse. J. Rel. Methods in Comp. Sci. 1, 277–313 (2004)

    Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Kahl, W.: Abstract Context Lattices Formalised for Concrete Applications — AContext-1.0. Mechanically checked Agda theories, 25 pp. literate document output (2014). http://relmics.mcmaster.ca/RATH-Agda/#AContext

  10. Kahl, W.: A Mechanised Abstract Formalisation of Concept Lattices. In: Höfner, P., Jipsen, P., Kahl, W., Müller, M.E. (eds.) RAMiCS 2014. LNCS, vol. 8428, pp. 242–260. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  11. Kahl, W.: Relation-Algebraic Theories in Agda — RATH-Agda-2.0.1. Mechanically checked Agda theories, with 456 pages literate document output (2014). http://relmics.mcmaster.ca/RATH-Agda/

  12. Kahl, W., Al-hassy, M.: Order Theory and Concept Lattices in Ordered Categories Without Meets, Formalised in Agda — AContext-2.1. Mechanically checked Agda theories, 181 pages literate document output (2015). http://relmics.mcmaster.ca/RATH-Agda/#AContext

  13. Kozen, D.: Typed Kleene Algebra. Technical Report 98-1669, Computer Science Department, Cornell University (1998)

    Google Scholar 

  14. Löh, A.: lhs2TeX (2012). http://www.andres-loeh.de/lhs2tex/

  15. Moshier, M.A.: A Relational Category of Polarities (unpublished draft) (2013)

    Google Scholar 

  16. 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). http://wiki.portal.chalmers.se/agda/pmwiki.php

  17. Schmidt, G., Ströhlein, T.: Relations and Graphs, Discrete Mathematics for Computer Scientists. EATCS-Monographs on Theoret. Comput. Sci. Springer (1993)

    Google Scholar 

  18. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. McMaster University, Hamilton, Ontario, Canada

    Musa Al-hassy & Wolfram Kahl

Authors
  1. Musa Al-hassy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfram Kahl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Musa Al-hassy .

Editor information

Editors and Affiliations

  1. McMaster University, Hamilton, Ontario, Canada

    Wolfram Kahl

  2. Brock University, St. Catharines, Ontario, Canada

    Michael Winter

  3. Universidade do Minho, Braga, Portugal

    José Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Al-hassy, M., Kahl, W. (2015). Mechanised Relation-Algebraic Order Theory in Ordered Categories without Meets. In: Kahl, W., Winter, M., Oliveira, J. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2015. Lecture Notes in Computer Science(), vol 9348. Springer, Cham. https://doi.org/10.1007/978-3-319-24704-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24704-5_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24703-8

  • Online ISBN: 978-3-319-24704-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation