F. Achermann and O. Nierstrasz, A calculus for reasoning about software composition, Theoretical Computer Science, vol.331, issue.2-3, 2005.
DOI : 10.1016/j.tcs.2004.09.022

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

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, pp.213-249, 1997.
DOI : 10.1145/258077.258078

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

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, 1998.
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/FSE'05, 2005.

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. 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

C. Carrez, A. Fantechi, and E. Najm, Behaviour contracts for a sound assembly of components, Lecture Notes in Computer Science, vol.2767, 2003.

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

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.

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

J. and R. Hindley, Basic simple type theory, 1997.
DOI : 10.1017/CBO9780511608865

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

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

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, 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.

M. Lumpe, F. Achermann, and O. Nierstrasz, A Formal Language for Composition, chapter 4, 2000.

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

H. Makholm and J. B. Wells, Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close, 14th European Symposium on Programming, 2005.
DOI : 10.1007/978-3-540-31987-0_27

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.

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

B. Pierce and D. Turner, Pict: A programming language based on the pi-calculus, 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, A 3-Part Type Inference Engine, Proceedings of the 2000 European Symposium on Programming, pp.320-335, 2000.
DOI : 10.1007/3-540-46425-5_21

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

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

A. Reid, M. Flatt, L. Stoller, J. Lepreau, and E. Eide, Knit: Component Composition for Systems Software, Proceedings of the 4th Symposium on Operating Systems Design and Implementation, 2000.

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. 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

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

C. Szyperski, Component Software, 2002.

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

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

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