A graphical approach to monad compositions

uncategorised
Authors

Patrik Eklund

Maria A. Galán

Jesús Medina

Manuel Ojeda-Aciego

Agustín Valverde

Published

1 January 2000

Publication details

First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, {MFCSIT} 2000, Cork, Ireland, July 20-21, 2000 , Electronic Notes in Theoretical Computer Science vol. 40, pages 145–160.

Links

DOI

 

Abstract

In this paper we show how composite expressions involving natural transformations can be pictorially represented in order to provide graphical proof support for providing monad compositions. Examples are drawn using powerset monads composed with the term monad.

Citation

Please, cite this work as:

[Ekl+00] P. Eklund, M. A. Galán, J. Medina, et al. “A graphical approach to monad compositions”. In: First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2000, Cork, Ireland, July 20-21, 2000. Ed. by T. Hurley, M. M. an Airchinnigh, M. P. Schellekens and A. K. Seda. Vol. 40. Electronic Notes in Theoretical Computer Science. Elsevier, 2000, pp. 145-160. DOI: 10.1016/S1571-0661(05)80041-6. URL: https://doi.org/10.1016/S1571-0661(05)80041-6.

@InProceedings{Eklund2000,
     author = {Patrik Eklund and Maria A. Gal{’a}n and Jes{’u}s Medina and Manuel Ojeda-Aciego and Agust'Valverde},
     booktitle = {First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, {MFCSIT} 2000, Cork, Ireland, July 20-21, 2000},
     title = {A graphical approach to monad compositions},
     year = {2000},
     editor = {Ted Hurley and M'l Mac {an Airchinnigh} and Michel P. Schellekens and Anthony Karel Seda},
     pages = {145–160},
     publisher = {Elsevier},
     series = {Electronic Notes in Theoretical Computer Science},
     volume = {40},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/journals/entcs/EklundGMOV00.bib},
     doi = {10.1016/S1571-0661(05)80041-6},
     timestamp = {Wed, 30 Nov 2022 10:58:03 +0100},
     url = {https://doi.org/10.1016/S1571-0661(05)80041-6},
}

Bibliometric data

The following data has been extracted from resources such as OpenAlex, Dimensions, PlumX or Altmetric.

A graphical approach to monad compositions

Cites

The following graph plots the number of cites received by this work from its publication, on a yearly basis.

Papers citing this work

The following is a non-exhaustive list of papers that cite this work:

[1] P. Eklund, M. Galán, J. Medina, et al. “A categorical approach to unification of generalised terms1 1This work has been developed as a cooperation organised within COST 274.” In: Electronic Notes in Theoretical Computer Science 66.5 (Dec. 2002), p. 41–51. ISSN: 1571-0661. DOI: 10.1016/s1571-0661(04)80513-9. URL: http://dx.doi.org/10.1016/s1571-0661(04)80513-9.

[2] D. Kozen, C. Kreitz, and E. Richter. “Automating Proofs in Category Theory”. In: Automated Reasoning. Springer Berlin Heidelberg, 2006, p. 392–407. ISBN: 9783540371885. DOI: 10.1007/11814771_34. URL: http://dx.doi.org/10.1007/11814771_34.

[3] Y. M. Motara. “High-Level Modelling for Typed Functional Programming”. In: Trends in Functional Programming. Springer International Publishing, 2021, p. 69–94. ISBN: 9783030839789. DOI: 10.1007/978-3-030-83978-9_4. URL: http://dx.doi.org/10.1007/978-3-030-83978-9_4.

[4] Y. M. Motara. “String Diagrams for Modelling Functional Programming”. In: 2020 2nd International Multidisciplinary Information Technology and Engineering Conference (IMITEC). IEEE, Nov. 2020, p. 1–7. DOI: 10.1109/imitec50163.2020.9334072. URL: http://dx.doi.org/10.1109/imitec50163.2020.9334072.