The Path Model of Intensional Type Theory
| dc.contributor.author | Ruch, Fabian | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers) | sv |
| dc.contributor.department | Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers) | en |
| dc.date.accessioned | 2019-07-03T13:51:48Z | |
| dc.date.available | 2019-07-03T13:51:48Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | The groupoid interpretation of Martin-Löf type theory not only shows the independence of uniqueness of identity proofs from the axioms of intensional type theory but is also constructive and validates the computation rules as definitional equalities. The groupoid semantics are very clear when interpreting dependent types and in particular the identity types but less so when defining equality preservation for terms, interpreting context extension or constructing the transport for identity proofs. The indirections stem from the fact that paths over paths is a derived notion in the groupoid interpretation. The notion is, however, a primitive in so called relational models which have been employed to prove abstraction theorems for type theories. We generalise the groupoid interpretation to a refined relational interpretation of intensional type theory and show that it is a model in the sense of categories with families. The refined relations support a concatenation operator that has identities and inverses; hence a model of paths. | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/228384 | |
| dc.language.iso | eng | |
| dc.setspec.uppsok | Technology | |
| dc.subject | Informations- och kommunikationsteknik | |
| dc.subject | Data- och informationsvetenskap | |
| dc.subject | Information & Communication Technology | |
| dc.subject | Computer and Information Science | |
| dc.title | The Path Model of Intensional Type Theory | |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.degree | Master Thesis | en |
| dc.type.uppsok | H | |
| local.programme | Computer science – algorithms, languages and logic (MPALG), MSc |
Ladda ner
Original bundle
1 - 1 av 1
Hämtar...
- Namn:
- 228384.pdf
- Storlek:
- 414.69 KB
- Format:
- Adobe Portable Document Format
- Beskrivning:
- Fulltext