Subset Coercions in Coq

  title={Subset Coercions in Coq},
  author={Matthieu Sozeau},
We propose a new language for writing programs with dependent types which can be elaborated into partial Coq terms. This language permits to establish a phase distinction between writing and proving algorithms in the Coq environment. Concretely, this means allowing to write algorithms as easily as in a practical functional programming language whilst giving them as rich a specification as desired and proving that the code meets the specification using the whole Coq proof apparatus. This is… CONTINUE READING
Highly Cited
This paper has 79 citations. REVIEW CITATIONS


Publications citing this paper.

79 Citations

Citations per Year
Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.


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

On the strenght of proof-irrelevant type theories

B. Werner
3rd International Joint Conference on Automated Reasoning • 2006
View 8 Excerpts
Highly Influenced

Coercive subtyping for the calculus of constructions

POPL • 2003
View 7 Excerpts
Highly Influenced

Pure type systems with judgemental equality

J. Funct. Program. • 2006
View 1 Excerpt

Coercion par prédicats en Coq. Master’s thesis, Université Paris VII, LRI, Orsay (2005) extended version - russell/report.pdf

M. Sozeau
View 1 Excerpt

Interactive Theorem Proving and Program Development

Texts in Theoretical Computer Science An EATCS Series • 2004
View 1 Excerpt

The view from the left

J. Funct. Program. • 2004
View 3 Excerpts

Cayenne - A Language with Dependent Types

Advanced Functional Programming • 1998
View 2 Excerpts

Similar Papers

Loading similar papers…