Convexity and order in probabilistic call-by-name FPC
From MaRDI portal
(Redirected from Publication:5140265)
Recommendations
Cites work
- Algebraically compact functors
- Axiomatic Domain Theory in Categories of Partial Maps
- Classical control, quantum circuits and linear logic in enriched category theory
- Complete positivity and natural representation of quantum computations
- From Kleisli categories to commutative \(C ^{*}\)-algebras: probabilistic gelfand duality
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
- Full abstraction for probabilistic PCF
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Generic Trace Semantics via Coinduction
- scientific article; zbMATH DE number 6712178 (Why is no real title available?)
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 19484 (Why is no real title available?)
- scientific article; zbMATH DE number 48416 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1259144 (Why is no real title available?)
- Introduction to coalgebra. Towards mathematics of states and observation
- Lawvere categories as composed PROPs
- LCF considered as a programming language
- Probabilistic call by push value
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Probabilities, distribution monads, and convex categories
- Recursive data types in algebraically -complete categories
- States of convex sets
This page was built for publication: Convexity and order in probabilistic call-by-name FPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140265)
