L. Coq-sur-paris and .. , Chagall (1958) Contents 4.1 Partial Type Equivalences, p.85

.. Diving-into-the-generated-term, 98 * This is joint work

[. Benton and N. Tabareau, Compiling functional types to relational specifications for low level imperative code, Proceedings of the 4th international workshop on Types in language design and implementation, TLDI '09, 2009.
DOI : 10.1145/1481861.1481864

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

P. Dagand, N. Tabareau, and . Tanter, Partial Type Equivalences for Verified Dependent Interoperability, 21st ACM SIGPLAN International Conference on Functional Programming, 2016.
DOI : 10.1145/2951913.2951933

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

I. Figueroa, T. Schrijvers, N. Tabareau, and . Tanter, Compositional reasoning about aspect interference, Proceedings of the 13th international conference on Modularity, MODULARITY '14, 2014.
DOI : 10.1145/2577080.2577093

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

I. Figueroa, N. Tabareau, and . Tanter, Effect Capabilities for Haskell, Brazilian Symposium on Programming Languages (SBLP), 2014.
DOI : 10.1007/978-3-319-11863-5_7

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

I. Figueroa, N. Tabareau, and . Tanter, Effective Aspects: A Typed Monadic Embedding of Pointcuts and Advice. Transactions on Aspect- Oriented Software Development, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00872782

I. Figueroa, N. Tabareau, and . Tanter, Effect capabilities for Haskell: Taming effect interference in monadic programming, Science of Computer Programming, vol.119, 2015.
DOI : 10.1016/j.scico.2015.11.010

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

A. Hirschowitz, T. Hirschowitz, and N. Tabareau, Wild omega- Categories for the Homotopy Hypothesis in Type Theory, Leibniz International Proceedings in Informatics (LIPIcs), pp.226-240, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01178301

G. Jaber, P. Lewertowski, M. Pédrot, N. Sozeau, and . Tabareau, The Definitional Side of the Forcing, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, 2016.
DOI : 10.1145/2933575.2935320

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

G. Jaber, N. Tabareau, and M. Sozeau, Extending Type Theory with Forcing, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.395-404, 2012.
DOI : 10.1109/LICS.2012.49

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

N. Tabareau, A theory of distributed aspects, Proceedings of the Eighth International Conference on Aspect-Oriented Software Development, AOSD '10, pp.133-144, 2010.
DOI : 10.1145/1739230.1739246

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

N. Tabareau, Aspect oriented programming, Proceedings of the 10th international workshop on Foundations of aspect-oriented languages, FOAL '11, 2011.
DOI : 10.1145/1960510.1960514

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

N. Tabareau, A monadic interpretation of execution levels and exceptions for AOP, Proceedings of the 11th annual international conference on Aspect-oriented Software Development, AOSD '12, 2012.
DOI : 10.1145/2162049.2162059

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

[. Tabareau, I. Figueroa, and . Tanter, A typed monadic embedding of aspects, Proceedings of the 12th annual international conference on Aspect-oriented software development, AOSD '13, 2013.
DOI : 10.1145/2451436.2451457

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

[. Tanter and N. Tabareau, Gradual certified programming in Coq, Proceedings of the 11th ACM Dynamic Languages Symposium (DLS 2015), pp.26-40, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01238774

S. Awodey and A. Bauer, Propositions as [Types], Journal of Logic and Computation, vol.14, issue.4, pp.447-471, 2004.
DOI : 10.1093/logcom/14.4.447

P. Avgustinov, A. Simon-christensen, L. Hendren, S. Kuzins, J. Lhoták et al., abc, Proceedings of the 4th international conference on Aspect-oriented software development , AOSD '05, pp.293-334, 2006.
DOI : 10.1145/1052898.1052906

I. Aracic, V. Gasiunas, M. Mezini, and K. Ostermann, An Overview of CaesarJ, Transactions on Aspect-Oriented Software Development, pp.135-173
DOI : 10.1007/3-540-45429-2_1

T. Altenkirch and A. Kaposi, Type theory in type theory using quotient inductive types, Proceedings of the 43rd Annual ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages, 2016.
DOI : 10.1145/2914770.2837638

URL : http://dl.acm.org/ft_gateway.cfm?id=2837638&type=pdf

C. Angiuli, E. Morehouse, R. Daniel, R. Licata, and . Harper, Homotopical patch theory, ICFP 2014, pp.243-256, 2014.

[. Altenkirch, C. Mcbride, and W. Swierstra, Observational equality, now!, Proceedings of the 2007 workshop on Programming languages meets program verification , PLPV '07, pp.57-68, 2007.
DOI : 10.1145/1292597.1292608

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

T. Altenkirch and O. Rypacek, A Syntactical Approach to Weak omega-Groupoids, Computer Science Logic (CSL'12), pp.16-30, 2012.

M. Bezem and T. Coquand, A Kripke model for simplicial sets, Theoretical Computer Science, vol.574, issue.C, pp.86-91, 2015.
DOI : 10.1016/j.tcs.2015.01.035

[. Benton, L. Cardelli, and C. Fournet, Modern concurrency abstractions for C#, ACM Transactions on Programming Languages and Systems, vol.26, issue.5, pp.769-804, 2004.
DOI : 10.1145/1018203.1018205

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

[. Bezem, T. Coquand, and S. Huber, A model of type theory in cubical sets, 2013.

[. Barthe, V. Capretta, and O. Pons, Setoids in type theory, Journal of Functional Programming, vol.13, issue.02, pp.261-293, 2003.
DOI : 10.1017/S0956796802004501

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

M. Bezem, T. Coquand, and E. Parmann, Non-Constructivity in Kan Simplicial Sets, 13th International Conference on Typed Lambda Calculi and Applications of Leibniz International Proceedings in Informatics (LIPIcs), pp.92-106, 2015.

J. Bénabou, Introduction to bicategories, Reports of the Midwest Category Seminar, pp.1-77, 1967.
DOI : 10.1007/BF01451367

F. Bañados, R. Garcia, and . Tanter, A theory of gradual effect systems, Proceedings of the 19th ACM SIGPLAN Conference on Functional Programming, pp.283-295, 2014.

[. Bernardy and M. Lasson, Realizability and Parametricity in Pure Type Systems, Foundations of Software Science and Computational Structures, pp.108-122, 2011.
DOI : 10.1007/978-3-642-19805-2_8

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

E. Brady, C. Mcbride, and J. Mckinna, Inductive Families Need Not Store Their Indices, chapter Inductive Families Need Not Store Their Indices, pp.115-129, 2004.
DOI : 10.1007/978-3-540-24849-1_8

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

[. Navarro, M. Südholt, W. Vanderperren, D. Bruno-de-fraine, and . Suvée, Explicitly distributed AOP using AWED, Proceedings of the 5th international conference on Aspect-oriented software development , AOSD '06, pp.51-62, 2006.
DOI : 10.1145/1119655.1119665

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

L. D. , B. Navarro, M. Südholt, W. Vanderperren, and B. Verheecke, Modularization of distributed web services using AWED, Proceedings of the 8th International Symposium on Distributed Objects and Applications (DOA'06, pp.1449-1466, 2006.

A. Brunel, Transformations de «forcing» et algèbres de «monitoring», 2014.

E. Bodden and V. Stolz, Tracechecks: Defining Semantic Interfaces with Temporal Logic, Proceedings of the 5th International Symposium on Software Composition, pp.147-162, 2006.
DOI : 10.1007/11821946_10

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

[. Bodden, E. Tanter, and M. Inostroza, Join point interfaces for safe and flexible decoupling of aspects, ACM Transactions on Software Engineering and Methodology, vol.23, issue.1, pp.1-7, 2014.
DOI : 10.1145/2559933

C. Cohen, T. Coquand, S. Huber, and A. Mörtberg, Cubical Type Theory: a constructive interpretation of the univalence axiom, 2016. To appear in post-proceedings of Types for Proofs and Programs, 2015.

M. Curti, P. Degano, and C. T. Baldari, Causal ??-Calculus for Biochemical Modelling, Computational Methods in Systems Biology, pp.21-34
DOI : 10.1007/3-540-36481-1_3

M. Cohen, A. Dénès, and . Mörtberg, Refinements for Free!, Proceedings of the 3rd International Conference on Certified Programs and Proofs (CPP 2013), pp.147-162, 2013.
DOI : 10.1007/978-3-319-03545-1_10

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

P. Curien, R. Garner, and M. Hofmann, Revisiting the categorical interpretation of dependent type theory, Theoretical Computer Science, vol.546, pp.99-119, 2014.
DOI : 10.1016/j.tcs.2014.03.003

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

H. Chen, COCA: Computation Offload to Clouds Using AOP, 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012), pp.466-473, 2012.
DOI : 10.1109/CCGrid.2012.98

A. Chlipala, Certified Programming with Dependent Types, 2013.

C. Clifton and G. T. Leavens, MiniMAO 1 : An imperative core language for studying aspect-oriented reasoning, Science of Computer Programming, vol.63, pp.312-374, 2006.
DOI : 10.1016/j.scico.2006.02.009

URL : http://doi.org/10.1016/j.scico.2006.02.009

E. Cheng and T. Leinster, Weak ?-categories via terminal coalgebras. arXiv preprint, 2012.

J. Paul and . Cohen, Set theory and the continuum hypothesis, 1966.

T. Disney and C. Flanagan, Gradual information flow typing, International Workshop on Scripts to Programs, 2011.

E. Bruno-de-fraine, M. Ernst, and . Südholt, Essential AOP, Proceedings of the 24th European Conference on Object-oriented Programming (ECOOP 2010), number 6183 in Lecture Notes in Computer Science, pp.101-125, 2010.
DOI : 10.1145/2362389.2362391

G. Duzan, J. Loyall, R. Schantz, R. Shapiro, and J. Zinky, Building adaptive distributed applications with middleware and aspects, Proceedings of the 3rd international conference on Aspect-oriented software development , AOSD '04, pp.66-73
DOI : 10.1145/976270.976280

[. Dagand and C. Mcbride, Transporting functions across ornaments, Proceedings of the 17th ACM SIGPLAN Conference on Functional Programming (ICFP 2012), pp.103-114, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00922581

B. Delaware, C. Pit-claudel, J. Gross, and A. Chlipala, Fiat: Deductive synthesis of abstract data types in a proof assistant, Proceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.689-700, 2015.

[. Dutchyn, D. B. Tucker, and S. Krishnamurthi, Semantics and scoping of aspects in higher-order languages, Science of Computer Programming, vol.63, issue.3, pp.207-239, 2006.
DOI : 10.1016/j.scico.2006.01.003

[. Elrad, R. E. Filman, and A. Bader, Aspect-oriented programming, Communications of the ACM, vol.44, issue.10, 2001.

R. Bruce, F. , and M. Felleisen, Contracts for higher-order functions, Proceedings of the 7th ACM SIGPLAN Conference on Functional Programming, pp.48-59, 2002.

]. C. Fg96a, G. Fournet, and . Gonthier, The reflexive CHAM and the join-calculus, pp.372-385, 1996.

[. Fournet and G. Gonthier, The reflexive chemical abstract machine and the join-calculus, Proceedings of POPL'96, pp.372-385, 1996.

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

[. Fournet, F. L. Fessant, L. Maranget, and A. Schmitt, JoCaml: A Language for Concurrent Distributed and Mobile Programming, Advanced Functional Programming, pp.129-158, 2003.
DOI : 10.1007/978-3-540-44833-4_5

C. Fournet, C. Laneve, L. Maranget, and D. Rémy, Inheritance in the join calculus, The Journal of Logic and Algebraic Programming, vol.57, issue.1-2, pp.23-70, 2003.
DOI : 10.1016/S1567-8326(03)00040-7

[. Fennell and P. Thiemann, Gradual Security Typing with References, 2013 IEEE 26th Computer Security Foundations Symposium, pp.224-239, 2013.
DOI : 10.1109/CSF.2013.22

R. Garcia, A. M. Clark, and . Tanter, Abstracting gradual typing, Proceedings of the 43rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.429-442, 2016.
DOI : 10.1145/2837614.2837670

G. Gonthier and A. Mahbouhi, An introduction to small scale reflection in Coq, Journal of Formalized Reasoning Bibliography, vol.3, issue.117, pp.95-152, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00515548

L. Gasiunas, M. Satabin, A. Mezini, J. Núñez, and . Noyé, EScala, Proceedings of the tenth international conference on Aspect-oriented software development, AOSD '11, pp.227-240, 2011.
DOI : 10.1145/1960275.1960303

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

H. Herbelin, A Constructive Proof of Dependent Choice, Compatible with Classical Logic, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.365-374, 2012.
DOI : 10.1109/LICS.2012.47

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

E. Hilsdale and J. Hugunin, Advice weaving in AspectJ, Proceedings of the 3rd international conference on Aspect-oriented software development , AOSD '04, pp.26-35
DOI : 10.1145/976270.976276

M. Hofmann and T. Streicher, The groupoid interpretation of type theory, Venice Festschrift, pp.83-111, 1996.

S. Huber, Canonicity for cubical type theory, 2016.

[. Haller and T. Van-cutsem, Implementing Joins Using Extensible Pattern Matching, Proceedings of the 10th International Conference on Coordination Models and Languages, pp.135-152, 2008.
DOI : 10.1007/978-3-540-68265-3_9

]. J. Hyl91 and . Hyland, First steps in synthetic domain theory, Proceedings of the International Conference on Category Theory, pp.131-156, 1991.

[. Jagadeesan, A. Jeffrey, and J. Riely, Typed parametric polymorphism for aspects, Science of Computer Programming, vol.63, issue.3, pp.267-296, 2006.
DOI : 10.1016/j.scico.2006.02.008

G. Jaber, P. Lewertowski, M. Pédrot, N. Sozeau, and . Tabareau, The Definitional Side of the Forcing, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, 2016.
DOI : 10.1145/2933575.2935320

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

[. Jaber, N. Tabareau, and M. Sozeau, Extending Type Theory with Forcing, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.395-404, 2012.
DOI : 10.1109/LICS.2012.49

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

[. Knowles and C. Flanagan, Hybrid type checking, ACM Transactions on Programming Languages and Systems, vol.32, issue.2, 2010.
DOI : 10.1145/1667048.1667051

[. Ko and J. Gibbons, Relational algebraic ornaments, Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming, DTP '13, pp.37-48, 2013.
DOI : 10.1145/2502409.2502413

G. Kiczales, E. Hilsdale, J. Hugunin, M. Kersten, J. Palm et al., An Overview of AspectJ, Proceedings of the 15th European Conference on Object-Oriented Programming number 2072 in Lecture Notes in Computer Science, pp.327-353, 2001.
DOI : 10.1007/3-540-45337-7_18

. Kil-+-96-]-g, J. Kiczales, J. Irwin, J. Lamping, C. V. Loingtier et al., Aspect oriented programming, In Special Issues in Object- Oriented Programming. Max Muehlhaeuser, 1996.

G. Kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. Lopes et al., Aspect-oriented programming, pp.220-242, 1997.

[. Kapulkin, P. Lefanu-lumsdaine, and V. Voevodsky, The simplicial model of univalent foundations, 2012.

G. Kiczales and M. Mezini, Aspect-oriented programming and modular reasoning, Proceedings of the 27th international conference on Software engineering (ICSE 2005), pp.49-58, 2005.
DOI : 10.1109/icse.2005.1553547

[. Krivine, Classical logic, storage operators and second-order lambda-calculus, Annals of Pure and Applied Logic, vol.68, issue.1, pp.53-78, 1994.
DOI : 10.1016/0168-0072(94)90047-7

URL : http://doi.org/10.1016/0168-0072(94)90047-7

J. Krivine, Realizability in classical logic. Panoramas et synthèses, pp.197-229, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00154500

]. J. Kri11 and . Krivine, Realizability algebras: a program to well order R, Logical Methods in Computer Science, vol.7, issue.3, pp.1-47, 2011.

X. Leroy, Formal certification of a compiler back-end or, ACM SIGPLAN Notices, vol.41, issue.1, pp.42-54, 2006.
DOI : 10.1145/1111320.1111042

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

P. Letouzey, Programmation fonctionnelle certifiée ? L'extraction de programmes dans l'assistant Coq, 2004.

[. Levy, Call-by-push-value, 2001.
DOI : 10.1007/978-94-007-0954-6

M. [. Licata and . Shulman, Calculating the Fundamental Group of the Circle in Homotopy Type Theory, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.223-232, 2013.
DOI : 10.1109/LICS.2013.28

[. Leger, E. Tanter, and R. Douence, Modular and flexible causality control on the Web, Science of Computer Programming, vol.78, issue.9, 2012.
DOI : 10.1016/j.scico.2012.11.005

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

Z. Luo, ECC, an extended calculus of constructions, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.386-395, 1989.
DOI : 10.1109/LICS.1989.39193

J. Lurie, Higher topos theory Annals of mathematics studies, 2009.

R. [. Mdhaffar, E. Halima, M. Juhnke, and . Jmaiel, AOP4CSM: An Aspect-Oriented Programming Approach for Cloud Service Monitoring, 2011 IEEE 11th International Conference on Computer and Information Technology, pp.363-370, 2011.
DOI : 10.1109/CIT.2011.67

C. Mcbride, Ornamental algebras, algebraic ornaments, 2010.

J. Matthews and R. B. Findler, Operational semantics for multilanguage programs, Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.3-10, 2007.
DOI : 10.1145/1498926.1498930

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

]. A. Miq11a and . Miquel, Forcing as a program transformation, Proceedings of the 26th Symposium on Logic in Computer Science (LICS'11), pp.197-206, 2011.

A. Miquel, Forcing as a Program Transformation, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.197-206, 2011.
DOI : 10.1109/LICS.2011.47

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

H. Masuhara, G. Kiczales, and C. Dutchyn, A Compilation and Optimization Model for Aspect-Oriented Programs, Proceedings of Compiler Construction (CC2003), pp.46-60, 2003.
DOI : 10.1007/3-540-36579-6_4

S. Maclane and I. Moerdijk, Sheaves in Geometry and Logic, 1992.

E. Moggi, Notions of computation and monads. Information and Computation, pp.55-92, 1991.

[. Mishra-linger and T. Sheard, Erasure and Polymorphism in Pure Type Systems, 11th International Conference on Foundations of Software Science and Computational Structures (FOSSACS), pp.350-364, 2008.
DOI : 10.1007/978-3-540-78499-9_25

[. Nishizawa, S. Chiba, and M. Tatsubori, Remote pointcut ? a language construct for distributed AOP, Lieberherr [Lie04], pp.7-15

C. D. Bruno, T. Oliveira, W. R. Schrijvers, and . Cook, EffectiveAdvice: discplined advice with explicit effects, AOSD 2010 [AOS10], pp.109-120

[. Osera, V. Sjöberg, and S. Zdancewic, Dependent interoperability, Proceedings of the sixth workshop on Programming languages meets program verification, PLPV '12, pp.3-14, 2012.
DOI : 10.1145/2103776.2103779

M. Obrovac and C. Tedeschi, Experimental Evaluation of a Hierarchical Chemical Computing Platform, International Journal of Networking and Computing, vol.3, issue.1, pp.37-54, 2013.
DOI : 10.15803/ijnc.3.1_37

[. Ou, G. Tan, Y. Mandelbaum, and D. Walker, Dynamic Typing with Dependent Types, Proceedings of the IFIP International Conference on Theoretical Computer Science, pp.437-450, 2004.
DOI : 10.1007/1-4020-8141-3_34

URL : http://cis.ksu.edu/~xou/publications/tcs04.pdf

[. Pazat, T. Priol, and C. Tedeschi, Towards a chemistryinspired middleware to program the internet of services, ERCIM News, issue.34, p.85, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00600706

R. Pawlak, L. Seinturier, L. Duchien, G. Florin, F. Legond-aubry et al., JAC: an aspect-based distributed dynamic framework, Software: Practice and Experience, vol.34, issue.12, pp.1119-1148, 2004.
DOI : 10.1002/spe.605

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

J. Riely and M. Hennessy, A typed language for distributed mobile processes, Proceedings of POPL'98, pp.378-390, 1998.
DOI : 10.1145/268946.268978

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

[. Rondon, M. Kawaguchi, and R. Jhala, Liquid types, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.159-169, 2008.
DOI : 10.1145/1379022.1375602

[. Swierstra and J. Alpuim, From proposition to program -embedding the refinement calculus in Coq, Proceedings of the 13th International Symposium on Functional and Logic Programming, pp.29-44, 2016.

G. Scherer, Multi-focusing on extensional rewriting with sums, 13th International Conference on Typed Lambda Calculi and Applications Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.317-331, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01235372

W. G. Sgr-+-10-]-kevin-sullivan, H. Griswold, Y. Rajan, Y. Song, M. Cai et al., Modular aspect-oriented design with XPIs, ACM Transactions on Software Engineering and Methodology, vol.20, issue.2, 2010.

[. Soares, E. Laureano, and P. Borba, Implementing distribution and persistence aspects with AspectJ, Proceedings of the 17th International Conference on Object-Oriented Programming Systems, Languages and Applications, pp.174-190, 2002.
DOI : 10.1145/582419.582437

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

[. Sekiyama, Y. Nishida, and A. Igarashi, Manifest contracts for datatypes, Proceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.195-207, 2015.
DOI : 10.1145/2775051.2676996

M. Sozeau and N. Oury, First-Class Type Classes, LNCS, vol.5170, pp.278-293, 2008.
DOI : 10.1007/11542384_8

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

[. Sozeau, Program-ing Finger Trees in Coq, ICFP'07, pp.13-24, 2007.

[. Steimann, T. Pawlitzki, S. Apel, and C. Kästner, Types and modularity for implicit invocation with implicit announcement, ACM Transactions on Software Engineering and Methodology, vol.20, issue.1, 2010.
DOI : 10.1145/1767751.1767752

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

J. Siek and W. Taha, Gradual typing for functional languages, Proceedings of the Scheme and Functional Programming Workshop, pp.81-92, 2006.

[. Steimann, The paradoxical success of aspect-oriented programming, Proceedings of the 21st ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA 2006), pp.481-497, 2006.

[. Tabareau, A theory of distributed aspects, Proceedings of the Eighth International Conference on Aspect-Oriented Software Development, AOSD '10, pp.133-144
DOI : 10.1145/1739230.1739246

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

E. Tanter, J. Fabry, R. Douence, J. Noyé, and M. Südholt, Scoping strategies for distributed aspects, Science of Computer Programming, vol.75, issue.12, pp.1235-1261, 2010.
DOI : 10.1016/j.scico.2010.06.011

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

[. Tabareau, I. Figueroa, and . Tanter, A typed monadic embedding of aspects, Proceedings of the 12th annual international conference on Aspect-oriented software development, AOSD '13, pp.171-184, 2013.
DOI : 10.1145/2451436.2451457

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

M. Tierney, Sheaf theory and the continuum hypothesis, LNM, vol.274, pp.13-42, 1972.
DOI : 10.1007/BFb0073963

E. Truyen and W. Joosen, Run-time and atomic weaving of distributed aspects. Transactions on Aspect-Oriented Software Development II, pp.147-181, 2006.

T. Trimble, What are 'fundamental n-groupoids' ? seminar at DPMMS, Cambridge, 1999.

[. Tanter and R. Toledo, A Versatile Kernel for Distributed AOP, Proceedings of the IFIP International Conference on Distributed Applications and Interoperable Systems, pp.316-331, 2006.
DOI : 10.1007/11773887_25

P. Wadler, How to replace failure by a list of successes, Proc. Of a Conference on Functional Programming Languages and Computer Architecture, pp.113-128, 1985.

P. Wadler and S. Blott, How to make ad-hoc polymorphism less ad hoc, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.60-76, 1989.
DOI : 10.1145/75277.75283

[. Williams, P. Dagand, and D. Rémy, Ornaments in practice Sets in types, types in sets, José Pedro Magalhães and Tiark Rompf Proceedings of the 10th ACM SIGPLAN Workshop on Generic Programming Theoretical aspects of computer software, pp.15-24, 1997.

G. Mitchell-wand, C. Kiczales, and . Dutchyn, A semantics for advice and dynamic join points in aspect-oriented programming, ACM Transactions on Programming Languages and Systems, vol.26, issue.5, pp.890-910, 2004.
DOI : 10.1145/1018203.1018208

[. Walker, S. Zdancewic, and J. Ligatti, A theory of aspects, Proceedings of the 8th ACM SIGPLAN Conference on Functional Programming (ICFP 2003), pp.127-139, 2003.