Fully Abstract Normal Form Bisimulation for Call-by-Value PCF

We present the first fully abstract normal form bisimulation for call-by-value PCF (PCF v ). Our model is based on a labelled transition system (LTS) that combines elements from applicative bisimulation, environmental bisimulation and game semantics. In order to obtain completeness while avoiding th...

Full description

Saved in:
Bibliographic Details
Published in2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) pp. 1 - 13
Main Authors Koutavas, Vasileios, Lin, Yu-Yang, Tzevelekos, Nikos
Format Conference Proceeding
LanguageEnglish
Published IEEE 26.06.2023
Subjects
Computer science
Games
Optimization
Semantics
Testing
Online AccessGet full text
DOI10.1109/LICS56636.2023.10175778

Cover

More Information
Summary:We present the first fully abstract normal form bisimulation for call-by-value PCF (PCF v ). Our model is based on a labelled transition system (LTS) that combines elements from applicative bisimulation, environmental bisimulation and game semantics. In order to obtain completeness while avoiding the use of semantic quotiening, the LTS constructs traces corresponding to interactions with possible functional contexts. The model gives rise to a sound and complete technique for checking of PCF v program equivalence, which we implement in a bounded bisimulation checking tool. We test our tool on known equivalences from the literature and new examples.
DOI:10.1109/LICS56636.2023.10175778