A. Adir, H. Attiya, and G. Shurek, Information-flow models for shared memory with an application to the powerPC architecture, IEEE Transactions on Parallel and Distributed Systems, vol.14, issue.5, pp.502-515, 2003.
DOI : 10.1109/TPDS.2003.1199067

A. Ahmed, R. B. Findler, J. Matthews, and P. Wadler, Blame for all, STOP, 2009.

J. Alglave, A. Fox, S. Ishtiaq, M. Myreen, S. Sarkar et al., The semantics of power and ARM multiprocessor machine code, Proceedings of the 4th workshop on Declarative aspects of multicore programming, DAMP '09, 2009.
DOI : 10.1145/1481839.1481842

J. Alglave, L. Maranget, S. Sarkar, and P. Sewell, Litmus: Running Tests against Hardware, TACAS, 2011.
DOI : 10.1145/1785414.1785443
URL : https://hal.archives-ouvertes.fr/hal-01100851

D. Ancona, G. Lagorio, and E. Zucca, TYPE INFERENCE FOR POLYMORPHIC METHODS IN JAVA-LIKE LANGUAGES, Theoretical Computer Science, 2007.
DOI : 10.1142/9789812770998_0014

C. Anderson and S. Drossopoulou, BabyJ, Electronic Notes in Theoretical Computer Science, vol.82, issue.8, 2003.
DOI : 10.1016/S1571-0661(04)80802-8
URL : http://doi.org/10.1016/s1571-0661(04)80802-8

J. Aycock, Aggressive type inference, International Python Conference, 2000.

B. E. Aydemir, A. Bohannon, M. Fairbairn, J. N. Foster, B. C. Pierce et al., Mechanized Metatheory for the Masses: The PoplMark Challenge, TPHOLs, 2005.
DOI : 10.1007/11541868_4

M. Batty, K. Memarian, S. Owens, S. Sarkar, and P. Sewell, Clarifying and compiling C/C++ concurrency: from C++11 to POWER, POPL, 2012.

P. Becker, Standard for Programming Language C++ -ISO/IEC 14882, 2011.

N. Benton and C. Hur, Biorthogonality, step-indexing and compiler correctness, ICFP, 2009.

S. Blazy and X. Leroy, Mechanized Semantics for the Clight Subset of the C Language, Journal of Automated Reasoning, vol.29, issue.6, pp.263-288, 2009.
DOI : 10.1007/s10817-009-9148-3
URL : https://hal.archives-ouvertes.fr/inria-00352524

H. Boehm and S. Adve, Foundations of the C++ concurrency memory model, PLDI, 2008.

G. Bracha, Pluggable type systems, OOPSLA04, Workshop on Revival of Dynamic Languages, 2004.

G. Bracha and D. Griswold, Strongtalk: Typechecking Smalltalk in a production environment, OOPSLA, 1993.

S. D. Brookes, Full Abstraction for a Shared-Variable Parallel Language, Information and Computation, vol.127, issue.2, pp.145-163, 1996.
DOI : 10.1006/inco.1996.0056

P. Camphuijsen, J. Hage, and S. Holdermans, Soft typing PHP, 2009.

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, 1988.
DOI : 10.1145/73560.73566

R. Cartwright, User-defined data types as an aid to verifying LISP programs, ICALP, 1976.

R. Cartwright and M. Fagan, Soft Typing, PLDI, 1991.

G. Castagna, J. Vitek, and F. Z. Nardelli, The Seal Calculus, Information and Computation, vol.201, issue.1, pp.1-54, 2005.
DOI : 10.1016/j.ic.2004.11.005
URL : https://hal.archives-ouvertes.fr/hal-00152521

A. Charguéraud, Annotated bibliography for formalization of lambda-calculus and type theory, 2006.

D. Dice, Java memory model concerns on Intel and AMD systems, 2008.

E. Eide and J. Regehr, Volatiles are miscompiled, and what to do about it, Proceedings of the 7th ACM international conference on Embedded software, EMSOFT '08, 2008.
DOI : 10.1145/1450058.1450093

R. B. Findler and M. Felleisen, Contracts for higher-order functions, ICFP, 2002.

C. Flanagan, Hybrid type checking, POPL, 2006.

C. Flanagan, ValleyScript: It's like static typing, 2007.

C. Fournet, G. Gonthier, J. Lévy, L. Maranget, and D. Rémy, A calculus of mobile agents, CONCUR, 1996.
DOI : 10.1007/3-540-61604-7_67

