Monads
Monads is a formal computational structure in functional programming that generalizes sequencing of computations by encapsulating values within a type constructor and defining bind and return operations, distinguishing it from other algebraic constructs through its adherence to monadic laws governing composition and identity.
655
Publications
33.2K
Citations
774
Authors
389
Institutions
Publications per year
2017–2026
89
655
Notions of computation and monads
Eugenio Moggi · Information and Computation · 1991 · 1.7K citations
Imperative functional programming
Simon Jones, Philip Wadler · 1993 · 1.2K citations · Full text
Computational lambda-calculus and monads
Eugenio Moggi · 2003 · 858 citations
Computing, Computer Science, Algebra +13
The essence of functional programming
Philip Wadler · 1992 · 676 citations · Full text
Philip Wadler · 1990 · 575 citations · Full text
1–5 of 655
774
17
h-index
15
h-index
15
h-index
12
h-index
11
h-index
1–5 of 774
389

University of Edinburgh
Edinburgh, United Kingdom
26 h-index
53 publications
5.3K citations

Radboud University Nijmegen
Nijmegen, The Netherlands
18 h-index
34 publications
968 citations
University of Cambridge
Cambridge, United Kingdom
18 h-index
34 publications
1.4K citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
16 h-index
30 publications
1.3K citations

Centre National de la Recherche Scientifique
Paris, France
15 h-index
29 publications
1.8K citations
University of Oxford
Oxford, United Kingdom
15 h-index
37 publications
1.6K citations

Aarhus University
Aarhus, Denmark
15 h-index
28 publications
1.5K citations
Chalmers University of Technology
Gothenburg, Sweden
14 h-index
34 publications
2.9K citations
1–8 of 389
ENTCS · 48 publications · 1.5K citations
26
h-index
25 publications · 1.8K citations
19
h-index
30 publications · 793 citations
18
h-index
MSCS · 21 publications · 1.1K citations
17
h-index
TAC · 21 publications · 705 citations
16
h-index
1–5