On Applicative Similarity, Sequentiality, and Full Abstraction (Q3449626)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	On Applicative Similarity, Sequentiality, and Full Abstraction	scientific article

Statements

scholarly article

On Applicative Similarity, Sequentiality, and Full Abstraction (English)

zbMATH Open document ID

10.1007/978-3-319-23506-6_7

Raphaëlle Crubillé

Davide Sangiorgi

Valeria Vignudelli

Lecture Notes in Computer Science

publication date

4 November 2015

full work available at URL

https://hal.inria.fr/hal-01229398/file/main.pdf

Mathematics Subject Classification ID

zbMATH DE Number

zbMATH Keywords

probabilistic \({\lambda}\)-calculus

bisimulation

coinduction

sequentiality

describes a project that uses

MaRDI profile type

MaRDI publication profile

Full abstraction in the lazy lambda calculus

On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi

On coinductive equivalences for higher-order probabilistic functional programs

Probabilistic operational semantics for the lambda calculus

Probabilistic game semantics

Bisimulation for labelled Markov processes

Probabilistic coherence spaces are fully abstract for probabilistic PCF

Probabilistic encryption

Bisimulation through probabilistic testing

LCF considered as a programming language

Stochastic lambda calculus and monads of probability distributions

Domain theory, testing and simulation for labelled Markov processes

Sitelinks

Mathematics(1 entry)

mardi Publication:3449626

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3449626&oldid=36211001"