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:
-
-
(Accepted manuscript, pdf, 516.8KB)
-
(Accepted manuscript, pdf, 516.8KB)
-
- Publisher copy:
- 10.1145/2933575.2934553
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
Bibliographic Details
- 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
Item Description
- Keywords:
- Pubs id:
-
pubs:615005
- UUID:
-
uuid:68386380-ebb6-4170-b6c9-84e261cbd5e5
- Local pid:
- pubs:615005
- Deposit date:
- 2017-03-12
Terms of use
- Copyright holder:
- Ong and Tsukada
- Copyright date:
- 2016
- Notes:
- Copyright © 2016 held by owner/author(s). Publication rights licensed to ACM
If you are the owner of this record, you can report an update to it here: Report update to this record