{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:17:48Z","timestamp":1778249868777,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540580850","type":"print"},{"value":"9783540484400","type":"electronic"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58085-9_77","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:11:31Z","timestamp":1330251091000},"page":"191-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Programming with streams in Coq a case study: The Sieve of Eratosthenes"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Leclerc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Paulin-Mohring","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"L. Boerio. Extending pruning techniques to polymorphic second order \u03bb-calculus. In Proceedings ESOP'94, 1994.","DOI":"10.1007\/3-540-57880-3_8"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"C. B\u00f6hm and A. Berarducci. Automatic synthesis of typed \u03bb-programs on term algebras. Theoretical Computer Science, 39, 1985.","DOI":"10.1016\/0304-3975(85)90135-5"},{"key":"9_CR3","unstructured":"R.L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Th. Coquand. Infinite objects in type theory. In [10], 1993.","DOI":"10.1007\/3-540-58085-9_72"},{"key":"9_CR5","series-title":"LNCS 203","volume-title":"EUROCAL'85","author":"T. Coquand","year":"1985","unstructured":"Th. Coquand and G. Huet. Constructions: A higher order proof system for mechanizing mathematics. In EUROCAL'85, Linz, 1985. Springer-Verlag. LNCS 203."},{"key":"9_CR6","unstructured":"Th. Coquand and G. Huet. Concepts math\u00e9matiques et informatiques formalis\u00e9s dans le calcul des constructions. In The Paris Logic Group, editor, Logic Colloquium'85. North-Holland, 1987."},{"key":"9_CR7","unstructured":"G. Dowek, A. Felty, H. Herbelin, 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."},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01887211","volume":"1","author":"P. Dybjer","year":"1989","unstructured":"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\u2013318, 1989.","journal-title":"Formal Aspects of Computing"},{"key":"9_CR9","unstructured":"H. Geuvers. Inductive and coinductive types with iteration and recursion. Faculty of Mathematics and Informatics, Catholic University Nijmegen, 1991."},{"key":"9_CR10","unstructured":"H. Geuvers, editor. Informal Proceedings of the 1993 Workshop on Types for Proofs and Programs, 1993."},{"key":"9_CR11","unstructured":"J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press, 1989."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"S. Hayashi. Singleton, union, intersection types for program extraction. In Proceedings of TACS'91, 1991.","DOI":"10.1007\/3-540-54415-1_71"},{"key":"9_CR13","unstructured":"G. Kahn. The semantics of a simple language for parallel programming. In Information Processing 74. North-Holland, 1974."},{"key":"9_CR14","unstructured":"G. Kahn and D. MacQueen. Coroutines and networks of parallel processes. In B. Gilchrist, editor, Information Processing 77. North-Holland, 1977."},{"key":"9_CR15","unstructured":"L.C. Paulson. Co-induction and co-recursion in higher-order logic. available by anonymous ftp."},{"key":"9_CR16","unstructured":"N. Mendler. Inductive Definition in Type Theory. PhD thesis, Cornell University, 1988."},{"key":"9_CR17","first-page":"173","volume-title":"Predicative types universes and primitive recursion","author":"N. Mendler","year":"1991","unstructured":"N. Mendler. Predicative types universes and primitive recursion. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 173\u2013184. Amsterdam, The Netherlands, IEEE Computer Society Press, 1991."},{"key":"9_CR18","unstructured":"B. Nordstr\u00f6m, K. Petersson, and J. Smith. Programming in Martin-L\u00f6f's Type Theory.International Series of Monographs on Computer Science. Oxford Science Publications, 1990."},{"key":"9_CR19","unstructured":"C. Parent. Developing certified programs in the system Coq-The Program tactic. Technical Report 93-29, Ecole Normale Sup\u00e9rieure de Lyon, October 1993. also in Proceedings of the BRA Workshop Types for Proofs and Programs, may 93."},{"key":"9_CR20","volume-title":"Logic Programming and automated reasoning, number 624 in LNCS","author":"M. Parigot","year":"1992","unstructured":"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."},{"key":"9_CR21","volume-title":"Sixteenth Annual ACM Symposium on Principles of Programming Languages","author":"C. Paulin-Mohring","year":"1989","unstructured":"C. Paulin-Mohring. Extracting F\u03c9's programs from proofs in the Calculus of Constructions. In Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, January 1989. ACM."},{"key":"9_CR22","unstructured":"C. Paulin-Mohring. Extraction de programmes dans le Calcul des Constructions. PhD thesis, Universit\u00e9 Paris 7, January 1989."},{"key":"9_CR23","unstructured":"Ch. Raffalli. L'arithm\u00e9tique fonctionnelle du second ordre avec points fixes. PhD thesis, Universit\u00e9 Paris VII, 1994."},{"key":"9_CR24","unstructured":"G. C. Wraith. A note on categorical data types. In D.H. Pitt, D.E. Rydeheard, P. Dybjer, A.M. Pitts, and A. Poign\u00e9, editors, Category Theory and Computer Science. Springer-Verlag, 1989. LNCS 389."}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58085-9_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:59:56Z","timestamp":1778248796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-58085-9_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580850","9783540484400"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-58085-9_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}