DeepAI AI Chat
Log In Sign Up

Dependent Type Systems as Macros

by   Stephen Chang, et al.

We present Turnstile+, a high-level, macros-based metaDSL for building dependently typed languages. With it, programmers may rapidly prototype and iterate on the design of new dependently typed features and extensions. Or they may create entirely new DSLs whose dependent type "power" is tailored to a specific domain. Our framework's support of language-oriented programming also makes it suitable for experimenting with systems of interacting components, e.g., a proof assistant and its companion DSLs. This paper explains the implementation details of Turnstile+, as well as how it may be used to create a wide-variety of dependently typed languages, from a lightweight one with indexed types, to a full spectrum proof assistant, complete with a tactic system and extensions for features like sized types and SMT interaction.


Implementing Dependent Types in pi-forall

These lecture notes describe the design of a minimal dependently-typed l...

Linear Dependent Type Theory for Quantum Programming Languages

Modern quantum programming languages integrate quantum resources and cla...

Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis

First-order resolution has been used for type inference for many years, ...

Isabelle/Spartan – A Dependent Type Theory Framework for Isabelle

This paper introduces Isabelle/Spartan, an implementation of intensional...

Toward SMT-Based Refinement Types in Agda

Dependent types offer great versatility and power, but developing proofs...

Constrained Type Families

We present an approach to support partiality in type-level computation w...

Practical Sized Typing for Coq

Termination of recursive functions and productivity of corecursive funct...