Journal article
Game semantics for dependent types
- Abstract:
-
We present a model of dependent type theory (DTT) with -, 1-, - and intensional Id-types, which is based on a slight variation of the (call-by-name) category of AJM-games and history-free winning well-bracketed strategies. The model satisfies Streicher’s criteria of intensionality and refutes function extensionality. The principle of uniqueness of identity proofs is satisfied. We show it contains a submodel as a full subcategory which gives a faithful interpretation of DTT with -, 1-, - and i...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 610.8KB)
-
- Publisher copy:
- 10.1016/j.ic.2018.02.015
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
+ Engineering and Physical Sciences Research Council
More from this funder
Funding agency for:
Vákár, M
+ National Science Foundation
More from this funder
Funding agency for:
Jagadeesan, R
Grant:
CCF 0916741
+ Engineering and Physical Sciences Research Council
More from this funder
Funding agency for:
Abramsky, S
Grant:
FA9550-12-1-0136
+ Air Force Office of Scientific Research
More from this funder
Funding agency for:
Abramsky, S
Grant:
FA9550-12-1-0136
Expand funders...
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Information and Computation Journal website
- Volume:
- 261
- Issue:
- Part 2
- Pages:
- 401-431
- Publication date:
- 2018-02-09
- Acceptance date:
- 2016-12-03
- DOI:
- EISSN:
-
1090-2651
- ISSN:
-
0890-5401
- Source identifiers:
-
830080
Item Description
- Keywords:
- Pubs id:
-
pubs:830080
- UUID:
-
uuid:7ae51c14-9cc4-41f0-8a81-291f5e5682e4
- Local pid:
- pubs:830080
- Deposit date:
- 2018-10-12
Terms of use
- Copyright holder:
- Elsevier
- Copyright date:
- 2018
- Notes:
- Copyright © 2018 Published by Elsevier Inc. This is the accepted manuscript version of the article. The final version is available online from Elsevier at: https://doi.org/10.1016/j.ic.2018.02.015
If you are the owner of this record, you can report an update to it here: Report update to this record