The discriminating power of the let-in operator in the lazy call-by-name probabilistic -calculus

DOI10.4230/LIPICS.FSCD.2019.26MaRDI QIDQ5089028zbMATH OpenFDO

Authors Simona Kašterović, Michele Pagani

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2019.26

zbMATH Keywords

bisimulationcontext equivalenceHowe's techniqueprobabilistic \(\lambda\)-calculustesting

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Recommendations

• The Benefit of Being Non-Lazy in Probabilistic λ-calculus
• On probabilistic applicative bisimulation and call-by-value \(\lambda \)-calculi
• On applicative similarity, sequentiality, and full abstraction
• Lambda calculus and probabilistic computation
• Probabilistic operational semantics for the lambda calculus

Cites work

• Bisimulation through probabilistic testing
• Domain theory, testing and simulation for labelled Markov processes
• Full abstraction for probabilistic PCF
• Fully abstract models of the probabilistic -calculus
• Linear logic
• On applicative similarity, sequentiality, and full abstraction
• On coinductive equivalences for higher-order probabilistic functional programs
• On probabilistic applicative bisimulation and call-by-value \(\lambda \)-calculi
• Probabilistic Böhm trees and probabilistic separation
• Probabilistic operational semantics for the lambda calculus
• Strong adequacy and untyped full-abstraction for probabilistic coherence spaces

Cited in

(2)

• The Benefit of Being Non-Lazy in Probabilistic λ-calculus
• Solvability in a probabilistic setting (invited talk)

This page was built for publication: The discriminating power of the let-in operator in the lazy call-by-name probabilistic \(\lambda\)-calculus

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