Pattern matching coverage checking with dependent types using set approximations

PLPV'07: Proceedings of the 2007 Workshop on Programming Languages meets Program Verification

Volumn , Issue , 2007, Pages 47-56

  Oury, Nicolas ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Coverage checking; Pattern matching; Set approximation

Indexed keywords

DATA ACQUISITION; FUNCTIONAL PROGRAMMING; PROBLEM SOLVING; SET THEORY; SPECIFICATIONS;

COVERAGE CHECKING; SET APPROXIMATION;

PATTERN MATCHING;

EID: 38849089893     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1292597.1292606     Document Type: Conference Paper

References (23)

1. Agda. The Agda programming language. http://www.cs. chalmers.se/ ~catarina/agda/.
2. ALFA. The Alfa proof editor, http://www.cs.chalmers.se/ hallgren/Alfa/.
3. Lennart Augustsson. Cayenne - Hotter than Haskell, 1999. http: //www.cs.chalmers.se/~augustss/cayenne/.
4. Lennart Augustsson. Compiling pattern matching. In Proc. of a conference on Functional programming languages and computer architecture, pages 368-381, New York, NY, USA, 1985. Springer-Verlag New York, Inc. ISBN 3-387-15975-4.
5. Marc Bezem and Jan Springintveld. A simple proof of the undecidability of inhabitation in lambda. J. Funct. Program., 6(5):757-761, 1996.
6. Coq. The Coq proof assistant, http://coq.inria.fr.
7. T. Coquand. Pattern matching with dependent types, 1992. Proceedings of the Workshop on Logical Frameworks.
8. Patrick Cousot and Radhia Cousot. Static determination of dynamic properties pf programs. In Dunod, editor, Proceedings of the 2nd International Symposium on Programming, pages 106-130, 1976.
9. Epigram. Epigram, making dependent types matter, http://www. e-pig.org.
10. Haskell. Haskell, a Purely Functional Language. http://www. haskell. org.
11. Lego. The LEGO proof assistant, http://www.dcs.ed.ac.uk/ home/lego/.
12. Conor McBride and James McKinna. The view from the left. J. Funct. Program., 14(1):69-111, 2004. ISSN 0956-7968.
13. R. Milner. A theory of type polymorphismn programming. Journal of Computer and System Sciences, 17, 1978.
14. Ocaml. The Ocaml Language, http://www.ocaml.org.
15. Nicolas Oury. Égalités et filtrages avec types dépendants dans le Calcul des Constructions Inductives. PhD thesis, Université Paris-Sud, September 2006. http://www.lri.fr/~noury/.
16. Polka. New Polka, http://www.irisa.fr/prive/bjeannet/ newpolka.html.
17. Emil L. Post. A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52, 1946.
18. C. Schurmann and F. Pfenning. A coverage checking algorithm for LF. In Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003), 2003.
19. The Coq Development Team. The Coq proof assistant reference manualchapter 4. Technical Report 0255, INRIA, Février 2002.
20. Twelf. TheTwelf project, http://www.cs.cmu.edu/~twelf/.
21. Daria Walukiewicz-Chrza̧szcz and Jacek Chrza̧szcz. Consistency and completeness of rewriting in the calculus of constructions. In Proceedings of IJCAR 2006, 2006.
22. Hongwei. Xi. Dependency typed pattern matching, 2003. URL citeseer.ist.psu.edu/xi03dependently.html.
23. Hongwei Xi. Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University, December 1998.