A quantitative approach to global state composition

DOI10.1017/S0960129525100285MaRDI QIDQ6894544zbMATH OpenFDO

Authors Sandra Alves, Delia Kesner, Miguel Ramos

Publication date 25 November 2025

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

compositioneffectsglobal statequantitative types

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Cites work

• A linearization of the Lambda-calculus and consequences
• A new type assignment for λ-terms
• A Semantical and Operational Account of Call-by-Value Solvability
• Boomerang, resourceful lenses for string data
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Call-By-Value, Again!
• Coalgebraic update lenses
• Collapsing non-idempotent intersection types
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Encoding tight typing in a unified framework
• Execution time of λ-terms via denotational semantics and intersection types
• scientific article; zbMATH DE number 1705158 (Why is no real title available?)
• scientific article; zbMATH DE number 4179333 (Why is no real title available?)
• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 1479634 (Why is no real title available?)
• scientific article; zbMATH DE number 7756108 (Why is no real title available?)
• Intersection types and computational effects
• Intersection, Universally Quantified, and Reference Types
• Lambda calculus and probabilistic computation
• Linear logic
• Linear type theory for asynchronous session types
• New semantical insights into call-by-value \(\lambda\)-calculus
• Non-idempotent types for classical calculi in natural deduction style
• Notions of computation and monads
• Open call-by-value
• Quantitative global memory
• Solvability for generalized applications
• Strong call-by-value and multi types
• Syntax and semantics of quantitative type theory
• Tensors of comodels and models for operational semantics
• The bang calculus revisited
• The bang calculus revisited
• The call-by-need lambda calculus
• Tight typings and split bounds, fully developed
• Towards a semantic measure of the execution time in call-by-value lambda-calculus
• Types of fireballs
• Update monads: cointerpreting directed containers

This page was built for publication: A quantitative approach to global state composition

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