A coinductive calculus for asynchronous side-effecting processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6914 LNCS, Issue , 2011, Pages 276-287

  Goncharov, Sergey ^a   Schröder, Lutz ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT FRAMEWORK; ATOMIC STEP; AXIOMATISATION; BASE LANGUAGE; CONCURRENT PROCESS; FINAL COALGEBRAS; MONADIC ENCAPSULATION; MUTUAL EXCLUSIONS; PARALLEL COMPOSITION; SIDE EFFECT; SOUNDNESS AND COMPLETENESS; VERIFICATION LOGIC; WORKED EXAMPLES;

COMPUTATION THEORY;

CALCULATIONS;

EID: 80052404592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22953-4_24     Document Type: Conference Paper

References (35)

1. Bartels, F.: Generalised coinduction. Math. Structures In Comp. Sci. 13(2), 321-348 (2003)
2. Benton, N., Hyland, M.: Traced premonoidal categories. ITA 37(4), 273-299 (2003)
3. Bergstra, J.A., Klop, J.W.: The algebra of recursively defined processes and the algebra of regular processes. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 82-94. Springer, Heidelberg (1984)
4. Capretta, V.: General recursion via coinductive types. Logical Methods in Computer Science 1(2) (2005)
5. Cenciarelli, P., Moggi, E.: A syntactic approach to modularity in denotational semantics. Technical report, Category Theory and Computer Science (1993)
6. Cockett, J.R.B.: Introduction to distributive categories. Mathematical Structures in Computer Science 3(3), 277-307 (1993)
7. Crole, R.L., Pitts, A.M.: New foundations for fixpoint computations. In: Logic in Computer Science, LICS 1990, pp. 489-497. IEEE Computer Society Press, Los Alamitos (1990)
8. De Roever,W.P., De Boer, F.S.,Hannemann, U., Hooman, J., Lakhnech, Y., Poel,M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge University Press, Cambridge (2001)
9. Erkök, L., Launchbury, J.: Recursive monadic bindings. In: ICFP 2000, pp. 174-185. ACM, New York (2000)
10. Filinski, A.: On the relations between monadic semantics. Theor. Comp. Sci. 375, 41-75 (2007)
11. Fiore, M.P., Moggi, E., Sangiorgi, D.: A fully abstract model for the π-calculus. Inf. Comput. 179(1), 76-117 (2002)
12. Goncharov, S.: Kleene monads. PhD thesis, Universität Bremen (2010)
13. Harrison, W.L.: The essence of multitasking. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 158-172. Springer, Heidelberg (2006)
14. Harrison, W.L., Hook, J.: Achieving information flow security through monadic control of effects. J. Computer Security 17, 599-653 (2009)
15. Hennessy, M., Plotkin, G.D.: Full abstraction for a simple parallel programming language. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 108-120. Springer, Heidelberg (1979)
16. Jacobs, B.: From coalgebraic to monoidal traces. Electron. Notes Theor. Comput. Sci. 264(2), 125-140 (2010)
17. Jacobs, B., Poll, E.: Coalgebras and Monads in the Semantics of Java. Theoret. Comput. Sci. 291, 329-349 (2003)
18. Krstić, S., Launchbury, J., Pavlovi, D.P.: Categories of processes enriched in final coalgebras. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 303-317. Springer, Heidelberg (2001) (Pubitemid 33254638)
19. Milius, S., Palm, T., Schwencke, D.: Complete iterativity for algebras with effects. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 34-48. Springer, Heidelberg (2009)
20. Milner, R.: Communication and concurrency. Prentice-Hall, Inc, Englewood Cliffs (1989)
21. Moggi, E.: Notions of computation and monads. Inf. Comput. 93, 55-92 (1991)
22. Nicola, R.D., Hennessy, M.: Testing equivalence for processes. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 548-560. Springer, Heidelberg (1983)
23. Papaspyrou, N., Macos, D.: A study of evaluation order semantics in expressions with side effects. J. Funct. Program. 10(3), 227-244 (2000)
24. Peyton Jones, S. (ed.): Haskell 98 Language and Libraries - The Revised Report. Cambridge (2003);
25. also: J. Funct. Programming 13, 2003.
26. Plotkin, G., Power, J.: Semantics for algebraic operations. In: Mathematical Foundations of Programming Semantics, MFPS 2001. ENTCS, vol. 45 (2001)
27. Rosenthal, K.I.: Quantales and their applications. Pitman Research Notes in Mathematics Series, vol. 234. Longman Scientific & Technical (1990)
28. Rutten, J.: Universal coalgebra: A theory of systems. Theoret. Comput. Sci. 249, 3-80 (2000)
29. Schröder, L., Mossakowski, T.: Monad-independent dynamic logic in HasCASL. J. Logic Comput. 14, 571-619 (2004)
30. Schröder, L., Mossakowski, T.: HasCASL: Integrated higher-order specification and program development. Theor. Comput. Sci. 410(12-13), 1217-1260 (2009)
31. Syme, D., Granicz, A., Cisternino, A.: Expert F#. Apress (2007)
32. Tolmach, A.P., Antoy, S.: A monadic semantics for core Curry. In: WFLP 2003. ENTCS, vol. 86(3), pp. 16-34 (2003)
33. Uustalu, T.: Generalizing substitution. ITA 37(4), 315-336 (2003)
34. Wadler, P.: How to declare an imperative. ACM Computing Surveys 29, 240-263 (1997)
35. Worrell, J.: Terminal sequences for accessible endofunctors. In: Coalgebraic Methods in Computer Science, CMCS 1999. ENTCS, vol. 19 (1999)