#### Filter Results:

- Full text PDF available (2)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to represent tables in a natural way. Thus the category is a model for databases, a single mathematical structure in… (More)

- Håkon Robbestad Gylterud
- ArXiv
- 2016

A multiset consists of elements, but the notion of a multiset is distinguished from that of a set by carrying information of how many times each element occurs in a given multiset. In this work we will investigate the notion of iterative multisets, where multisets are iteratively built up from other multisets, in the context Martin-Löf Type Theory, in the… (More)

- ‹
- 1
- ›