N. [. La-réaction, est l'opération de base sur les graphes et correspond à un transformateur. Deux versions spécialisées d'une réaction sont également fournies : les initialiseurs [| => A |

L. Valeur, adresse x est notée $x et est initialisée à 1. En général, les actions d'une réaction

L. M. Abadi, L. Cardelli, P. L. Curien, and J. Levy, adresse suivante y. L'action insère une nouvelle adresse z et initialise sa valeur à i. L'interprétation des réactions comme des transformateurs est directe. La seule différence réside dans une [1] Explicit Substitutions, Proceedings of the ACM Symposium on Principles of Programming Languages Cardelli, P. L. Curien. Formal parametric polymorphism. Theoretical Computer Science, pp.31-46, 1990.

M. Abadi, L. C. Aditya, A. Caro, A. W. Appel, G. Argo et al., Compiler-directed type reconstruction for polymorphic languages Runtime tags aren't necessary Compiling with Continuations Improving the three instruction machine A categorical understanding of environment machines, Lisp and Symbolic Computation Proceedings of the ACM Conference on Functional Programming and Computer Architecture, pp.74-82, 1989.

H. G. Baker, Unify and conquer (garbage, updating, aliasing, ?) in functional languages, Proceedings of the ACM Conference on Lisp and Functional Programming, pp.218-226, 1990.

H. P. Barendregt, The lambda calculus. Its syntax and semantics, 1981.

F. Bellegarde, Z. Benaissa, P. Lescanne, and K. H. Rose, Rewriting systems on FP expressions to reduce the number of sequences yielded Modeling sharing and recursion for weak reduction strategies using explicit substitution, Proc of PLILP'1996, pp.11-34, 1986.

M. Benedikt, T. Reps, and M. Sagiv, A Decidable Logic for Describing Linked Data Structures, Proceedings of 8th European Symposium on Programming, pp.2-19, 1999.
DOI : 10.1007/3-540-49099-X_2

A. Bloss, Update analysis and the efficient implementation of functional aggregates, Proceedings of the fourth international conference on Functional programming languages and computer architecture , FPCA '89, pp.26-38, 1989.
DOI : 10.1145/99370.99373

T. Bratvold, A Skeleton-based parallelising compiler for ML, Proceedings of the International Workshop on Parallel Implementation of Functional Languages, pp.23-33, 1993.

D. F. Brewer and M. J. Nash, The Chinese Wall security policy, Proceedings. 1989 IEEE Symposium on Security and Privacy, pp.206-214, 1989.
DOI : 10.1109/SECPRI.1989.36295

D. E. Britton, Heap Storage Management for the Programming Language Pascal, 1975.

G. Burn, S. L. Peyton-jones, and J. D. Robson, The spineless G-machine, Proceedings of the 1988 ACM conference on LISP and functional programming , LFP '88, pp.244-258, 1988.
DOI : 10.1145/62678.62717

G. Burn and D. L. Métayer, Abstract, Journal of Functional Programming, vol.6, issue.01, pp.75-110, 1996.
DOI : 10.1145/91556.91655

W. Cai and D. Skillicorn, CALCULATING RECURRENCES USING THE BIRD-MEERTENS FORMALISM, Parallel Processing Letters, vol.05, issue.02, pp.179-190, 1995.
DOI : 10.1142/S0129626495000163

L. Cardelli, Compiling a functional language, Proceedings of the 1984 ACM Symposium on LISP and functional programming , LFP '84, pp.208-217, 1984.
DOI : 10.1145/800055.802037

L. Cardelli and A. D. Gordon, Mobile ambients, Proceedings of the First International Conference on Foundations of Software Science and Computation Structures (FoSSaCS '98), pp.140-155, 1998.
DOI : 10.1007/bfb0053547

R. Cartwright and M. Fagan, Soft typing, Proceedings of PLDI '91, Conference on Programming Language Design and Implementation, pp.278-292, 1991.

B. W. Char, K. O. Geddes, G. H. Gonnet, B. L. Leong, M. B. Monagan et al., Maple V Language Reference Manual, 1992.
DOI : 10.1007/978-1-4615-7386-9

D. Chase, M. Wegman, and F. Zadeck, Analysis of pointers and structures, Proceedings ACM Conference on Programming Language Design and Implementation) of SIGPLAN Notices, pp.296-310, 1990.

S. Chatterjee, J. R. Gilbert, R. Schreiber, and S. Teng, Automatic array alignment in data-parallel programs, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.16-28, 1993.
DOI : 10.1145/158511.158517

M. Chen, Y. Choo, and J. Li, Crystal: theory and pragmatics of generating efficient parallel code, Parallel Functional Languages and Compilers, pp.255-308, 1991.

W. N. Chin, Automatic Methods for Program Transformation, 1990.

P. Clauss, Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs, Proceedings of the ACM International Conference on Supercomputing, pp.278-285, 1996.
URL : https://hal.archives-ouvertes.fr/hal-01100306

D. Cohen, M. S. Feather, K. Narayanaswamy, and S. S. Fickas, Automatic monitoring of software requirements, Proceedings of the 19th international conference on Software engineering , ICSE '97, pp.602-603, 1997.
DOI : 10.1145/253228.253493

J. Cohen, Garbage Collection of Linked Data Structures, ACM Computing Surveys, vol.13, issue.3, 1981.
DOI : 10.1145/356850.356854

M. Cole, A skeletal approach to the exploitation of parallelism, Proceedings of CONPAR, pp.667-675, 1988.

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, 1990.

B. Courcelle, Graph rewriting: an algebraic and logic approach, Handbook of Theoretical Computer Science, Chapter, 1990.

G. Cousineau, P. Curien, and M. Mauny, The categorical abstract machine, Science of Computer Programming, vol.8, issue.2, pp.173-202, 1987.
DOI : 10.1016/0167-6423(87)90020-7

P. Crégut, Machines à environnement pour la réduction symbolique et l'évaluation partielle, Thèse de l'université de Paris VII, 1991.

J. Darlington, A. J. Field, P. G. Harrison, P. H. Kelly, D. W. Sharp et al., Parallel programming using skeleton functions Skeletons for structured parallel composition De Brujin. ?-calculus notation with nameless dummies: a tool for automatic formula manipulation, with application to Church Rosser theorem, Proceedings of PARLE Proceedings of ACM Symposium on Principle and Practice of Parallel Programming Indagationes mathematicae, pp.146-160, 1972.

A. Deutsch, Semantic models and abstract interpretation techniques for inductive data structures and pointers, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation , PEPM '95, pp.226-229, 1995.
DOI : 10.1145/215465.215594

R. Douence, Décrire et comparer les mises en oeuvre de langages fonctionnels . Doctorat de l'université de Rennes I, 1996.

M. Draghicescu and S. Purushothaman, A compositional analysis of evaluation-order and its application, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.242-250, 1990.
DOI : 10.1145/91556.91658

E. A. Emerson, Temporal and Modal Logic, pp.995-1072, 1990.
DOI : 10.1016/B978-0-444-88074-1.50021-4

U. Erlingsson and F. B. Schneider, SASI enforcement of security policies, Proceedings of the 1999 workshop on New security paradigms , NSPW '99, 1999.
DOI : 10.1145/335169.335201

D. Evans and A. Twyman, Flexible policy-directed code safety, Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344), pp.32-45, 1999.
DOI : 10.1109/SECPRI.1999.766716

J. Fairbairn and S. Wray, Tim: A simple, lazy abstract machine to execute supercombinators, Proceedings of the ACM Conference on Functional Programming and Computer Architecture, pp.34-45, 1987.
DOI : 10.1007/3-540-18317-5_3

P. Feautrier, Toward automatic distribution. Parallel Processing Letters, pp.233-244, 1994.

M. Felleisen and D. P. Friedman, A syntactic theory of sequential state, Theoretical Computer Science, vol.69, issue.3, 1987.
DOI : 10.1016/0304-3975(89)90069-8

M. J. Fischer, Lambda-calculus schemata, Proceedings of the ACM Conference on Proving Properties about Programs, Sigplan Notices, pp.104-109, 1972.

K. Fisher, F. Honsell, and J. C. Mitchell, A lambda calculus of objects and method specialization, Preliminary version appeared in Proceedings IEEE Symposium on Logic in Computer Science, pp.3-37, 1993.

Y. Futamura, Partial computation of programs, In RIMS Symp. on Soft. Science and Eng. LNCS, vol.147, pp.34-45, 1983.
DOI : 10.1007/3-540-11980-9_13

R. Ghiya and L. J. Hendren, Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.1-15, 1996.
DOI : 10.1145/237721.237724

P. Godefroid, Model checking for programming languages using VeriSoft, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.174-186, 1997.
DOI : 10.1145/263699.263717

B. Goldberg, Tag-free garbage collection for strongly typed programming languages, Proceedings of the ACM SIGPLAN'91 Symposium on Programming Languages Design and Implementation, pp.165-176, 1991.
DOI : 10.1145/113445.113460

B. Goldberg and M. Gloger, Polymorphic type reconstruction for garbage collection without tags, Proceedings of the ACM Conference on Lisp and Functional Programming, pp.53-65, 1992.
DOI : 10.1145/141471.141504
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.7334

C. K. Gomard and P. Sestoft, Globalization and live variables, Proceedings of ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991.
DOI : 10.1145/115865.115882

L. Gong, M. Mueller, H. Prafullchandra, and R. Schemers, Going beyond the sandbox: An overview of the new security architecture in the Java Development Kit 1.2, USENIX Symposium on Internet Technologies and Systems Proceedings, pp.103-112, 1997.

S. Gorlatch, C. Wedler, and C. Lengauer, Optimization rules for programming with collective operations, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999, pp.492-499, 1999.
DOI : 10.1109/IPPS.1999.760522
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.9098

M. Gupta and P. Banerjee, Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers, IEEE Transactions on Parallel and Distributed Systems, vol.3, issue.2, pp.179-193, 1992.
DOI : 10.1109/71.127259

J. Guzmán and P. Hudak, Single-threaded polymorphic lambda calculus, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, 1990.
DOI : 10.1109/LICS.1990.113759

C. Hall, Using Hindley-Milner type inference to optimise list representation, Proceedings of the ACM Conference on Lisp and Functional Programming, pp.162-172, 1994.
DOI : 10.1145/182409.156781
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9444

J. Hannan, Staging transformations for abstract machines, Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, pp.130-141, 1991.

T. Hardin, L. Maranget, and B. Pagano, Functional back-ends within the lambda-sigma calculus, Proceedings of International Conference on Functional Programming, pp.25-33, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073659

J. Hatcliff and O. Danvy, A generic account of continuation-passing styles, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '94, pp.458-471, 1994.
DOI : 10.1145/174675.178053

N. Heintze and J. G. Riecke, The SLam calculus, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '98, pp.365-377, 1998.
DOI : 10.1145/268946.268976

L. J. Hendren, J. Hummel, and A. Nicolau, Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs, Proceedings ACM Conference on Programming Language Design and Implementation, pp.249-260, 1992.

C. Herrmann and C. Lengauer, Parallelization of divide-and-conquer by translation to nested loops, Journal of Functional Programming, vol.9, issue.3, pp.279-310, 1999.
DOI : 10.1017/S0956796899003287

C. A. Hoare, Communicating Sequential Processes, International Series in Computer Science, 1985.

H. Hosoya and A. Yonezawa, Garbage collection via dynamic type inference - A formal treatment -, Proceedings of the Second Workshop on Types in Compilation, 1998.
DOI : 10.1007/BFb0055520

P. Hudak, A semantic model of reference counting and its abstraction, Proceedings of Conference on Lisp and Functional Programming, pp.351-363, 1986.

G. Huet, Résolution d'équations dans les langages d'ordre 1, 2,??, Thèse de doctorat d'état, 1976.

J. Hughes, The design and implementation of programming languages, 1983.

K. Inoue, H. Seki, and H. Yagi, Analysis of functional programs to detect run-time garbage cells, ACM Transactions on Programming Languages and Systems, vol.10, issue.4, pp.555-578, 1988.
DOI : 10.1145/48022.48025

B. Jay and P. Steckler, The functional imperative: Shape!, European Symposium on Programming, pp.139-153, 1998.
DOI : 10.1007/BFb0053568

B. Jay, Costing parallel programs as a function of shapes, Science of Computer Programming, vol.37, issue.1-3, pp.207-224, 2000.
DOI : 10.1016/S0167-6423(99)00027-1

J. Jensen, M. Jørgensen, M. Schwartzbach, and N. Klarlund, Automatic verification of pointer programs using monadic second-order logic, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.226-234, 1997.
DOI : 10.1145/258916.258936

T. Jensen, D. L. Métayer, and T. Thorn, Verification of control flow based security policies, Proceedings of Symposium on Research in Security and Privacy, pp.89-103, 1999.

T. Johnsson, Compiling Lazy Functional Languages, 1987.

N. D. Jones, (éditeur) Semantics-Directed Compiler Generation, LNCS, vol.94, 1980.

N. Jones and S. Muchnick, Flow analysis and optimization of Lisp-like structures , in Program Flow Analysis: Theory and Applications, pp.102-131, 1981.

R. Jones, Abstract, Journal of Functional Programming, vol.2, issue.01, pp.73-79, 1992.
DOI : 10.1002/spe.4380170904

S. B. Jones and D. L. Métayer, Compile-time garbage collection by sharing analysis, Proceedings of the ACM Conference on Functional Programming and Computer Architecture, pp.54-74, 1989.

M. S. Joy, V. J. Rayward-smith, and F. W. Burton, Efficient combinator code, Computer Languages, vol.10, issue.3-4, 1985.
DOI : 10.1016/0096-0551(85)90017-7

U. Kastens and M. Schmidt, Lifetime analysis for procedure parameters, ESOP 86, pp.53-69, 1986.
DOI : 10.1007/3-540-16442-1_4

G. Kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. Lopes et al., Aspect-oriented programming, Proceedings of the European Conference on Object-Oriented Programming, 1997.

G. Kiczales, Aspect-oriented programming. Collection of Tech. Reports SPL-97-007 -010, 1997.

N. Klarlund and M. Schwartzbach, Graph types, Proceedings of ACM Principles of Programming Languages, pp.196-205, 1993.

N. Klarlund and M. Schwartzbach, Graphs and decidable transductions based on edge constraints, Proceedings Trees in Algebra and Programming - CAAP'94, pp.187-201, 1994.

N. Klarlund and M. Schwartzbach, A domain-specific language for regular sets of strings and trees, Proceedings of Domain Specific Languages, pp.145-156, 1997.
DOI : 10.1109/32.798326

J. W. Klop, Term rewriting systems, Handbook of Logic in Computer Science, pp.2-108, 1992.

D. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin et al., Orbit, Proceedings of 1986 ACM SIGPLAN Symposium on Compiler Construction, pp.219-233, 1986.
DOI : 10.1145/989393.989414

W. Landi and B. Ryder, Pointer induced aliasing, a problem classification, Proceedings ACM Principles of Programming Languages, pp.93-103, 1991.

P. J. Landin, The Mechanical Evaluation of Expressions, The Computer Journal, vol.6, issue.4, pp.308-320, 1964.
DOI : 10.1093/comjnl/6.4.308

X. Leroy, The Zinc experiment: an economical implementation of the ML language, Inria Technical Report, vol.117, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00070049

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 and F. Rouaix, Security properties of typed applets, Conference record of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.391-403, 1998.
URL : https://hal.archives-ouvertes.fr/hal-01499957

D. Lester, Combinator Graph Reduction: a congruence and its application, 1989.

S. Liang, P. Hudak, and M. P. Jones, Monad transformers and modular interpreters, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '95, pp.333-343, 1995.
DOI : 10.1145/199448.199528

R. D. Lins, Categorical multi-combinators, Proceedings of the ACM Conference on Functional Programming and Computer Architecture, pp.60-79, 1987.

R. Lins, S. Thompson, S. L. Peyton, and . Jones, Abstract, Journal of Functional Programming, vol.274, issue.01, pp.47-63, 1992.
DOI : 10.1016/S0165-6074(08)80048-8

J. Mallet, Compilation d'un langage spécialisé pour machine massivement parallèle. Doctorat de l'université de Rennes I, 1998.

E. Meijer and R. Paterson, Down with lambda lifting. Unpublished paper. copies available at: erik@cs.kun.nl, 1991.

G. Michaelson, N. Scaife, P. Bristow, and P. King, Engineering a parallel compiler for SML, Proceedings of the International Workshop on Implementation of Functional Languages, pp.213-226, 1998.

R. Milner, A theory of type polymorphism in programming, Journal of Computer and System Sciences, vol.17, issue.3, pp.348-375, 1978.
DOI : 10.1016/0022-0000(78)90014-4

R. Milner, A Calculus on Communicating Systems, LNCS, vol.92, 1980.
DOI : 10.1007/3-540-10235-3

R. Milner, Communicating and Mobile Systems: the ?-Calculus, 1999.

P. Mishra and U. S. Reddy, Declaration-free type checking, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '85, pp.7-21, 1985.
DOI : 10.1145/318593.318603

J. C. Mitchell, Abstract, Journal of Functional Programming, vol.17, issue.03, pp.245-286, 1991.
DOI : 10.1016/S0019-9958(82)80087-9

M. Mizuno and D. Schmidt, A security flow control algorithm and its denotational semantics correctness proof, Formal Aspects of Computing, vol.69, issue.2, pp.727-754, 1992.
DOI : 10.1007/BF03180570

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

G. Morrisett, M. Felleisen, and R. Harper, Abstract models of memory management, Proceedings of the seventh international conference on Functional programming languages and computer architecture , FPCA '95, pp.66-76, 1995.
DOI : 10.1145/224164.224182

G. Morrisett, D. Tarditi, P. Cheng, C. Stone, R. Harper et al., TIL: A Type-Directed Optimizing Compiler for ML, Proceedings of Conference on Programming Language Design and Implementation, pp.181-192, 1996.

G. Morrisett, D. Walker, K. Crary, and N. Glew, From System F to Typed Assembly Language, Conference record of the 25th ACM SIGPLAN-SI- GACT Symposium on Principles of Programming Languages, pp.85-97, 1998.
DOI : 10.1145/268946.268954
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.6526

G. Nadathur and D. Miller, An overview of ?Prolog, Proceedings of the 5th International Conference on Logic Programming, pp.810-827, 1988.

G. C. Necula, Proof-carrying code, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.106-119, 1997.
DOI : 10.1145/263699.263712

T. Nitsche, Shapeliness analysis of functional programs with algebraic data types, Science of Computer Programming, vol.37, issue.1-3, pp.225-252, 2000.
DOI : 10.1016/S0167-6423(99)00028-3

J. Palsberg and P. Ørbaek, Trust in the lambda-calculus, Proceedings of the 1995 Static Analysis Symposium, pp.314-330, 1995.
DOI : 10.7146/brics.v2i31.19934

M. Périn, Spécifications graphiques multi-vues : formalisation et vérification de cohérence. Doctorat de l'université de Rennes I, 2000.

S. L. Peyton and . Jones, The implementation of functional programming languages, 1987.

S. L. Peyton and . Jones, Implementing lazy functional languages on stock hardware: the spineless tagless G-machine, Journal of Functional Programming, vol.2, issue.2, pp.127-202, 1992.

S. L. Peyton-jones, D. L. Lester124-]-s, J. Peyton-jones, and . Launchbury, Implementing functional languages, a tutorial Unboxed values as first class citizens in a non-strict functional language, Proceedings of the ACM Conference on Functional Programming and Computer Architecture, pp.636-666, 1991.

