Runners in Action

Ahman, Danel; Bauer, Andrej

doi:10.1007/978-3-030-44914-8_2

Cited by 11 publications

(16 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…takes as its input, and its output gets bound to . For instance, this could take the form of defining a suitable effect handler [Plotkin and Pretnar 2013], but could also be given by calls to runners of algebraic effects [Ahman and Bauer 2020], or simply by invoking some (default) top-level (native) implementation. What is important is that some pre-defined piece of code op [ / ] gets executed in place of every operation call op ( , .…”

Section: Conventional Algebraic Effects Are Synchronous By Naturementioning

confidence: 99%

“…Next, we use ñ to implement a parallel variant of runners of algebraic effects [Ahman and Bauer 2020]. These are a natural mathematical model and programming abstraction for resource management based on algebraic effects, and correspond to effect handlers that apply continuations (at most) once in a tail call position.…”

Section: Runners Of Algebraic Effectsmentioning

confidence: 99%

“…In a nutshell, for a signature of operation symbols op : op → op , a runner R comprises a family of stateful functions op R : op → ⇒ op × , called co-operations, where is the type of resources that the runner manipulates. In the more general setting of Ahman and Bauer [2020], the co-operations also model other, external effects, such as native calls to the operating system, and can furthermore raise exceptionsÐall of which we shall gloss over here.…”

Section: Runners Of Algebraic Effectsmentioning

confidence: 99%

“…Given a runner R, Ahman and Bauer [2020] provide the programmer with a construct using R @ init run finally {return @ fin ↦ → } which runs using R, with resources initially set to init ; and finalises the return value and final resources using , e.g., ensuring that all file handles get closed. This is a form of effect handling: it executes by invoking co-operations in place of operation calls, while doing resource-passing under the hood.…”

Section: Runners Of Algebraic Effectsmentioning

confidence: 99%

See 3 more Smart Citations

Asynchronous effects

Ahman

Pretnar

2021

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

We explore asynchronous programming with algebraic effects. We complement their conventional synchronous treatment by showing how to naturally also accommodate asynchrony within them, namely, by decoupling the execution of operation calls into signalling that an operation’s implementation needs to be executed, and interrupting a running computation with the operation’s result, to which the computation can react by installing interrupt handlers. We formalise these ideas in a small core calculus, called λ æ . We demonstrate the flexibility of λ æ using examples ranging from a multi-party web application, to preemptive multi-threading, to remote function calls, to a parallel variant of runners of algebraic effects. In addition, the paper is accompanied by a formalisation of λ æ ’s type safety proofs in Agda, and a prototype implementation of λ æ in OCaml.

show abstract

Section: Conventional Algebraic Effects Are Synchronous By Naturementioning

confidence: 99%

Section: Runners Of Algebraic Effectsmentioning

confidence: 99%

Section: Runners Of Algebraic Effectsmentioning

confidence: 99%

Section: Runners Of Algebraic Effectsmentioning

confidence: 99%

See 2 more Smart Citations

Asynchronous effects

Ahman

Pretnar

2021

Proc. ACM Program. Lang.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Denotational methods have the benefit of often being more modular than the operational methods, and often reveal the foundational mathematical building blocks of programming languages. Denotational semantics often inspire new programming constructions or languages, as exemplified in monads [30], runners for computational effects [37,3], homotopy type theory [36], or even guarded recursion itself [10].…”

Section: Synthetic Guarded Domain Theorymentioning

confidence: 99%

Two Guarded Recursive Powerdomains for Applicative Simulation

Møgelberg¹,

Vezzosi²

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Clocked Cubical Type Theory is a new type theory combining the power of guarded recursion with univalence and higher inductive types (HITs). This type theory can be used as a metalanguage for synthetic guarded domain theory in which one can solve guarded recursive type equations, also with negative variable occurrences, and use these to construct models for reasoning about programming languages. Combining this with HITs allows for the use of type constructors familiar from set-theory based approaches to semantics, such as quotients and finite powersets in these models.In this paper we show how to reason about the combination of finite non-determinism and recursion in this type theory. Unlike traditional domain theory which takes an ordering of programs as primitive, synthetic guarded domain theory takes the notion of computation step as primitive in the form of a modal operator. We use this extra intensional information to define two guarded recursive (finite) powerdomain constructions differing in the way non-determinism interacts with the computation steps. As an example application of these we show how to prove applicative similarity a congruence in the cases of may-and must-convergence for the untyped lambda calculus with finite non-determinism. Such results are usually proved using operational reasoning and Howe's method. Here we use an adaptation of a denotational method developed by Pitts in the context of domain theory.

show abstract

Algebraic and Coalgebraic Perspectives on Interaction Laws

Uustalu

Voorneveld

2020

Programming Languages and Systems

View full text Add to dashboard Cite

Monad algebras, turning computations over return values into values, are used to handle algebraic effects invoked by programs, whereas comonad coalgebras, turning initial states into environments ("cocomputations") over states, describe production of coalgebraic coeffects that can respond to effects. (Monad-comonad) interaction laws by Katsumata et al. describe interaction protocols between a computation and an environment. We show that any triple of those devices can be combined into a single algebra handling computations over state predicates. This method yields an isomorphism between the category of interaction laws, and the category of so-called merge functors which merge algebras and coalgebras to form combined algebras. In a similar vein, we can combine interaction laws with coalgebras only, retrieving Uustalu's stateful runners. If instead we combine interaction laws with algebras only, we get a novel concept of continuation-based runners that lift an environment of value predicates to a single predicate on computations of values. We use these notions to study different running examples of interactions of computations and environments.

show abstract

Runners in Action

Cited by 11 publications

References 29 publications

Asynchronous effects

Asynchronous effects

Two Guarded Recursive Powerdomains for Applicative Simulation

Algebraic and Coalgebraic Perspectives on Interaction Laws

Contact Info

Product

Resources

About