Corpus ID: 225070231

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}
}
  • Benjamin Moon, Harley D. Eades, D. Orchard
  • Published 2020
  • Computer Science, Physics
  • ArXiv
  • 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

    Figures and Tables from this paper

    References

    SHOWING 1-10 OF 80 REFERENCES
    Quantitative program reasoning with graded modal types
    • 20
    Parametric quantifiers for dependent type theory
    • 29
    • PDF
    Implementing a modal dependent type theory
    • 9
    • PDF
    Really Natural Linear Indexed Type Checking
    • 20
    • PDF
    A graded dependent type system with a usage-aware semantics
    • 2
    • PDF
    A relationally parametric model of dependent type theory
    • 46
    • PDF
    Integrating Linear and Dependent Types
    • 40
    Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types
    • 8
    • PDF
    On understanding types, data abstraction, and polymorphism
    • 2,048
    • PDF
    On Irrelevance and Algorithmic Equality in Predicative Type Theory
    • 40
    • PDF