Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)

Abstract

A few forms of bisimulation and of coinductive techniques that have been proposed for higher-order languages are discussed, beginning with the pure lambda-calculus and then moving to extensions of it, notably those with non-determinism and probabilities.
Fichier principal
Vignette du fichier
main.pdf (146.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01092815 , version 1 (09-12-2014)

Licence

Attribution

Identifiers

Cite

Davide Sangiorgi. Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract). Coalgebraic Methods in Computer Science, Apr 2014, Grenoble, France. pp.3 - 9, ⟨10.1007/978-3-662-44124-4_1⟩. ⟨hal-01092815⟩
158 View
183 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More