Comparing Hierarchies of Types in Models of Linear Logic (2003)
| Citations: | 5 - 2 self |
BibTeX
@MISC{Mellies03comparinghierarchies,
author = {Paul-Andre Mellies},
title = {Comparing Hierarchies of Types in Models of Linear Logic},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that two models M and N of linear logic collapse to the same extensional hierarchy of types, when (1) their monoidal categories C and D are related by a pair of monoidal functors F : C D : G and transformations Id C ) GF and Id D ) FG, and (2) their exponentials ! are related by distributive laws % : ! : ! M G ) G ! N commuting to the promotion rule. The key ingredient of the proof is a notion of back-and-forth translation between the hierarchies of types induced by M and N. We apply this result to compare (1) the qualitative and the quantitative hierarchies induced by the coherence (or hypercoherence) space model, (2) several paradigms of games semantics: error-free vs. error-aware, alternated vs. non-alternated, backtracking vs. repetitive, uniform vs. non-uniform.
