Grading call-by-push-value, explicitly and implicitly
From MaRDI portal
Cites work
- A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
- Adjunction models for call-by-push-value with stacks
- Algebraic foundations for effect-dependent optimisations
- An effect system for algebraic effects and handlers
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Coeffects: a calculus of context-dependent computation
- Combining effects and coeffects via grading
- Compiling standard ML to Java bytecodes
- Effect systems revisited -- control-flow algebra and semantics
- Graded algebraic theories
- Graded monads and rings of polynomials
- Handlers in action
- Handlers of Algebraic Effects
- scientific article; zbMATH DE number 5119885 (Why is no real title available?)
- scientific article; zbMATH DE number 512784 (Why is no real title available?)
- scientific article; zbMATH DE number 7779295 (Why is no real title available?)
- Inheritance as implicit coercion
- List Objects with Algebraic Structure
- Logical relations for coherence of effect subtyping
- Modelling environments in call-by-value programming languages.
- Notions of computation and monads
- Parametric effect monads and semantics of effect systems
- Towards a formal theory of graded monads
- Typed Lambda Calculi and Applications
- When programs have to watch paint dry
This page was built for publication: Grading call-by-push-value, explicitly and implicitly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296823)
