A representable approach to finite nondeterminism
type: Item
instance of: scholarly article
title: A representable approach to finite nondeterminism
zbMATH Open document ID: 0901.68105
DOI: 10.1016/S0304-3975(96)00232-0
author: S. O. Anderson
author: John Power
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 1178593
zbMATH Keywords: denotational semantics
MaRDI profile type: Publication
cites work: Q3917476
cites work: Q3682648
cites work: Introduction to extensive and distributive categories
cites work: Q4847018
cites work: Q3491793
cites work: Q3202991
cites work: A Powerdomain Construction
cites work: Q3920613
cites work: Premonoidal categories and notions of computation
cites work: The convex powerdomain in a category of posets realized by cpos
cites work: Power domains
cites work: Yoneda structures on 2-categories
cites work: On powerdomains and modality
full work available at URL: s0304-3975(96)00232-0
OpenAlex ID: W2096619922
Recommended article: Q3794154
Recommended article: Q3787999
Recommended article: Q3738563
Recommended article: Finite non-deterministic semantics for some modal systems
Recommended article: Free semiring-representations and nondeterminism
Recommended article: A Bicategorical Model for Finite Nondeterminism
Recommended article: Classes of bounded nondeterminism
Recommended article: On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
Recommended article: Q3766854
Recommended article: On finite representations of infinite-state behaviours
description: scientific article; zbMATH DE number 1178593