Asymptotic speedup via effect handlers

DOI10.1017/S0956796824000030MaRDI QIDQ6561531zbMATH OpenFDO

Authors Daniel Hillerström, Sam Lindley, John Longley

Publication date 25 June 2024

Published in Journal of Functional Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0956796824000030

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites work

• A survey of known results and research areas for \(n\)-queens
• An effect system for algebraic effects and handlers
• An introduction to algebraic effects and handlers (invited tutorial paper)
• Backtracking, interleaving, and terminating monad transformers (functional pearl)
• Bar recursion is not computable via iteration
• Computing with infinite objects
• Continuation passing style for effect handlers
• Do be do be do
• Doo bee doo bee doo
• Effect handlers via generalised continuations
• Effekt: Capability-passing style for type- and effect-safe, extensible effect handlers in Scala
• Exceptional syntax
• Fully abstract models of typed \(\lambda\)-calculi
• Handlers in action
• Handlers of Algebraic Effects
• Handling algebraic effects
• Higher-order computability
• scientific article; zbMATH DE number 1705158 (Why is no real title available?)
• scientific article; zbMATH DE number 4212032 (Why is no real title available?)
• scientific article; zbMATH DE number 3928328 (Why is no real title available?)
• scientific article; zbMATH DE number 1222580 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• Introduction to algorithms.
• LCF considered as a programming language
• Modelling environments in call-by-value programming languages.
• More haste, less speed: lazy versus eager evaluation
• Notions of computation and monads
• On the expressive power of programming languages
• One-shot algebraic effects as coroutines
• Programming with algebraic effects and handlers
• Purely Functional Data Structures
• Revised\(^{6}\) report on the algorithmic language scheme
• The expressive power of higher-order types or, life without CONS
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The recursion hierarchy for PCF is strict
• Typed equivalence of effect handlers and delimited control
• Über eine Schlußweise aus dem Endlichen ins Unendliche.

This page was built for publication: Asymptotic speedup via effect handlers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561531)