Modelling environments in call-by-value programming languages.

DOI10.1016/S0890-5401(03)00088-9zbMath1069.68073MaRDI QIDQ1427853

Paul Blain Levy, Hayo Thielecke, A. John Power

Publication date: 14 March 2004

Published in: Information and Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Combinatory logic and lambda calculus (03B40)

Related Items (35)

Normalization by evaluation and algebraic effects ⋮ Algebras for Parameterised Monads ⋮ Coalgebraic Components in a Many-Sorted Microcosm ⋮ Freyd categories are enriched Lawvere theories ⋮ On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ A Nominal Relational Model for Local Store ⋮ Categorifying Computations into Components via Arrows as Profunctors ⋮ Generic models for computational effects ⋮ Combining algebraic effects with continuations ⋮ Representable Markov categories and comparison of statistical experiments in categorical probability ⋮ A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics ⋮ When programs have to watch paint dry ⋮ Streams of approximations, equivalence of recursive effectful programs ⋮ Understanding algebraic effect handlers via delimited control operators ⋮ Smart Choices and the Selection Monad ⋮ Separating Sessions Smoothly ⋮ Commutativity ⋮ Effect handlers via generalised continuations ⋮ Region-based resource management and lexical exception handlers in continuation-passing style ⋮ Duoidally enriched Freyd categories ⋮ Local local reasoning: a BI-hyperdoctrine for full ground store ⋮ Local algebraic effect theories ⋮ No value restriction is needed for algebraic effects and handlers ⋮ Unnamed Item ⋮ An introduction to algebraic effects and handlers (invited tutorial paper) ⋮ Commutative Semantics for Probabilistic Programming ⋮ Programming with algebraic effects and handlers ⋮ What is a Categorical Model of Arrows? ⋮ Models for the computational λ-calculus ⋮ A metalanguage for guarded iteration ⋮ Parameterised notions of computation ⋮ Categorical semantics for arrows ⋮ Adjunction Models For Call-By-Push-Value With Stacks ⋮ Continuation passing style for effect handlers ⋮ On reduction and normalization in the computational core

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Categories for computation in context and unified logic
• Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
• Variations on algebra: Monadicity and generalisations of equational theories
• Notions of computation and monads
• Categories of partial maps
• Two-dimensional monad theory
• Premonoidal categories as categories with algebraic structure
• Premonoidal categories and notions of computation
• Decomposing typed lambda calculus into a couple of categorical programming languages

This page was built for publication: Modelling environments in call-by-value programming languages.