Iterated Covariant Powerset is not a Monad

Abstract We prove that the double covariant powerset functor PP does not admit any monad structure. The same applies to the n-fold composition of P for any n > 1 .

[1]  Corina Cîrstea.  Canonical Coalgebraic Linear Time Logics , 2015, CALCO.

[2]  Johan van Benthem,et al.  A Propositional Dynamic Logic for Instantial Neighborhood Models , 2017, LORI.

[3]  Marek W. Zawadowski,et al.  Monads of Regular Theories , 2015, Appl. Categorical Struct..

[4]  Philip Wadler,et al.  Comprehending monads , 1990, LISP and Functional Programming.

[5]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[6]  Alexandra Silva,et al.  Generalizing determinization from automata to coalgebras , 2013, Log. Methods Comput. Sci..

[7]  Glynn Winskel,et al.  Distributing probability over non-determinism , 2006, Mathematical Structures in Computer Science.

[8]  S. Lane.  Categories for the Working Mathematician , 1971 .

[9]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1997, Theor. Comput. Sci..

[10]  Helle Hvid Hansen,et al.  Neighbourhood Structures: Bisimilarity and Basic Model Theory , 2009, Log. Methods Comput. Sci..

[11]  Stefan Milius,et al.  Complete Iterativity for Algebras with Effects , 2009, CALCO.

[12]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[13]  Jurriaan Rot,et al.  Coalgebraic Trace Semantics via Forgetful Logics , 2015, FoSSaCS.

[14]  H. Peter Gumm,et al.  Types and coalgebraic structure , 2005 .

[15]  Alexandra Silva,et al.  Trace semantics via determinization , 2015, J. Comput. Syst. Sci..

[16]  Bart Jacobs,et al.  Steps and Traces , 2018, CMCS.

[17]  John Power,et al.  A Coalgebraic Foundation for Linear Time Semantics , 1999, CTCS.

[18]  Bart Jacobs.  Trace Semantics for Coalgebras , 2004, CMCS.

[19]  Ana Sokolova,et al.  Generic Trace Semantics via Coinduction , 2007, Log. Methods Comput. Sci..

[20]  Stefan Milius,et al.  Simplified Coalgebraic Trace Equivalence , 2014, Software, Services, and Systems.

[21]  Philip S. Mulry,et al.  Monad compositions II: Kleisli strength , 2008, Mathematical Structures in Computer Science.

[22]  Martin Odersky,et al.  Programming in Scala , 2008 .

[23]  Filippo Bonchi,et al.  Bialgebraic Semantics for Logic Programming , 2015, Log. Methods Comput. Sci..

[24]  E. Manes,et al.  Monads of sets , 2003 .

[25]  Mikolaj Bojanczyk,et al.  Recognisable Languages over Monads , 2015, DLT.

[26]  Philip Wadler.  Monads for Functional Programming , 1995, Advanced Functional Programming.

[27]  Ernest G. Manes,et al.  Implementing collection classes with monads , 1998, Mathematical Structures in Computer Science.

[28]  Ernest G. Manes,et al.  Taut Monads and T0-spaces , 2002, Theor. Comput. Sci..

[29]  Philip S. Mulry,et al.  MONAD COMPOSITIONS I: GENERAL CONSTRUCTIONS AND RECURSIVE DISTRIBUTIVE LAWS , 2007 .

[30]  Jurriaan Rot,et al.  Coalgebraic Determinization of Alternating Automata , 2018, ArXiv.