Logical bisimulations and functional languages

Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Citations (Scopus)


Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimulation proof method with "up-to context" techniques. We present logical bisimulations, a form of bisimulation for higherorder languages, in which the bisimulation clause is somehow reminiscent of logical relations. We consider purely functional languages, in particular untyped call-by-name and call-by-value lambda-calculi, and, in each case: we present the basic properties of logical bisimilarity, including congruence; we show that it coincides with contextual equivalence; we develop some up-to techniques, including up-to context, as examples of possible enhancements of the associated bisimulation method.

Original languageEnglish
Title of host publicationInternational Symposium on Fundamentals of Software Engineering - International Symposium, FSEN 2007, Proceedings
PublisherSpringer Verlag
Number of pages16
ISBN (Print)9783540756972
Publication statusPublished - 2007
Event2nd IPM International Symposium on Fundamentals of Software Engineering, FSEN 2007 - Tehran, Iran, Islamic Republic of
Duration: 2007 Apr 172007 Apr 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4767 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd IPM International Symposium on Fundamentals of Software Engineering, FSEN 2007
Country/TerritoryIran, Islamic Republic of


Dive into the research topics of 'Logical bisimulations and functional languages'. Together they form a unique fingerprint.

Cite this