Type theoretical databases

dc.date.accessioned	2021-04-15T20:01:53Z
dc.date.available	2021-04-15T20:01:53Z
dc.date.created	2020-02-27T10:18:21Z
dc.date.issued	2020
dc.identifier.citation	Forssell, Jon Henrik Gylterud, Håkon Robbestad Spivak, David I . Type theoretical databases. Journal of Logic and Computation. 2020, 30(1), 217-238
dc.identifier.uri	http://hdl.handle.net/10852/85289
dc.description.abstract	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.
dc.language	EN
dc.rights	Attribution 4.0 International
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/
dc.title	Type theoretical databases
dc.type	Journal article
dc.creator.author	Forssell, Jon Henrik
dc.creator.author	Gylterud, Håkon Robbestad
dc.creator.author	Spivak, David I
cristin.unitcode	185,15,5,25
cristin.unitname	PROG Programmering
cristin.ispublished	true
cristin.fulltext	original
cristin.fulltext	preprint
cristin.qualitycode	1
dc.identifier.cristin	1798069
dc.identifier.bibliographiccitation	info:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Journal of Logic and Computation&rft.volume=30&rft.spage=217&rft.date=2020
dc.identifier.jtitle	Journal of Logic and Computation
dc.identifier.volume	30
dc.identifier.issue	1
dc.identifier.startpage	217
dc.identifier.endpage	238
dc.identifier.doi	https://doi.org/10.1093/logcom/exaa009
dc.identifier.urn	URN:NBN:no-87902
dc.type.document	Tidsskriftartikkel
dc.type.peerreviewed	Peer reviewed
dc.source.issn	0955-792X
dc.identifier.fulltext	Fulltext https://www.duo.uio.no/bitstream/handle/10852/85289/1/exaa009.pdf
dc.type.version	PublishedVersion
dc.relation.project	NFR/230535