Environmental bisimulations for probabilistic higher-order languages

DOI10.1145/2837614.2837651zbMath1347.68056OpenAlexW2296330072MaRDI QIDQ2828300

Davide Sangiorgi, Valeria Vignudelli

Publication date: 24 October 2016

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

Full work available at URL: https://hal.inria.fr/hal-01337665/file/main.pdf

zbMATH Keywords

contextual equivalenceimperative languagesenvironmental bisimulationprobabilistic lambda calculus

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (9)

Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ Unnamed Item ⋮ Decomposing probabilistic lambda calculi ⋮ Metric Reasoning About $$\lambda $$-Terms: The General Case ⋮ Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Environmental bisimulations for probabilistic higher-order languages