S. L. Peyton-jones, W. Partain, and A. Santos, Let-floating: moving bindings to give faster programs, Proceedings of International Conference on Functional Programming, pp.1-12, 1996.

R. Plasmeijer and M. Van-eekelen, Functional Programming and Parallel Graph Rewriting, 1993.

W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in FORTRAN. The Art of Scientific Computing, 1986.

F. Prost, ML type inference for dead code analysis, 1997.

W. Pugh, Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, vol.336, pp.668-676, 1990.

W. Pugh, Counting solutions to presburger formulas: How and why, Proceedings of the Conference on Programming Language Design and Implementation, pp.121-134, 1994.
DOI : 10.1145/178243.178254

R. Rangaswami, A Cost Analysis for a Higher-Order Parallel Programming Model, 1996.

J. Raoult and F. Voisin, Set-theoretic graph rewriting, Proceedings of International Workshop on Graph Transformations in Computer Science, pp.312-325, 1993.
DOI : 10.1007/3-540-57787-4_20
URL : https://hal.archives-ouvertes.fr/inria-00074892

J. C. Reynolds, Types, abstraction, and parametric polymorphism, Proceedings of Information Processing, pp.513-523, 1983.

J. Rushby, Kernels for safety? In Safe and Secure Computer Systems, pp.310-320, 1987.

