Programming with streams in Coq a case study: The sieve of eratosthenes

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

Volumn 806 LNCS, Issue , 1994, Pages 191-212

  Leclerc, Francois ^a   Paulin Mohring, Christine ^b  

^a CNRS   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; SIEVES;

CALCULUS OF CONSTRUCTION; DEPENDENT TYPES; FUNCTIONAL PROGRAMS; LAMBDA-CALCULI; PARALLEL DATAFLOW; PARAMETERIZED; SYSTEM F; TYPE THEORY;

THEOREM PROVING;

EID: 84947980044     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58085-9_77     Document Type: Conference Paper

References (24)

1. L. Boerio. Extending pruning techniques to polymorphic second order λ-calculus. In Proceedings ESOP’94, 1994.
2. C. Böhm and A. Berarducci. Automatic synthesis of typed λ-programs on term algebras. Theoretical Computer Science, 39, 1985.
3. R.L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.
4. Th. Coquand. Infinite objects in type theory. In [10], 1993.
5. Th. Coquand and G. Huet. Constructions: A higher order proof system for mechanizing mathematics. In EUROCAL’85, Linz, 1985. Springer-Verlag. LNCS 203.
6. Th. Coquand and G. Huet. Concepts mathématiques et informatiques formalisés duns le calcul des constructions. In The Paris Logic Group, editor, Logic Colloquium’ 85. North-Holland, 1987.
7. G. Dowek, A. Felty, H. Iterbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner. The Coq Proof Assistant User’s Guide Version 5.8. Rapport Technique 154, INRIA, May 1993.
8. P. Dybjer and H. Sander. A functional programming approach to the specification and verification of concurrent systemsnd verification of concurrent systems. Formal Aspects of Computing, 1:303-318, 1989.
9. H. Geuvers. Inductive and coinductive types with iteration and recursion. Faculty of Mathematics and Informatics, Catholic University Nijmegen, 1991.
10. H. Geuvers, editor. Informal Proceedings of the 1993 Workshop on Types for Proofs and Programs, 1993.
11. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press, 1989.
12. S. Hayashi. Singleton, union, intersection types for program extraction. In Proceedings of TACS’91, 1991.
13. G. Kadan. The semantics of a simple language for parallel programming. In Information Processing J. Nortli-Holland, 1974.
14. G. Kahn and D. MacQueen. Coroutines and networks of parallel processes. In B. Gilchrist, editor, Information Processing 77. North-Holland, 1977.
15. L.C. Panlson. Co-induction and co-recursion in higher-order logic, available by anonymous.
16. N. Mendler. Inductive Definition in Type Theory. PhD thesis, Cornell University, 1988.
17. N. Mendler. Predicative types universes and primitive recursion. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 173-184. Amsterdam, The Netherlands, IEEE Computer Society Press, 1991.
18. B. NordstrSm, K. Petersson, and J. Smith. Programming in Martin-Lb’f’s Type Theory. International Series of Monographs on Computer Science. Oxford Science Publications, 1990.
19. C. Parent. Developing certified programs in the system Coq - The Program tactic. Technical Report 93-29, Ecole Normale Supérieure de Lyon, October 1993. also in Proceedings of the BRA Workshop Types for Proofs and Programs, may 93.
20. M. Parigot, P. Manoury, and M. Simonot. Propre: A programming language with proofs. In A. Voronkov, editor, Logic Programming and automated reasoning, number 624 in LNCS, St. Petersburg, Russia, July 1992. Springer-Verlag.
21. ωs programs from proofs in the Calculus of Constructions. In Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, January 1989. ACM.
22. C. Paulin-Mohring. Extraction de programmes dans le Calcul des Constructions. PhD thesis, Université Paris 7, January 1989.
23. Ch. Raffalli. L’arithmétique fonctionnelle du second ordre avec points fixes. PhD thesis, Universitd Paris VII, 1994.
24. G. C. Wraith. A note on categorical data types. In D.H. Pitt, D.E. Rydeheard, P. Dybjer, A.M. Pitts, and A. Poigné, editors, Category Theory and Computer Science. Springer-Verlag, 1989. LNCS 389.