DeepAI AI Chat
Log In Sign Up

Code Generation for Higher Inductive Types

by   Paventhan Vivekanandan, et al.
Indiana University

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.


page 1

page 2

page 3

page 4


Type-Theoretic Signatures for Algebraic Theories and Inductive Types

We develop the usage of certain type theories as specification languages...

Inference with System W Satisfies Syntax Splitting

In this paper, we investigate inductive inference with system W from con...

Verification of High-Level Transformations with Inductive Refinement Types

High-level transformation languages like Rascal include expressive featu...

Touring the MetaCoq Project (Invited Paper)

Proof assistants are getting more widespread use in research and industr...

Internalizing Representation Independence with Univalence

In their usual form, representation independence metatheorems provide an...

Computing Cohomology Rings in Cubical Agda

In Homotopy Type Theory, cohomology theories are studied synthetically u...

Constructing Higher Inductive Types as Groupoid Quotients

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