A. Aiken, Set constraints: Results, applications and future directions
DOI : 10.1007/3-540-58601-6_110

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.537

A. Aiken, D. Kozen, and E. Wimmers, Decidability of systems of set constraints with negative constraints, 1993.

A. Aiken and E. L. Wimmers, Type inclusion constraints and type inference, Proceedings of the conference on Functional programming languages and computer architecture , FPCA '93, pp.31-41, 1993.
DOI : 10.1145/165180.165188

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.1739

M. Aiken, M. Fähndrich, C. Hawblitzel, G. Hunt, and J. Larus, Deconstructing process isolation, Proceedings of the 2006 workshop on Memory system performance and correctness , MSPC '06, pp.1-10, 2006.
DOI : 10.1145/1178597.1178599

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.1184

J. Aldrich, C. Chambers, and D. Notkin, Architectural Reasoning in ArchJava, Proceedings 16th European Conf. on Object-Oriented Programming, 2002.
DOI : 10.1007/3-540-47993-7_15

R. Allen and D. Garlan, A formal basis for architectural connection, ACM Transactions on Software Engineering and Methodology, vol.6, issue.3, 1997.
DOI : 10.1145/258077.258078

URL : https://hal.archives-ouvertes.fr/hal-00444067

O. Alliance, Osgi Service Platform, Release 3, 2003.

F. Arbab, Abstract behavior types : A foundation model for components and their composition. Formal Methods for Components and Objects, pp.33-70, 2003.

J. Armstrong, Making reliable distributed systems in the presence of software errors, KTH, 2003.

K. Arnold, J. Gosling, and D. Holmes, The Java Programming Language, 2005.

N. T. Bhatti, M. A. Hiltunen, R. D. Schlichting, and W. Chiu, Coyote: a system for constructing fine-grain configurable communication services, ACM Transactions on Computer Systems, vol.16, issue.4
DOI : 10.1145/292523.292524

P. Bidinger, M. Leclercq, V. Quéma, A. Schmitt, and J. B. Stefani, Dream Types -A Domain Specific Type System for Component-Based Message- Oriented Middleware, 4th Workshop on Specification and Verification of Component-Based Systems (SAVCBS'05), in association with ESEC/F- SE'05, 2005.

P. Bidinger and J. Stefani, The Kell Calculus: Operational Semantics and Type System, Proceedings 6th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS 03), 2003.
DOI : 10.1007/3-540-47959-7_3

G. Boudol, Asynchrony and the pi-calculus, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00076939

G. Boudol, ULM: A Core Programming Model for Global Computing, Lecture Notes in Computer Science, vol.2986, pp.234-248, 2004.
DOI : 10.1007/978-3-540-24725-8_17

E. Bruneton, T. Coupaye, M. Leclercq, V. Quema, and J. B. Stefani, The Fractal Component Model and its Support in Java. Software -Practice and Experience, pp.11-12, 2006.

L. Caires and L. Cardelli, A spatial logic for concurrency (part i)

L. Cardelli, A semantics of multiple inheritance, Inf. Comput, vol.76, issue.2-3, 1988.

L. Cardelli, Structural subtyping and the notion of power type, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.70-79, 1988.
DOI : 10.1145/73560.73566

L. Cardelli, Program fragments, linking, and modularization, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.266-277, 1997.
DOI : 10.1145/263699.263735

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8472

L. Cardelli, Types for mobile ambients, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, 1999.
DOI : 10.1145/292540.292550

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.3335

L. Cardelli and A. Gordon, Mobile ambients, Foundations of Software Science and Computational Structures, 1998.
DOI : 10.1016/s0304-3975(99)00231-5

URL : http://doi.org/10.1016/s0304-3975(99)00231-5

L. Cardelli and J. Mitchell, Operations on records, Mathematical Foundations of Programming Semantics, pp.22-52, 1990.
DOI : 10.1007/bfb0040253

S. Carpineti, G. Castagna, C. Laneve, and L. Padovani, A formal account of contracts for web services. Web Services and Formal Methods, pp.148-162, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00152568

G. Castagna, J. Vitek, and F. Z. Nardelli, The Seal Calculus, Information and Computation, vol.201, issue.1, 2005.
DOI : 10.1016/j.ic.2004.11.005

URL : https://hal.archives-ouvertes.fr/hal-00152521

