Skip to Main content Skip to Navigation
Conference papers

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

Davide Sangiorgi 1, 2
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Davide Sangiorgi Connect in order to contact the contributor
Submitted on : Tuesday, December 9, 2014 - 3:21:49 PM
Last modification on : Friday, October 30, 2020 - 12:04:03 PM
Long-term archiving on: : Saturday, April 15, 2017 - 7:07:33 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Les métriques sont temporairement indisponibles