Applicative Bisimulation and Quantum λ-Calculi - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Applicative Bisimulation and Quantum λ-Calculi

(1, 2) , (1, 2)
1
2

Abstract

Applicative bisimulation is a coinductive technique to check program equivalence in higher-order functional languages. It is known to be sound — and sometimes complete — with respect to context equivalence. In this paper we show that applicative bisimulation also works when the underlying language of programs takes the form of a linear λ-calculus extended with features such as probabilistic binary choice, but also quantum data, the latter being a setting in which linearity plays a role. The main results are proofs of soundness for the obtained notions of bisimilarity.
Fichier principal
Vignette du fichier
main.pdf (469.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01231800 , version 1 (20-11-2015)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Ugo Dal Lago, Alessandro Rioli. Applicative Bisimulation and Quantum λ-Calculi. 6th Fundamentals of Software Engineering (FSEN), Apr 2015, Tehran, Iran. pp.54-68, ⟨10.1007/978-3-319-24644-4_4⟩. ⟨hal-01231800⟩
121 View
130 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More