Canonicity and Computability in Homotopy Type Theory

08/18/2023
by   Dmitry Filippov, et al.
0

This dissertation gives an overview of Martin Lof's dependant type theory, focusing on its computational content and addressing a question of possibility of fully canonical and computable semantic presentation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2023

Simple Type Theory as a Clausal Theory

We give a presentation of Simple Type Theory as a clausal rewrite system...
research
05/08/2019

On Church's Thesis in Cubical Assemblies

We show that Church's thesis, the axiom stating that all functions on th...
research
02/18/2019

Homotopy canonicity for cubical type theory

Cubical type theory provides a constructive justification of homotopy ty...
research
12/22/2020

Computable Random Variables and Conditioning

The aim of this paper is to present an elementary computable theory of r...
research
11/13/2019

Naive cubical type theory

This paper proposes a way of doing type theory informally, assuming a cu...
research
01/29/2018

Equivariant ZFA and the foundations of nominal techniques

We give an accessible presentation to the foundations of nominal techniq...
research
06/16/2022

A visual introduction to information theory

Though originally developed for communications engineering, information ...

Please sign up or login with your details

Forgot password? Click here to reset