Highly Influenced

# 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} }

- Published 2012 in Logical Methods in Computer Science
DOI:10.2168/LMCS-8(1:18)2012

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

#### From This Paper

##### Figures, tables, and topics from this paper.

15 Citations

30 References

Similar Papers