M. Sagiv, T. Reps, and R. Wilhelm, Solving shape-analysis problems in languages with destructive updating, Proceedings of ACM Principles of Programming Languages, pp.16-31, 1996.

A. Sastry, W. Clinger, and Z. Ariola, Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates, Proceedings of the conference on Functional programming languages and computer architecture , FPCA '93, pp.266-275, 1993.
DOI : 10.1145/165180.165222

D. A. Schmidt, Detecting global variables in denotational specifications, ACM Transactions on Programming Languages and Systems, vol.7, issue.2, pp.299-310, 1985.
DOI : 10.1145/3318.3323

D. A. Schmidt, Denotational Semantics, a Methodology for Language Development, 1986.

F. B. Schneider, Enforceable security policies, 1998.

R. Sedgewick, Algorithms in C, 1990.

P. Sestoft, Replacing function parameters by global variables, Proceedings of the fourth international conference on Functional programming languages and computer architecture , FPCA '89, pp.39-53, 1988.
DOI : 10.1145/99370.99374

Z. Shao and A. Appel, Space-efficient closure representations, Proceedings of the ACM Conference on Lisp and Functional Programming, pp.150-161, 1994.

G. L. Steele, Rabbit: a compiler for scheme, 1978.

J. E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, 1977.

M. Südholt, The Transformational Derivation of Parallel Programs using Data-Distribution Algebras and Skeletons, 1997.

