Subset coercions in COQ

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4502 LNCS, Issue , 2007, Pages 237-252

  Sozeau, Matthieu ^a,b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONAL PROGRAMMING; SET THEORY; SPECIFICATION LANGUAGES;

COQ PROOF ASSISTANT; MATHEMATICAL CONVENTION; PROOF OBLIGATIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 38049160746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74464-1_16     Document Type: Conference Paper

References (17)

1. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development. Springer, Heidelberg (2004)
2. Shankar, N., Owre, S.: Principles and pragmatics of subtyping in PVS. In: Bert, D., Choppy, C., Mosses, P.D. (eds.) WADT 1999. LNCS, vol. 1827, pp. 37-52. Springer, Heidelberg (2000)
3. Owre, S., Shankar, N.: The formal semantics of PVS. Technical Report SRI-CSL-97-2, Computer Science Laboratory, SRI International, Menlo Park, CA (1997)
4. Parent, C.: Synthesizing proofs from programs in the Calculus of Inductive Constructions. In: Möller, B. (ed.) MPC 1995. LNCS, vol. 947, pp. 351-379. Springer, Heidelberg (1995)
5. Nordström, B., Petersson, K., Smith, J.M.: Programming in Martin-Löf's Type Theory. Oxford University Press, Oxford (1990)
6. Constable, R.L., Allen, S.F., Bromley, H., Cleaveland, W., Cremer, J., Harper, R., Howe, D.J., Knoblock, T., Mendler, N., Panangaden, P., Sasaki, J.T., Smith, S.F.: Implementing Mathematics with the Nuprl Development System. Prentice-Hall, Englewood Cliffs (1986)
7. Coquand, T., Huet, G.: The Calculus of Constructions. Inf. Comp. 76, 95-120 (1988)
8. Sozeau, M.: Russell Metatheoretic Study in Coq, experimental development (2006) http://www.lri.fr/~sozeau/research/russell/proof.en.html
9. Chen, G.: Sous-typage, Conversion de Types et Élimination de la Transitivité. PhD thesis, Université Paris VII, Laboratoire d'Informatique de l'École Normale Supérieure, Paris (1998)
10. Luo, Z.: Coercive subtyping in type theory. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol. 1258, pp. 276-296. Springer, Heidelberg (1997)
11. Adams, R.: Pure Type Systems with Judgemental Equality. Journal of Functional Programming 16, 219-246 (2006)
12. Werner, B.: On the strength of proof-irrelevant type theories. In: 3rd International Joint Conference on Automated Reasoning (2006)
13. Miquel, A., Werner, B.: The not so simple proof-irrelevant model of CC. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, pp. 240-258. Springer, Heidelberg (2003)
14. Sozeau, M.: Coercion par prédicats en Coq. Master's thesis, Université Paris VII, LRI, Orsay, extended version - (2005) http://www.lri.fr/~sozeau/research/russell/report.pdf
15. Augustsson, L.: Cayenne - A language with dependent types. In: ACM SIGPLAN International Conference on Functional Programming (ICFP), Baltimore, Maryland, pp. 239-250 (1998)
16. McBride, C., McKinna, J.: The view from the left. J. Funct. Program. 14(1), 69-111 (2004)
17. Xi, H.: Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University, Pittsburgh, Pennsylvania (1998)