References

1. Lorenzo Bettini, Mario Coppo, Loris D'Antoni, Marco De Luca, Mariangiola Dezani-Ciancaglini & Nobuko Yoshida (2008): Global Progress in Dynamically Interleaved Multiparty Sessions. In: CONCUR'08, LNCS 5201. Springer, pp. 418–433, doi:10.1007/978-3-540-85361-9_33.
2. Viviana Bono, Chiara Messa & Luca Padovani (2011): Typing Copyless Message Passing. In: ESOP'11, LNCS 6602. Springer, pp. 57–76, doi:10.1007/978-3-642-19718-5_4.
3. Luca Cardelli, Simone Martini, John C. Mitchell & Andre Scedrov (1994): An Extension of System F with Subtyping. Information and Computation 109(1/2), pp. 4–56, doi:10.1006/inco.1994.1013.
4. Giuseppe Castagna, Mariangiola Dezani-Ciancaglini, Elena Giachino & Luca Padovani (2009): Foundations of Session Types. In: PPDP'09. ACM, pp. 219–230, doi:10.1145/1599410.1599437.
5. Dario Colazzo & Giorgio Ghelli (2005): Subtyping, recursion, and parametric polymorphism in kernel Fun. Information and Computation 198(2), pp. 71–147, doi:10.1016/j.ic.2004.11.003.
6. Mariangiola Dezani-Ciancaglini, Sophia Drossopoulou, Elena Giachino & Nobuko Yoshida (2007): Bounded Session Types for Object-Oriented Languages. In: FMCO'06, LNCS 4709. Springer, pp. 207–245, doi:10.1007/978-3-540-74792-5_10.
7. Manuel Fähndrich, Mark Aiken, Chris Hawblitzel, Orion Hodson, Galen Hunt, James R. Larus & Steven Levi (2006): Language support for fast and reliable message-based communication in Singularity OS. In: EuroSys'06. ACM, pp. 177–190, doi:10.1145/1217935.1217953.
8. Simon Gay (2008): Bounded polymorphism in session types. Mathematical Structures in Computer Science 18(5), pp. 895–930, doi:10.1017/S0960129508006944.
9. Simon Gay & Vasco T. Vasconcelos (2010): Linear type theory for asynchronous session types. Journal of Functional Programming 20(01), pp. 19–50, doi:10.1017/S0956796809990268.
10. Kohei Honda (1993): Types for dyadic interaction. In: CONCUR'93, LNCS 715. Springer, pp. 509–523, doi:10.1007/3-540-57208-2_35.
11. Kohei Honda, Vasco T. Vasconcelos & Makoto Kubo (1998): Language primitives and type disciplines for structured communication-based programming. In: ESOP'98, LNCS 1381. Springer, pp. 122–138, doi:10.1007/BFb0053567.
12. Galen Hunt, James Larus, Martín Abadi, Mark Aiken, Paul Barham, Manuel Fähndrich, Chris Hawblitzel, Orion Hodson, Steven Levi, Nick Murphy, Bjarne Steensgaard, David Tarditi, Ted Wobber & Brian Zill (2005): An Overview of the Singularity Project. Technical Report MSR-TR-2005-135. Microsoft Research.
13. Microsoft (2004): Singularity design note 5: Channel contracts. Technical Report. Microsoft Research. Available at http://www.codeplex.com/singularity..
14. Peter W. O'Hearn, John C. Reynolds & Hongseok Yang (2001): Local Reasoning about Programs that Alter Data Structures. In: CSL'01, LNCS 2142. Springer, pp. 1–19, doi:10.1007/3-540-44802-0_1.
15. Zachary Stengel & Tevfik Bultan (2009): Analyzing singularity channel contracts. In: ISSTA'09. ACM, pp. 13–24, doi:10.1145/1572272.1572275.
16. Jules Villard (2011): Heaps and Hops. Laboratoire Spécification et Vérification, ENS Cachan, France.
17. Jules Villard, Étienne Lozes & Cristiano Calcagno (2009): Proving Copyless Message Passing. In: APLAS'09, LNCS 5904. Springer, pp. 194–209, doi:10.1007/978-3-642-10672-9_15.
18. Jules Villard, Étienne Lozes & Cristiano Calcagno (2010): Tracking Heaps That Hop with Heap-Hop. In: TACAS'10, LNCS 6015. Springer, pp. 275–279, doi:10.1007/978-3-642-12002-2_23.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org