Published April 5, 2014
| Version v1
Conference paper
Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)
Creators
Contributors
Others:
- Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO)
- Foundations of Component-based Ubiquitous Systems (FOCUS) ; Centre Inria d'Université Côte d'Azur (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
- Marcello M. Bonsangue
- TC 1
- WG 1.3
Description
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.
Abstract
Part 1: Invited ContributionsAbstract
International audienceAdditional details
Identifiers
- URL
- https://inria.hal.science/hal-01092815
- URN
- urn:oai:HAL:hal-01092815v1
Origin repository
- Origin repository
- UNICA