On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi

DOI10.1007/978-3-642-54833-8_12zbMath1405.68076arXiv1401.3766OpenAlexW136487247MaRDI QIDQ5410701

Ugo Dal Lago, Raphaëlle Crubillé

Publication date: 16 April 2014

Published in: Programming Languages and Systems (Search for Journal in Brave)

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

zbMATH Keywords

bisimulationlambda calculuscoinductionprobabilistic computation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (13)

On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ Combining algebraic effect descriptions using the tensor of complete lattices ⋮ On Applicative Similarity, Sequentiality, and Full Abstraction ⋮ Applicative Bisimulation and Quantum λ-Calculi ⋮ The geometry of Bayesian programming ⋮ On Equivalences, Metrics, and Polynomial Time ⋮ Program equivalence in a typed probabilistic call-by-need functional language ⋮ On Higher-Order Probabilistic Subrecursion ⋮ Metric Reasoning About $$\lambda $$-Terms: The General Case ⋮ Unnamed Item ⋮ Effectful applicative similarity for call-by-name lambda calculi ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi