On Applicative Similarity, Sequentiality, and Full Abstraction

DOI10.1007/978-3-319-23506-6_7zbMath1444.68116OpenAlexW2294711452MaRDI QIDQ3449626

Raphaëlle Crubillé, Ugo Dal Lago, Davide Sangiorgi, Valeria Vignudelli

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

bisimulationcoinductionsequentialityprobabilistic \({\lambda}\)-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Metric Reasoning About $$\lambda $$-Terms: The General Case ⋮ Unnamed Item

Uses Software

• IBAL

Cites Work

• Probabilistic encryption
• Bisimulation through probabilistic testing
• LCF considered as a programming language
• Full abstraction in the lazy lambda calculus
• Domain theory, testing and simulation for labelled Markov processes
• Bisimulation for labelled Markov processes
• Probabilistic operational semantics for the lambda calculus
• Stochastic lambda calculus and monads of probability distributions
• On coinductive equivalences for higher-order probabilistic functional programs
• Probabilistic coherence spaces are fully abstract for probabilistic PCF
• On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi
• Probabilistic game semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Applicative Similarity, Sequentiality, and Full Abstraction