Reference. A Specification for Dependent Types in Haskell

Cite

Cite as @weirich_etal_2017 (helia, typst) · \cite{weirich_etal_2017} (LaTeX)
BibTeX
bibtex · 12 lines
@article{weirich_etal_2017,
 title = {A Specification for Dependent Types in {Haskell}},
 author = {Weirich, Stephanie and Voizard, Antoine and Amorim, Pedro Henrique Azevedo de and Eisenberg, Richard A.},
 year = {2017},
 doi = {10.1145/3110275},
 url = {https://dl.acm.org/doi/10.1145/3110275},
 publisher = {ACM},
 journal = {Proceedings of the ACM on Programming Languages},
 volume = {1},
 number = {ICFP},
 pages = {1--29}
}
hayagriva YAML (typst)
yaml · 19 lines
weirich_etal_2017:
  type: article
  title: A Specification for Dependent Types in {Haskell}
  author:
  - Weirich, Stephanie
  - Voizard, Antoine
  - Amorim, Pedro Henrique Azevedo de
  - Eisenberg, Richard A.
  date: 2017
  page-range: 1-29
  url: https://dl.acm.org/doi/10.1145/3110275
  serial-number:
    doi: 10.1145/3110275
  parent:
    type: periodical
    title: Proceedings of the ACM on Programming Languages
    publisher: ACM
    issue: ICFP
    volume: 1
Cited by (1)

Internalizing Extensions in Lattices of Type Theories chan-2025-internalizing

Many proof assistants allow the use of features and axioms that increase their expressive power. However, these extensions must be used with care, as some combinations are known to lead to logical inconsistencies. Therefore, proof assistants include mechanisms that track which extensions are used in a proof development or module, ensuring that incompatible extensions are not used simultaneously. Unfortunately, existing extension tracking mechanisms are external to the type system. This means that we cannot specify precisely which extensions a definition depends on. Having the ability to write more precise specifications means we are not picking an overapproximation of the extensions needed, which prevents reusing definitions in the presence of incompatible extensions. Furthermore, we cannot refer to definitions that use incompatible extensions even if they are never used in inconsistent ways. The reasoning principles of one extension therefore cannot be used as a metatheory to reason about the properties of an incompatible extension. In this report, I explore the use of the Dependent Calculus of Indistinguishability (DCOI) by Liu et al. for extension tracking. DCOI is a dependent type system with dependency tracking, where terms and variables are assigned dependency levels alongside their types. These dependency levels form a lattice that describes which levels are permitted to access what. To instead track extensions, each set of extensions would correspond to a dependency level, and the lattice would describe how extensions are permitted to interact.
arXiv
Cites 61 works (2 here)
With notes (2)

Computational higher-dimensional type theory angiuli-2017-computational

PDF · DOI · pldb

Elimination with a Motive mcbride-2002-elimination

DOI
External (59)
weirich_etal_2017 reference entries/refs/weirich_etal_2017/weirich_etal_2017.hel