N. Tawbi, Estimation of nested loops execution time by integer arithmetic in convex polyhedra, Proceedings of 8th International Parallel Processing Symposium, pp.217-223, 1994.
DOI : 10.1109/IPPS.1994.288298

T. Thorn, Vérification de politiques de sécurité par analyse de programmes. Doctorat de l'université de Rennes I, février, 1999.

A. Tolmach, Tag-free Garbage Collection Using Explicit Type Parameters, Proceedings of Conference on Lisp and Functional Programming, published as 1994 LISP Pointers, pp.1-11, 1994.

D. A. Turner, A new implementation technique for applicative languages, Software: Practice and Experience, vol.6, issue.1, pp.31-49, 1979.
DOI : 10.1002/spe.4380090105

D. A. Turner, Another algorithm for bracket abstraction, The Journal of Symbolic Logic, vol.41, issue.02, pp.267-270, 1979.
DOI : 10.1007/BF01448013

D. Volpano and G. Smith, A type-based approach to program security, Proceedings 7th TAPSOFT, pp.607-621, 1997.
DOI : 10.1007/BFb0030629

P. Wadler, Listlessness is better than laziness, Proceedings of the 1984 ACM Symposium on LISP and functional programming , LFP '84, pp.45-52, 1984.
DOI : 10.1145/800055.802020

