Feasible reactivity in a synchronous -calculus

PPDP'07: Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2007, Pages 221-230

  Amadio, Roberto M ^a   Dabrowski, Frédéric ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b INRIA   (France)

Author keywords

Concurrency; Reactivity; Resources control

Indexed keywords

BRANCH AND BOUND METHOD; CONCURRENCY CONTROL; DIFFERENTIATION (CALCULUS); PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; STATIC ANALYSIS;

FEASIBLE REACTIVITY; RESOURCES CONTROL; SYNCHRONOUS PROGRAM;

LOGIC PROGRAMMING;

EID: 34548066064     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273920.1273951     Document Type: Conference Paper

References (20)

1. R. Amadlo. The SL synchronous language, revisited. Journal of Logic and Algebraic Programming, 70:121-150, 2007.
2. R. Amadio. A synchronous π-calculus. Technical Report, Université Paris 7, Laboratoire PPS, June 2006. http://hal.ccsd.cnrs.fr/ PPS/. Information and Computation, in press.
3. R. Amadio, G. Boudol, F. Baussinot and I. Castellani. Reactive programming, revisited. In Proc. Workshop on Algebraic Process Calculi: the first 25 years and beyond, Electronic Notes in Theoretical Computer Science, 162:49-60, 2006.
4. R. Amadio. Synthesis of max-plus quasi-interpretations. In Fundamenta Informatkae, 65(1-2):29-60, 2005.
5. R. Amadio, S. Dal-Zilio. Resource control for synchronous cooperative threads. In Theoret. Comp. Sci, 358:229-254, 2006.
6. R. Amadio, F. Dabrowski. Feasible reactivity for synchronous cooperative threads. In Proc. EXPRESS, ENTCS, 154(3), 2006.
7. S. Bellantoni. and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97-110, 1992.
8. G. Berry and G. Gonthier, The Esterel synchronous programming language. Science of computer programming, 19(2):87-152, 1992.
9. G. Bonfante, J.-Y. Marion, and J.-Y. Moyen. On termination methods with space bound certifications. In Proc. Perspectives of System Informatics, Springer LNCS 2244, 2001.
10. F. Boussinot and R. De Simone, The SL Synchronous Language. IEEE Trans. on Software Engineering, 22(4):256-266, 1996.
11. A. Cobham. The intrinsic computational difficulty of functions. In Proc. Logic, Methodology, and Philosophy of Science II, North Holland, 1965.
12. M. Hofmann. The strength of non size-increasing computation. In Proc. ACM-POPL, 2002.
13. N. Jones. Computability and complexity, from a programming perspective. MIT-Press, 1997.
14. D. Leivant. Predicative recurrence and computational complexity i: word recurrence and poly-time. Feasible mathematics II, Clote and Remmel (eds.), Birkhäuser:320-343, 1994.
15. L. Mandel and M. Pouzet. ReactiveML, a reactive extension to ML. In Proc. ACM Principles and Practice of Declarative Programming, 2005.
16. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
17. Reactive Programming, INRIA, Mimosa Project, http://www-sop.inria.fr/ mimosa/rp.
18. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts 1-2. Information and Computation, 100(1):1-77, 1992.
19. R. Amadio and F. Dabrowski. Feasible reactivity in a synchronous pi-calculus. Technical Report, Université Paris 7, Laboratoire PPS, June 2006. http://hal.ccsd.cnrs.fr/PPS/.
20. M. Serrano, F. Boussinot, and B. Serpette. Scheme fair threads. In Proc. ACM Principles and practice of declarative programming, 2004.