Show simple item record

Type theoretical databases

dc.contributor.authorForssell, Jon Henrik
dc.contributor.authorGylterud, Håkon Robbestad
dc.contributor.authorSpivak, David I
dc.date.accessioned2021-07-07T08:01:16Z
dc.date.available2021-07-07T08:01:16Z
dc.date.created2020-02-27T10:18:21Z
dc.date.issued2020
dc.PublishedJournal of Logic and Computation. 2020, 30 (1), 217-238.
dc.identifier.issn0955-792X
dc.identifier.urihttps://hdl.handle.net/11250/2763658
dc.description.abstractWe 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.isoengen_US
dc.publisherOxford University Pressen_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleType theoretical databasesen_US
dc.typeJournal articleen_US
dc.typePeer revieweden_US
dc.description.versionpublishedVersionen_US
dc.rights.holderCopyright the authors 2020en_US
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1
dc.identifier.doi10.1093/logcom/exaa009
dc.identifier.cristin1798069
dc.source.journalJournal of Logic and Computationen_US
dc.source.4030
dc.source.141
dc.source.pagenumber217-238en_US
dc.identifier.citationJournal of Logic and Computation. 2020, 30 (1), 217–238.en_US
dc.source.volume30en_US
dc.source.issue1en_US


Files in this item

Thumbnail
Name:
exaa009.pdf
Size:
697.3Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record

Navngivelse 4.0 Internasjonal
Except where otherwise noted, this item's license is described as Navngivelse 4.0 Internasjonal