A constructive denotational semantics for Kahn networks in Coq

From Semantics to Computer Science: Essays in Honour of Gilles Kahn

Volumn 9780521518253, Issue , 2009, Pages 383-414

  Paulin Mohring, Christine ^a  

^a INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; EMBEDDED SYSTEMS; PARALLEL PROGRAMMING; SEMANTIC WEB; SEMANTICS;

COMPLETE PARTIAL ORDERS; COQ PROOF ASSISTANT; DENOTATIONAL SEMANTICS; INTERACTIVE ENVIRONMENTS; PARALLEL PROGRAM; SCIENTIFIC CONTRIBUTIONS; SEMANTICS OF PROGRAMMING LANGUAGES; SYNCHRONOUS PROGRAM;

THEOREM PROVING;

EID: 84927007144     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511770524.018     Document Type: Chapter

References (15)

1. P. Audebaud and C. Paulin-Mohring. Proofs of randomized algorithms in Coq. In T. Uustalu (ed.) Mathematics of Program Construction, MPC 2006, volume 4014, Lecture Notes in Computer Science, Kuressaare, Estonia, July 2006. Springer-Verlag, 2006.
2. P. Audebaud and C. Paulin-Mohring. Proofs of randomized algorithms in Coq. To appear in Science of Computer Programming.
3. Y. Bertot. Filters on coinductive streams, an application to Eratosthenes’sieve. In P. Urzyczyn (ed.) International Conference of Typed Lambda Calculi and Applications, volume 3461, Lecture Notes in Computer Science, pp. 102–115. Springer-Verlag, 2005.
4. Y. Bertot and P. Castéran. Interactive Theorem Proving and Program Development. Springer-Verlag, 2004.
5. S. Boulmé and G. Hamon. Certifying synchrony for free. In International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), volume 2250, Lecture Notes in Artificial Intelligence, La Havana, Cuba, December 2001. Springer-Verlag, 2001. Short version of A clocked denotational semantics for Lucid-Synchrone in Coq, available as a Technical Report (LIP6), at www.lri.fr/∼pouzet.
6. V. Capretta. General recursion via coinductive types. Logical Methods in Computer Science, 1(2:1):1–28, 2005.
7. P. Caspi and M. Pouzet. Synchronous Kahn Networks. In ACM SIGPLAN International Conference on Functional Programming, Philadelphia, Pensylvania, May 1996.
8. A. Cohen, M. Duranton, C. Eisenbeis, C. Pagetti, F. Plateau and M. Pouzet. N-Synchronous Kahn networks: a relaxed model of synchrony for real-time systems. In ACM International Conference on Principles of Programming Languages (POPL’06), Charleston, South Carolina, USA, January 2006.
9. B. Courcelle, G. Kahn and J. Vuillemin. Algorithmes d’équivalence et de réduction à des expressions minimales dans une classe d’équations récursives simples. In J. Loeckx (ed.) Automata, Languages and Programming, volume 14, Lecture Notes in Computer Science, pp. 200–213. Springer-Verlag, 1974. Translation from French by T. Veldhuizen with original text, a few comments and additional references.
10. N. Halbwachs, P. Caspi, P. Raymond and D. Pilaud. The synchronous dataflow programming language lustre. Proceedings of the IEEE, 79(9):1305–1320, 1991.
11. G. Kahn. The semantics of a simple language for parallel programming. In Information Processing 74. North-Holland, 1974.
12. G. Kahn and D. MacQueen. Coroutines and networks of parallel processes. In B. Gilchrist (ed.) Information Processing 77. North-Holland, 1977.
13. G. Kahn and G.D. Plotkin. Concrete domains. Theoretical Computer Science, 121(1& 2):187–277, 1993.
14. D. Pilaud, P. Caspi, N. Halbwachs and J. Plaice. Lustre: a declarative language for programming synchronous systems. In 14th ACM Conference on Principles of Programming Languages, pp. 178–188, Munich, January 1987.
15. The Coq Development Team. The Coq Proof Assistant Reference Manual – Version V8.1, July 2006. http://coq.inria.fr.