Full abstraction in a subtyped pi-calculus with linear types

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

Volumn 6901 LNCS, Issue , 2011, Pages 280-296

  Demangeon, Romain ^a   Honda, Kohei ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL ADEQUACY; CONCURRENT CALCULI; CONTEXTUAL CONGRUENCE; DEFINABILITY; EMBEDDINGS; FULL ABSTRACTION; FUNCTIONAL CALCULUS; LINEAR TYPES; PI CALCULUS; PROOF METHODS; SEMANTIC ANALYSIS; SUBTYPINGS; TESTING EQUIVALENCE;

ABSTRACTING; BIOMINERALIZATION; FUNCTIONAL PROGRAMMING; OBJECT ORIENTED PROGRAMMING; SEMANTICS;

CALCULATIONS;

EID: 80052887353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23217-6_19     Document Type: Conference Paper

References (28)

1. Abadi, M., Cardelli, L.: A semantics of object types. In: LICS, pp. 332-341. IEEE Computer Society, Los Alamitos (1994)
2. Amadio, R.M., Cardelli, L.: Subtyping recursive types. ACM Trans. Program. Lang. Syst. 15(4), 575-631 (1993)
3. Berger, M., Honda, K., Yoshida, N.: Genericity and the pi-calculus. Acta. Inf. 42(2- 3), 83-141 (2005)
4. Cardelli, L., Wegner, P.: On understanding types, data abstraction, and polymorphism. ACM Comput. Surv. 17(4), 471-522 (1985)
5. Castagna, G., Nicola, R.D., Varacca, D.: Semantic subtyping for the pi-calculus. Theor. Comput. Sci. 398, 217-242 (2008)
6. Castellani, I., Hennessy, M.: Testing theories for asynchronous languages. In: Arvind, V., Ramanujam, R., (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 90-102. Springer, Heidelberg (1998)
7. Demangeon, R., Honda, K.: Full abstraction in a subtyped pi-calculus with linear types, long version (2011) (in preparation), http://perso.ens-lyon.fr/ romain.demangeon/subtyping-long.pdf
8. Dezani-Ciancaglini, M., De'Liguoro, U.: Sessions and Session Types: An Overview. In: Laneve, C., Su, J. (eds.) WS-FM 2009. LNCS, vol. 6194, pp. 1-28. Springer, Heidelberg (2010)
9. Fiore, M.P., Honda, K.: Recursive types in games: Axiomatics and process representation. In: LICS, pp. 345-356 (1998)
10. Gay, S.J., Hole, M.: Subtyping for session types in the pi calculus. Acta. Inf. 42(2- 3), 191-225 (2005)
11. Honda, K.: Composing processes. In: POPL, pp. 344-357 (1996)
12. Honda, K.: Processes and games. Electr. Notes Theor. Comput. Sci. 71 (2002)
13. Honda, K., Vasconcelos, V.T., Kubo, M.: Language primitives and type discipline for structured communication-based programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122-138. Springer, Heidelberg (1998)
14. Honda, K., Yoshida, N.: Game-theoretic analysis of call-by-value computation. Theor. Comput. Sci. 221(1-2), 393-456 (1999)
15. Laird, J.: A game semantics of the asynchronous pi-calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 51-65. Springer, Heidelberg (2005)
16. Milner, R.: Functions as processes. Mathematical Structures in Computer Science 2(2), 119-141 (1992)
17. Morris, J.H.: Lambda-Calculus Models of Programming Languages. PhD Thesis, M.I.T (1968)
18. Padovani, L.: Session types at the mirror. In: ICE, pp. 71-86 (2009)
19. Padovani, L.: Fair subtyping for multi-party session types. In: De Meuter, W., Roman, G.-C. (eds.) COORDINATION 2011. LNCS, vol. 6721, pp. 127-141. Springer, Heidelberg (2011)
20. Pierce, B.C.: Types and programming languages. MIT Press, Cambridge (2002)
21. Pierce, B.C., Sangiorgi, D.: Typing and subtyping for mobile processes. Mathematical Structures in Computer Science 6(5), 409-453 (1996)
22. Pierce, B.C., Steffen, M.: Higher-order subtyping. Theor. Comput. Sci. 176(1-2), 235-282 (1997)
23. Quaglia, P., Walker, D.: Types and full abstraction for polyadic pi-calculus. Inf. Comput. 200(2), 215-246 (2005)
24. Sangiorgi, D.,Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
25. Takeuchi, K., Honda, K., Kubo, M.: An interaction-based language and its typing system. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 398-413. Springer, Heidelberg (1994)
26. Turner, N.: The polymorphic pi-calculus: Theory and Implementation. PhD thesis, Department of Computer Science, University of Edinburgh (1996)
27. Walker, D.: Objects in the pi-calculus. Inf. Comput. 116(2), 253-271 (1995)
28. Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the Pi-Calculus. Information and Computation 191(2), 145-202 (2004)