Some properties of coalgebras and their role in computer science

• Autorzy: Steingartner W. , Radakovic D. , Valkosak F. , Macko P.

Identyfikatory

DOI

10.17512/jamcm.2016.4.16

• Języki publikacji: EN

Abstrakty

EN

This paper introduces basic theoretical knowledge of coalgebras in computer science. Coalgebras are, specifically in category theory, structures defined according to an endofunctor. For both algebra and coalgebra, a functor is a convenient and general way of defining a signature. We present practical usage of the coalgebras in an example. We observe a behavior of a simple Sequencer developed in SLGeometry framework. We model its behavior with the simple program written in Python, and we describe its behavior within coalgebra of endofunctor. The computation of the values stored in internal states is performed coinductively. Our approach can be used in the teaching process of formal methods for young software engineers.

Słowa kluczowe

EN

coalgebra; functor; induction; internal state of program; observable behavior of program; SLGeometry software; koalgebra; funktor; indukcja; endofunktor

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Journal of Applied Mathematics and Computational Mechanics
• Rocznik: 2016
• Tom: Vol. 15, nr 4
• Strony: 145--156
• Opis fizyczny: Bibliogr. 19 poz., tab.

Twórcy

autor

Steingartner W.

• Department of Computers and Informatics, Faculty of Electrical Engineering and Informatics Technical University of Košice, Košice, Slovak Republic

autor

Radakovic D.

• Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Novi Sad, Serbia

autor

Valkosak F.

• Department of Computers and Informatics, Faculty of Electrical Engineering and Informatics Technical University of Košice, Košice, Slovak Republic

autor

Macko P.

• Department of Computers and Informatics, Faculty of Electrical Engineering and Informatics Technical University of Košice, Košice, Slovak Republic

Bibliografia

• [1] Aczel P., Non-well-founded sets, Center for the Study of Language and Information, Stanford 1941.
• [2] Adámek J., Milius S., Moss L.S., Initial algebras and terminal coalgebras: a survey, 2010.
• [3] Jacobs B., Rutten J., An introduction to (co)algebras and (co)induction, [in:] eds. D. Sangiorgi, J. Rutten, Advanced topics in bisimulation and coinduction, 2011 (This chapter is a modest update of the 1997 BEATCS old tutorial paper).
• [4] Novitzká V., Slodičák V., On applying stochastic problems in higher-order theories, Acta Electrotechnica et Informatica 2007, 7, 3.
• [5] Ristić S., Aleksić S., Čeliković M., Luković I., Generic and standard database constraint metamodels, Comput. Sci. Inf. Syst. 2014, 11(2), 679-696.
• [6] Jacobs B., Introduction to Coalgebra. Towards Mathematics of States and Observations, Version 2.0, 2012.
• [7] Walters R.F.C., Categories and Computer Science, Cambridge University Press, New York 1992.
• [8] Brandenburg M., Einführung in die Kategorientheorie. Mit ausführlichen Erklärungen und zahlreichen Beispielen, Springer-Verlag, Berlin-Heidelberg, Springer Spektrum, 2016.
• [9] Barr, M., Wells, C., Category Theory for Computing Science, Prentice Hall International, 1990.
• [10] Blute R., Scott P., Category theory for linear logicians, [in:] T. Erhard, J.-Y. Girard, P. Ruet (eds.), Linear Logic in Computer Science, London Mathematical Society Lecture Note Series, Cambridge Univ. Press, 2004.
• [11] Geuvers H., Representing Streams in Second Order Logic (Coinduction and Coalgebra in Second Order Logic), Seminar Representing Streams, Lorentz Centre, Leiden Dec 14 2012, ISBN 3-540-66463-7.
• [12] Vene V., Categorical Programming with Inductive and Coinductive Types, Tartu University Press, Tartu 2000.
• [13] Rutten J.J.M.M., Fundamental study - universal coalgebra: a theory of systems, Theoretical Computer Science 2000, 249, 3-80.
• [14] Jacobs B., Rutten J., Tutorial on (Co)Algebras and (Co)Induction, EATCS 1999, 222-259.
• [15] Radaković D., Herceg Đ., A platform for development of mathematical games on silverlight, Acta Didactica Napocensia 2013, 6(1), 77-90.
• [16] Radaković D., Herceg Dj, The Extensibility of an Interpreted Language Using Plugin Libraries, AIP Proceedings, Numerical Analysis and Applied Mathematics ICNAAM 2011: International Conference on Numerical Analysis and Applied Mathematics 2011, 1389, 837-840.
• [17] Herceg Đ., Radaković D., Herceg D., Generalizing the Extensibility of a Dynamic Geometry-Software, AIP Proceedings, Numerical Analysis and Applied Mathematics ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics 2012, 1479, 482-485.
• [18] Radaković D., Herceg Dj, The Use of WPF for Development of Interactive Geometry Software, Acta Universitatis Matthiae Belii, Series Mathematics 2010, 16, 65-79.
• [19] GeoGebra: Featured Materials, https://www.geogebra.org/materials/

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę.