The expressive power of indeterminate primitives in asynchronous computation

DOI10.1007/3-540-60692-0_45MaRDI QIDQ2956679zbMATH OpenOpenAlexFDO

Authors Prakash Panangaden

Publication date 19 January 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60692-0_45

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• The expressive power of indeterminate dataflow primitives
• scientific article; zbMATH DE number 4060692
• Nonexpressibility of fairness and signaling
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 4092750

Cited in

(6)

• The expressive power of indeterminate dataflow primitives
• Nonexpressibility of fairness and signaling
• Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay
• Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
• On the Expressive Power of Primitives for Compensation Handling
• Foundations of Software Science and Computation Structures

This page was built for publication: The expressive power of indeterminate primitives in asynchronous computation

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