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.
Type de document :
Communication dans un congrès
Marcello M. Bonsangue. Coalgebraic Methods in Computer Science, Apr 2014, Grenoble, France. Springer, Lecture Notes in Computer Science, LNCS-8446, pp.3 - 9, 2014, Coalgebraic Methods in Computer Science. 〈10.1007/978-3-662-44124-4_1〉
Liste complète des métadonnées

Littérature citée [34 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01092815
Contributeur : Sangiorgi Davide <>
Soumis le : mardi 9 décembre 2014 - 15:21:49
Dernière modification le : samedi 27 janvier 2018 - 01:30:40
Document(s) archivé(s) le : samedi 15 avril 2017 - 07:07:33

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Davide Sangiorgi. Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract). Marcello M. Bonsangue. Coalgebraic Methods in Computer Science, Apr 2014, Grenoble, France. Springer, Lecture Notes in Computer Science, LNCS-8446, pp.3 - 9, 2014, Coalgebraic Methods in Computer Science. 〈10.1007/978-3-662-44124-4_1〉. 〈hal-01092815〉

Partager

Métriques

Consultations de la notice

111

Téléchargements de fichiers

182