Filters on coInductive streams, an application to Eratosthenes' sieve

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 102-115

  Bertot, Yves ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; MATHEMATICAL MODELS; NUMBER THEORY; PROBLEM SOLVING; RECURSIVE FUNCTIONS; THEOREM PROVING;

CO-RECURSIVE FUNCTIONS; COINDUCTIVE STREAMS; ERATOSTHENE'S SIEVE; PRIME NUMBERS;

ELECTRIC FILTERS;

EID: 24944450386     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_9     Document Type: Conference Paper

References (21)

1. Yves Bertot and Pierre Castéran. Interactive Theorem Proving and Program Development, Coq'Art: the Calculus of Inductive Constructions. Springer-Verlag, 2004.
2. Ana Bove. Simple general recursion in type theory. Nordic Journal of Computing, 8(1):22-42, 2001.
3. Rod M. Burstall and John Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, 1977.
4. Pierre Castéran and Davy Rouillard. Reasoning about parametrized automata. In Proceedings, 8-th International Conference on Real-Time System, volume 8, pages 107-119, 2000.
5. Thierry Coquand. Infinite objects in Type Theory. In Henk Barendregt and Tobias Nipkow, editors, Types for Proofs and Programs, volume 806 of LNCS, pages 62-78. Springer Verlag, 1993.
6. Solange Coupet-Grimal. An axiomatization of linear temporal logic in the calculus of inductive constructions. Journal of Logic and Computation, 13(6):801-813, 2003.
7. Antony J. T. Davie. An introduction to functional programming systems using Haskell. Cambridge Computer Science texts. Cambridge University Press, 1992.
8. Pietro di Gianantonio and Marino Miculan. A unifying approach to recursive and corecursive definitions. In Herman Geuvers and Freek Wiedijk, editors, Types for Proofs and Programs, volume 2646 of LNCS, pages 148-161. Springer Verlag, 2003.
9. Pietro di Gianantonio and Marino Miculan. Unifying recursive and co-recursive definitions in sheaf categories. In Igora Walukiewicz, editor, Foundations of Software Science and Computation Structures (FOSSACS'04), volume 2987 of LNCS. Springer Verlag, 2004.
10. Gilles Dowek, Amy Felty, Hugo Herbelin, Gérard Huet, Chet Murthy, Catherine Parent, Christine Paulin-Mohring, and Benjamin Werner. The Coq Proof Assistant User's Guide. INRIA, May 1993. Version 5.8.
11. Catherine Dubois and Véronique Viguié Donzeau-Gouge. A step towards the mechanization of partial functions: domains as inductive predicates, July 1998. www.cs.bham.ac.uk/~mmk/cade98-partiality.
12. Eduardo Giménez. Codifying guarded definitions with recursive schemes. In Peter Dybjer, Bengt Nordström, and Jan Smith, editors, Types for proofs and Programs, volume 996 of LNCS, pages 39-59. Springer Verlag, 1994.
13. Eduardo Giménez. An application of co-inductive types in Coq: Verification of the alternating bit protocol. In Proceedings of the 1995 Workshop on Types for Proofs and Programs, volume 1158 of Lecture Notes in Computer Science, pages 135-152. Springer-Verlag, 1995.
14. P. Hudak, S. Peyton Jones, P. Wadler, et al. Report on the Programming Language Haskell. Yale University, New Haven, Connecticut, USA, 1992. Version 1.2.
15. Gilles Kahn and David B. MacQueen. Coroutines and networks of parallel processes. In IFIP Congress 77, pages 993-998. North-Holland, 1977.
16. François Leclerc and Christine Paulin-Mohring. Programming with streams in coq. A case study: the sieve of Eratosthenes. In Henk Barendregt and Tobias Nipkow, editors, Types for Proofs and Progams, volume 806 of LNCS, pages 191-212. Springer Verlag, 1993.
17. Pierre Letouzey. A new extraction for Coq. In Herman Geuvers and Freek Wiedijk, editors, TYPES 2002, volume 2646 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
18. Milad Niqui. Formalising Exact Arithmetic, Representations, Algorithms, and Proofs. PhD thesis, University of Nijmegen, September 2004. ISBN 90-9018333-7.
19. Christine Paulin-Mohring. Inductive Definitions in the System Coq - Rules and Properties. In M. Bezem and J.-F. Groote, editors, Proceedings of the conference Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science, 1993. LIP research report 92-49.
20. Christine Paulin-Mohring and Benjamin Werner. Synthesis of ML programs in the system Coq. Journal of Symbolic Computation, 15:607-640, 1993.
21. David A. Turner. SASL Language Manual. St. Andrews University Department of Computer Science, 1976.