Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Mauro Jaskelioff"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 81, Iss Proc. LSFA 2011, Pp 16-29 (2012)
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter
Externí odkaz:
https://doaj.org/article/697badaa545a4c0cbbc44d7a0dec65b8
Autor:
Mauro Jaskelioff, Ondrej Rypacek
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 76, Iss Proc. MSFP 2012, Pp 40-49 (2012)
Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been characterised by McB
Externí odkaz:
https://doaj.org/article/dbc15c4a28754c7f8ea2ca2f24581339
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:
Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell -Haskell 2019
Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell-Haskell 2019
Haskell@ICFP
Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell-Haskell 2019
Haskell@ICFP
For over two decades, monad transformers have been the main modular approach for expressing purely functional side-effects in Haskell. Yet, in recent years algebraic effects have emerged as an alternative whose popularity is growing. While the two ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9aa485cdf9b49878a0898687b4bffa2b
Publikováno v:
LICS
Piróg, M, Schrijvers, T, Wu, N & Jaskelioff, M 2018, Syntax and Semantics for Operations with Scopes . in Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018 . Association for Computing Machinery (ACM), pp. 809-818, 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, United Kingdom, 9/07/18 . https://doi.org/10.1145/3209108.3209166
Piróg, M, Schrijvers, T, Wu, N & Jaskelioff, M 2018, Syntax and Semantics for Operations with Scopes . in Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018 . Association for Computing Machinery (ACM), pp. 809-818, 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, United Kingdom, 9/07/18 . https://doi.org/10.1145/3209108.3209166
© 2018 ACM. Motivated by the problem of separating syntax from semantics in programming with algebraic effects and handlers, we propose a categorical model of abstract syntax with so-called scoped operations. As a building block of a term, a scoped
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2388cad8a876cec4fcef2c9fd7f2a7d1
https://doi.org/10.1145/3209108.3209166
https://doi.org/10.1145/3209108.3209166
Publikováno v:
IFL
Coinductive data structures, such as streams or infinite trees, have many applications in functional programming and type theory, and are naturally defined using recursive equations. But how do we ensure that such equations make sense, i.e. that they
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a359404b80157be8981a46f31167b3ba
https://doi.org/10.1145/3064899.3064900
https://doi.org/10.1145/3064899.3064900
Publikováno v:
Journal of Functional Programming. 20:353-373
The worker/wrapper transformation is a general technique for improving the performance of recursive programs by changing their types. The previous formalisation (A. Gill & G. Hutton, J. Funct. Program., vol. 19, 2009, pp. 227–251) was based upon a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::110233af825836dab60bfda079e75d08
https://doi.org/10.1017/s0956796810000122
https://doi.org/10.1017/s0956796810000122
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:
Dante Zanarini, Mauro Jaskelioff
Publikováno v:
PLAS@ECOOP
Given the increasingly sensitive data that web applications deal with, a lot of attention has been put into their security. Dynamic methods for ensuring confidentiality of secret data, such as monitors, are usually preferred due to their permissivene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3617a9925c3d17a0d0bf0e3a3249d956
https://doi.org/10.1145/2637113.2637120
https://doi.org/10.1145/2637113.2637120