P. Wadler, Fixing some space leaks with a garbage collector. Software Practice and Experience, pp.595-608, 1987.

P. Wadler, Deforestation: transforming programs to eliminate trees, Proceedings of the European Symposium on Programming, pp.344-358, 1988.

P. Wadler, Theorems for free!, Proceedings of the fourth international conference on Functional programming languages and computer architecture , FPCA '89, pp.347-359, 1989.
DOI : 10.1145/99370.99404

P. Wadler, Linear types can change the world!, IFIP Working Conference on Programming Concepts and Methods, 1990.

P. Wadler, Comprehending monads, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.61-78, 1990.
DOI : 10.1145/91556.91592

P. Wadler, The essence of functional programming, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.1-14, 1992.
DOI : 10.1145/143165.143169

D. S. Wallach, A New Approach to Mobile Code Security, 1999.

D. S. Wallach and E. W. Felten, Understanding Java stack inspection, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186), 1998.
DOI : 10.1109/SECPRI.1998.674823

D. Wilde, A library for polyhedral operations, Publication Interne, vol.785, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00074515

D. Wilde, The ALPHA language, 1994.
URL : https://hal.archives-ouvertes.fr/inria-00074378

G. Wilson, Assessing the Usability of Parallel Programming Systems: The Cowichan Problems, Proceedings of the IFIP Working Conference on Programming Environments for Massively Parallel Distributed Systems, 1994.
DOI : 10.1007/978-3-0348-8534-8_18

