dc.contributor.author | Forssell, Jon Henrik | |
dc.contributor.author | Gylterud, Håkon Robbestad | |
dc.contributor.author | Spivak, David I | |
dc.date.accessioned | 2021-07-07T08:01:16Z | |
dc.date.available | 2021-07-07T08:01:16Z | |
dc.date.created | 2020-02-27T10:18:21Z | |
dc.date.issued | 2020 | |
dc.Published | Journal of Logic and Computation. 2020, 30 (1), 217-238. | |
dc.identifier.issn | 0955-792X | |
dc.identifier.uri | https://hdl.handle.net/11250/2763658 | |
dc.description.abstract | We show how the display-map category of finite (symmetric) simplicial complexes can be seen as representing the totality of database schemas and instances in a single mathematical structure. We give a sound interpretation of a certain dependent type theory in this model and show how it allows for the syntactic specification of schemas and instances and the manipulation of the same with the usual type-theoretic operations. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Oxford University Press | en_US |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | Type theoretical databases | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright the authors 2020 | en_US |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |
dc.identifier.doi | 10.1093/logcom/exaa009 | |
dc.identifier.cristin | 1798069 | |
dc.source.journal | Journal of Logic and Computation | en_US |
dc.source.40 | 30 | |
dc.source.14 | 1 | |
dc.source.pagenumber | 217-238 | en_US |
dc.identifier.citation | Journal of Logic and Computation. 2020, 30 (1), 217–238. | en_US |
dc.source.volume | 30 | en_US |
dc.source.issue | 1 | en_US |