Algebraic foundations for effect-dependent optimisations
DOI10.1145/2103656.2103698zbMATH Open1321.68200OpenAlexW3160062581MaRDI QIDQ2942885FDOQ2942885
Authors: Ohad Kammar, Gordon D. Plotkin 
Publication date: 11 September 2015
Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2103656.2103698
Recommendations
computational effectsdenotational semanticsdomain theoryuniversal algebratype and effect systemsinequational logiccall-by-push-valuealgebraic theory of effectscode transformationscompiler optimisationsrelevant and affine monadssum and tensor
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cited In (13)
- Sound and complete type inference for closed effect rows
- Normalization by evaluation and algebraic effects
- Structured handling of scoped effects
- Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics
- Title not available (Why is that?)
- Higher-order asynchronous effects
- Probability monads with submonads of deterministic states
- An introduction to algebraic effects and handlers (invited tutorial paper)
- An algebraic theory for shared-state concurrency
- The beta-Bernoulli process and algebraic effects
- Local algebraic effect theories
- No value restriction is needed for algebraic effects and handlers
- Counting successes: effects and transformations for non-deterministic programs
This page was built for publication: Algebraic foundations for effect-dependent optimisations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942885)
