%0 Conference Proceedings
%T Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)
%+ Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO)
%+ Foundations of Component-based Ubiquitous Systems (FOCUS)
%A Sangiorgi, Davide
%Z Part 1: Invited Contributions
%F Invité
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B Coalgebraic Methods in Computer Science
%C Grenoble, France
%Y Marcello M. Bonsangue
%I Springer
%3 Coalgebraic Methods in Computer Science
%V LNCS-8446
%P 3 - 9
%8 2014-04-05
%D 2014
%R 10.1007/978-3-662-44124-4_1
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.3
%2 https://inria.hal.science/hal-01092815/document
%2 https://inria.hal.science/hal-01092815/file/main.pdf
%L hal-01092815
%U https://inria.hal.science/hal-01092815
%~ INRIA
%~ INRIA-SOPHIA
%~ INRIASO
%~ INRIA_TEST
%~ TESTALAIN1
%~ IFIP-LNCS
%~ IFIP
%~ INRIA2
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-LNCS-8446
%~ IFIP-WG1-3
%~ IFIP-CMCS
%~ IFIP-2010