On bisimilarity in lambda calculi with continuous probabilistic choice

DOI10.1016/j.entcs.2019.09.007OpenAlexW2995436578WikidataQ113317356 ScholiaQ113317356MaRDI QIDQ2133169

Ugo Dal Lago, Francesco Gavazzo

Publication date: 29 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.09.007

zbMATH Keywords

\(\lambda\)-calculuscontinuous distributionsprobabilistic computation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Simulations in coalgebra
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The lazy lambda calculus in a concurrency scenario
• Modelling environments in call-by-value programming languages.
• Fixpoint semantics and simulation
• Approximate relational Hoare logic for continuous random samplings
• Domain theory, testing and simulation for labelled Markov processes
• Proving congruence of bisimulation in functional programming languages
• Behavioural equivalence via modalities for algebraic effects
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• A User's Guide to Measure Theoretic Probability
• Step-Indexed Logical Relations for Probability
• A lambda-calculus foundation for universal probabilistic programming
• Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring
• Commutative Semantics for Probabilistic Programming
• Similarity Quotients as Final Coalgebras
• Logical relations for monadic types
• Typed Normal Form Bisimulation
• Codensity Lifting of Monads and its Dual
• Semantics for probabilistic programming
• Equivalence in functional languages with effects
• Quantitative Behavioural Reasoning for Higher-order Effectful Programs
• Distance makes the types grow stronger
• Stochastic lambda calculus and monads of probability distributions
• A probabilistic language based upon sampling functions
• A semantic account of metric preservation
• On coinductive equivalences for higher-order probabilistic functional programs
• On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi
• Howe's method for higher-order languages
• Probabilistic bisimulation
• Relational algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On bisimilarity in lambda calculi with continuous probabilistic choice