Adjunction models for call-by-push-value with stacks
From MaRDI portal
Recommendations
Cites work
- A fully abstract semantics for a higher-order functional language with nondeterministic computation
- Classical logic, continuation semantics and abstract machines
- Control categories and duality: On the categorical semantics of the lambda-mu calculus
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- Introduction to distributive categories
- Introduction to extensive and distributive categories
- Modelling environments in call-by-value programming languages.
- Notions of computation and monads
- On full abstraction for PCF: I, II and III
- The duality of computation
Cited in
(13)- Call-By-Push-Value from a Linear Logic Point of View
- A theory of effects and resources: adjunction models and polarised calculi
- Monads and adjunctions for global exceptions
- Probabilistic call by push value
- scientific article; zbMATH DE number 2172969 (Why is no real title available?)
- scientific article; zbMATH DE number 2120508 (Why is no real title available?)
- Stream processors and comodels
- LNL polycategories and doctrines of linear logic
- Galois connecting call-by-value and call-by-name
- Structured handling of scoped effects
- Towards univalent reference types: the impact of univalence on denotational semantics
- A verified cost model for call-by-push-value
- Call-by-push-value: Decomposing call-by-value and call-by-name
This page was built for publication: Adjunction models for call-by-push-value with stacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842825)