Abstract
We show how types of finite sets and multisets can be constructed in ordinary dependent type theory, without the need for quotient types or working with setoids, and prove that these constructions realise finite sets and multisets as free idempotent commutative monoids and free commutative monoids, respectively. Both constructions arise as generalisations of C. Coquand’s data type of fresh lists, and we show how many other free structures also can be realised by other instantiations. All of our results have been formalised in Agda.
Original language | English |
---|---|
Pages | 1-20 |
Number of pages | 20 |
Publication status | E-pub ahead of print - 29 Nov 2023 |
Event | The 21st Asian Symposium on Programming Languages and Systems - Taipei, Taiwan Duration: 26 Nov 2023 → 29 Nov 2023 Conference number: 21 https://conf.researchr.org/home/aplas-2023 |
Conference
Conference | The 21st Asian Symposium on Programming Languages and Systems |
---|---|
Abbreviated title | APLAS |
Country/Territory | Taiwan |
City | Taipei |
Period | 26/11/23 → 29/11/23 |
Internet address |
Keywords
- free algebraic structures
- fresh lists
- dependent type theory