V. Danos, J. Feret, W. Fontana, R. Harmer, and J. Krivine, Rule-Based Modelling and Model Perturbation, In Transactions on Computational Systems Biology XI, vol.450, issue.7170, pp.116-137, 2009.
DOI : 10.1038/nature05998
URL : https://hal.archives-ouvertes.fr/inria-00528364

R. Harmer, Rule-based Modelling and Tunable Resolution, Electronic Proceedings in Theoretical Computer Science, vol.9, pp.65-72, 2009.
DOI : 10.4204/EPTCS.9.8
URL : https://hal.archives-ouvertes.fr/hal-00694488

A. Basso-blandin, W. Fontana, and R. Harmer, A knowledge representation meta-model for rule-based modelling of signalling networks, Electronic Proceedings in Theoretical Computer Science, vol.204, pp.47-59, 2016.
DOI : 10.4204/EPTCS.204.5
URL : https://hal.archives-ouvertes.fr/hal-01468117

]. S. Abramsky, K. Honda, and G. Mccusker, A fully abstract game semantics for general references, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), pp.334-344, 1998.
DOI : 10.1109/LICS.1998.705669

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930
URL : http://doi.org/10.1006/inco.2000.2930

S. Abramsky and G. Mccusker, Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions, Algol-like languages, pp.297-329, 1997.
DOI : 10.1016/s1571-0661(05)80398-6
URL : http://doi.org/10.1016/s1571-0661(05)80398-6

S. Awodey, Category theory, 2010.
DOI : 10.1093/acprof:oso/9780198568612.001.0001

F. Baader, The Description Logic handbook: theory, implementation and applications, 2003.
DOI : 10.1017/CBO9780511711787

S. D. Brookes and A. W. Roscoe, An improved failures model for communicating processes, International Conference on Concurrency, pp.281-305, 1984.
DOI : 10.1007/3-540-15670-4_14
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=2512&context=compsci

P. Clairambault, Logique et interaction: uné etude sémantique de la totalité, 2010.

P. Clairambault and R. Harmer, Totality in arena games. Annals of pure and applied logic, pp.673-689, 2010.
DOI : 10.1016/j.apal.2009.07.016
URL : https://hal.archives-ouvertes.fr/hal-00443535

P. R. Cohen, DARPA's Big Mechanism program, Physical Biology, vol.12, issue.4, p.45008, 2015.
DOI : 10.1088/1478-3975/12/4/045008

T. Coquand, A semantics of evidence for classical arithmetic, The Journal of Symbolic Logic, vol.54, issue.01, pp.325-337, 1995.
DOI : 10.1007/BFb0079691

A. Corradini, D. Duval, R. Echahed, F. Prost, and L. Ribeiro, AGREE ??? Algebraic Graph Rewriting with Controlled Embedding, International Conference on Graph Transformation, pp.35-51, 2015.
DOI : 10.1007/978-3-319-21145-9_3
URL : https://hal.archives-ouvertes.fr/hal-01403189

A. Corradini, T. Heindel, F. Hermann, and B. König, Sesqui-Pushout Rewriting, International Conference on Graph Transformation, pp.30-45, 2006.
DOI : 10.1007/11841883_4

A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel et al., ALGEBRAIC APPROACHES TO GRAPH TRANSFORMATION ??? PART I: BASIC CONCEPTS AND DOUBLE PUSHOUT APPROACH, Handbook of Graph Grammars, pp.163-246, 1997.
DOI : 10.1142/9789812384720_0003

P. Curien, Categorical combinators, sequential algorithms, and functional programming, Birkhaüser Boston, 1993.
DOI : 10.1007/978-1-4612-0317-9

P. Curien, Definability and Full Abstraction, Electronic Notes in Theoretical Computer Science, vol.172, pp.301-310, 2007.
DOI : 10.1016/j.entcs.2007.02.011
URL : https://hal.archives-ouvertes.fr/hal-00144692

V. Danos, J. Feret, W. Fontana, R. Harmer, and J. Krivine, Rule-Based Modelling of Cellular Signalling, pp.17-41, 2007.
DOI : 10.1007/978-3-540-74407-8_3
URL : https://hal.archives-ouvertes.fr/hal-00164297

V. Danos, J. Féret, W. Fontana, R. Harmer, and J. Krivine, Investigation of a Biological Repair Scheme, International Workshop on Membrane Computing, pp.1-12, 2008.
DOI : 10.1063/1.2836156
URL : https://hal.archives-ouvertes.fr/inria-00528319

V. Danos, J. Feret, W. Fontana, R. Harmer, and J. Krivine, Rulebased modelling, symmetries, refinements, Formal methods in systems biology, pp.103-122, 2008.
DOI : 10.1007/978-3-540-68413-8_8
URL : https://hal.archives-ouvertes.fr/inria-00528339

V. Danos, J. Feret, W. Fontana, R. Harmer, and J. Krivine, Abstracting the di?erential semantics of rule-based models: exact and automated model reduction, Logic in Computer Science (LICS), 2010 25th Annual IEEE Symposium on, pp.362-381, 2010.

