Full Abstraction for Probabilistic PCF

DOI10.1145/3164540zbMath1426.68035arXiv1511.01272OpenAlexW2963573740WikidataQ129915934 ScholiaQ129915934MaRDI QIDQ4561511

Christine Tasson, Thomas Ehrhard, Michele Pagani

Publication date: 6 December 2018

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

full abstractionfunctional programming languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (14)

Taylor expansion, finiteness and strategies ⋮ Linear logic in normed cones: probabilistic coherence spaces and beyond ⋮ The geometry of Bayesian programming ⋮ A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces ⋮ A coherent differential PCF ⋮ Weighted models for higher-order computation ⋮ Densities of almost surely terminating probabilistic programs are differentiable almost everywhere ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Taylor expansion of probabilistic λ-terms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ QPCF: higher-order languages and quantum circuits

This page was built for publication: Full Abstraction for Probabilistic PCF