Codensity Lifting of Monads and its Dual

We introduce a method to lift monads on the base category of a fibration to its total category. This method, which we call codensity lifting, is applicable to various fibrations which were not supported by its precursor, categorical TT-lifting. After introducing the codensity lifting, we illustrate some examples of codensity liftings of monads along the fibrations from the category of preorders, topological spaces and extended pseudometric spaces to the category of sets, and also the fibration from the category of binary relations between measurable spaces. We also introduce the dual method called density lifting of comonads. We next study the liftings of algebraic operations to the codensity liftings of monads. We also give a characterisation of the class of liftings of monads along posetal fibrations with fibred small meets as a limit of a certain large diagram.

[1]  Tetsuya Sato,et al.  Codensity Liftings of Monads , 2015, CALCO.

[2]  Martín Abadi.  Top-top-closed Relations and Admissibility , 2000, Math. Struct. Comput. Sci..

[3]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[4]  Bart Jacobs,et al.  Structural Induction and Coinduction in a Fibrational Setting , 1998, Inf. Comput..

[5]  John C. Mitchell,et al.  Notes on Sconing and Relators , 1992, CSL.

[6]  Bart Jacobs,et al.  Categorical Logic and Type Theory , 2001, Studies in logic and the foundations of mathematics.

[7]  Tarmo Uustalu,et al.  Comonadic Notions of Computation , 2008, CMCS.

[8]  Noam Zeilberger,et al.  Functors are Type Refinement Systems , 2015, POPL.

[9]  Andrzej Filinski.  On the relations between monadic semantics , 2007, Theor. Comput. Sci..

[10]  Jean Goubault-Larrecq,et al.  Logical Relations for Monadic Types , 2005 .

[11]  Joël Ouaknine,et al.  Domain theory, testing and simulation for labelled Markov processes , 2005, Theor. Comput. Sci..

[12]  Shin-ya Katsumata,et al.  A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage , 2005, CSL.

[13]  Bart Jacobs,et al.  Simulations in Coalgebra , 2003, CMCS.

[14]  S. Nadler.  Hyperspaces of Sets: A Text with Research Questions , 1978 .

[15]  Jean-Yves Girard,et al.  Geometry of Interaction 1: Interpretation of System F , 1989 .

[16]  David Sprunger,et al.  Fibrational Bisimulations and Quantitative Reasoning , 2018, CMCS.

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

[18]  Gordon D. Plotkin,et al.  Algebraic Operations and Generic Effects , 2003, Appl. Categorical Struct..

[19]  Sam Lindley,et al.  Normalisation by evaluation in the compilation of typed functional programming languages , 2005 .

[20]  Jean Goubault-Larrecq,et al.  Logical Relations for Monadic Types , 2002 .

[21]  Kim G. Larsen,et al.  Bisimulation on Markov Processes over Arbitrary Measurable Spaces , 2014, Horizons of the Mind.

[22]  John C. Reynolds,et al.  Types, Abstractions, and Parametric Polymorphism, Part 2 , 1991, MFPS.

[23]  Andrzej Filinski,et al.  Inductive reasoning about effectful data types , 2007, ICFP '07.

[24]  Tetsuya Sato,et al.  Preorders on Monads and Coalgebraic Simulations , 2013, FoSSaCS.

[25]  Shin-ya Katsumata,et al.  Relating computational effects by ⊤⊤-lifting , 2013, Inf. Comput..

[26]  J. Krivine.  Realizability in classical logic , 2009 .

[27]  Andrzej Filinski,et al.  Representing monads , 1994, POPL '94.

[28]  Dominic R. Verity,et al.  ∞-Categories for the Working Mathematician , 2018 .

[29]  Mitchell Wand,et al.  Relating models of backtracking , 2004, ICFP '04.

[30]  Yde Venema,et al.  Lax extensions of coalgebra functors and their logic , 2015, J. Comput. Syst. Sci..

[31]  Wim H. Hesselink,et al.  Fixpoint semantics and simulation , 2000, Theor. Comput. Sci..

[32]  Ian Stark,et al.  Reducibility and TT-Lifting for Computation Types , 2005, TLCA.

[33]  Roman Fric,et al.  A Categorical Approach to Probability Theory , 2010, Stud Logica.

[34]  Paul Blain Levy,et al.  Similarity Quotients as Final Coalgebras , 2011, FoSSaCS.

[35]  S. Lindley.  Reducibility and > >-lifting for Computation Types , 2004 .

[36]  Andrew M. Pitts,et al.  Parametric polymorphism and operational equivalence , 2000, Mathematical Structures in Computer Science.

[37]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .