Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) - Coalgebraic Methods in Computer Science
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.

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
main.pdf (146.13 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Davide Sangiorgi  : Connect in order to contact the contributor

https://inria.hal.science/hal-01092815

Submitted on : Tuesday, December 9, 2014-3:21:49 PM

Last modification on : Thursday, November 14, 2024-4:16:03 PM

Long-term archiving on : Saturday, April 15, 2017-7:07:33 AM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INRIA IFIP-LNCS IFIP INRIA2 IFIP-TC IFIP-TC1 IFIP-WG IFIP-LNCS-8446 IFIP-WG1-3 IFIP-CMCS
183 View
215 Download

Altmetric

Share

More