Zobrazeno 1 - 5
of 5
pro vyhledávání: '"commutative monads"'
Autor:
Goubault-Larrecq, Jean, Jia, Xiaodong
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science
Electronic Notes in Theoretical Informatics and Computer Science, In press, 2, ⟨10.46298/entics.proceedings.isdt9⟩
9th International Symposium on Domain Theory
9th International Symposium on Domain Theory, Jul 2022, Singapore, Singapore. ⟨10.48550/arXiv.2211.12392⟩
Electronic Notes in Theoretical Informatics and Computer Science, In press, 2, ⟨10.46298/entics.proceedings.isdt9⟩
9th International Symposium on Domain Theory
9th International Symposium on Domain Theory, Jul 2022, Singapore, Singapore. ⟨10.48550/arXiv.2211.12392⟩
International audience; We introduce continuous $R$-valuations on directed-complete posets (dcpos, for short), as a generalization of continuous valuations in domain theory, by extending values of continuous valuations from reals to so-called Abelian
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08b1b5541f9a38032c6be0c8ea61d819
https://inria.hal.science/hal-04029481/document
https://inria.hal.science/hal-04029481/document
The notion of "centre" has been introduced for many algebraic structures in mathematics. A notable example is the centre of a monoid which always determines a commutative submonoid. Monads (in category theory) can be seen as generalisations of monoid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::87e4171c80c23aa46bef3671a9deb03d
https://hal.science/hal-03662565
https://hal.science/hal-03662565
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Matthijs Vákár, Hongseok Yang, Sean K. Moss, Adam Ścibior, Chris Heunen, Yufei Cai, Sam Staton, Ohad Kammar, Klaus Ostermann, Zoubin Ghahramani
Publikováno v:
Scibior, A, Kammar, O, Vákár, M, Staton, S, Yang, H, Cai, Y, Ostermann, K, Moss, S K, Heunen, C & Ghahramani, Z 2018, ' Denotational validation of higher-order Bayesian inference ', Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 60 . https://doi.org/10.1145/3158148
We present a modular semantic account of Bayesian inference algorithms for probabilistic programming languages, as used in data science and machine learning. Sophisticated inference algorithms are often explained in terms of composition of smaller pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c204d70414bc624f2f7ac5a6920a2e93
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.