Explicit Computational Paths in Type Theory

Bulletin of Symbolic Logic - United Kingdom
doi 10.1017/bsl.2019.2
Full Text
Abstract

Available in full text

Categories
PhilosophyLogic
Date
Authors
Publisher

Cambridge University Press (CUP)

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy