6 citations · 14 across the 6 of their papers we have counts for
6 papers
Strong Dinatural Transformations and Generalised Codensity Monads
Maciej Piróg, Filip Sieczkowski
We introduce dicodensity monads: a generalisation of pointwise codensity monads generated by functors to monads generated by mixed-variant bifunctors. Our construction is based on…
Guarded and Unguarded Iteration for Generalized Processes
Sergey Goncharov, Lutz Schröder, Christoph Rauch +1
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requi…
Tabling with Sound Answer Subsumption
Alexander Vandenbroucke, Maciej Piróg, Benoit Desouter +1
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 ar…
From Push/Enter to Eval/Apply by Program Transformation
Maciej Piróg, Jeremy Gibbons
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 functio…
Eilenberg--Moore Monoids and Backtracking Monad Transformers
Maciej Piróg
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 m…
Tracing monadic computations and representing effects
Maciej Piróg, Jeremy Gibbons
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…