Code Generation for Higher Inductive Types

08/24/2018
by   Paventhan Vivekanandan, et al.
0

Higher inductive types are inductive types that include nontrivial higher-dimensional structure, represented as identifications that are not reflexivity. While work proceeds on type theories with a computational interpretation of univalence and higher inductive types, it is convenient to encode these structures in more traditional type theories with mature implementations. However, these encodings involve a great deal of error-prone additional syntax. We present a library that uses Agda's metaprogramming facilities to automate this process, allowing higher inductive types to be specified with minimal additional syntax.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2023

Type-Theoretic Signatures for Algebraic Theories and Inductive Types

We develop the usage of certain type theories as specification languages...
research
02/11/2022

Inference with System W Satisfies Syntax Splitting

In this paper, we investigate inductive inference with system W from con...
research
09/17/2018

Verification of High-Level Transformations with Inductive Refinement Types

High-level transformation languages like Rascal include expressive featu...
research
07/16/2021

Touring the MetaCoq Project (Invited Paper)

Proof assistants are getting more widespread use in research and industr...
research
09/11/2020

Internalizing Representation Independence with Univalence

In their usual form, representation independence metatheorems provide an...
research
12/08/2022

Computing Cohomology Rings in Cubical Agda

In Homotopy Type Theory, cohomology theories are studied synthetically u...
research
02/19/2020

Constructing Higher Inductive Types as Groupoid Quotients

In this paper, we show that all finitary 1-truncated higher inductive ty...

Please sign up or login with your details

Forgot password? Click here to reset