V. Danos, J. Feret, W. Fontana, and J. Krivine, Scalable Simulation of Cellular Signaling Networks, Asian Symposium on Programming Languages and Systems, pp.139-157, 2007.
DOI : 10.1007/978-3-540-76637-7_10
URL : https://hal.archives-ouvertes.fr/inria-00528409

V. Danos, J. Feret, W. Fontana, and J. Krivine, Abstract Interpretation of Cellular Signalling Networks, International Workshop on Verification, Model Checking, and Abstract Interpretation, pp.83-97, 2008.
DOI : 10.1007/978-3-540-78163-9_11
URL : https://hal.archives-ouvertes.fr/inria-00528352

V. Danos and R. Harmer, The Anatomy of Innocence, International Workshop on Computer Science Logic, pp.188-202, 2001.
DOI : 10.1007/3-540-44802-0_14

V. Danos and R. Harmer, Probabilistic game semantics, ACM Transactions on Computational Logic, vol.3, issue.3, pp.359-382, 2002.
DOI : 10.1145/507382.507385
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.2777

V. Danos, R. Harmer, R. Honorato-zimmer, and S. Stucki, Deriving rate equations for site graph rewriting systems, To appear in Electronic Notes in Theoretical Computer Science, 2014.

V. Danos, R. Harmer, and G. Winskel, Constraining rule-based dynamics with types, Mathematical Structures in Computer Science, vol.2006, issue.02, pp.272-289, 2013.
DOI : 10.1007/978-3-540-74407-8_3
URL : https://hal.archives-ouvertes.fr/hal-00694492

V. Danos, J. Feret, W. Fontana, R. Harmer, J. Hayman et al., Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), volume 18 of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.276-288, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00809065

O. Danvy and A. Filinski, Representing Control: a Study of the CPS Transformation, Mathematical structures in computer science, pp.361-391, 1992.
DOI : 10.1016/0304-3975(87)90109-5

Y. Diers, Familles universelles de morphismes, of Publications de l'U.E.R. mathématiques pures et appliquées. Université des sciences et techniques de Lille I, 1978.

R. Dyckho? and W. Tholen, Exponentiable morphisms, partial products and pullback complements, Journal of Pure and Applied Algebra, vol.49, issue.1-2, pp.103-116, 1987.
DOI : 10.1016/0022-4049(87)90124-1

H. Ehrig, R. Heckel, M. Kor?, M. Löwe, L. Ribeiro et al., ALGEBRAIC APPROACHES TO GRAPH TRANSFORMATION ??? PART II: SINGLE PUSHOUT APPROACH AND COMPARISON WITH DOUBLE PUSHOUT APPROACH, Handbook of Graph Grammars, pp.247-312, 1997.
DOI : 10.1142/9789812384720_0004

E. Demir, The BioPAX community standard for pathway data sharing, Nature Biotechnology, vol.35, issue.9, pp.935-942, 2010.
DOI : 10.1038/nbt.1666
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3001121

J. Feret, V. Danos, J. Krivine, R. Harmer, and W. Fontana, Internal coarse-graining of molecular systems, Proceedings of the National Academy of Sciences, vol.83, issue.2-3, p.6453, 2009.
DOI : 10.1016/j.biosystems.2005.06.014
URL : https://hal.archives-ouvertes.fr/inria-00528330

R. Harmer, Games and full abstraction for non-deterministic languages, 1999.

R. Harmer, Rule-based Modelling and Tunable Resolution, 5th Workshop on Developments in Computational Models ? Computational Models From Nature of Electronic Proceedings in Theoretical Computer Science, pp.65-72, 2009.
DOI : 10.4204/EPTCS.9.8
URL : https://hal.archives-ouvertes.fr/hal-00694488

R. Harmer, V. Danos, J. Feret, J. Krivine, and W. Fontana, Intrinsic information carriers in combinatorial dynamical systems, Chaos: An Interdisciplinary Journal of Nonlinear Science, vol.11, issue.3, p.37108, 2010.
DOI : 10.1073/pnas.97.1.32
URL : https://hal.archives-ouvertes.fr/hal-00520128

R. Harmer, M. Hyland, and P. Mellies, Categorical Combinatorics for Innocent Strategies, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.379-388, 2007.
DOI : 10.1109/LICS.2007.14
URL : https://hal.archives-ouvertes.fr/hal-00150373

R. Harmer and O. Laurent, The Anatomy of Innocence Revisited, International Conference on Foundations of Software Technology and Theoretical Computer Science, pp.224-235, 2006.
DOI : 10.1007/11944836_22
URL : https://hal.archives-ouvertes.fr/hal-00124569

R. Harmer and G. Mccusker, A fully abstract game semantics for finite nondeterminism, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.422-430, 1999.
DOI : 10.1109/LICS.1999.782637
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.2267

B. Henderson-sellers, On the mathematics of modelling, metamodelling, ontologies and modelling languages, Briefs in Computer Science, 2012.
DOI : 10.1007/978-3-642-29825-7

