Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Exequiel Rivas"'
Autor:
Exequiel Rivas
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 275, Iss Proc. MSFP 2018, Pp 18-33 (2018)
We revisit once again the connection between three notions of computation: monads, arrows and idioms (also called applicative functors). We employ monoidal categories of finitary functors and profunctors on finite sets as models of these notions of c
Externí odkaz:
https://doaj.org/article/3d99fc776f48414ca0d97281898c4353
Autor:
Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, Théo Winterhalter, Carmine Abate, Nikolaj Sidorenco, Cătălin Hrițcu, Kenji Maillard, Bas Spitters
Publikováno v:
ACM Transactions on Programming Languages and Systems.
State-separating proofs (SSP) is a recent methodology for structuring game-based cryptographic proofs in a modular way, by using algebraic laws to exploit the modular structure of composed protocols. While promising, this methodology was previously n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::527ef3480187e0fa65e80de3b22ec333
https://doi.org/10.1145/3594735
https://doi.org/10.1145/3594735
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030992521
Monad-comonad interaction laws are a mathematical concept for describing communication protocols between effectful computations and coeffectful environments in the paradigm where notions of effectful computation are modelled by monads and notions of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86f8f26c04e333a9276d58c4e72875c8
https://doi.org/10.1007/978-3-030-99253-8_22
https://doi.org/10.1007/978-3-030-99253-8_22
Publikováno v:
Journal of Functional Programming
Journal of Functional Programming, 2020, 30, ⟨10.1017/S0956796820000106⟩
Journal of Functional Programming, Cambridge University Press (CUP), 2020, 30, ⟨10.1017/S0956796820000106⟩
Journal of Functional Programming, 2020, 30, ⟨10.1017/S0956796820000106⟩
Journal of Functional Programming, Cambridge University Press (CUP), 2020, 30, ⟨10.1017/S0956796820000106⟩
Algebraic effects and handlers are a convenient method for structuring monadic effects with primitive effectful operations and separating the syntax from the interpretation of these operations. However, the scope of conventional handlers is limited a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d66523a075a588df0092d52b1c0f0969
https://doi.org/10.1017/s0956796820000106
https://doi.org/10.1017/s0956796820000106
Publikováno v:
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken / Virtual, Germany. pp.604-618, ⟨10.1145/3373718.3394808⟩
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken / Virtual, Germany. pp.604-618, ⟨10.1145/3373718.3394808⟩
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS
International audience; We introduce and study functor-functor and monad-comonad interaction laws as math-ematical objects to describe interaction of effectful computations with behaviors of effect-performingmachines. Monad-comonad interaction laws a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e4e40132e7af72a9838e4870f5b2ffd
http://arxiv.org/abs/1912.13477
http://arxiv.org/abs/1912.13477
Publikováno v:
CLEI Selected Papers
There are different algebraic structures that one can use to model notions of computation. The most well- known are monads, but lately, applicative functors have been gaining popularity. These two structures can be understood as instances of the unif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::786c2d905fbdb1eb0914bc54bee32314
https://doi.org/10.1016/j.entcs.2018.06.008
https://doi.org/10.1016/j.entcs.2018.06.008
Publikováno v:
IFL
Algebraic effects and handlers are a convenient method for structuring monadic effects with primitive effectful operations and separating the syntax from the interpretation of these operations. However, the scope of conventional handlers are somewhat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b98120e1bb584cef01176e165e9dd78d
https://doi.org/10.1145/3205368.3205372
https://doi.org/10.1145/3205368.3205372
Autor:
Mauro Jaskelioff, Exequiel Rivas
Publikováno v:
ICFP
Left-nested list concatenations, left-nested binds on the free monad, and left-nested choices in many non-determinism monads have an algorithmically bad performance. Can we solve this problem without losing the ability to pattern-match on the computa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::885bb64e2828fe23697bbe288ca1eeba
https://doi.org/10.1145/2784731.2784743
https://doi.org/10.1145/2784731.2784743
Publikováno v:
PPDP
It is well-known that monads are monoids in the category of endo-functors, and in fact so are applicative functors. Unfortunately, the benefits of this unified view are lost when the additional non-determinism structure of |MonadPlus| or |Alternative
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6de3d840446dd4d0600447c60402dfa
https://lirias.kuleuven.be/handle/123456789/499951
https://lirias.kuleuven.be/handle/123456789/499951
Autor:
Exequiel Rivas, Mauro Jaskelioff
There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article, we show that these three notions can be seen as instances of a unifying abstract concept: monoids in monoidal categories. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4aba8a602349d746dad3038769356532
http://arxiv.org/abs/1406.4823
http://arxiv.org/abs/1406.4823