Search Results for author:
Found 6 papers, 1 papers with code
On Reinforcement Learning, Effect Handlers, and the State Monad
We study the algebraic effects and handlers as a way to support decision-making abstractions in functional programs, whereas a user can ask a learning algorithm to resolve choices without implementing the underlying selection mechanism, and give a feedback by way of rewards.
Modal Reasoning = Metric Reasoning, via Lawvere
In this work, we show that coinductive equivalences can be extended to a modal setting, and we do so by generalising Abramsky's applicative bisimilarity to coeffectful behaviours.
Logic in Computer Science D.3.1
A Diagrammatic Calculus for Algebraic Effects
We introduce a new diagrammatic notation for representing the result of (algebraic) effectful computations.
Programming Languages Logic in Computer Science
Automated Sized-Type Inference and Complexity Analysis
This paper introduces a new methodology for the complexity analysis of higher-order functional programs, which is based on three components: a powerful type system for size analysis and a sound type inference procedure for it, a ticking monadic transformation and a concrete tool for constraint solving.
Logic in Computer Science Programming Languages I.2.2
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed
Such a theorem cannot be proved by directly relating lambda-calculus with Turing machines or random access machines, because of the size explosion problem: there are terms that in a linear number of steps produce an exponentially long output.
Programming Languages Logic in Computer Science
A Lambda-Calculus Foundation for Universal Probabilistic Programming
Our second contribution is to formalize the implementation technique of trace Markov chain Monte Carlo (MCMC) for our calculus and to show its correctness.
Programming Languages
