( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Sweedler Theory of Monads.

, , и . FoSSaCS, том 13242 из Lecture Notes in Computer Science, стр. 428-448. Springer, (2022)

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.

Tarmo Ploom

Osama Tarmoom

Tarmo Kulmar

Tarmo Sakari Luoma

Tarmo Sakari Luoma

 

Другие публикации лиц с тем же именем

Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11)., , и . NII Shonan Meet. Rep., (2013)Container Combinatorics: Monads and Lax Monoidal Functors.. TTCS, том 10608 из Lecture Notes in Computer Science, стр. 91-105. Springer, (2017)The Sequent Calculus of Skew Monoidal Categories., , и . MFPS, том 341 из Electronic Notes in Theoretical Computer Science, стр. 345-370. Elsevier, (2018)Generalizing substitution.. FICS, том NS-02-2 из BRICS Notes Series, стр. 9-11. University of Aarhus, (2002)Monads Need Not Be Endofunctors., , и . FoSSaCS, том 6014 из Lecture Notes in Computer Science, стр. 297-311. Springer, (2010)Flexibly Graded Monads and Graded Algebras., и . MPC, том 13544 из Lecture Notes in Computer Science, стр. 102-128. Springer, (2022)Dependently typed programming with finite sets., и . WGP@ICFP, стр. 33-44. ACM, (2015)Monad Translating Inductive and Coinductive Types.. TYPES, том 2646 из Lecture Notes in Computer Science, стр. 299-315. Springer, (2002)Decomposing Comonad Morphisms., и . CALCO, том 139 из LIPIcs, стр. 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Constraint Satisfaction and Constraint Programming: A Brief Lead-In., , и . NATO ASI CP, том 131 из NATO ASI Series, стр. 1-16. Springer, (1993)