Hostname: page-component-cb9f654ff-r5d9c Total loading time: 0 Render date: 2025-08-01T08:12:17.174Z Has data issue: false hasContentIssue false

Explicit Computational Paths in Type Theory

Published online by Cambridge University Press:  25 July 2019

Rights & Permissions [Opens in a new window]

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Thesis Abstracts
Copyright
Copyright © The Association for Symbolic Logic 2019