C. Fournet, N. Guts, and F. Z. Nardelli, A Formal Implementation of Value Commitment, ESOP, 2008.
DOI : 10.1007/978-3-540-78739-6_29

M. Furr, J. Hoon-an, J. Foster, and M. Hicks, Static type inference for Ruby, Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, 2009.
DOI : 10.1145/1529282.1529700

K. E. Gray, R. B. Findler, and M. Flatt, Fine-grained interoperability through mirrors and contracts, OOPSLA, 2005.
DOI : 10.1145/1103845.1094830
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.8325

N. Guts, Auditability for security protocols, 2011.

N. Guts, C. Fournet, and F. Z. Nardelli, Reliable Evidence: Auditability by Typing, Esorics, 2009.
DOI : 10.1016/S0140-3664(02)00049-X

D. Herman, A. Tomb, and C. Flanagan, Space-efficient gradual typing, TFP, 2007.
DOI : 10.1007/s10990-011-9066-z

A. Hobor, A. W. Appel, and F. Z. Nardelli, Oracle Semantics for Concurrent Separation Logic, ESOP, 2008.
DOI : 10.1007/978-3-540-78739-6_27

A. Holkner and J. Harland, Evaluating the dynamic behaviour of Python applications, ACSC, 2009.

A. S. Inc, ActionScript 3.0 Language and Components Reference, 2008.

M. Johnson, Memoization in top-down parsing, Comput. Linguist, vol.21, issue.3, pp.405-417, 1995.

S. Kahrs, Mistakes and ambiguities in the definition of Standard ML, 1993.

A. Kennedy, N. Benton, J. B. Jensen, and P. Dagand, Coq, Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP '13, 2013.
DOI : 10.1145/2505879.2505897
URL : https://hal.archives-ouvertes.fr/hal-01081548

G. Klein, T. Nipkow, and L. Paulson, The Archive of Formal Proofs, 2009.

G. Lagorio and E. Zucca, Just: safe unknown types in Java-like languages., The Journal of Object Technology, vol.6, issue.2, 2007.
DOI : 10.5381/jot.2007.6.2.a4

X. Leroy, Formal certification of a compiler back-end, or: programming a compiler with a proof assistant, POPL, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000963

X. Leroy, Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, pp.107-115, 2009.
DOI : 10.1145/1538788.1538814
URL : https://hal.archives-ouvertes.fr/inria-00415861

X. Leroy, A Formally Verified Compiler Back-end, Journal of Automated Reasoning, vol.27, issue.1, pp.363-446, 2009.
DOI : 10.1007/s10817-009-9155-4
URL : https://hal.archives-ouvertes.fr/inria-00360768

X. Leroy, The Objective Caml system release 4.01: Documentation and user's manual, 2013.

. Lngen, Tool support for locally nameless representations, 2009.

M. Merro and F. Z. Nardelli, Behavioral theory for mobile ambients, Journal of the ACM, vol.52, issue.6, pp.961-1023, 2005.
DOI : 10.1145/1101821.1101825

R. Milner, Communication and Concurrency, 1989.

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

R. Morisset, P. Pawan, and F. Z. Nardelli, Compiler testing via a theory of sound optimisations in the C11/C++11 memory model, PLDI, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909083

G. Morrisett, G. Tan, J. Tassarotti, J. Tristan, and E. Gan, Rocksalt: better, faster, stronger sfi for the x86, PLDI, 2012.

S. Nyström, A soft-typing system for Erlang, Proceedings of the 2003 ACM SIGPLAN workshop on Erlang , ERLANG '03, 2003.
DOI : 10.1145/940880.940888

S. Owens, P. Böhm, F. Z. Nardelli, and P. Sewell, Lem: A Lightweight Tool for Heavyweight Semantics, ITP, 2011.
DOI : 10.1007/978-3-540-68237-0_21

S. Owens, S. Sarkar, and P. Sewell, A Better x86 Memory Model: x86-TSO, TPHOLs, 2009.
DOI : 10.1007/11817963_46

S. Owens, S. Sarkar, and P. Sewell, A better x86 memory model: x86-TSO (extended version), 2009.

S. Owens, S. Sarkar, and P. Sewell, The x86-TSO model

G. Peskine, S. Sarkar, P. Sewell, and F. Z. Nardelli, Binding and substitution (note), 2007.

G. Richards, S. Lebresne, B. Burg, and J. Vitek, An analysis of the dynamic behavior of javascript programs, PLDI, 2010.

A. Rossberg, Defects in the revised definition of Standard ML, 2001.

