Probabilistic Böhm trees and probabilistic separation

DOI10.1145/3209108.3209126MaRDI QIDQ5145341zbMATH OpenOpenAlexFDO

Authors Thomas Leventis

Publication date 20 January 2021

Published in Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3209108.3209126

zbMATH Keywords

separationobservational equivalenceBöhm treesprobabilistic lambda-calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• On probabilistic applicative bisimulation and call-by-value \(\lambda \)-calculi
• Probabilistic operational semantics for the lambda calculus
• On coinductive equivalences for higher-order probabilistic functional programs
• The Benefit of Being Non-Lazy in Probabilistic λ-calculus
• A deterministic rewrite system for the probabilistic \(\lambda\)-calculus

Cited in

(6)

• scientific article; zbMATH DE number 7559292 (Why is no real title available?)
• scientific article; zbMATH DE number 7533341 (Why is no real title available?)
• Solvability in a probabilistic setting (invited talk)
• Extensional Taylor expansion
• On the Taylor expansion of probabilistic λ-terms
• Abstract Böhm trees

This page was built for publication: Probabilistic Böhm trees and probabilistic separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145341)