Graded Modal Dependent Type Theory
@article{Moon2020GradedMD, title={Graded Modal Dependent Type Theory}, author={Benjamin Moon and Harley D. Eades and D. Orchard}, journal={ArXiv}, year={2020}, volume={abs/2010.13163} }
Graded type theories are an emerging paradigm for augmenting the reasoning power of types with parameterizable, fine-grained analyses of program properties. There have been many such theories in recent years which equip a type theory with quantitative dataflow tracking, usually via a semiring-like structure which provides analysis on variables (often called ‘quantitative’ or ‘coeffect’ theories). We present Graded Modal Dependent Type Theory (Grtt for short), which equips a dependent type… CONTINUE READING
References
SHOWING 1-10 OF 80 REFERENCES
Quantitative program reasoning with graded modal types
- Computer Science
- Proc. ACM Program. Lang.
- 2019
- 20
Parametric quantifiers for dependent type theory
- Computer Science, Mathematics
- Proc. ACM Program. Lang.
- 2017
- 29
- PDF
A graded dependent type system with a usage-aware semantics
- Computer Science
- Proc. ACM Program. Lang.
- 2021
- 2
- PDF
Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types
- Computer Science
- Proc. ACM Program. Lang.
- 2019
- 8
- PDF
On Irrelevance and Algorithmic Equality in Predicative Type Theory
- Computer Science, Mathematics
- Log. Methods Comput. Sci.
- 2012
- 40
- PDF