Linking theories in probabilistic programming
type: Item
instance of: scholarly article
title: Linking theories in probabilistic programming
zbMATH Open document ID: 0943.68033
DOI: 10.1016/S0020-0255(99)00015-8
author: Jifeng He
author: Tony Hoare
published in: Information Sciences
publication date: 2000-01-30T00:00:00Z
Mathematics Subject Classification ID: 68N30
zbMATH DE Number: 1394727
zbMATH Keywords: probabilistic programming
zbMATH Keywords: relational calculus
MaRDI profile type: Publication
cites work: Axiomatizing probabilistic processes: ACP with generative probabilities
cites work: A calculus of refinements for program derivations
cites work: Q4144755
cites work: A logic for reasoning about probabilities
cites work: Q3946875
cites work: Probabilistic models for the guarded command language
cites work: Laws of programming
cites work: Q3203061
cites work: Bisimulation through probabilistic testing
cites work: Q4301161
cites work: Refinement-oriented probability for CSP
cites work: A theoretical basis for stepwise refinement and the programming calculus
full work available at URL: s0020-0255(99)00015-8
OpenAlex ID: W2117546271
Recommended article: Linking theories of probabilistic programming
Recommended article: Q3347262
Recommended article: Foundations of Probabilistic Programming
Recommended article: Probabilistic Couplings from Program Logics
Recommended article: Probabilistic programming inference via intensional semantics
Recommended article: Semantics of Probabilistic Programming: A Gentle Introduction
Recommended article: Q4370247
description: scientific article; zbMATH DE number 1394727