Peter Aczel
JiříAdámek
Stefan Milius
JiříVelebil
2003
Infinite trees and completely iterative theories: a coalgebraic view
Theoretical Computer Science
300
1-3
1–45
10.1016/S0304-3975(02)00728-4
JiříAdámek
Stefan Milius
JiříVelebil
2006
Elgot Algebras
Logical Methods in Computer Science
2
5
10.2168/LMCS-2(5:4)2006
Robert Atkey
Neil Ghani
Bart Jacobs
Patricia Johann
2012
Fibrational Induction Meets Effects
Lars Birkedal
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science
7213
Springer
42–57
10.1007/978-3-642-28729-9_3
Robert Atkey
Patricia Johann
2015
Interleaving data and effects
Journal of Functional Programming
25
10.1017/S0956796815000209
Roland Carl Backhouse
Marcel Bijsterveld
Rik van Geldrop
Jaap van der Woude
1995
Categorical Fixed Point Calculus
Category Theory and Computer Science
159–179
10.1007/3-540-60164-3_25
Michael Barr
Charles Wells
1985
Toposes, Triples, and Theories
Grundlehren der mathematischen Wissenschaften
Springer-Verlag
New York
http://www.tac.mta.ca/tac/reprints/articles/12/tr12abs.html
10.1007/978-1-4899-0021-0
Jonathan M. Beck
1967
Triples, Algebras and Cohomology
Columbia University
http://www.tac.mta.ca/tac/reprints/articles/2/tr2abs.html
Jonathan M. Beck
1969
Distributive laws
B. Eckmann
Seminar on Triples and Categorical Homology Theory
Lecture Notes in Mathematics
80
Springer Berlin Heidelberg
119–140
10.1007/BFb0083084
http://www.tac.mta.ca/tac/reprints/articles/18/tr18abs.html
Richard S. Bird
2006
A program to solve Sudoku (functional pearl)
Journal of Functional Programming
16
6
671–679
10.1017/S0956796806006058
Andrzej Filinski
Kristian Støvring
2007
Inductive Reasoning About Effectful Data Types
SIGPLAN Not.
42
9
97–110
10.1145/1291220.1291168
Marcelo Fiore
2013
An equational metalogic for monadic equational systems
Theory and Applications of Categories
27
18
465–492
http://www.tac.mta.ca/tac/volumes/27/18/27-18abs.html
Marcelo P. Fiore
Gordon D. Plotkin
Daniele Turi
1999
Abstract syntax and variable binding
14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999
IEEE Computer Society
193–202
10.1109/LICS.1999.782615
Ralf Hinze
2000
Deriving backtracking monad transformers (functional pearl)
Martin Odersky
Philip Wadler
Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), Montreal, Canada, September 18-21, 2000.
ACM
186–197
10.1145/351240.351258
Ralf Hinze
2012
Kan extensions for program optimisation or: Art and Dan explain an old trick
Jeremy Gibbons
Pablo Nogueira
Mathematics of Program Construction - 11th International Conference, MPC 2012, Madrid, Spain, June 25-27, 2012. Proceedings
Lecture Notes in Computer Science
7342
Springer
324–362
10.1007/978-3-642-31113-0_16
John Hughes
1995
The design of a pretty-printing Library
Johan Jeuring
Erik Meijer
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques, Båstad, Sweden, May 24-30, 1995, Tutorial Text
Lecture Notes in Computer Science
925
Springer
53–96
10.1007/3-540-59451-5_3
Martin Hyland
Gordon D. Plotkin
John Power
2006
Combining effects: Sum and tensor
Theoretical Computer Science
357
1-3
70–99
10.1016/j.tcs.2006.03.013
Martin Hyland
John Power
2006
Discrete Lawvere theories and computational effects
Theoretical Computer Science
366
1-2
144–162
10.1016/j.tcs.2006.07.007
Mauro Jaskelioff
Eugenio Moggi
2010
Monad transformers as monoid transformers
Theoretical Computer Science
411
51–52
4441–4466
10.1016/j.tcs.2010.09.011
Gregory M. Kelly
1980
A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
Bulletin of the Australian Mathematical Society
22
1–83
10.1017/S0004972700006353
Oleg Kiselyov
Chung-chieh Shan
Daniel P. Friedman
Amr Sabry
2005
Backtracking, Interleaving, and Terminating Monad Transformers: (Functional Pearl)
SIGPLAN Notices
40
9
192–203
10.1145/1090189.1086390
Anders Kock
1971
Closed categories generated by commutative monads
Journal of the Australian Mathematical Society
12
405–424
10.1017/S1446788700010272
Tom Leinster
2013
Codensity and the ultrafilter monad
Theory and Applications of Categories
28
13
332–370
http://www.tac.mta.ca/tac/volumes/28/13/28-13abs.html
Saunders Mac Lane
1998
Categories for the Working Mathematician
Graduate Texts in Mathematics
Springer
10.1007/978-1-4757-4721-8
Eugenio Moggi
1989
An Abstract View of Programming Languages
Technical Report
Edinburgh University
http://www.lfcs.inf.ed.ac.uk/reports/90/ECS-LFCS-90-113/
Philip Mulry
2013
Notions of Monad Strength
Anindya Banerjee
Olivier Danvy
Kyung-Goo Doh
John Hatcliff
Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday, Manhattan, Kansas, USA, 19-20th September 2013
Electronic Proceedings in Theoretical Computer Science
129
Open Publishing Association
67–83
10.4204/EPTCS.129.6
Maciej Piróg
Jeremy Gibbons
2014
The Coinductive Resumption Monad
Electronic Notes in Theoretical Computer Science
308
273–288
10.1016/j.entcs.2014.10.015
Mathematical Foundations of Programming Semantics (MFPS XXX)
Gordon D. Plotkin
John Power
2003
Algebraic Operations and Generic Effects
Applied Categorical Structures
11
1
69–94
10.1023/A:1023064908962
Exequiel Rivas
Mauro Jaskelioff
2014
Notions of Computation as Monoids
http://arxiv.org/abs/1406.4823
Submitted to the Journal of Functional Programming
Exequiel Rivas
Mauro Jaskelioff
Tom Schrijvers
2015
From monoids to near-semirings: the essence of MonadPlus and alternative
Moreno Falaschi
Elvira Albert
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, July 14-16, 2015
ACM
196–207
10.1145/2790449.2790514
Philip Wadler
1985
How to replace failure by a list of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages
Jean-Pierre Jouannaud
Functional Programming Languages and Computer Architecture, FPCA 1985, Nancy, France, September 16-19, 1985, Proceedings
Lecture Notes in Computer Science
201
Springer
113–128
10.1007/3-540-15975-4_33
Mitchell Wand
Dale Vaillancourt
2004
Relating Models of Backtracking
SIGPLAN Notices
39
9
54–65
10.1145/1016848.1016861
Harvey Wolff
1973
Monads and monoids on symmetric monoidal closed categories
Archiv der Mathematik
24
1
113–120
10.1007/BF01228184