scientific article; zbMATH DE number 7559292

DOI10.4230/LIPICS.FSCD.2019.26MaRDI QIDQ5089028FDOQ5089028

Michele Pagani, Simona Kašterović

Publication date: 18 July 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

testingbisimulationcontext equivalenceHowe's techniqueprobabilistic \(\lambda\)-calculus

Mathematics Subject Classification ID

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

Cites Work

• Probabilistic operational semantics for the lambda calculus
• Linear logic
• Bisimulation through probabilistic testing
• Domain theory, testing and simulation for labelled Markov processes
• On coinductive equivalences for higher-order probabilistic functional programs
• On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi
• Full Abstraction for Probabilistic PCF
• Strong adequacy and untyped full-abstraction for probabilistic coherence spaces
• Title not available (Why is that?)
• On Applicative Similarity, Sequentiality, and Full Abstraction
• Probabilistic Böhm Trees and Probabilistic Separation

Cited In (1)

• The Benefit of Being Non-Lazy in Probabilistic λ-calculus

This page was built for publication:

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