On coinductive equivalences for higher-order probabilistic functional programs

DOI10.1145/2535838.2535872zbMath1284.68424arXiv1311.1722OpenAlexW2035063966MaRDI QIDQ5408426

Davide Sangiorgi, Ugo Dal Lago, Michele Alberti

Publication date: 10 April 2014

Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

zbMATH Keywords

bisimulationcoinductionprobabilistic lambda-calculusHowe's technique.

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ On Applicative Similarity, Sequentiality, and Full Abstraction ⋮ The geometry of Bayesian programming ⋮ On Equivalences, Metrics, and Polynomial Time ⋮ Program equivalence in a typed probabilistic call-by-need functional language ⋮ Program equivalence in an untyped, call-by-value functional language with uncurried functions ⋮ Metric Reasoning About $$\lambda $$-Terms: The General Case ⋮ Effectful applicative similarity for call-by-name lambda calculi ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: On coinductive equivalences for higher-order probabilistic functional programs