R. Collet, The Limits of Network Transparency in a Distributed Programming Language, 2007.

R. Collet and P. Van-roy, Failure Handling in a Network-Transparent Distributed Programming Language, Recent Advances in Exception Handling Techniques, 2006.
DOI : 10.1007/11818502_7

R. Collet, The Limits of Network Transparency in a Distributed Programming Language, 2007.

D. Conan, R. Rouvoy, and L. Seinturier, Scalable Processing of Context Information with COSMOS, Proceedings of the 7th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS'07), 2007.
DOI : 10.1109/MPRV.2002.1037720

URL : https://hal.archives-ouvertes.fr/inria-00155045

S. Conchon and F. Pottier, JOIN(X): Constraint-Based Type Inference for the Join-Calculus, 10th European Symposium on Programming Languages and Systems, 2001.
DOI : 10.1007/3-540-45309-1_15

URL : https://hal.archives-ouvertes.fr/inria-00000029

G. Coulson, G. Blair, P. Grace, A. Joolia, K. Lee et al., Open- COM v2 : A Component Model for Building Systsms Software, Proceedings of IASTED Software Engineering and Applications (SEA '04), 2004.

K. Crary and S. Weirich, Flexible type analysis, ICFP '99 : Proceedings of the fourth ACM SIGPLAN international conference on Functional programming, pp.233-248, 1999.

K. Crary, S. Weirich, and G. Morrisett, Intensional polymorphism in type-erasure semantics, ICFP '98 : Proceedings of the third ACM SIGPLAN international conference on Functional programming, pp.301-312, 1998.

L. Damas and R. Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '82, pp.207-212, 1982.
DOI : 10.1145/582153.582176

B. P. , D. , and D. Sangiorgi, Typing and subtyping for mobile processes, Mathematical Structures in Computer Science, pp.376-385, 1996.

D. Duggan and C. Sourelis, Mixin modules, ICFP '96 : Proceedings of the first ACM SIGPLAN international conference on Functional programming, pp.262-273, 1996.
DOI : 10.1145/232627.232654

J. Eker, J. Janneck, E. A. Lee, J. Liu, X. Liu et al., Taming heterogeneity - the Ptolemy approach, Proceedings of the IEEE, vol.91, issue.1, pp.127-144, 2003.
DOI : 10.1109/JPROC.2002.805829

C. Fournet and G. Gonthier, The Join Calculus: A Language for Distributed Mobile Programming, Applied Semantics, International Summer School, pp.268-332, 2002.
DOI : 10.1007/3-540-45699-6_6

C. Fournet, G. Gonthier, J. J. Levy, L. Maranget, and D. Remy, A calculus of mobile agents, Proceedings 7th International Conference on Concurrency Theory (CONCUR '96), Lecture Notes in Computer Science 1119, 1996.
DOI : 10.1007/3-540-61604-7_67

C. Fournet, C. Laneve, L. Maranget, and D. Rémy, Implicit typingàtypingà la ml for the join-calculus, Proceedings 8th International Conference on Concurrency Theory (CONCUR '97), Lecture Notes in Computer Science 1243, 1997.

D. Garlan, R. Monroe, and D. Wile, Acme, CASCON First Decade High Impact Papers on, CASCON '10, 2000.
DOI : 10.1145/1925805.1925814

P. Genevès, N. Laya¨?dalaya¨?da, and A. Schmitt, Efficient static analysis of XML paths and types, PLDI '07 : Proceedings of the 2007 ACM SIG- PLAN conference on Programming language design and implementation, pp.342-351, 2007.

J. Girard, The system F of variable types, fifteen years later, Theoretical Computer Science, vol.45, issue.2, pp.159-192, 1986.
DOI : 10.1016/0304-3975(86)90044-7

D. Grolaux, K. Glynn, and P. Van-roy, A Fault Tolerant Abstraction for Transparent Distributed Programming, Multiparadigm Programming in Mozart/Oz, 2nd International Conference, 2004.
DOI : 10.1007/978-3-540-31845-3_13

C. A. Gunter, Semantics of programming languages : structures and techniques, 1992.

S. Haridi, P. Van-roy, P. Brand, M. Mehl, R. Scheidhauer et al., Efficient logic variables for distributed computing, ACM Transactions on Programming Languages and Systems, vol.21, issue.3, 1999.
DOI : 10.1145/319301.319347

F. Henglein, Type inference with polymorphic recursion, ACM Transactions on Programming Languages and Systems, vol.15, issue.2, pp.253-289, 1993.
DOI : 10.1145/169701.169692

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.388.430

T. Hildebrandt, J. Chr, M. Godskesen, and . Bundgaard, Bisimulation congruences for homer ? a calculus of higher order mobile embedded resources, 2004.

D. Hirschkoff, T. Hirschowitz, D. Pous, A. Schmitt, and J. B. Stefani, Component-Oriented Programming with Sharing: Containment is Not Ownership, 4th International Conference on Generative Programming and Component Engineering (GPCE), 2005.
DOI : 10.1007/11561347_26

URL : https://hal.archives-ouvertes.fr/hal-00310126

C. Galen, J. R. Hunt, and . Larus, Singularity : rethinking the software stack, SIGOPS Oper. Syst. Rev, vol.41, issue.2, pp.37-49, 2007.

V. Issarny, C. Bidan, and T. Saridakis, Achieving middleware customization in a configuration-based development environment: experience with the Aster prototype, Proceedings. Fourth International Conference on Configurable Distributed Systems (Cat. No.98EX159), 1998.
DOI : 10.1109/CDS.1998.675775

Y. Jaradin, F. Spiessens, P. Van, and R. , Capability confinement by membranes, 2005.

L. Jategaonkar and J. Mitchell, ML with extended pattern matching and subtypes, Proceedings of the 1988 ACM conference on LISP and functional programming , LFP '88, pp.198-211, 1988.
DOI : 10.1145/62678.62702

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.7634

B. Jay and D. Kesner, Pure Pattern Calculus, pp.100-114, 2006.
DOI : 10.1006/inco.1996.0004

URL : https://hal.archives-ouvertes.fr/hal-00148846

J. B. Wells, Typability and type checking in System F are equivalent and undecidable, Annals of Pure and Applied Logic, vol.98, issue.1-3, pp.111-156, 1999.
DOI : 10.1016/S0168-0072(98)00047-5

A. Joolia, T. Batista, G. Coulson, and A. Gomes, Mapping ADL Specifications to an Efficient and Reconfigurable Runtime Component Platform, 5th Working IEEE/IFIP Conference on Software Architecture (WICSA'05), 2005.
DOI : 10.1109/WICSA.2005.42

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.1304

N. Kobayashi, A partially deadlock-free typed process calculus, ACM Transactions on Programming Languages and Systems, vol.20, issue.2, pp.436-482, 1998.
DOI : 10.1145/276393.278524

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.6338

N. Kobayashi, Type Systems for Concurrent Programs, 10th Anniversary Colloquium of UNU/IIST, pp.439-453
DOI : 10.1007/978-3-540-40007-3_26

E. Kohler, M. , M. , and U. , The click modular router, ACM Transactions on Computer Systems, vol.18, issue.3, 2000.
DOI : 10.1145/354871.354874

L. Bettini, V. Bono, R. De-nicola, G. Ferrari, D. Gorla et al., The Klaim Project: Theory and Practice, Global Computing : Programming Environments, Languages, Security and Analysis of Systems, number 2874 in Lecture Notes in Computer Science, 2003.
DOI : 10.1007/978-3-540-40042-4_4

M. Leclercq, A. E. Ozcan, V. Quema, and J. B. Stefani, Supporting Heterogeneous Architecture Descriptions in an Extensible Toolset, 29th International Conference on Software Engineering (ICSE'07), pp.209-219, 2007.
DOI : 10.1109/ICSE.2007.82

M. Leclercq, V. Quema, and J. B. Stefani, DREAM, Proceedings of the 3rd workshop on Adaptive and reflective middleware -, 2005.
DOI : 10.1145/1028613.1028625

URL : https://hal.archives-ouvertes.fr/hal-00881539

C. Lhoussaine, Type inference for a distributed ?-calculus, Sci. Comput. Program, vol.50, issue.1-3, 2004.

M. Lienhardt, A. Schmitt, and J. Stefani, Oz/K, Proceedings of the 6th international conference on Generative programming and component engineering , GPCE '07, pp.43-52, 2007.
DOI : 10.1145/1289971.1289980

URL : https://hal.archives-ouvertes.fr/inria-00149612

M. Lienhardt, A. Schmitt, and J. Stefani, Oz/K, Proceedings of the 6th international conference on Generative programming and component engineering , GPCE '07, 2007.
DOI : 10.1145/1289971.1289980

URL : https://hal.archives-ouvertes.fr/inria-00149612

M. Lienhardt, A. Schmitt, and J. Stefani, A type system for the Dream framework, 2007.

X. Liu, C. Kreitz, R. Van-renesse, J. Hickey, M. Hayden et al., Building Reliable, High-Performance Communication Systems from Components, ACM Symposium on Operating Systems Principles, 1999.

Y. D. Liu and S. Smith, Interaction-Based Programming with Classages, Proceedings OOPSLA, 2005.
DOI : 10.1145/1103845.1094827

D. Macqueen, Modules for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming , LFP '84, pp.198-207, 1984.
DOI : 10.1145/800055.802036

S. Maffeis, Sequence types for the pi-calculus, ITRS'04, pp.117-132, 2005.

M. Miller, Robust Composition : Towards a Unified Approach to Access Control and Concurrency Control, 2006.

R. Milner, Communication and concurrency, 1989.

R. Milner, M. Tofte, R. Harper, and D. Macqueen, The Definition of Standard ML (Revised), 1997.

R. Milner, Communicating and mobile systems : the ?-calculus, 1999.

R. Milner, M. Tofte, and R. Harper, The definition of Standard ML, 1990.

H. Miranda, A. S. Pinto, and L. Rodrigues, Appia, a flexible protocol kernel supporting multiple coordinated channels, Proceedings 21st International Conference on Distributed Computing Systems, 2001.
DOI : 10.1109/ICDSC.2001.919005

R. Morris, E. Kohler, J. Jannotti, and M. F. Kaashoek, The Click Modular Router, ACM Symposium on Operating Systems Principles, 1999.

A. Mycroft, Polymorphic type schemes and recursive definitions, Proceedings of the 6th Colloquium on International Symposium on Programming, pp.217-228, 1984.
DOI : 10.1007/3-540-12925-1_41

M. Odersky, M. Sulzmann, and M. Wehr, Type inference with constrained types, Theory and Practice of Object Systems, vol.X, issue.1, pp.35-55, 1999.
DOI : 10.1002/(SICI)1096-9942(199901/03)5:1<35::AID-TAPO4>3.0.CO;2-4

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.1443

J. Palsberg, M. Wand, and P. Keefe, Type inference with non-structural subtyping, Formal Aspects of Computing, vol.5, issue.3, pp.49-67, 1997.
DOI : 10.1007/BF01212524

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3123

H. Philipp and O. Martin, Actors that unify threads and events, Coordination Models and Languages, pp.171-190, 2007.

B. Pierce and D. Turner, Pict : A programming language based on the picalculus, Proof, Language and Interaction : Essays in Honour of Robin Milner, 2000.

E. L. Post, A variant of a recursively unsolvable problem, Bulletin of the American Mathematical Society, vol.52, issue.4, pp.264-268, 1946.
DOI : 10.1090/S0002-9904-1946-08555-9

F. Pottier, Type Inference in the Presence of Subtyping : from Theory to Practice, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00073205

F. Pottier, Simplifying Subtyping Constraints: A Theory, INFCTRL : Information and Computation (formerly Information and Control), 2001.
DOI : 10.1006/inco.2001.2963

F. Pottier, A constraint-based presentation and generalization of rows, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., p.331, 2003.
DOI : 10.1109/LICS.2003.1210073

F. Pottier and D. Rémy, The Essence of ML Type Inference Advanced Topic in Types and Programming Languages, 2005.

F. Pottier, A versatile constraint-based type inference system, Nordic J. of Computing, vol.7, issue.4, pp.312-347, 2000.

D. Rémy, Type checking records and variants in a natural extension of ML, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.77-88, 1989.
DOI : 10.1145/75277.75284

D. Rémy, Type inference for records in a natural extension of ML, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design, 1993.

A. Rossberg, The Missing Link ? Dynamic Components for ML, Int. Conf. Functional Programming (ICFP), 2006.

R. Rouvoy and P. Merle, Leveraging component-based software engineering with Fraclet, annals of telecommunications - annales des t??l??communications, vol.26, issue.1, pp.65-79, 2009.
DOI : 10.1007/s12243-008-0072-z

URL : https://hal.archives-ouvertes.fr/inria-00429714

P. Van-roy, S. Haridi, P. Brand, G. Smolka, M. Mehl et al., Mobile objects in distributed Oz, ACM Transactions on Programming Languages and Systems, vol.19, issue.5, 1997.
DOI : 10.1145/265943.265972

A. Schmitt and J. B. Stefani, The M-calculus : A Higher-Order Distributed Process Calculus, Proceedings 30th Annual ACM Symposium on Principles of Programming Languages, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072227

A. Schmitt and J. B. Stefani, The Kell Calculus: A Family of Higher-Order Distributed Process Calculi, Global Computing, 2005.
DOI : 10.1007/3-540-45694-5_19

P. Sewell, J. Leifer, K. Wansbrough, F. Zappa-nardelli, M. Allen-willians et al., Acute : High-level programming language design for distributed computation, Int. Conf. Functional Programming, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00070671

P. Sewell and J. Vitek, Secure composition of untrusted code: box ??, wrappers, and causality types, Journal of Computer Security, vol.11, issue.2, 2003.
DOI : 10.3233/JCS-2003-11202

V. Simonet, An extension of hm(x) with bounded existential and universal data-types, ICFP '03 : Proceedings of the eighth ACM SIG- PLAN international conference on Functional programming, pp.39-50, 2003.

V. Simonet, Type Inference with Structural Subtyping: A Faithful Formalization of an Efficient Constraint Solver, APLAS, pp.283-302, 2003.
DOI : 10.1007/978-3-540-40018-9_19

V. Simonet and F. Pottier, A constraint-based approach to guarded algebraic data types, ACM Transactions on Programming Languages and Systems, vol.29, issue.1, 2007.
DOI : 10.1145/1180475.1180476

G. Stoyle, M. W. Hicks, G. M. Bierman, P. Sewell, and I. Neamtiu, Mutatis mutandis : safe and predictable dynamic software updating, POPL, pp.183-194, 2005.

C. Szyperski, Component Software, 2002.

A. Unyapoth and P. Sewell, Nomadic Pict : Correct Communication Infrastructures for Mobile Computation, Proceedings ACM Int. Conf. on Principles of Programming Languages (POPL), 2001.

P. Van-roy and S. Haridi, Concepts, Techniques and Models of Computer Programming, 2004.

T. Vasco and . Vasconcelos, 9th International School on Formal Methods for the Design of Computer, Communication and Software Systems, LNCS, chapter Fundamentals of Session Types, vol.5569, pp.158-186, 2009.

M. Wand, Type inference for record concatenation and multiple inheritance, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.92-97, 1989.
DOI : 10.1109/LICS.1989.39162

URL : http://doi.org/10.1016/0890-5401(91)90050-c

S. Weirich, Higher-Order Intensional Type Analysis, 11th European Symposium on Programming Languages and Systems, 2002.
DOI : 10.1007/3-540-45927-8_8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7120

P. Wojciechowski and P. Sewell, Nomadic Pict : Language and Infrastructure, IEEE Concurrency, vol.8, issue.2, 2000.
DOI : 10.1109/4434.846193

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.2511

N. Yoshida, Channel dependent types for higher-order mobile processes, ACM SIGPLAN Notices, vol.39, issue.1, pp.147-160, 2004.
DOI : 10.1145/982962.964014

N. Yoshida and M. Hennessy, Subtyping and locality in distributed higherorder processes, Proceedings CONCUR 99, Lecture Notes in Computer Science no 1664, 1999.

N. Yoshida and M. Hennessy, Assigning types to processes, 15th Annual IEEE Symposium on Logic in Computer Science (LICS), pp.334-345, 2000.
DOI : 10.1006/inco.2002.3113

URL : http://doi.org/10.1006/inco.2002.3113

N. Yoshida and M. Hennessy, Assigning types to processes, Inf. Comput, vol.174, issue.2, 2002.

N. Yoshida and V. Vasconcelos, Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication, Electronic Notes in Theoretical Computer Science, vol.171, issue.4, 2007.
DOI : 10.1016/j.entcs.2007.02.056