Zobrazeno 1 - 10
of 22
pro vyhledávání: '"PIRÓG, MACIEJ"'
Autor:
Pirog, Maciej Adam
Some programs are not merely sets of batch instructions performed in isolation. They interact, either directly with the user, or with other threads and resources. This dissertation tackles the problem of mathematical description (denotational semanti
Externí odkaz:
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.677985
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 3 (July 4, 2019) lmcs:4170
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding op
Externí odkaz:
http://arxiv.org/abs/1712.09574
Tabling is a powerful resolution mechanism for logic programs that captures their least fixed point semantics more faithfully than plain Prolog. In many tabling applications, we are not interested in the set of all answers to a goal, but only require
Externí odkaz:
http://arxiv.org/abs/1608.00787
Autor:
Piróg, Maciej, Gibbons, Jeremy
Publikováno v:
EPTCS 212, 2016, pp. 53-62
Push/enter and eval/apply are two calling conventions used in implementations of functional languages. In this paper, we explore the following observation: when considering functions with multiple arguments, the stack under the push/enter and eval/ap
Externí odkaz:
http://arxiv.org/abs/1606.06380
Autor:
Piróg, Maciej
Publikováno v:
EPTCS 207, 2016, pp. 23-56
We develop an algebraic underpinning of backtracking monad transformers in the general setting of monoidal categories. As our main technical device, we introduce Eilenberg--Moore monoids, which combine monoids with algebras for strong monads. We show
Externí odkaz:
http://arxiv.org/abs/1604.01184
Autor:
Piróg, Maciej, Gibbons, Jeremy
Publikováno v:
EPTCS 76, 2012, pp. 90-111
In functional programming, monads are supposed to encapsulate computations, effectfully producing the final result, but keeping to themselves the means of acquiring it. For various reasons, we sometimes want to reveal the internals of a computation.
Externí odkaz:
http://arxiv.org/abs/1202.2922
Autor:
Piróg, Maciej, Gibbons, Jeremy
Publikováno v:
In Electronic Notes in Theoretical Computer Science 29 October 2014 308:273-288
Publikováno v:
Zdrowie Publiczne i Zarządzanie / Public Health Management. 13(2):223-229
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=515604
Autor:
Piróg, Maciej, Gibbons, Jeremy
Publikováno v:
In Electronic Notes in Theoretical Computer Science 4 November 2013 298:309-324
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding op
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57ce0951afb76bd3d18349e95fdb0a76