. Filtrer-y-en-pos, consistè a vérifier que pos' n'est pas consommée. Si c'est le cas on indique que Correction de la combinatorisation (?s

. Dans-le-premier-cas, ´ evaluation de M dans s ne termine pas Dans le second cas, l'´ evaluation de M dans s bloque dans l'´ etat mémoire s ? 1 . Dans letroisì eme cas on a : if M 1 then M

I. M. Dans, l'expression M 1 est réduite en premier (IF est une valeur) Nous retrouvons les trois issues possibles pour l'´ evaluation de M 1 . Si l'´ evaluation de M 1 ne termine pas, alors l'´ evaluation de [M ] ne termine pas 1 . Si l'´ evaluation de M 1 bloque dans l'´ etat s ? 1 alors l'´ evaluation de [M ] bloqué egalement dans cetétatcetétat. Dans le cas restant, l'´ evaluation de M 1 donne V 1 dans l'´ etat s 1 et on a donc

´. Etant-des-valeurs, ) (fun x ? M 3 ) / s 1 ? E 2 (fun x ? M 3 ) / s 1 (5) o` u E 2 est fun z ? if V 1 then

´. Etant-des-valeurs, s 1 ? if V 1 then (fun x ? M 2 ) ( ) else (fun x ? M 3 ) ( ) / s 1 (6) Or on a (fun x ? M 2 ) ( ) ? M 2 {x ? ( )} et comme x n'apparait pas dans M 2, {x ? ( )} vaut M 2 . De même, (fun x ? M 3 ) ( ) ? M 3 . Donc, en remplaçant d'´ egaì a ´ egal (r` egles (cond- comp-2) et (cond-comp-3)) on a : if V 1 then (fun x ? M 2 ) ( ) else (fun x ? M 3 ) ( ) ? if V 1 then M 2 else M

. Considérantconsidérantégalement, Or, on a vu que par (2) nous avons

. Regardonsàregardonsà-présent-le-terme, N 2 )) X : (fun x ? (N 1 N 2 )) X / s ? (N 1 N 2 ){x ? X}

. Le-terme, ){x ? X} estégaìestégaì a (N 1 {x ? X}) (N 2 {x ? X}) (par la définition de l'application d'une substitution), Par conséquent on a : (fun x ? (N 1 N 2 )) X ? (N 1 {x ? X}) (N 2 {x ? X})

. Combinatorisation-en-profondeur, M est de la forme fun x ? fun y ? N . Par définition, [fun x ? fun y ? N ] = [fun x ? [fun y ? N ]]. Or, [fun y ? N ] est soit un opérateur (I), soit une application (de la forme K C ou S N 1 N 2 ) On peut donc appliquer l'hypothèse d'inductionàinductionà fun x ?

J. J. Arulanandham, C. S. Calude, and M. J. Dinneen, Bead-Sort : A natural sorting algorithm, EATCS Bull, vol.76, pp.153-162, 2002.

