Corpus ID: 4512260

Elaboration in Dependent Type Theory

@article{Moura2015ElaborationID,
  title={Elaboration in Dependent Type Theory},
  author={Leonardo Mendonça de Moura and J. Avigad and Soonho Kong and Cody Roux},
  journal={ArXiv},
  year={2015},
  volume={abs/1505.04324}
}
  • Leonardo Mendonça de Moura, J. Avigad, +1 author Cody Roux
  • Published 2015
  • Computer Science
  • ArXiv
  • To be usable in practice, interactive theorem provers need to provide convenient and efficient means of writing expressions, definitions, and proofs. This involves inferring information that is often left implicit in an ordinary mathematical text, and resolving ambiguities in mathematical expressions. We refer to the process of passing from a quasi-formal and partially-specified expression to a completely precise formal one as elaboration. We describe an elaboration algorithm for dependent type… CONTINUE READING
    Implementing type theory in higher order constraint logic programming
    1
    Congruence Closure in Intensional Type Theory
    7
    Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages
    Automation and Computation in the Lean Theorem Prover
    A Modular Type Reconstruction Algorithm
    14
    Improving typeclass relations by being open
    Deep Generation of Coq Lemma Names Using Elaborated Terms
    1
    Mutation Analysis for Coq
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 50 REFERENCES
    A Theory of Type Polymorphism in Programming
    1957
    Extending Hindley-Milner Type Inference with Coercive Structural Subtyping
    16
    Inductive Definitions in the system Coq - Rules and Properties
    455
    Idris, a general-purpose dependently typed programming language: Design and implementation
    249
    Packaging Mathematical Structures
    129
    Functional pearl: i am not a number--i am a free variable
    70
    Using Axiomatic Type Classes in Isabelle
    36
    Inductive families
    142
    Hints in Unification
    54
    Programming in Higher-Order Logic
    39