H. Herbelin, Games and weak-head reduction for classical PCF, International Conference on Typed Lambda Calculi and Applications, pp.214-230, 1997.
DOI : 10.1007/3-540-62688-3_38
URL : https://hal.archives-ouvertes.fr/inria-00381542

W. S. Hlavacek, J. R. Faeder, M. L. Blinov, R. G. Posner, M. Hucka et al., Rules for Modeling Signal-Transduction Systems, Science Signaling, vol.579, issue.8, p.6, 2006.
DOI : 10.1016/j.febslet.2005.02.013
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.1561

M. Hofmann and T. Streicher, Continuation models are universal for µ-calculus, Logic in Computer Science, 1997. LICS'97. Proceedings., 12th Annual IEEE Symposium on, pp.387-395, 1997.
DOI : 10.1109/lics.1997.614964

J. M. Hyland and C. L. Ong, On full abstraction for PCF: I, II and III. Information and Computation, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917
URL : http://doi.org/10.1006/inco.2000.2917

S. Lack and P. Soboci´nskisoboci´nski, Adhesive categories, International Conference on Foundations of Software Science and Computation Structures, pp.273-288, 2004.
DOI : 10.7146/brics.v10i31.21799

J. Lambek and P. J. Scott, Introduction to higher-order categorical logic, 1988.

H. Lavoie and M. Therrien, Regulation of RAF protein kinases in ERK signalling, Nature Reviews Molecular Cell Biology, vol.267, issue.5, pp.281-298, 2015.
DOI : 10.1126/science.7811320

T. Leinster, Basic category theory, 2014.
DOI : 10.1017/CBO9781107360068

R. Loader, Unary PCF is decidable, Theoretical Computer Science, vol.206, issue.1-2, pp.317-329, 1998.
DOI : 10.1016/S0304-3975(98)00048-6
URL : http://doi.org/10.1016/s0304-3975(98)00048-6

R. Loader, Finitary PCF is not decidable, Theoretical Computer Science, vol.266, issue.1-2, pp.341-364, 2001.
DOI : 10.1016/S0304-3975(00)00194-8
URL : http://doi.org/10.1016/s0304-3975(00)00194-8

S. and M. Lane, Categories for the working mathematician, 1998.
DOI : 10.1007/978-1-4612-9839-7

G. Mccusker, Abstract, Bulletin of Symbolic Logic, vol.2, issue.03, pp.347-362, 1997.
DOI : 10.2307/2275407

R. Milner, Communication and concurrency, 1989.

E. Murphy, V. Danos, J. Feret, R. Harmer, and J. Krivine, Rule-Based Modeling and Model Refinement, Elements of Computational Systems Biology, vol.75, issue.19, pp.83-114, 2009.
DOI : 10.1002/9780470556757.ch4
URL : https://hal.archives-ouvertes.fr/inria-00527981

H. Nickau, Hereditarily sequential functionals, International Symposium on Logical Foundations of Computer Science, pp.253-264
DOI : 10.1007/3-540-58140-5_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2978

J. Pustejovsky, Dynamic event structure and habitat theory, 6th International Conference on Generative Approaches to the Lexicon, pp.1-10, 2013.

J. Pustejovsky and N. Krishnaswamy, Generating simulations of motion events from verbal descriptions. Lexical and Computational Semantics, pp.99-109, 2014.
DOI : 10.3115/v1/s14-1014
URL : http://arxiv.org/abs/1610.01713

R. Rosen, On models and modeling, Applied Mathematics and Computation, vol.56, issue.2-3, pp.359-372, 1993.
DOI : 10.1016/0096-3003(93)90128-2

M. Schmidt-schauß, Decidability of behavioural equivalence in unary PCF, Theoretical Computer Science, vol.216, issue.1-2, pp.363-373, 1999.
DOI : 10.1016/S0304-3975(98)00024-3

B. Schoeberl, C. Eichler-jonsson, E. D. Gilles, and G. Müller, Computational modeling of the dynamics of the MAP kinase cascade activated by surface and internalized EGF receptors, Nature Biotechnology, vol.20, issue.4, pp.370-375, 2002.
DOI : 10.1038/nbt0402-370

P. Selinger, Control categories and duality: on the categorical semantics of the lambda-mu calculus, Mathematical Structures in Computer Science, vol.11, issue.2, pp.207-260, 2001.
DOI : 10.1017/S096012950000311X

T. Streicher and B. Reus, Classical logic, continuation semantics and abstract machines, Journal of Functional Programming, vol.8, issue.6, pp.543-572, 1998.
DOI : 10.1017/S0956796898003141

X. Zhang, J. Gureasko, K. Shen, P. A. Cole, and J. Kuriyan, An Allosteric Mechanism for Activation of the Kinase Domain of Epidermal Growth Factor Receptor, Cell, vol.125, issue.6, pp.1137-1149, 2006.
DOI : 10.1016/j.cell.2006.05.013