A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
2009
2009 24th Annual IEEE Symposium on Logic In Computer Science
Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies which "behave well" and react in the same way to a set of tests. The semantical types which are interpretation of logical formulas enjoy a fundamental property, called internal completeness, which characterizes ludics and sets it apart also from realizability. Internal completeness entails standard full completeness as a
doi:10.1109/lics.2009.46
dblp:conf/lics/BasaldellaF09
fatcat:xscyzyd46veototi43cuwzl3du