A. Aiken, M. Fähndrich, J. S. Foster, and Z. Su, A toolkit for constructing type- and constraint-based program analyses, Second International Workshop on Types in Compilation (TIC'98, 1998.
DOI : 10.1007/BFb0055513

A. Aiken, Introduction to set constraint-based program analysis, Science of Computer Programming, vol.35, issue.2-3, pp.79-111, 1999.
DOI : 10.1016/S0167-6423(99)00007-6

A. Aiken, D. Kozen, M. Vardi, and E. Wimmers, The complexity of set constraints, Proceedings of Computer Science Logic, pp.1-17, 1993.
DOI : 10.1007/BFb0049320

[. Aiken, T. K. Lakshman, and E. Wimmers, Soft typing with conditional types, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, pp.163-173, 1994.
DOI : 10.1145/174675.177847

A. Aiken and E. Wimmers, Solving systems of set constraints, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.329-340, 1992.
DOI : 10.1109/LICS.1992.185545

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

[. Aiken, E. Wimmers, and J. Palsberg, Optimal representations of polymorphic types with subtyping, Theoretical Aspects of Computer Software (TACS), 1997.

T. P. Baker, A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension, SIAM Journal on Computing, vol.7, issue.4, pp.533-541, 1978.
DOI : 10.1137/0207043

[. Berry and G. Boudol, The chemical abstract machine, Theoretical Computer Science, vol.96, issue.1, pp.217-248, 1992.
DOI : 10.1016/0304-3975(92)90185-I
URL : https://hal.archives-ouvertes.fr/inria-00075426

[. Banâtre, A. Coutant, and D. L. Métayer, A parallel machine for multiset transformation and its programming style, Future Generation Computer Systems, vol.4, issue.2, pp.133-144, 1988.
DOI : 10.1016/0167-739X(88)90012-X

[. Barbanera, M. Dezani-ciancaglini, and U. Liguoro, Intersection and Union Types: Syntax and Semantics, Information and Computation, vol.119, issue.2, pp.202-230, 1995.
DOI : 10.1006/inco.1995.1086
URL : http://doi.org/10.1006/inco.1995.1086

[. Bird and O. De-moor, Algebra of Programming, volume 100 of International Series in Computer Science, 1997.

[. Banâtre, P. Fradet, and D. L. Métayer, Gamma and the Chemical Reaction Model: Fifteen Years After, Lecture Notes in Computer Science, vol.2235, pp.17-44, 2001.
DOI : 10.1007/3-540-45523-X_2

[. Banâtre, P. Fradet, and Y. Radenac, High-order chemical programming style In Unconventional Programming Paradigms -Challenges and Research Issues for New Programming Paradigms, Mont Saint-Michel Pre-proceedings, the final proceedings will be published by Springer in the LNCS series, 2004.

R. S. Bird, Two dimensional pattern matching, Information Processing Letters, vol.6, issue.5, pp.168-170, 1977.
DOI : 10.1016/0020-0190(77)90017-5

R. S. Bird, Using circular programs to eliminate multiple traversals of data, Acta Informatica, vol.4, issue.3, pp.239-250, 1984.
DOI : 10.1007/BF00264249

[. Banâtre and D. L. Métayer, A new computational model and its discipline of programming, 1986.

P. Buneman, S. Naqvi, V. Tannen, and L. Wong, Principles of programming with complex objects and collection types, Theoretical Computer Science, vol.149, issue.1, pp.3-48, 1995.
DOI : 10.1016/0304-3975(95)00024-Q

A. Janusz and . Brzozowski, Derivatives of regular expressions, JACM, vol.11, issue.4, pp.481-494, 1964.

[. Boussié, A. Spicher, and O. Michel, Simulation du déplacement du nématode ascaris suum en MGS, 2004.

[. Cardelli, Typeful programming, Formal Description of Programming Concepts, pp.431-507, 1991.

F. Clavel, S. Durán, P. Eker, N. Lincoln, J. Martí-oliet et al., The Maude 2.0 System, Rewriting Techniques and Applications, pp.76-87, 2003.
DOI : 10.1007/3-540-44881-0_7

B. Haskell, R. Curry, and . Feys, Combinatory Logic, volume I, 1958.

[. Cartwright and M. Fagan, Soft typing, Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI'91), pp.278-292, 1991.
DOI : 10.1145/113445.113469

R. Cockett and T. Fukushima, About Charity, Yellow Series Report, vol.48018, issue.92, 1992.

W. Chin and S. Khoo, Calculating sized types. Higher-Order and Symbolic Computation, pp.261-300, 2001.
DOI : 10.1145/328690.328893
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.4005

H. Comon and P. Lescanne, Equational problems anddisunification, Journal of Symbolic Computation, vol.7, issue.3-4, pp.371-425, 1989.
DOI : 10.1016/S0747-7171(89)80017-3
URL : http://doi.org/10.1016/s0747-7171(89)80017-3

E. Contejean and C. Marché, CiME: Completion modulo E, 7th International Conference on Rewriting Techniques and Applications, pp.416-419
DOI : 10.1007/3-540-61464-8_70

J. Cohen, O. Michel, and J. Giavitto, Filtrage et r` egles de réécriture sur des structures indexées par des groupes INRIA, Journées Francophones des Langages Applicatifs, 2003.

J. Cohen, Typage des collections topologiques hétérogènes et des transformations Research Report LaMI-89, 2003.
DOI : 10.3166/tsi.24.1081-1111

J. Cohen, Typing rule-based transformations over topological collections, 4th International Workshop on Rule-Based Programming (RULE'03), pp.50-66, 2003.
DOI : 10.1016/S1571-0661(04)80676-5
URL : https://hal.archives-ouvertes.fr/hal-00442371

J. Cohen, Typing rule-based transformations over topological collections, Electronic Notes in Theoretical Computer Science, 2003.
DOI : 10.1016/S1571-0661(04)80676-5
URL : https://hal.archives-ouvertes.fr/hal-00442371

J. Cohen, Typage fort et typage souple des collections topologiques et des transformations, Journées Francophones des Langages Applicatifs, pp.37-54, 2004.
DOI : 10.3166/tsi.24.1081-1111
URL : https://hal.archives-ouvertes.fr/hal-00442431

J. Cohen, Interprétation par SK-traduction et syntaxe abstraite d'ordre supérieur, INRIA, 2005. [col95] collectif. Encyclopaedia Universalis, pp.17-34, 1995.

B. Courcelle, Réécriture de graphes : orientation bibliographique. Spring school on rewriting, Odeillo, unpublished, available on author's web page, 1993.

[. Damm, Type inference with set theoretic type operators, 1994.

A. Diller, Efficient multi-variate abstraction using an array representation for combinators, Information Processing Letters, vol.84, issue.6, pp.311-317, 2002.
DOI : 10.1016/S0020-0190(02)00318-6

[. Dershowitz and J. Jouannaud, Rewriting systems Discrete and continuous models for heterocyst differentiation in growing filaments of blue-green bacteria, Handbook of Theoretical Computer Science, pp.243-320249, 1987.

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

M. Eigen and P. Schuster, The Hypercycle : A principle of natural selforganization, 1979.

[. Eifrig, S. Smith, and V. Trifonov, Sound polymorphic type inference for objects, Proceedings Object-Oriented Programming Systems, Languages, and Applications (OOPSLA)'95, pp.169-184, 1995.

M. Fähndrich and A. Aiken, Making set-constraint program analyses scale, The CP'96 Workshop on Set Constraints, 1996.

M. Fähndrich and A. Aiken, Program analysis using mixed term and set constraints, Proceedings of the 4th International Static Analysis Symposium, pp.114-126, 1997.
DOI : 10.1007/BFb0032737

W. Fontana and L. Buss, The arrival of the fittest " : Toward a theory of biological organization, Bulletin of Mathematical Biology, 1994.

W. Fontana and L. Buss, What would be conserved if " the tape were played twice Complexity : Metaphors, Models, and Reality, Proceedings of the National Academy of Sciences USA, pp.757-761, 1994.

W. Fontana and L. Buss, Boundaries and Barriers, chapter The barrier of objects : from dynamical systems to bounded organizations, pp.56-116, 1996.

A. Frisch, G. Castagna, and V. Benzaken, Semantic Subtyping, Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science, pp.137-146, 2002.
DOI : 10.1145/1391289.1391293
URL : https://hal.archives-ouvertes.fr/hal-00152690

[. Flanagan and M. Felleisen, Componential set-based analysis, Proceedings of the ACM SIGPLAN 1997 conference on Programming Language Design and Implementation, pp.235-248, 1997.
DOI : 10.1145/258915.258937
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.6615

M. Fähndrich, J. Foster, Z. Su, and A. Aiken, Partial online cycle elimination in inclusion constraint graphs, Proceedings of the SIG- PLAN Conference on Programming Language Design and Implementation, pp.85-96, 1998.

P. Jun, J. Furuse, and . Garrigue, A label-selective lambda-calculus with optional arguments and its compilation method, 1995.

M. Feeley and G. Lapalme, Using closures for code generation, Computer Languages, vol.12, issue.1, pp.47-66, 1987.
DOI : 10.1016/0096-0551(87)90012-9

P. Fradet and D. L. Métayer, Structured Gamma, Science of Computer Programming, vol.31, issue.2-3, pp.263-289, 1998.
DOI : 10.1016/S0167-6423(97)00023-3
URL : http://doi.org/10.1016/s0167-6423(97)00023-3

[. Fähndrich, Z. Su, and A. Aiken, Projection merging : Reducing redundancies in inclusion constraint graphs, Proceedings of the ACM Symposium on Principles of Programming Languages, pp.81-95, 2000.

P. Jun and . Furuse, Extensional polymorphism : theory and application, 2002.

J. Garrigue, Programming with polymorphic variants, ML Workshop, 1998.

J. Garrigue, Simple type inference for structural polymorphism, 9th Workshop on Foundations of Object-Oriented Languages, 2002.

J. Garrigue, Relaxing the Value Restriction, International Symposium on Functional and Logic Programming, 2004.
DOI : 10.1007/978-3-540-24754-8_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.4779

J. Giavitto, J. Banâtre, P. Fradet, and O. Michel, Pre-proceedings of Unconventional Programming Paradigms -Challenges and Research Issues for New Programming Paradigms, Mont Saint-Michel The final proceedings will be published by Springer in the LNCS series, 2004.

J. Gateley and B. F. Duba, Call-by-value combinatory logic and the lambda-value calculus, 7th International Conference, pp.41-53, 1991.
DOI : 10.1007/3-540-55511-0_2

J. Giavitto, C. Godin, O. Michel, and P. Prusinkiewicz, Biological Modeling in the Genomic Context, chapter Computational Models for Integrative and Developmental Biology, Hermes, 2002.

E. Ralph, D. R. Griswold, and . Hanson, String processing languages, 1991.

[. Giavitto, Typing geometries of homogeneous collections, 2nd International Workshop on Array Manipulation (ATABLE), 1992.

[. Giavitto, Topological Collections, Transformations and Their Application to the Modeling and the Simulation of Dynamical Systems, Rewriting Technics and Applications (RTA'03), pp.208-233, 2003.
DOI : 10.1007/3-540-44881-0_16

[. Gruau, Y. Lhuillier, P. Reitz, and O. Temam, BLOB computing, Proceedings of the first conference on computing frontiers on Computing frontiers , CF'04, pp.125-139
DOI : 10.1145/977091.977111
URL : https://hal.archives-ouvertes.fr/lirmm-00108879

[. Giavitto and O. Michel, MGS, Electronic Notes in Theoretical Computer Science, vol.59, issue.4, 2001.
DOI : 10.1016/S1571-0661(04)00293-2
URL : https://hal.archives-ouvertes.fr/hal-00769284

[. Giavitto and O. Michel, MGS, Electronic Notes in Theoretical Computer Science, 2001.
DOI : 10.1016/S1571-0661(04)00293-2
URL : https://hal.archives-ouvertes.fr/hal-00769284

[. Giavitto and O. Michel, Data Structure as Topological Spaces, Proceedings of the 3nd International Conference on Unconventional Models of Computation UMC02, pp.137-150, 2002.
DOI : 10.1007/3-540-45833-6_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.9083

J. Giavitto, O. Michel, and J. Cohen, Pattern-matching and rewriting rules for group indexed data structures, ACM SIGPLAN Notices, vol.37, issue.12, pp.76-87, 2002.
DOI : 10.1145/636517.636529
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.9633

J. Giavitto, O. Michel, J. Giavitto, O. Michel, and J. Cohen, Une présentation du langage MGS (tutoriel) Technical Report LaMI-84-2002, LaMI Accretive rules in Cayley P Systems, Membrane Computing : International Workshop, pp.319-338, 2002.

J. Giavitto, O. Michel, J. Cohen, and A. Spicher, Computations in Space and Space in Computations, 2004.
DOI : 10.1007/11527800_11

J. Giavitto, O. Michel, J. Cohen, and A. Spicher, Computation in space and space in computation In Unconventional Programming Paradigms -Challenges and Research Issues for New Programming Paradigms, Mont Saint-Michel Pre-proceedings, the final proceedings will be published by Springer in the LNCS series, 2004.

J. Giavitto, G. Malcolm, and O. Michel, Rewriting Systems and the Modelling of Biological Systems, Comparative and Functional Genomics, vol.5, issue.1, pp.95-99, 2004.
DOI : 10.1002/cfg.363

[. Giavitto, O. Michel, and J. Sansonnet, Group-based fields, Proceedings of the International Workshop on Parallel Symbolic Languages and Systems (PSLS'95), pp.209-215, 1996.
DOI : 10.1007/BFb0023063

J. Hatcliff and O. Danvy, Thunks and the ??-calculus, Journal of Functional Programming, vol.7, issue.3, pp.303-319, 1997.
DOI : 10.1017/S0956796897002748

[. Heintze, Set-based analysis of ML programs, Proceedings of the 1994 ACM conference on LISP and Functional Programming, pp.306-317, 1994.

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

M. Henle, A combinatorial introduction to topology, 1994.

J. Y. Hung, W. Gao, and J. C. Hung, Variable structure control: a survey, IEEE Transactions on Industrial Electronics, vol.40, issue.1, pp.2-22, 1993.
DOI : 10.1109/41.184817

R. Hinze and J. Jeuring, Generic Haskell : practice and theory, Generic Programming, 2003.
DOI : 10.1007/978-3-540-45191-4_1

R. Harper and G. Morrisett, Compiling polymorphism using intensional type analysis, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '95, pp.130-141, 1995.
DOI : 10.1145/199448.199475

J. Hugues, L. Pareto, and A. Sabry, Proving the correctness of reactive systems using sized types, Symposium on Principles of Programming Languages, pp.410-423, 1996.

[. Hindley and J. P. Seldin, An Introduction to Combinators and the ?-calculus, 1986.
DOI : 10.1017/CBO9780511809835

J. Hughes, Super-combinators a new implementation method for applicative languages, Proceedings of the 1982 ACM symposium on LISP and functional programming , LFP '82, pp.1-10, 1982.
DOI : 10.1145/800068.802129

U. Itkis, Control Systems of Variable Structure, 1976.

M. Jammer, Concepts of Space : The History of Theories of Space in Physics (third, enlarged edition), 1954.

P. Jansson, Functional Polytypic Programming, 2000.

]. C. Jay04 and . Jay, The pattern calculus, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.26, issue.6, pp.911-937, 2004.

[. Jay, G. , and E. Moggi, Functorial ML, Journal of Functional Programming, vol.8, issue.6, pp.573-619, 1998.
DOI : 10.1017/S0956796898003128

J. Jeuring, The derivation of a hierarchy of algorithms for pattern matching on arrays, Proceedings ATABLE-92, Second international Workshop on Array Structures, 1992.

J. Jeuring and P. Jansson, Polytypic programming, Advanced Functional Programming, Second International School, pp.68-114
DOI : 10.1007/3-540-61628-4_3

T. Jim and J. Palsberg, Type inference in systems of recursive types with subtyping. Available on authors' web page, 1999.

L. P. Simon, J. Jones, and . Salkild, The spineless tagless G-machine, Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, pp.184-201, 1989.

[. Jay and M. Sekanina, Shape checking of array programs, Proceedings of CATS'97 (Computing : The Australasian Theory Symposium), pp.113-121, 1997.

C. Paris, J. C. Kanellakis, and . Mitchell, Polymorphic unification and ML typing, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pp.105-115, 1989.

J. Kodumal, BANSHEE : A toolkit for building constraint-based analyses. Web page

J. Peter and . Landin, An abstract machine for designers of computing languages, Proceedings of the IFIP Congress, pp.438-439, 1965.

J. Peter and . Landin, Correspondence between ALGOL 60 and Church's lambdanotation : part I, Commununications of the ACM, vol.8, issue.2, pp.89-101, 1965.

V. Larue, Structures de données indexées par un groupe : représentation graphique et extension au cas non abélien, 2002.

X. Leroy, Unboxed objects and polymorphic typing, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.177-188, 1992.
DOI : 10.1145/143165.143205
URL : https://hal.archives-ouvertes.fr/hal-01499973

X. Leroy, The effectiveness of type-based unboxing, Workshop on Types in Compilation '97, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01499964

A. Lindenmayer, Mathematical models for cellular interactions in development I. Filaments with one-sided inputs, Journal of Theoretical Biology, vol.18, issue.3, pp.280-315, 1968.
DOI : 10.1016/0022-5193(68)90079-9

X. Leroy and M. Mauny, Abstract, Journal of Functional Programming, vol.582, issue.04, pp.431-463, 1994.
DOI : 10.1016/0890-5401(90)90018-D
URL : https://hal.archives-ouvertes.fr/hal-01499980

[. Manca, Logical string rewriting, Theoretical Computer Science, vol.264, issue.1, pp.25-51, 2001.
DOI : 10.1016/S0304-3975(00)00212-7
URL : http://doi.org/10.1016/s0304-3975(00)00212-7

[. Michel, J. Giavitto, and J. Cohen, MGS : transformer des collections complexes pour la simulation en biologie, Journées Francophones des Langages Applicatifs (JFLA'02), 2002.

O. Michel, Représentations dynamiques de l'espace dans un langage déclaratif de simulation, 1996.

O. Michel and F. Jacquemard, An analysis of the Needham-Schroeder public-key protocol with MGS, Preproceedings of the Fifth Workshop on Membrane Computing (WMC5), pp.295-315, 2004.

[. Moreau-andhéì-ene and . Kirchner, A compiler for rewrite programs in associative-commutative theories Polymorphic typing of heterogeneous lists, Proceedings of Algebraic and Logic Programming -Programming Language Implementation and Logic Programming, ALP/PLI LP'98 Ecole Normale Supérieure, 1994.

[. Moreau, Compilation de r` egles de réécriture et de stratégies nondéterministes, 1999.

D. Peter and . Mosses, Handbook of Theoretical Computer Science, volume B, chapter Denotational semantics, pp.577-631, 1990.

[. Macqueen, G. Plotkin, and R. Sethi, An ideal model for recursive polymorphic types, Information and Control, vol.71, issue.1-2, pp.95-130, 1986.
DOI : 10.1016/S0019-9958(86)80019-5

[. Moreau, C. Ringeissen, and M. Vittek, A patternmatching compiler, Proceedings of the 1st International Workshop on Language Descriptions, Tools and Applications Electronic Notes in Theoretical Computer Science, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100437

[. Moreau, C. Ringeissen, and M. Vittek, A pattern matching compiler for multiple target languages, 12th Conference on Compiler ConstructionMSR91] Eric Mjolsness, David H. Sharp, and John Reinitz. A connectionist model of development, pp.61-76429, 1991.
URL : https://hal.archives-ouvertes.fr/inria-00099427

S. Marlow and P. Wadler, A practical subtyping system for Erlang, 2nd International Conference on Functional Programming, 1997.

A. Ohori, A polymorphic record calculus and its compilation, ACM Transactions on Programming Languages and Systems, vol.17, issue.6, pp.844-895, 1995.
DOI : 10.1145/218570.218572
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.4611

F. Pfenning and C. Elliot, Higher-order abstract syntax, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language Design and Implementation, pp.199-208, 1988.
DOI : 10.1145/53990.54010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.6896

[. Prusinkiewicz and J. Hanan, L-systems: from formalism to programming languages, Lindenmayer Systems, 1992.
DOI : 10.1007/978-3-642-58117-5_12

C. Benjamin and . Pierce, Programming with intersection types, union types, and polymorphism , 1991. Avaible on author's web page

C. Benjamin and . Pierce, Types and Programming Languages, 2002.

L. Simon and -. Peyton, The Implementation of Functional Programming Languages [Pot98a] François Pottier Synthèse de types en présence de sous-typage : de la théoriè a la pratique [Pot98b] François Pottier. A framework for type inference with subtyping [Pot01] François Pottier. Simplifying subtyping constraints : A theory Unpublished manuscript, Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pp.228-238153, 1987.

M. Pantel and P. Sallé, Typage souple pour le langage FOL, Journées Francophones des Langages Applicatifs (JFLA 94), pp.21-51, 1994.

G. P?aunp?aun, O. Patrick, and . Keefe, Computing with membranes Type inference with nonstructural subtyping, PWO97] Jens Palsberg, pp.108-14349, 1997.

E. M. Rauch, Discrete, amorphous physical models, International Journal of Theoretical Physics, vol.42, issue.2, pp.329-348, 2003.
DOI : 10.1023/A:1024455602163

D. Rémy, Syntactic theories and the algebra of record terms, Research Report, vol.1869, 1993.

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.

C. Reynolds and . Boids, [RS92] Grzegorz Rozenberg and Arto Salomaa. Lindenmayer Systems Analytical and Structural Polymorphism Expressed using Patterns over Types, 1992.

F. Ruehr, Structural polymorphism Entailment with conditional equality constraints, Workshop on Generic Programming (WGP'98) European Symposium on Programming, pp.170-189, 1998.

T. Sheard, Type parametric programming, 1993.

A. Spicher and O. Michel, Integration and pattern-matching of topological structures in a functional language In International Workshop on Implementation and Application of Functional Languages Draft proceedings published as a technical report of the, The post-proceedings will be published as an LNCS volume, 2004.

A. Spicher, O. Michel, and J. Giavitto, A Topological Framework for the Specification and the Simulation of Discrete Dynamical Systems, Sixth International conference on Cellular Automata for Research and Industry (ACRI'04), 2004.
DOI : 10.1007/978-3-540-30479-1_25

A. Spicher, Typage et compilation de filtrage de chemins dans des collections topologiques, 2003.

[. Schonberg, J. T. Schwartz, and M. Sharir, An Automatic Technique for Selection of Data Representations in SETL Programs, ACM Transactions on Programming Languages and Systems, vol.3, issue.2, pp.126-143, 1981.
DOI : 10.1145/357133.357135

[. Strachey, Fundamental concepts in programming languages. Unpublished, Proceedings of the 1967 International Summer School in Computer Programming, 1967.

[. Strachey, Fundamental concepts in programming languages. Higher- Order and Symbolic Computation, pp.11-49, 2000.

[. Toffoli and M. Norman, Cellular Automata Machine, 1987.

A. M. Turing, The chemical basis of morphogenesis, Philosophical Transactions of the Royal Society of London, Series B : Biological Sciences, issue.237, pp.37-72, 1952.

G. Turk, Generating textures for arbitrary surfaces using reaction-diffusion, Computer Graphics (SIGGRAPH '91 Proceedings), volume, pp.289-298, 1991.

F. J. Varela, Principle of Biological Autonomy, 1979.

J. Von-neumann, Theory of Self-Reproducing Automata, 1966.

W. William, E. A. Wadge, and . Ashcroft, Lucid, the Data flow programming language, 1985.

U. Wilensky, NetLogo ants model, 1998.

U. Wilensky, NetLogo flocking model, 1998.

G. [. Wilcox, R. J. Mitchison, and . Smith, Pattern formation in the blue-green algae, Anabaena. I. Basic mechanisms, Journal of Cell Science, vol.12, pp.707-723, 1973.

K. Andrew and . Wright, Practical Soft Typing for Scheme, 1994.

K. Andrew and . Wright, Simple imperative polymorphism, LISP and Symbolic Computation, vol.8, issue.4, pp.343-355, 1995.

H. Xi, Dependent types in practical programming, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, 1998.
DOI : 10.1145/292540.292560