A higher-order language for Markov kernels and linear operators

DOI10.1007/978-3-031-30829-1_5MaRDI QIDQ6091183zbMATH OpenOpenAlexFDO

Authors Pedro H. Azevedo de Amorim

Publication date 24 November 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

categorical semanticslinear logicprobabilistic programming

Mathematics Subject Classification ID

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

Abstract: Much work has been done to give semantics to probabilistic programming languages. In recent years, most of the semantics used to reason about probabilistic programs fall in two categories: semantics based on Markov kernels and semantics based on linear operators. Both styles of semantics have found numerous applications in reasoning about probabilistic programs, but they each have their strengths and weaknesses. Though it is believed that there is a connection between them there are no languages that can handle both styles of programming. In this work we address these questions by defining a two-level calculus and its categorical semantics which makes it possible to program with both kinds of semantics. From the logical side of things we see this language as an alternative resource interpretation of linear logic, where the resource being kept track of is sampling instead of variable use.

Cites work

• A Convenient Category for Higher-Order Probability Theory
• A semantics for nabla
• A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
• Applicative programming with effects
• Borel structures for function spaces
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Cones as a model of intuitionistic linear logic
• scientific article; zbMATH DE number 822489 (Why is no real title available?)
• Pointless learning
• Probabilistic call by push value
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Probabilistic relational verification for cryptographic implementations
• Tensors, monads and actions

Cited in

(1)

• Classical linear logic in perfect Banach lattices

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

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