Adjunction Models For Call-By-Push-Value With Stacks

DOI10.1016/S1571-0661(04)80568-1zbMath1270.68155OpenAlexW2097704879MaRDI QIDQ2842825

Paul Blain Levy

Publication date: 16 August 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80568-1

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

Stream processors and comodels ⋮ Call-by-push-value: Decomposing call-by-value and call-by-name ⋮ LNL polycategories and doctrines of linear logic ⋮ Galois connecting call-by-value and call-by-name ⋮ Structured handling of scoped effects ⋮ Call-By-Push-Value from a Linear Logic Point of View ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Notions of computation and monads
• Introduction to extensive and distributive categories
• Modelling environments in call-by-value programming languages.
• A fully abstract semantics for a higher-order functional language with nondeterministic computation
• On full abstraction for PCF: I, II and III
• Control categories and duality: on the categorical semantics of the lambda-mu calculus
• The duality of computation
• Classical logic, continuation semantics and abstract machines
• Introduction to distributive categories
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES

This page was built for publication: Adjunction Models For Call-By-Push-Value With Stacks