( en | de | ru )

 

Disambiguation of "Uustalu, Tarmo"

Author of the publication

copydeleteadd this publication to your clipboard
Codensity Lifting of Monads and its Dual.

, , and . Log. Methods Comput. Sci., (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tarmo Ploom

Osama Tarmoom

Tarmo Kulmar

Tarmo Sakari Luoma

Tarmo Sakari Luoma

 

Other publications of authors with the same name

Generalizing substitution.. FICS, volume NS-02-2 of BRICS Notes Series, page 9-11. University of Aarhus, (2002)Flexibly Graded Monads and Graded Algebras., and . MPC, volume 13544 of Lecture Notes in Computer Science, page 102-128. Springer, (2022)Monads Need Not Be Endofunctors., , and . FoSSaCS, volume 6014 of Lecture Notes in Computer Science, page 297-311. Springer, (2010)Dependently typed programming with finite sets., and . WGP@ICFP, page 33-44. ACM, (2015)Decomposing Comonad Morphisms., and . CALCO, volume 139 of LIPIcs, page 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Container Combinatorics: Monads and Lax Monoidal Functors.. TTCS, volume 10608 of Lecture Notes in Computer Science, page 91-105. Springer, (2017)Monad Translating Inductive and Coinductive Types.. TYPES, volume 2646 of Lecture Notes in Computer Science, page 299-315. Springer, (2002)Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11)., , and . NII Shonan Meet. Rep., (2013)The Sequent Calculus of Skew Monoidal Categories., , and . MFPS, volume 341 of Electronic Notes in Theoretical Computer Science, page 345-370. Elsevier, (2018)Explicit Binds: Effortless Efficiency with and without Trees.. FLOPS, volume 7294 of Lecture Notes in Computer Science, page 317-331. Springer, (2012)