A New Elimination Rule for the Calculus of Inductive Constructions

@inproceedings{Barras2008ANE,
  title={A New Elimination Rule for the Calculus of Inductive Constructions},
  author={Bruno Barras and Pierre Corbineau and Benjamin Gr{\'e}goire and Hugo Herbelin and Jorge Luis Sacchini},
  booktitle={TYPES},
  year={2008}
}
In Type Theory, definition by dependently-typed case analysis can be expressed by means of a set of equations — the semantic approach — or by an explicit pattern-matching construction — the syntactic approach. We aim at putting together the best of both approaches by extending the pattern-matching construction found in the Coq proof assistant in order to obtain the expressivity and flexibility of equationbased case analysis while remaining in a syntax-based setting, thus making dependently… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

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

Towards a practical programming language based on dependent type theory

Ulf Norell
PhD thesis, Chalmers University of Technology, • 2007
View 12 Excerpts
Highly Influenced

Epigram: Practical Programming with Dependent Types

Advanced Functional Programming • 2004
View 5 Excerpts
Highly Influenced

The view from the left

J. Funct. Program. • 2004
View 11 Excerpts
Highly Influenced

Eliminating Dependent Pattern Matching

Essays Dedicated to Joseph A. Goguen • 2006
View 4 Excerpts
Highly Influenced

Pattern matching with dependent types

Thierry Coquand
Informal Proceedings Workshop on Types for Proofs and Programs (B̊astad, Sweden), • 1992
View 5 Excerpts
Highly Influenced

Subset Coercions in Coq

TYPES • 2006
View 1 Excerpt

Similar Papers

Loading similar papers…