Conference item icon

Conference item

Plays as resource terms via non-idempotent intersection types

Abstract:

A program is interpreted as a collection of resource terms by the Taylor expansion, as a collection of plays by game semantics, and as a collection of types by a non-idempotent intersection type assignment system. This paper investigates the connection between these models and aims to show that they are essentially the same in a certain sense. Technically we study the relational interpretations of resource terms and of plays, which can be seen as nonidempotent intersection type assignment sys...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1145/2933575.2934553

Authors


More by this author
Institution:
University of Oxford
Oxford college:
Merton College
Role:
Author
Publisher:
Association for Computing Machinery Publisher's website
Journal:
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science Journal website
Pages:
237-246
Host title:
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
Publication date:
2016-07-01
Acceptance date:
2016-04-04
DOI:
ISSN:
1043-6871
Source identifiers:
615005
ISBN:
9781450343916
Keywords:
Pubs id:
pubs:615005
UUID:
uuid:68386380-ebb6-4170-b6c9-84e261cbd5e5
Local pid:
pubs:615005
Deposit date:
2017-03-12

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP