Skip to main content

What we talk about when we talk about monads

Petricek, Tomas (2018) What we talk about when we talk about monads. The Art, Science, and Engineering of Programming, 2 (3). p. 12. ISSN 2473-7321. (doi:10.22152/programming-journal.org/2018/2/12) (KAR id:67137)

Abstract

Computer science provides an in-depth understanding of technical aspects of programming concepts, but if we want to understand how programming concepts evolve, how programmers think and talk about them and how they are used in practice, we need to consider a broader perspective that includes historical, philosophical and cognitive aspects. In this paper, we develop such broader understanding of monads, a programming concept that has an infamous formal definition, syntactic support in several programming languages and a reputation for being elegant and powerful, but also intimidating and difficult to grasp.

This paper is not a monad tutorial. It will not tell you what a monad is. Instead, it helps you understand how computer scientists and programmers talk about monads and why they do so. To answer these questions, we review the history of monads in the context of programming and study the development through the perspectives of philosophy of science, philosophy of mathematics and cognitive sciences.

More generally, we present a framework for understanding programming concepts that considers them at three levels: formal, metaphorical and implementation. We base such observations on established results about the scientific method and mathematical entities - cognitive sciences suggest that the metaphors used when thinking about monads are more important than widely accepted, while philosophy of science explains how the research paradigm from which monads originate influences and restricts their use.

Finally, we provide evidence for why a broader philosophical, sociological look at programming concepts should be of interest for programmers. It lets us understand programming concepts better and, fundamentally, choose more appropriate abstractions as illustrated in a number of case studies that conclude the paper.

Item Type: Article
DOI/Identification number: 10.22152/programming-journal.org/2018/2/12
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Tomas Petricek
Date Deposited: 25 May 2018 16:25 UTC
Last Modified: 09 Jul 2019 11:25 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/67137 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year