A co-iterative characterization of synchronous stream functions

Electronic Notes in Theoretical Computer Science

Volumn 11, Issue , 1998, Pages 1-21

  Caspi, Paul ^a   Pouzet, Marc ^b  

^a VERIMAG   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; OPTIMIZATION; SEMANTICS; SYNCHRONIZATION;

DATA-FLOW LANGUAGES; FUNCTIONAL PROGRAMMING; REACTIVE PROGRAMMING; SYNCHRONOUS STREAM FUNCTIONS;

ITERATIVE METHODS;

EID: 19044396240     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00050-7     Document Type: Article

References (19)

1. Ashcroft E.A., Wadge W.W. Lucid, the data-flow programming language. 1985;Academic Press
2. Benveniste A., LeGuernic P., Jacquemot Ch. Synchronous programming with events and relations: the SIGNAL language and its semantics. Science of Computer Programming. 16:1991;103-149
3. Boussinot F. Proposition de sémantique dénotationnelle pour des réseaux de processus avec mélange equitable. Theoretical Computer Science. 18:1982;173-206
4. P. Caspi. Towards recursive block diagrams. In Proc. 19th IFAC/IFIP Workshop on real-time programming, Isle of Reichenau. IFAC, June 1994.
5. Caspi P., Pouzet M. Synchronous Kahn networks. Int. Conf. on Functional Programming. May 1996;ACM SIGPLAN, Philadelphia
6. P. Caspi and M. Pouzet. A Co-iterative Characterization of Synchronous Stream Functions. Verimag Research Report, October 1997. Available at http://www-spi.lip6.fr/~pouzet
7. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language lustre. Proceedings of the IEEE, 79(9):1305-1320, 1991.
8. D. Harel and A. Pnueli. On the development of reactive systems. In Logic and Models of Concurrent Systems, volume 13 of NATO ASI Series, pages 477-498. Springer Verlag, 1985.
9. Z. Hu, H. Iwasaki and M. Takeichi. Deriving Structural Hylomorphisms From Recursive Definitions. In Int. Conf. on Functional Programming. ACM SIGPLAN, Philadelphia May 1996.
10. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. EATCS Bulletin. 62:1997;222-259
11. Kahn G. The semantics of a simple language for parallel programming. IFIP 74 Congress. 1974;North Holland, Amsterdam
12. X. Leroy. The Objective Caml system release 1.05. Documentation and user's manual. Technical report, INRIA, March 1997.
13. Milner R. A theory of type polymorphism in programming. Journal of Computer and System Science. 17:1978;348-375
14. Milner R. Calculi for synchrony and asynchrony. Theoretical Computer Science. 25:(3):July 1983;267-310
15. Miner P.S., Johnson S.D. Verification of an optimized fault-tolerant clock synchronization circuit. Designing Correct Circuits. Electronic Workshops in Computing, Bastad, Sweden :September 1996;Springer-Verlag
16. A. Mycroft. Polymorphic type schemes. In Proceedings of the Sixth International Symposium on Programming, Toulouse, volume 167 of Lecture Notes in Computer Science. Springer, April 1984.
17. C. Paulin-Mohring. Circuits as streams in Coq, verification of a sequential multiplier. Research Report 95-16, Laboratoire de l'Informatique du Parallélisme, September 1995.
18. M. H. Sørensen, R. Glück, and N. D. Jones. Towards unifying partial evaluation, deforestation, supercompilation and GPC. In European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 485-500. Springer Verlag, 1993.
19. Wadler P. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science. 73:1990;231-248