P. R. Wilson, Uniprocessor garbage collection techniques, Proceedings of Workshop on Memory Management, pp.1-42, 1992.
DOI : 10.1007/BFb0017182

P. Fradet and D. L. Métayer, Compilation of functional languages by program transformation, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.21-51, 1991.
DOI : 10.1145/114005.102805
URL : https://hal.archives-ouvertes.fr/inria-00075518

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

R. Douence and P. Fradet, A systematic study of functional language implementations, ACM Transactions on Programming Languages and Systems, vol.20, issue.2, pp.344-387, 1998.
DOI : 10.1145/276393.276397

P. Fradet and J. Mallet, Compilation of a specialized functional language for massively parallel computers, Journal of Functional Programming, vol.10, issue.6, 2000.
DOI : 10.1017/S0956796800003816
URL : https://hal.archives-ouvertes.fr/inria-00072760

P. Fradet and D. L. Métayer, Compilation of lambda-calculus into functional machine code, Proceedings TAPSOFT' 89, pp.155-166, 1989.
DOI : 10.1007/3-540-50940-2_34

P. Fradet, Syntactic detection of single-threading using continuations, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, FPCA'91, pp.241-258, 1991.
DOI : 10.1007/3540543961_12

P. Fradet, Compilation of head and strong reduction [174] P. Fradet. Collecting more garbage, Proc of the 5th European Symposium on Programming, ESOP'94 Proceedings of ACM Conference on Lisp and Functional Programming, LISP'94, pp.211-224, 1994.

