A higher-order language for Markov kernels and linear operators

DOI10.1007/978-3-031-30829-1_5arXiv2202.00142OpenAlexW4366548744MaRDI QIDQ6091183

Pedro H. Azevedo de Amorim

Publication date: 24 November 2023

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

Full work available at URL: https://arxiv.org/abs/2202.00142

zbMATH Keywords

linear logicprobabilistic programmingcategorical semantics

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Borel structures for function spaces
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
• Tensors, monads and actions
• Pointless Learning
• A Convenient Category for Higher-Order Probability Theory
• Cones as a model of intuitionistic linear logic
• A semantics for nabla
• Probabilistic relational verification for cryptographic implementations
• Applicative programming with effects

This page was built for publication: A higher-order language for Markov kernels and linear operators