S. Sarkar, P. Sewell, J. Alglave, L. Maranget, and D. Williams, Understanding POWER multiprocessors, PLDI, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01100824

S. Sarkar, P. Sewell, F. Zappa-nardelli, S. Owens, T. Ridge et al., The semantics of x86-CC multiprocessor machine code, POPL, 2009.

J. Sevcik, Program Transformations in Weak Memory Models, 2008.

J. Sevcik, Safe optimisations for shared-memory concurrent programs, PLDI, 2011.

J. Sevcik, V. Vafeiadis, F. Zappa-nardelli, S. Jagannathan, and P. Sewell, Relaxedmemory concurrency and verified compilation, POPL, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00907801

J. Sevcik, V. Vafeiadis, F. Zappa-nardelli, S. Jagannathan, and P. Sewell, Compcerttso: A verified compiler for relaxed-memory concurrency, J. ACM, vol.60, issue.3, p.22, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909076

P. Sewell, On implementations and semantics of a concurrent programming language, In CONCUR, 1997.
DOI : 10.1007/3-540-63141-0_27

P. Sewell, J. J. Leifer, K. Wansbrough, F. Zappa-nardelli, M. Allen-williams et al., Acute: High-level programming language design for distributed computation. design rationale and language definition, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00070671

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

P. Sewell, J. J. Leifer, K. Wansbrough, F. Zappa-nardelli, M. Allen-williams et al., Acute: High-level programming language design for distributed computation, Journal of Functional Programming, vol.17, pp.4-5547, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070671

P. Sewell, S. Sarkar, S. Owens, F. Z. Nardelli, and M. O. Myreen, x86-TSO, Communications of the ACM, vol.53, issue.7, pp.89-97, 2010.
DOI : 10.1145/1785414.1785443

P. Sewell, F. Zappa-nardelli, S. Owens, G. Peskine, T. Ridge et al., Ott: Effective tool support for the working semanticist, Journal of Functional Programming, vol.8, issue.01, pp.71-122, 2010.
DOI : 10.1007/BFb0035382

P. Sewell, F. Zappa-nardelli, S. Owens, G. Peskine, T. Ridge et al., Ott: Effective tool support for the working semanticist, ICFP, 2007.

J. Siek and W. Taha, Gradual Typing for Objects, ECOOP, 2007.
DOI : 10.1007/978-3-540-73589-2_2

J. Siek and P. Wadler, Threesomes, with and without blame, STOP, 2009.

J. G. Siek, Gradual Typing for Functional Languages, Scheme and Functional Programming Workshop, 2006.

J. G. Siek, R. Garcia, and W. Taha, Exploring the Design Space of Higher-Order Casts, ESOP, 2009.
DOI : 10.1007/978-3-642-00590-9_2

J. G. Siek and M. Vachharajani, Gradual typing with unification-based inference, Proceedings of the 2008 symposium on Dynamic languages, DLS '08, 2008.
DOI : 10.1145/1408681.1408688

M. Sperber, R. K. Dybvig, M. Flatt, A. Van-straaten, R. Findler et al., Revised 6 report on the algorithmic language Scheme, 2007.

E. Stephenson, Perl Runs Sweden's Pension System. O'Reilly Media, 2001.

S. Tobin-hochstadt and M. Felleisen, Interlanguage migration, Companion to the 21st ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications , OOPSLA '06, 2006.
DOI : 10.1145/1176617.1176755

S. Tobin-hochstadt and M. Felleisen, The design and implementation of Typed Scheme, POPL, 2008.

C. Urban and C. Kaliszyk, General bindings and alpha-equivalence in nominal isabelle, Logical Methods in Computer Science, vol.8, issue.2, p.2012

V. Vafeiadis and F. Z. Nardelli, Verifying Fence Elimination Optimisations, SAS, 2011.
DOI : 10.1145/42190.42277
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.9669

P. Wadler and R. B. Findler, Well-Typed Programs Can???t Be Blamed, ESOP, 2009.
DOI : 10.1007/978-3-642-00590-9_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6379

U. Wiger, Four-fold increase in productivity and quality, Workshop on Formal Design of Safety Critical Embedded Systems, 2001.

A. Wright and R. Cartwright, A practical soft type system for Scheme, Conference on LISP and Functional programming, pp.250-262, 1994.

T. Wrigstad, F. Zappa-nardelli, S. Lebresne, J. Ostlund, and J. Vitek, Integrating typed and untyped code in a scripting language, POPL, 2010.

X. Yang, Y. Chen, E. Eide, and J. Regehr, Finding and understanding bugs in C compilers, PLDI, 2011.