R. Douence and P. Fradet, Towards a taxonomy of functional language implementations, Proceedings of 7th International Symposium on Programming Languages: Implementations, Logics and Programs, PLILP'95, pp.34-45, 1995.
DOI : 10.1007/BFb0026812

P. Fradet, R. Gaugne, and D. L. Métayer, Static detection of pointer errors: An axiomatisation and a checking algorithm, Proceedings European Symposium on Programming, ESOP' 96, pp.125-140, 1996.
DOI : 10.1007/3-540-61055-3_33

P. Fradet and L. Métayer, Shape types, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.27-39, 1997.
DOI : 10.1145/263699.263706

P. Fradet, D. L. Métayer, and M. Périn, Consistency checking for multiple view software architectures, Proceedings of the Joint European Software Engineering Conference and Symposium on Foundations of Software Engineering , ESEC/FSE'99) ou LNCS, pp.410-428, 1999.
DOI : 10.1145/318774.319258

T. Colcombet and P. Fradet, Enforcing trace properties by program transformation, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '00, pp.54-66, 2000.
DOI : 10.1145/325694.325703
URL : https://hal.archives-ouvertes.fr/inria-00000937

P. Fradet, V. Issarny, and S. Rouvrais, Analyzing Non-functional Properties of Mobile Agents, Proceedings of Fundamental Approaches to Software Engineering , FASE'00, 2000.
DOI : 10.1007/3-540-46428-X_22

P. Fradet and D. L. Métayer, Type checking for a multiset rewriting language, Proceedings the LOMAPS workshop on Analysis and Verification of Multiple-agent Languages, pp.126-140, 1996.

P. Fradet and M. Südholt, Towards a generic framework for aspect-oriented programming, Third Aspect Oriented Programming Workshop, Object-Oriented Technology, ECOOP'98 Workshop Reader, pp.394-397, 1998.

P. Fradet and M. Südholt, An aspect language for robust programming, International Workshop on Aspect-Oriented Programming, AOP' 99, 1999.

P. Fradet and D. L. Métayer, Compilation de langages fonctionnels par transformation de programmes, Journées francophones des langages applicatifs , JFLA'90, pp.123-133, 1990.

R. Douence and P. Fradet, Décrire et comparer les implantations de langages fonctionnels, Journées francophones des langages applicatifs, JFLA'96, Collection Inria Didactique, pp.183-203, 1996.

P. Fradet and D. L. Métayer, From lambda-calculus to machine code by program transformation. Prospects for Functional Programming in, 1991.

P. Fradet and D. L. Métayer, Compilation of functional languages by program transformation. Inria research report 1040, 1989.
URL : https://hal.archives-ouvertes.fr/inria-00075518

P. Fradet, Compilation of head and strong reduction. (version étendue) Inria research report 2132, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00074540

R. Douence and P. Fradet, A taxonomy of functional language implementations . Part I: call-by-value. Inria research report 2783, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073908

R. Douence and P. Fradet, A taxonomy of functional language implementations . Part II: call-by-name, call-by-need, and graph reduction, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073908

P. Fradet, R. Gaugne, and D. L. Métayer, An inference algorithm for the static verification of pointer manipulation, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073795

P. Fradet and J. Mallet, Compilation of a specialized functional language for massively parallel computers, Inria Tech, 2000.

P. Fradet, D. L. Métayer, and M. Périn, Consistency checking for multiple view software architectures (version étendue) Irisa research report 1249, 2000.

E. Denney, P. Fradet, C. Goire, T. Jensen, and D. L. Métayer, Procédé de vérification de transformateurs de codes pour un système embarqué, notamment sur une carte à puce, 1999.