References

  1. Luca Cardelli & Cosimo Laneve (2011): Reversible structures. In: CMSB. ACM, pp. 131–140, doi:10.1145/2037509.2037529.
  2. I. Cristescu, J. Krivine & D. Varacca (2013): A Compositional Semantics for the Reversible p-Calculus. In: LICS. IEEE, pp. 388–397, doi:10.1109/LICS.2013.45.
  3. Vincent Danos & Jean Krivine (2004): Reversible Communicating Systems. In: CONCUR, LNCS 3170. Springer, pp. 292–307, doi:10.1007/978-3-540-28644-8_19.
  4. Vincent Danos & Jean Krivine (2007): Formal Molecular Biology Done in CCS-R. Electr. Notes Theor. Comput. Sci. 180(3), pp. 31–49, doi:10.1016/j.entcs.2004.01.040.
  5. E. Giachino, I. Lanese, C.A. Mezzina & F. Tiezzi (2013): Causal-Consistent Reversibility in a Tuple-Based Language. Technical Report. http://www.cs.unibo.it/~lanese/work/klaimrev-TR.pdf.
  6. I. Lanese, C.A. Mezzina, A. Schmitt & J. Stefani (2011): Controlling Reversibility in Higher-Order Pi. In: CONCUR, LNCS 6901. Springer, pp. 297–311, doi:10.1007/978-3-642-23217-6_20.
  7. I. Lanese, C.A. Mezzina & J. Stefani (2010): Reversing Higher-Order Pi. In: CONCUR, LNCS 6269. Springer, pp. 478–493, doi:10.1007/978-3-642-15375-4_33.
  8. Iain C. C. Phillips & Irek Ulidowski (2007): Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1-2), pp. 70–96, doi:10.1016/j.jlap.2006.11.002.
  9. Francesco Tiezzi & Nobuko Yoshida (2014): Towards Reversible Sessions. Technical Report. http://cse.lab.imtlucca.it/~tiezzi/papers/places2014_full.pdf.
  10. N. Yoshida & V.T. Vasconcelos (2007): Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication. Electr. Notes Theor. Comput. Sci. 171(4), pp. 73–93, doi:10.1016/j.entcs.2007.02.056.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org