Abstract / Description of output
A general category of games is constructed. A subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical linear logic.
Original language | English |
---|---|
Pages (from-to) | 68 |
Number of pages | 1 |
Journal | Logic in Computer Science, Symposium on |
Volume | 0 |
DOIs | |
Publication status | Published - 1997 |