A representable approach to finite nondeterminism

DOI10.1016/S0304-3975(96)00232-0zbMath0901.68105OpenAlexW2096619922MaRDI QIDQ1391859

S. O. Anderson, A. John Power

Publication date: 23 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00232-0

zbMATH Keywords

denotational semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (5)

Bisimulation as a logical relation ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ Semantics for Algebraic Operations ⋮ Axiomatics for Data Refinement in Call by Value Programming Languages ⋮ Premonoidal categories as categories with algebraic structure

Cites Work

• On powerdomains and modality
• Introduction to extensive and distributive categories
• Power domains
• Yoneda structures on 2-categories
• A Powerdomain Construction
• Premonoidal categories and notions of computation
• The convex powerdomain in a category of posets realized by cpos
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A representable approach to finite nondeterminism