A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions

@article{Asperti2012ABR,
  title={A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions},
  author={Andrea Asperti and Wilmer Ricciotti and Claudio Sacerdoti Coen and Enrico Tassi},
  journal={Logical Methods in Computer Science},
  year={2012},
  volume={8}
}
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm is in charge of giving a meaning to the terms, types and proof terms directly written by the user or generated by using tactics, decision procedures or general automation. The terms are written in an “external syntax” meant to be user friendly that allows omission of information, untyped binders and a certain liberal… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
15 Citations
30 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Verified Computing in Homological Algebra. A Journey Esploring the Power and Limits of Dependent Type Theory

  • Arnaud Spiwack
  • PhD thesis, École Polytechniqe,
  • 2011
2 Excerpts

Similar Papers

Loading similar papers…