Defunctionalization at work

O Danvy, LR Nielsen - Proceedings of the 3rd ACM SIGPLAN …, 2001 - dl.acm.org
Reynolds's defunctionalization technique is a whole-program transformation from higher-
order to first-order functional programs. We study practical applications of this transformation …

Demystifying differentiable programming: Shift/reset the penultimate backpropagator

F Wang, D Zheng, J Decker, X Wu… - Proceedings of the …, 2019 - dl.acm.org
Deep learning has seen tremendous success over the past decade in computer vision,
machine translation, and gameplay. This success rests crucially on gradient-descent …

Abstracting algebraic effects

D Biernacki, M Piróg, P Polesiuk… - Proceedings of the ACM …, 2019 - dl.acm.org
Proposed originally by Plotkin and Pretnar, algebraic effects and their handlers are a
leading-edge approach to computational effects: exceptions, mutable state, nondeterminism …

Handle with care: relational interpretation of algebraic effects and handlers

D Biernacki, M Piróg, P Polesiuk… - Proceedings of the ACM …, 2017 - dl.acm.org
Algebraic effects and handlers have received a lot of attention recently, both from the
theoretical point of view and in practical language design. This stems from the fact that …

A general fine-grained reduction theory for effect handlers

F Sieczkowski, M Pyzik, D Biernacki - Proceedings of the ACM on …, 2023 - dl.acm.org
Effect handlers are a modern and increasingly popular approach to structuring
computational effects in functional programming languages. However, while their traditional …

Delimited dynamic binding

O Kiselyov, C Shan, A Sabry - ACM SIGPLAN Notices, 2006 - dl.acm.org
Dynamic binding and delimited control are useful together in many settings, including Web
applications, database cursors, and mobile code. We examine this pair of language features …

Defunctionalized interpreters for programming languages

O Danvy - ACM Sigplan Notices, 2008 - dl.acm.org
This document illustrates how functional implementations of formal semantics (structural
operational semantics, reduction semantics, small-step and big-step abstract machines …

A concrete framework for environment machines

M Biernacka, O Danvy - ACM Transactions on Computational Logic …, 2007 - dl.acm.org
We materialize the common understanding that calculi with explicit substitutions provide an
intermediate step between an abstract specification of substitution in the lambda-calculus …

Foundations for programming and implementing effect handlers

D Hillerström - 2022 - era.ed.ac.uk
First-class control operators provide programmers with an expressive and efficient means for
manipulating control through reification of the current control state as a first-class object …

Subtyping delimited continuations

M Materzok, D Biernacki - ACM SIGPLAN Notices, 2011 - dl.acm.org
We present a type system with subtyping for first-class delimited continuations that
generalizes Danvy and Filinski's type system for shift and reset by maintaining explicit …