L. Codes and . Vides, C'était donc des états accessibles et d'après le lemme 30, ces états sont simulables

. Le-test,-d-'de, . La, and . Forte, une instruction courante Loc est faux Dans ce cas, la décompilation donne un terme qui n'est pas réductible car son test sera aussi faux et qui n

?. Si and . Est-une-réduction-locale, alors nous avons e = ? a i [e a i ] et e = ? b j [e b j ]. Nous avons alors trois cas

S. and =. Et-i, = j alors par le lemme 92.2, il n'existe qu'un seul vecteur parallèle à réduire (provenant d'un unique vecteur départemental) Comme précédemment, les règles s'entrelacent et sont chacune déter- ministe

N. Ous-présentons-des-travaux-connexes, preuve de programmes ou les structures de données parallèles, et d'autre part, des modèles et des langages pour le méta-calcul. 13.2. PERSPECTIVES Minimally Synchronous Parallel ML. De nouveaux travaux sur MSPML ont été entrepris à l'été Il reste encore beaucoup à faire, et une nouvelle thèse a commencé en septembre 2005. Les travaux en cours prolongent [25, 26] afin d'avoir une preuve de correction des mécanismes de gestion des environnements de communications, Cette preuve pourrait être effectuée avec les Abstract State Machines, 2005.

. Celle-ci-pourrait-alors-Être-utilisée-pour-guider-une-implantation-modulaire-de-mspml-comme-celle-de-bsml-dans-le-chapitre-4, En effet, pour le moment, MSPML est seulement implantée avec les outils TCP/IP d'OCaml. Cela rend les programmes non-portables car dans un grand nombre d'architectures parallèles, les processeurs n'ont pas d'adresse IP. Une implantation modulaire permettrait l'utilisation de bibliothèques de plus «bas niveau» et tolérantes aux pannes [49] ou optimales sur certains types de réseaux. Une dernière direction sera la comparaison formelle et réelle des coûts BSP et MPM de nos sémantiques . Par réelle, nous parlons, bien entendu, des temps d'exécution des programmes BSML et MSPML sur une machine parallèle

A. En, D. Metacomputing, and M. , On trouve dans la littérature de nombreux algorithmes BSP pour différents domaines d'application. Un travail intéressant serait l'adaptation et l'implantation de ces algorithmes en DMML. Un premier pas serait la définition d'un ensemble d'algorithmes classique DMM comme il a été fait pour BSP [147] et d'un programme de tests

. Tolérance-aux-pannes, La documentation de la dernière version de l'Oxford BSPlib indiquait que la version suivante devait contenir la migration de processus appliquée à l'équilibrage de charges et à la tolérance aux pannes. Mais cette version n'a jamais été diffusée. L'actuelle implantation de la bibliothèque PUB propose une version basée sur TCP/IP permettant de faire migrer des processus

D. Le-modèle, D. Le-langage, and . Offrent-une-telle-structuration, Il est alors tout à fait envisageable d'améliorer notre implantation actuelle avec

O. Ainsi and . Peut-imaginer-dans-un-système-grid-qu-'un-utilisateur-soumet-un-agent, un programme ) à exécuter et que, selon différentes contraintes, cet agent migre sur la machine parallèle permettant une exécution dudit programme dans le respect de ces contraintes Une possibilité est de plonger le BS?calcul dans le join-calcul [120] afin de voir quels peuvent être les possibilités offertes et les problèmes potentiels. Une autre approche intéressante serait d'implanter les primitives BSML pour Dynamic BSP [198] ou de créer de nouvelles primitives pour ce modèle, Nous pourrions utiliser les fonctionnalités de mobilité de langages fonctionnels déjà existant comme JoCaml [72] ou Acute [237]. Publications Revues internationales [R1] F. Gava. External Memory in Bulk-Synchronous Parallel ML. Parallel and Distributed Computing Practices

F. Gava and F. Loulergue, A Functional Language for Departmental Metacomputing. Parallel Processing Letters, pp.289-304, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00110829

F. Gava and F. Loulergue, A static analysis for Bulk Synchronous Parallel ML to avoid parallel nesting, Future Generation Computer Systems, vol.21, issue.5, pp.665-671, 2005.
DOI : 10.1016/j.future.2004.05.006
URL : https://hal.archives-ouvertes.fr/hal-00110830

F. [. Loulergue, M. Gava, F. Arapinis, and . Dabrowski, Semantics and Implementation of Minimally Synchronous Parallel ML, International Journal of Computer and Information Science ACIS, vol.5, issue.3, pp.182-199, 2004.

F. Gava, Formal Proofs of Functional BSP Programs. Parallel Processing Letters, pp.365-376, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00005601

F. Loulergue and F. Gava, Billiet Bulk-Synchronous Parallel ML : Modular Implementation and Performance Prediction, The International Conference on Computational Science Part IV, pp.1046-1054, 2005.
DOI : 10.1007/11428848_132
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.3833

F. Gava, Parallel I/O in Bulk-Synchronous Parallel ML, The International Conference on Computational Science Part III, pp.339-346, 2004.
DOI : 10.1007/978-3-540-24688-6_45

. [. Gava, Design of Deparmental Metacomputing ML, The International Conference on Computational Science, pp.50-53, 2004.

F. Gava and F. Loulergue, Semantics of a Functional Bulk Synchronous Parallel Language with Imperative Features, Parallel Computing : Software Technology, Algorithms, Architectures and Applications, Proceeding of the 10th ParCo Conference, 2003.

F. Gava, F. Loulergue, and F. Dabrowski, A Parallel Categorical Abstract Machine for Bulk Synchronous Parallel ML, 4th International Conference on Software Engineering , Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'03), pp.293-300, 2003.

F. Dabrowski, F. Loulergue, and F. Gava, Pattern Matching of Parallel Values in Bulk Synchronous Parallel ML, 4th International Conference on Software Engineering , Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'03), pp.301-308, 2003.

M. Arapinis, F. Loulergue, F. Gava, and F. Dabrowski, Semantics of Minimally Synchronous Parallel ML, 4th International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'03), pp.260-267, 2003.

F. Gava and F. Loulergue, A Polymorphic Type System for Bulk Synchronous Parallel ML, Seventh International Conference on Parallel Computing Technologies number 2763 in LNCS, pp.215-229, 2003.
DOI : 10.1007/978-3-540-45145-7_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.345

F. Gava and F. Loulergue, A Parallel Virtual Machine for Bulk Synchronous Parallel ML, International Conference on Computational Science Part I, number 2657 in LNCS, pp.155-164, 2003.
DOI : 10.1007/3-540-44860-8_16

F. Gava, A modular implementation of data structures in Bulk-Synchronous Parallel ML Third Workshop on High-Level Parallel Programming and Applications, 2003.

F. Gava, Une implantation de la juxtaposition, Journées Francophones des Langages Applicatif, 2006.

F. Gava, Une biblioth??que certifi??e de programmes fonctionnels BSP, Journées Francophones des Langages Applicatif, JFLA, pp.55-68, 2004.
DOI : 10.3166/tsi.25.1261-1280

F. Gava and F. Loulergue, Synthèse de types pour Bulk Synchronous Parallel ML, Journées Francophones des Langages Applicatifs, pp.153-168, 2003.

H. Adachi, Z. Iwasaki, and . Hu, Diff : A Powerfull Parallel Skeleton, The 2000 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), pp.425-527, 2000.

G. Akerholt, K. Hammond, S. Peyton-jones, and P. Trinder, Processing transactions on GRIP, a parallel graph reducer, Bode et al
DOI : 10.1007/3-540-56891-3_51

M. Aldinucci, M. Coppola, and M. Danelutto, Rewriting Skeleton Programs : How to Evaluate the Data-Parallel Stream-Parallel Tradeof, First International Workshop on Constructive Methods for Parallel Programming (CMPP'98), Research Report MIP-9805, 1998.

A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman, LogGP, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures , SPAA '95, pp.71-79, 1997.
DOI : 10.1145/215399.215427

J. Allard, V. Gouranton, L. Lecointre, E. Melin, and B. Raffin, Net Juggler: running VR Juggler with multiple displays on a commodity component cluster, Proceedings IEEE Virtual Reality 2002, 2002.
DOI : 10.1109/VR.2002.996534

R. Alpert and J. Philbin, cbsp : Zero-cost synchronization in a modified bsp model, 1997.

K. R. Apt and E. Olderog, Verification of sequential and concurrent programs, 1997.

L. Arge, D. E. Vengroff, and J. S. Vitter, External-Memory Algorithms for Processing Line Segments in Geographic Information Systems, Algorithms -ESA '95, Third Annual European Symposium Proceedings, volume 979 of Lecture Notes in Computer Science, pp.295-310, 1995.
DOI : 10.7146/brics.v3i12.19975

A. and R. Nikhil, I-structures : Data structures for parallel computing, ACM Transactions on Programming Languages and Systems, vol.11, issue.4, 1989.

M. J. Atallah, F. Dehne, R. Miller, A. Rau-chaplin, and J. Tsay, Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers, Journal of Parallel and Distributed Computing, vol.20, issue.1, pp.1-13, 1994.
DOI : 10.1006/jpdc.1994.1001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.7579

O. Aumage, L. Bougé, and I. Madeleine, Madeleine II: a portable and efficient communication library for high-performance cluster computing, Proceedings IEEE International Conference on Cluster Computing. CLUSTER 2000, pp.607-626, 2002.
DOI : 10.1109/CLUSTR.2000.889004

O. Aumage, L. Bougé, A. Denis, L. Eyraud, R. Namyst et al., Communications efficaces au sein d'une interconnexion hétérogène de grappes : Exemple de mise en oeuvre dans la bibliothèque madeleine, Calcul réparti à grande échelle, pp.103-128, 2002.

O. Aumage and G. Mercier, MPICH/MADIII : a cluster of clusters enabled MPI implementation, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings., 2003.
DOI : 10.1109/CCGRID.2003.1199349
URL : https://hal.archives-ouvertes.fr/hal-00344362

M. Aumor, F. Arguello, J. Lopez, O. Plata, and L. Zapata, A Data-Parallel Formulation for Divide and Conquer Algorithms, The Computer Journal, vol.44, issue.4, pp.303-320, 2001.
DOI : 10.1093/comjnl/44.4.303

B. Bacci, M. Danelutto, S. Orlando, S. Pelagatti, and M. Vanneschi, P3L: A structured high-level parallel language, and its structured support, Concurrency : Practice and Experiences, pp.225-255, 1995.
DOI : 10.1002/cpe.4330070305
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.6425

O. Ballereau, F. Loulergue, and G. Hains, High-level BSP Programming : BSML and BS?, Trends in Functional Programming, pp.29-38, 2000.

M. Bamha, L'implémentation d'un langage portable à parallélisme emboîté en processus statiques, 1996.

M. Bamha and M. Exbrayat, Pipelining a Skew-Insensitive Parallel Join Algorithm. Parallel Processing Letters, pp.317-328, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00081339

M. Bamha and G. Hains, Frequency-adaptive join for Shared Nothing machines, Parallel and Distributed Computing Practices, pp.333-345, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00081345

M. Bamha and G. Hains, An Efficient Equi-semi-join Algorithm for Distributed Architectures, International Conference on Computational Science (ICCS 2005), 2005.
DOI : 10.1007/11428848_97
URL : https://hal.archives-ouvertes.fr/hal-00081352

H. P. Barendregt, Functional Programming and Lambda Calculus, Handbook of Theoretical Computer Science, pp.321-364, 1990.
DOI : 10.1016/B978-0-444-88074-1.50012-3

B. Barras, Auto-validation d'un système de preuves avec familles inductives, 1999.

W. Bäumker, A. Dittrich, and F. Meyer-auf-der-heide, Truly efficient parallel algorithms : coptimal multisearch for an extension of the BSP model, 3 rd European Symposium on Algorithms (ESA), pp.17-30, 1995.

D. Beauquier and A. Slissenko, A first order logic for specification of timed algorithms: basic properties and a decidable class, Annals of Pure and Applied Logic, vol.113, issue.1-3, 2002.
DOI : 10.1016/S0168-0072(01)00049-5

A. Belbekkouche, Mspml : Environnements de communication et tolérance au pannes, 2005.

R. Benheddi, Composition parallèle pour mspml : sémantique et implémentation, 2005.

R. Benzinger, Automated higher-order complexity analysis, Theoretical Computer Science, vol.318, issue.1-2, pp.79-103, 2004.
DOI : 10.1016/j.tcs.2003.10.022

J. Berthold, Towards a Generalised Runtime Environment for Parallel Haskells, The International Conference on Computational Science Part III, pp.307-314, 2004.
DOI : 10.1007/978-3-540-24688-6_41

J. Berthold and R. Loogen, Analysing dynamic channels for topology skeletons in eden, 2004.

Y. Berthot and P. Castéran, Interactive Theorem Proving and Program Development, 2004.
DOI : 10.1007/978-3-662-07964-5

P. B. Bhat, V. K. Prasanna, and C. Raghavendra, Adaptive Communication Algorithms for Distributed Heterogeneous Systems, Journal of Parallel and Distributed Computing, vol.59, issue.2, pp.252-279, 1999.
DOI : 10.1006/jpdc.1999.1571

G. Bilardi, K. T. Herley, A. Pietracaprina, G. Pucci, and P. Spirakis, BSP versus LogP, Algorithmica, vol.24, issue.3-4, pp.405-422, 1999.
DOI : 10.1007/PL00008270

R. S. Bird, An Introduction to the Theory of Lists, Logic of Programming and Calculi of Discrete Design, pp.3-42, 1987.
DOI : 10.1007/978-3-642-87374-4_1

R. H. Bisseling, Parallel Scientific Computation. A structured approach using BSP and MPI, 2004.
DOI : 10.1093/acprof:oso/9780198529392.001.0001

R. H. Bisseling and W. F. Mccoll, Scientific computing on bulk synchronous parallel architectures, Technology and Foundations : Information Processing '94, pp.509-514, 1994.

V. Blanco, J. A. González, C. León, C. Rodríguez, G. Rodríguez et al., Predicting the performance of parallel programs, Parallel Computing, vol.30, issue.3, pp.337-356, 2004.
DOI : 10.1016/j.parco.2003.11.004

G. E. Blelloch, Vector Models for Data-Parallel Computing, 1990.

G. E. Blelloch, NESL : A Nested Data-Parallel Language (version 2.6), 1993.

O. Bonorden, B. Juurlink, I. V. Otte, and O. Rieping, The Paderborn University BSP (PUB) library, Parallel Computing, vol.29, issue.2, pp.187-207, 2003.
DOI : 10.1016/S0167-8191(02)00218-1

O. Bonorden, F. Meyer-auf-der-heide, and R. Wanka, Composition of Efficient Nested BSP Algorithms : Minimum Spanning Tree Computation as an Instructive Example, International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002.

E. Börger and R. Stärk, Abstract State Machines, 2003.
DOI : 10.1007/978-3-642-18216-7

G. Bosilca, A. Bouteiller, F. Cappello, S. Djilali, G. Fédak et al., MPICH-V: Toward a Scalable Fault Tolerant MPI for Volatile Nodes, ACM/IEEE SC 2002 Conference (SC'02), 2002.
DOI : 10.1109/SC.2002.10048
URL : https://hal.archives-ouvertes.fr/in2p3-00457138

L. Bougé, Le modèle de programmation à parallélisme de données : une perspective sémantique, RAIRO Technique et Science Informatiques, vol.12, issue.5, 1993.

L. Bougé, D. Cachera, Y. Le-guyadec, G. Utard, and B. Virot, Formal validation of data-parallel programs: a two-component assertional proof system for a simple language, Theoretical Computer Science, vol.189, issue.1-2, pp.71-107, 1997.
DOI : 10.1016/S0304-3975(97)00041-8

A. Bouteiller, F. Cappello, T. Herault, G. Krawezik, P. Lemarinier et al., MPICH-V2, Proceedings of the 2003 ACM/IEEE conference on Supercomputing, SC '03, 2003.
DOI : 10.1145/1048935.1050176

A. Bouteiller, B. Collin, T. Herault, P. Lemarinier, and F. Cappello, Impact of Event Logger on Causal Message Logging Protocols for Fault Tolerant MPI, 19th IEEE International Parallel and Distributed Processing Symposium, 2005.
DOI : 10.1109/IPDPS.2005.249

A. Bouteiller, H. Bouziane, T. Herault, P. Lemarinier, and F. Cappello, Hybrid Preemptive Scheduling of MPI Applications on the Grids, Fifth IEEE/ACM International Workshop on Grid Computing, 2004.
DOI : 10.1109/GRID.2004.39
URL : https://hal.archives-ouvertes.fr/inria-00574591

A. Bouteiller, P. Lemarinier, G. Krawezik, and F. Cappello, Coordinated checkpoint versus message log for fault tolerant MPI, Proceedings IEEE International Conference on Cluster Computing CLUSTR-03, 2005.
DOI : 10.1109/CLUSTR.2003.1253321

S. Boutin, Proving correctness of the translation from mini-ml to the cam with the coq proof development system, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00074142

A. Braud and C. Vrain, A parallel genetic algorithm based on the BSP model, Evolutionary Computation and Parallel Processing GECCO & AAAI Workshop, 1999.

S. Breitinger, R. Loogen, Y. Ortega-mallén, R. Pe, and . Marí, Eden ??? The paradise of functional concurrent programming, Euro-Par'96 Parallel Processing, number 1124 in LNCS, pp.359-368, 1996.
DOI : 10.1007/3-540-61626-8_93

F. Cabestre, C. Percebois, and J. Bodeveix, Abstract machine construction through operational semantics refinements, Future Generation Computer Systems, vol.16, issue.7, pp.753-769, 2000.
DOI : 10.1016/S0167-739X(99)00089-8

R. Calinescu, Bulk synchronous parallel scheduling of uniform dags, Euro-Par'96. Parallel Processing, pp.555-562, 1996.
DOI : 10.1007/BFb0024748
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.9735

D. K. Campbell, A survey of models of parallel computation, 1997.

F. Cappello, P. Fraigniaud, B. Mans, and A. L. Rosenberg, HiHCoHP-Toward a realistic communication model for hierarchical hyperclusters of heterogeneous processors, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, 2001.
DOI : 10.1109/IPDPS.2001.924978

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

D. Caromel, W. Klauser, and J. Vayssière, Towards seamless computing and metacomputing in java, Concurrency : Practive and Experience, pp.11-131043, 1998.

E. Caron, O. Cozette, D. Lazure, and G. Utard, Virtual memory management in data parallel applications, HPCN Europe, pp.1107-1116, 1999.
DOI : 10.1007/BFb0100671
URL : https://hal.archives-ouvertes.fr/hal-01444354

E. Caron and G. Utard, On the performance of parallel factorization of out-of-core matrices, Parallel Computing, vol.30, issue.3, pp.357-375, 2004.
DOI : 10.1016/j.parco.2004.02.002
URL : https://hal.archives-ouvertes.fr/hal-01431496

E. Chailloux, P. Manoury, and B. Pagano, Développement d'applications avec Objective Caml, 2000.
DOI : 10.3166/tsi.24.1055-1080

S. Giloi, B. D. Jähnichen, and . Shriver, Programming Models and Tools for Massively Parallel Computers, Proceedings of, pp.167-174, 1995.
DOI : 10.1016/B978-0-444-81784-6.50007-5

A. Chan, F. Dehne, and R. Taylor, CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines, International Journal of High Performance Computing Applications, vol.19, issue.1, 2005.
DOI : 10.1177/1094342005051196

Y. Chen and W. Sanders, TOP-DOWN DESIGN OF BULK-SYNCHRONOUS PARALLEL PROGRAMS, Parallel Processing Letters, vol.13, issue.03, pp.389-400, 2003.
DOI : 10.1142/S0129626403001367

Y. Chiang, M. T. Goodrich, E. F. Grove, D. E. Vengroff, and J. S. Vitter, External-memory Graphs Algorithms, ACM-SIAM Symp on Discrete Algorithms, pp.139-149, 1995.

F. Clément, A. Vodicka, R. D. Cosmo, and P. Weis, Parallel programming with the ocamlp3l system, application to to numerical code coupling, 2004.

J. Clinckemaillie, B. Elsner, G. Lonsdale, S. Meliciani, S. Vlachoutsis et al., Performance Issues of the Parallel Pam-Crash Code, International Journal of High Performance Computing Applications, vol.11, issue.1, pp.3-11, 1997.
DOI : 10.1177/109434209701100101

M. Cole, Algorithmic Skeletons, 1989.
DOI : 10.1007/978-1-4471-0841-2_13

M. Cole, Bringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming, Parallel Computing, vol.30, issue.3, pp.389-406, 2004.
DOI : 10.1016/j.parco.2003.12.002

M. Cole and Y. Hayashi, Static Performance Prediction of Skeletal Programs. Parallel Algorithms and Applications, pp.59-84, 2002.

S. Conchon and F. L. Fessant, Jocaml: mobile agents for Objective-Caml, Proceedings. First and Third International Symposium on Agent Systems Applications, and Mobile Agents, pp.22-29, 1999.
DOI : 10.1109/ASAMA.1999.805390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.9051

. Th, G. Coquand, and . Huet, The Calculus of Constructions, Information and Computation, vol.37, issue.2-3, 1988.

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

G. Cousineau and M. Mauny, Approche Fonctionnelle de la Programmation, Ediscience International, 1995.

A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, and E. Ramos, Randomized external-memory algorithms for some geometric problems, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.259-268, 1998.
DOI : 10.1145/276884.276914

D. E. Culler, R. M. Karp, D. A. Patterson, A. Sahey, K. E. Schauser et al., LogP: towards a realistic model of parallel computation, ACM SIGPLAN Notices, vol.28, issue.7, pp.1-12, 1993.
DOI : 10.1145/173284.155333

P. Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, 1993.
DOI : 10.1007/978-1-4612-0317-9

M. Danelutto, R. Di-cosmo, X. Leroy, and S. Pelagatti, Parallel functional programming with skeletons : the OcamlP3L experiments, The ML Workshop, 1998.

M. Danelutto, R. Di-cosmo, X. Leroy, and S. Pelagatti, Ocamlp3l a functional parallel programming system, 1998.

O. Danvy, A Journey from Interpreters to Compilers and Virtual Machines, number 2830, 2003.
DOI : 10.1007/978-3-540-39815-8_7

O. Danvy, A Rational Deconstruction of Landin's SECD Machine, LNCS, vol.3474, pp.52-71, 2005.

J. Darlington, A. J. Field, P. G. Harrison, P. Kelly, D. Sharp et al., Parallel programming using skeleton functions, Bode et al
DOI : 10.1007/3-540-56891-3_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.6680

J. Darlington, Y. Guo, H. W. To, and Y. Jing, Skeletons for structured parallel composition, Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1995.

N. G. De-bruijn, Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, whith application to the Church-Rosser theorem, Indag. Math, vol.34, pp.381-392, 1972.

P. De-la-torre and C. P. , Submachine locality in the bulk synchronous setting, Euro-Par'96 Parallel Processing, number 1124 in LNCS, pp.359-368, 1996.
DOI : 10.1007/BFb0024723

F. Dehne, Special issue on coarse-grained parallel algorithms, Algorithmica, vol.14, pp.173-421, 1999.

F. Dehne, W. Dittrich, and D. Hutchinson, Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms, Algorithmica, vol.36, issue.2, pp.97-122, 2003.
DOI : 10.1007/s00453-002-1009-y
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5743

F. Dehne, W. Dittrich, D. Hutchinson, and A. Maheshwari, Parallel virtual memory, 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.889-890, 1999.

F. Dehne, W. Dittrich, D. Hutchinson, and A. Maheshwari, Bulk Synchronous Parallel Algorithms for the External Memory Model, Theory of Computing Systems, pp.567-598, 2003.
DOI : 10.1007/s00224-002-1066-2

F. Dehne, A. Fabri, and A. Rau-chaplin, SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS, International Journal of Computational Geometry & Applications, vol.06, issue.03, pp.379-400, 1996.
DOI : 10.1142/S0218195996000241

A. Denis, C. Pérez, and T. Priol, PadicoTM: an open integration framework for communication middleware and runtimes, Future Generation Computer Systems, vol.19, issue.4, pp.575-585, 2003.
DOI : 10.1016/S0167-739X(03)00034-7
URL : https://hal.archives-ouvertes.fr/inria-00000132

N. Deo and P. Micikevicius, Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem, 4th International Workshop Distributed Computing, Mobile and Wireless Computing (IWDC), volume 2571 of LNCS, pp.55-66, 2002.
DOI : 10.1007/3-540-36385-8_6

D. Cosmo and S. Pelagatti, A Calculus for Dense Array Distributions. Parallel Processing Letters, pp.377-388, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00149567

W. Dittrich and D. Hutchinson, Blocking in Parallel Multisearch Problems, Theory of Computing Systems, pp.145-189, 2001.
DOI : 10.1007/s00224-001-0002-1

W. Dosch, A pair-based functional skeleton and its list homomorphic implementation, Tenth International Conference on Parallel and Distributed Computing and Systems (PDCS'98), pp.561-567, 1998.

W. Dosch and B. Wiedemann, Calculating list homomorphism for parallel bracket matching, Proceedings of the Internatioanl Conference on Parallel and Distributed Processing Techniques and Applications, volume IV, pp.1710-1717, 2000.

M. Dowse and A. Butterfield, A language for reasoning about concurrent functional I/O, 2004.

D. C. Dracopoulos and S. Kent, Speeding up genetic programming : A parallel BSP implementation, First Annual Conference on Genetic Programming, 1996.

A. Fahmy and A. Heddaya, Communicable memory and lazy barriers for bulk synchronous parallelism in bspk, 1996.

P. Ferragina and F. Luccio, String Search in Coarse-Grained Parallel Computers, Algorithmica, vol.24, issue.3-4, pp.177-194, 1999.
DOI : 10.1007/PL00008259

J. Filliâtre, Verification of non-functional programs using interpretations in type theory, Journal of functional Programming, vol.13, issue.4, 2003.
DOI : 10.1017/S095679680200446X

J. Filliâtre and P. Letouzey, Functors for Proofs and Programs, Proceedings of The European Symposium on Programming, pp.370-384, 2004.
DOI : 10.1007/978-3-540-24725-8_26

J. Filliâtre, Why : a software verification tool, 2003.

C. Foisy and E. Chailloux, Caml Flight : a portable SPMD extension of ML for distributed memory multiprocessors, Workshop on High Performance Functionnal Computing, 1995.

C. Foisy, J. Vachon, and G. Hains, DPML : de la sémantique à l'implantation, Journées Francophones des Langages Applicatifs, number 11 in Collection Didactique, 1994.

S. Fortune and J. Wyllie, Parallelism in random access machines, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, 1978.
DOI : 10.1145/800133.804339

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

J. Furuse and P. Weis, Safe value I/O in Caml, Journées Francophones des Langages Applicatifs (JFLA), pp.79-99, 2000.

E. Gascard and L. Pierre, Formal proof of applications distributed in symmetric interconnection networks. Parallel Processing Letters, 2003.

A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek et al., PVM Parallel Virtual Machine. A User's Guide and Tutorial for Networked Parallel Computing. Scientific and Engineering Computation Series, 1994.

A. V. Gerbessiotis and C. J. Siniolakis, Architecture independent parallel selection with applications to parallel priority queues, Theoretical Computer Science, vol.301, issue.1-3, pp.119-142, 2003.
DOI : 10.1016/S0304-3975(02)00572-8

A. V. Gerbessiotis, C. J. Siniolakis, and A. Tiskin, Parallel priority Queue and list contraction: The BSP approach, Computing and Informatics, vol.21, pp.59-90, 2002.
DOI : 10.1007/BFb0002764

A. V. Gerbessiotis and L. G. Valiant, Direct Bulk-Synchronous Parallel Algorithms, Journal of Parallel and Distributed Computing, vol.22, issue.2, pp.251-267, 1994.
DOI : 10.1006/jpdc.1994.1085
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9332

P. B. Gibbons, Y. Matias, and V. Ramachandran, The QRQW-PRAM : Accouting for convention in parallel algorithms, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.638-648, 1994.

J. Girard, Y. Lafont, and P. Taylor, Proofs and types, volume 7 of Cambridge Tracts in Theoretical Computer Science, 1989.

G. Gonthier and C. Fournier, The Join Calculus : a Language for Distributed Mobile Programming, Applied Semantics, number 2395 in LNCS, pp.268-332, 2002.

M. T. Goodrich, J. J. Tsay, D. E. Vengroff, and J. S. Vitter, External-memory computational geometry, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp.714-723, 1993.
DOI : 10.1109/SFCS.1993.366816
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.6690

A. Gordon and R. L. Crole, A sound metalogical semantics for input/output effects, Mathematical Structures in Computer Science, vol.9, pp.125-188, 1999.

S. Gorlatch, Message passing without send???receive, Future Generation Computer Systems, vol.18, issue.6, pp.797-805, 2002.
DOI : 10.1016/S0167-739X(02)00052-3

L. Granvilliers, G. Hains, Q. Miller, and N. Romero, A system for the high-level parallelization and cooperation of constraint solvers, Proceedings of International Conference on Parallel and Distributed Computing and Systems (PDCS), pp.596-601, 1998.

C. Grelck and S. Scholz, Classes and objects as basis for I/O in SAC, Proceedings of IFL'95, pp.30-44, 1995.

B. Grobauer, Cost recurrences for DML programs, ACM SIGPLAN Notices, vol.36, issue.10, pp.253-264, 2001.
DOI : 10.1145/507669.507666
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.7863

B. Grégoire, Compilation de termes de preuves : un (nouveau) mariage entre Coq et OCaml, 2004.

Y. Gu, B. Lee, and W. Cai, JBSP: A BSP Programming Library in Java, Journal of Parallel and Distributed Computing, vol.61, issue.8, pp.611126-1142, 2001.
DOI : 10.1006/jpdc.2001.1735

I. Guérin-lassous and J. Gustedt, Portable List Ranking: An Experimental Study, ACM Journal of Experiments Algorithms, vol.7, issue.7, pp.1-18, 2002.
DOI : 10.1007/3-540-44691-5_10

J. A. Gunnels, F. G. Gustavson, G. M. Henry, and R. A. Van-de-geijn, FLAME: Formal Linear Algebra Methods Environment, ACM Transactions on Mathematical Software, vol.27, issue.4, pp.422-455, 2001.
DOI : 10.1145/504210.504213
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.7096

Y. Gurevich, Evolving Algebras 1993 : Lipari Guide, Specification and Validation Methods, pp.9-36, 1995.

J. Gustedt, Towards Realistic Implementations of External Memory Algorithms Using a Coarse Grained Paradigm, 2003.
DOI : 10.1007/3-540-44843-8_29
URL : https://hal.archives-ouvertes.fr/inria-00099787

G. Hains, Subset synchronization in BSP computing, PDPTA'98, International Conference on Parallel and Distributed Processing Techniques and Applications, pp.242-246, 1998.

G. Hains and C. Foisy, The data-parallel categorical abstract machine, PARLE'93, Parallel Architectures and Languages Europe, number 694 in LNCS, pp.56-67, 1993.
DOI : 10.1007/3-540-56891-3_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.3701

G. Hains and F. Loulergue, Functional Bulk Synchronous Parallel Programming using the BSMLlib Library Advances in Computation : Theory and Practice, Constructive Methods for Parallel Programming, pp.165-178, 2002.

K. Hammond, J. Berthold, and R. Loogen, AUTOMATIC SKELETONS IN TEMPLATE HASKELL, Parallel Processing Letters, vol.13, issue.03, pp.413-424, 2003.
DOI : 10.1142/S0129626403001380

K. Hammond and P. W. Trinder, Comparing parallel functional languages : Programming and performance. Higher-order and Symbolic Computation, 2003.

J. Hannan and D. Miller, From operational semantics to abstract machines, Mathematical Structures in Computer Science, vol.247, issue.04, pp.415-459, 1992.
DOI : 10.1016/0304-3975(75)90017-1

T. Hardin, L. Maranget, and B. Pagano, Functional runtime systems within the lambda-sigma calculus, Journal of Functional Programming, vol.8, issue.2, pp.131-176, 1998.
DOI : 10.1017/S0956796898002986
URL : https://hal.archives-ouvertes.fr/hal-01199543

J. D. Harrop, Objective Caml for Scientists, 2005.

Y. Hayashi, Shaped-based Cost Analysis of Skeletal Parallel Programs, 2001.

Y. Hayashi and M. Cole, Bsp-based cost analysis of skeletal programs, Trends in Functional Programming, pp.20-28, 2000.

C. A. Hermann and C. Lengauer, ON THE SPACE-TIME MAPPING OF A CLASS OF DIVIDE-AND-CONQUER RECURSIONS, Parallel Processing Letters, vol.06, issue.04, pp.525-537, 1996.
DOI : 10.1142/S0129626496000479

C. A. Hermann and C. Lengauer, Hdc : A high-order language for divide-and-conquer. Parallel Processing Letters, pp.239-250, 2000.

C. A. Herrmann, Functional meta-programming in the construction of parallel programs. Parallel Processing Letters, 2005.

J. M. Hill, S. R. Donaldson, and T. Lanfear, Process migration and fault tolerance of BSPlib programs running on networks of workstations, Euro-Par'98, 1998.
DOI : 10.1007/BFb0057841

J. M. Hill, W. F. Mccoll, and . Bsplib, BSPlib: The BSP programming library, Parallel Computing, vol.24, issue.14, pp.1947-1980, 1998.
DOI : 10.1016/S0167-8191(98)00093-3

M. D. Jonathan, D. B. Hill, and . Skillicorn, Practical Barrier Synchronisation, 6th EuroMicro Workshop on Parallel and Distributed Processing (PDP'98, 1998.

C. A. Hoare, An axiomatic basis for computer programmation, Communication of the ACM, 1969.

G. Horvitz and R. H. Bisseling, Designing a BSP version of ScaLAPACK, Proceedings Ninth SIAM Conference on Parallel Processing for Scientific Computing. SIAM, 1999.

Z. Hu, H. Iwasaki, and M. Takeichi, An Accumulative Parallel Skeleton for All, European Symposium on Programming, number 2035 in LNCS, pp.83-97, 2002.
DOI : 10.1007/3-540-45927-8_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6695

Z. Hu, T. Takahashi, H. Iwasaki, and M. Takeichi, Segmented Diffusion Theorem, IEEE International Conference on Systems, Man and Cybernetics (SMC 02, 2002.

Z. Hu, M. Takeichi, and H. Iwasaki, Diffusion : Calculating Efficient Parallel Programs, ACM SIG- PLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'99, pp.85-94, 1999.

D. A. Hutchinson, A. Maheshwari, and N. Zeh, An external memory data structure for shortest path queries, 5th Annual Combinatorics and Computing Conf (COCOON '99), pp.51-60, 1999.
DOI : 10.1016/S0166-218X(02)00217-2
URL : http://doi.org/10.1016/s0166-218x(02)00217-2

K. Höfler, M. Müller, and S. Schwarzer, Design and application of object oriented parallel data structures in particle and continuous systems, High Performance Computing in Science and Engineering, 1999.

J. Jájá, An Introduction to Parallel Algorithms, 1992.

S. A. Jarvis, J. M. Hill, C. J. Siniolakis, and V. P. Vasilev, Portable and architecture independent parallel performance tuning using BSP, Parallel Computing, vol.28, issue.11, pp.1587-1609, 2002.
DOI : 10.1016/S0167-8191(02)00160-6

B. Jay, A semantics for shape, Science of Computer Programming, vol.25, issue.2-3, pp.251-283, 1995.
DOI : 10.1016/0167-6423(95)00015-1

C. B. Jay, M. I. Cole, M. Sekanina, and P. Steckler, A monadic calculus for parallel costing of a functional language of arrays, Euro-Par'97, number 1300 in Lecture Notes in Computer Science, pp.650-661, 1997.
DOI : 10.1007/BFb0002796

H. Jifeng, Q. Miller, and L. Chen, Algebraic laws for BSP programming, Euro-Par'96 Parallel Processing, number 1124 in LNCS, pp.359-368, 1996.
DOI : 10.1007/BFb0024724

J. M. Hill, W. F. Mccoll, D. C. Stefanescu, M. W. Goudreau, K. Lang et al., BSPlib: The BSP programming library, Parallel Computing, vol.24, issue.14, 1997.
DOI : 10.1016/S0167-8191(98)00093-3

G. Jones, Programming in Occam, 1987.

Y. Kee and S. Ha, AN EFFICIENT IMPLEMENTATION OF THE BSP PROGRAMMING LIBRARY FOR VIA, Parallel Processing Letters, vol.12, issue.01, pp.65-77, 2002.
DOI : 10.1142/S0129626402000835

T. Kielmann, H. E. Bal, S. Gorlatch, K. Verstoep, and R. F. Hofman, Network performance-aware collective communication for clustered wide-area systems, Parallel Computing, vol.27, issue.11, pp.1431-1456, 2001.
DOI : 10.1016/S0167-8191(01)00098-9

J. Kim, S. Ha, and C. S. Jhon, Relaxed barrier synchronization for the BSP model of computation on message-passing architectures, Information Processing Letters, vol.66, issue.5, pp.247-253, 1998.
DOI : 10.1016/S0020-0190(98)00061-1

U. Klusik, Y. Ortega, and R. Pena, Implementing Eden ??? or: Dreams Become Reality, Proceedings of IFL'98, pp.103-119
DOI : 10.1007/3-540-48515-5_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.8391

C. Koelbel, D. Loveman, R. Schreiber, G. Steele, and M. Zosel, The High Performance Fortran Handbook, Computers in Physics, vol.8, issue.4, 1994.
DOI : 10.1063/1.4823319

M. Van-kreveld, J. Nievergelt, T. Roos, and P. Widmayer, Algorithms Foundations of Geographics Information Systems, International Symposium on High Performance Computing, number 1340 in Lecture Notes in Computer Science, 1997.

P. Krusche, EXPERIMENTAL EVALUATION OF BSP PROGRAMMING LIBRARIES, Parallel Processing Letters, vol.18, issue.01, 2005.
DOI : 10.1142/S0129626408003193

V. Kumar and E. Schwabe, Improved algorithms and data structures for solving graph problems in external memory, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing, 1996.
DOI : 10.1109/SPDP.1996.570330

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

I. and G. Lassous, Algorithmes parallèles de traitement de graphes : une approche basée sur l'analyse expérimentale, 1999.

D. Lemétayer, ACE: an automatic complexity evaluator, ACM Transactions on Programming Languages and Systems, vol.10, issue.2, pp.248-266, 1988.
DOI : 10.1145/42190.42347

X. Leroy, The ZINC experiment : An economical implementation of the ML language, 1991.
URL : https://hal.archives-ouvertes.fr/inria-00070049

X. Leroy, A modular module system, Journal of Functional Programming, vol.10, issue.3, pp.269-303, 2000.
DOI : 10.1017/S0956796800003683
URL : https://hal.archives-ouvertes.fr/inria-00073825

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

P. Lescanne, From lambda-sigma to lambda-upsilon, a journey through calculi of explicit substitutions, 21st ACM Symposium on Principles of Programming Languages (POPL'94), pp.60-69

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

Z. Li, P. H. Mills, and J. H. Reif, MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION???, Parallel Algorithms and Applications, vol.8, issue.1, pp.35-59, 1995.
DOI : 10.1007/BF01185208

W. B. Ligon and R. B. Ross, Beowulf Cluster Computing with Linux, chapter PVFS : Parallel Virtual File System, pp.391-430, 2001.

D. Louis-régis, Certification de programmes bsml avec juxtaposition parallèle, 2005.

F. Loulergue, BSML : Programmation BSP purement fonctionnelle, Dixièmes Rencontres Francophones du Parallélisme (Renpar'10), pp.243-246, 1998.

F. Loulergue, Extension du BS?-calcul, JFLA'99 : Journées Francophones des Langages Applicatifs, pp.93-112, 1999.

F. Loulergue, BS? p : Functional BSP Programs on Enumerated Vectors, International Symposium on High Performance Computing, number 1940 in Lecture Notes in Computer Science, pp.355-363, 2000.

F. Loulergue, DISTRIBUTED EVALUATION OF FUNCTIONAL BSP PROGRAMS, Parallel Processing Letters, vol.11, issue.04, pp.423-437, 2001.
DOI : 10.1142/S0129626401000701

F. Loulergue, Parallel Composition and Bulk Synchronous Parallel Functional Programming, Trends in Functional Programming, pp.77-88, 2001.

F. Loulergue, Implementation of a Functional Bulk Synchronous Parallel Programming Library, 14th IASTED International Conference on Parallel and Distributed Computing Systems, pp.452-457, 2002.

F. Loulergue, Parallel Juxtaposition for Bulk Synchronous Parallel ML, number 2790 in LNCS, pp.781-788, 2003.
DOI : 10.1007/978-3-540-45209-6_107

F. Loulergue, Parallel Superposition for Bulk Synchronous Parallel ML, International Conference on Computational Science Part III, number 2659 in LNCS, pp.223-232, 2003.
DOI : 10.1007/3-540-44863-2_23

F. Loulergue, A calculus of functional BSP programs with explicit substitution, Parallel Computing : Software Technology, Algorithms, Architectures and Applications, Proceeding of the 10th ParCo Conference, 2004.
DOI : 10.1016/S0927-5452(04)80019-4

F. Loulergue, Communication Primitives for Minimally Synchronous Parallel ML, The International Conference on Computational Science Part I, LNCS, pp.411-414, 2004.
DOI : 10.1007/978-3-540-24685-5_51

F. Loulergue, Management of Communication Environments for Minimally Synchronous Parallel ML, DAPSYS 2004. Kluwer, 2004.
DOI : 10.1007/0-387-23096-3_21

F. Loulergue, Programmation fonctionnelle d'ordinateur parallèles et de méta-ordinateur : sémantique , systèmes et preuves, 2004.

F. Loulergue, G. Hains, and C. Foisy, A calculus of functional BSP programs, Science of Computer Programming, vol.37, issue.1-3, pp.253-277, 2000.
DOI : 10.1016/S0167-6423(99)00029-5
URL : https://hal.archives-ouvertes.fr/inria-00452579

J. M. Martin and A. Tiskin, BSP modelling a two-tiered parallel architectures, pp.47-55, 1999.

J. M. Martin and A. V. Tiskin, Dynamic BSP : towards a flexible approach to parallel computing over the grid, Communicating Process Architectures : Proceedings of CPA, pp.219-226, 2004.

B. , D. Martino, A. Mazzeo, M. Mazzocca, and U. Villano, Parallel program analysis and restructuring by detection of point-to-point interaction patterns and their transformation into collective communication constructs, Science of Computer Programming, vol.40, issue.2-3, pp.235-263, 2001.

M. Mauny, Compilation des langages fonctionnels dans les combinateurs catégoriques Application au langage ML, 1985.

W. Mccoll, Scalable parallel computing : A grand unified theory and its practical development, Proc. 13th IFIP World Computer Congress, 1994.

W. F. Mccoll, Scalable computing Computer Science Today : Recent Trends and Developments, number 1000 of LNCS, pp.46-61, 1995.

W. F. Mccoll, Scalability, portability and predictability: The BSP approach to parallel programming, Future Generation Computer Systems, vol.12, issue.4, pp.265-272, 1996.
DOI : 10.1016/S0167-739X(96)00030-1

W. F. Mccoll, Universal computing, Proc. Euro-Par '96, pp.25-36, 1996.
DOI : 10.1007/3-540-61626-8_3

M. Medidi and N. Deo, Parallel Dictionaries Using AVL Trees, Journal of Parallel and Distributed Computing, vol.49, issue.1, pp.146-155, 1998.
DOI : 10.1006/jpdc.1998.1432

K. Mehlhorn and S. Näher, LEDA: a platform for combinatorial and geometric computing, Communications of the ACM, vol.38, issue.1, pp.96-102, 1995.
DOI : 10.1145/204865.204889

A. Merlin and G. Hains, La Machine Abstraite Catégorique BSP, Journées Francophones des Langages Applicatifs. INRIA, 2002.

A. Merlin, G. Hains, and F. Loulergue, A SPMD Environment Machine for Functional BSP Programs, Proceedings of the Third Scottish Functional Programming Workshop, 2001.

Q. Miller, BSP in a Lazy Functional Context, Trends in Functional Programming, pp.1-13, 2002.

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, I and II. Information and Computation, pp.1-40, 1992.

P. Morin, Coarse grained parallel computing on heterogeneous systems, Proceedings of the 1998 ACM symposium on Applied Computing , SAC '98, pp.628-634, 1998.
DOI : 10.1145/330560.331004
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9746

K. Munagala and A. Ranade, I/O Complexity of Graph Algorithms, ACM-SIAM Symposium on Discrete Algorithms, pp.687-694, 1999.

Z. Nemeth and V. Sunderam, Characterizing grids : Attributes, definitions, and formalisms, Journal of Grid Computing, vol.1, issue.1, pp.9-23, 2003.
DOI : 10.1023/A:1024011025052

C. Okasaki, Purely Functional Data-Structures, 1998.
DOI : 10.1017/CBO9780511530104
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.505

B. Pagano, Des calculs de substitution explicite et de leur application à la compilation des langages fonctionnel, 1997.

P. Panangaden and J. Reppy, The Essence of Concurrent ML, Monographs in Computer Science, 1996.
DOI : 10.1007/978-1-4612-2274-3_2

C. Parent, Developing certified programs in the system Coq the program tactic, Types for Proofs and Programs, pp.291-312, 1993.
DOI : 10.1007/3-540-58085-9_81

C. Paulin-mohring, Définitions inductives en théorie des types d'ordre supérieur, Habilitation à Diriger des Recherches, 1996.

C. Paulin-mohring and B. Werner, Synthesis of ML programs in the system Coq, Journal of Symbolic Computation, vol.15, issue.5-6, pp.607-640, 1993.
DOI : 10.1016/S0747-7171(06)80007-6

S. Pelagatti, Structured Development of Parallel Programs, 1998.

A. Plaat and H. E. Bal, Sensitivity of Parallel Applications to large differences in bandwidth and latency in two-layer interconnects, Futur Generation Computer Systems, 2004.

E. Polonovski, Substitutions explicites, logiques et normalisation, 2004.

F. Pottier and V. Simonet, Information flow inference for ML, ACM Transactions on Programming Languages and Systems, vol.25, issue.1, pp.117-158, 2003.
DOI : 10.1145/596980.596983
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.6266

X. Rebeuf, Un modèle de coût symbolique pour les programmes parallèles asynchrones à dépendances structurées, 2000.

B. Reistad and D. K. Gifford, Static dependent costs for estimating program execution time, Conference on Lisp and Functional Programming, 1994.

D. Rémy, Using, Understanding, and Unravellling the OCaml Language, Applied Semantics, number 2395 in LNCS, pp.413-536, 2002.

J. H. Reppy, Concurrent Programming in ML, 1999.
DOI : 10.1017/CBO9780511574962

J. L. Roda, C. Rodríguez, D. G. Morales, and F. Almeida, Predicting the execution time of message passing models. Concurrency : Practice and Experience, pp.461-477, 1999.

C. Rodriguez, J. L. Roda, F. Sande, D. G. Morales, and F. Almeida, A new parallel model for the analysis of asynchronous algorithms, Parallel Computing, vol.26, issue.6, pp.753-767, 2000.
DOI : 10.1016/S0167-8191(00)00002-8

R. O. Rogers and D. B. Skillicorn, Using the BSP cost model to optimise parallel neural network training, Future Generation Computer Systems, vol.14, issue.5-6, pp.5-6409, 1998.
DOI : 10.1016/S0167-739X(98)00043-0

J. M. Rosario and A. Choudhary, High-performance I/O for massively parallel computers: problems and prospects, Computer, vol.27, issue.3, pp.59-68, 1994.
DOI : 10.1109/2.268887

A. L. Rosenberg, Optimal sharing of partitionable workloads in heterogeneous networks of workstations, International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), pp.413-419, 2000.

J. Schmid, E. Börger, and R. Stark, Java and the JVM : Definition, Verification, Validation, 2001.

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

J. F. Sibeyn and M. Kaufmann, BSP-like external-memory computation, Proc. 3rd Italian Conference on Algorithms and Complexity, pp.229-240, 1997.
DOI : 10.1007/3-540-62592-5_75

D. B. Skillicorn, Foundations of Parallel Programming. Number 6 in International Series on Parallel Computation, 1994.

D. B. Skillicorn, Building BSP Progams Using the Refinement Calculus, Formal Methods for Parallel Programming and Applications workshop at IPPS/SPDP'98, 1998.

D. B. Skillicorn, M. Danelutto, S. Pelagatti, and A. Zavanella, Optimising data-parallel programs using the BSP cost model, Europar'98, pp.698-715, 1998.
DOI : 10.1007/BFb0057918

D. Skillicorn, J. M. Hill, and W. F. Mccoll, Questions and Answers about BSP, Scientific Programming, vol.6, issue.3, pp.249-274, 1997.
DOI : 10.1155/1997/532130

L. Smarr and C. E. Catlett, Metacomputing, Communications of the ACM, vol.35, issue.6, pp.44-52, 1992.
DOI : 10.1145/129888.129890

M. Snir and W. Gropp, MPI the Complete Reference, 1998.

A. Stewart and M. Clint, BSP-style Computation: a Semantic Investigation, The Computer Journal, vol.44, issue.3, pp.174-185, 2001.
DOI : 10.1093/comjnl/44.3.174

A. Stewart, M. Clint, and J. Gabarró, Axiomatic Frameworks for Developing BSP-Style Programs. Parallel Algorithms and Applications, pp.271-292, 2000.

A. Stewart, M. Clint, and J. Gabarró, Algebraic Rules for Reasoning about BSP Programs Advances in Computation : Theory and Practice, Constructive Methods for Parallel Programming, 2002.

J. Sérot, TAGGED-TOKEN DATA-FLOW FOR SKELETONS, Parallel Processing Letters, vol.11, issue.04, pp.377-392, 2001.
DOI : 10.1142/S0129626401000671

J. Sérot and D. Ginhac, Skeletons for parallel image processing: an overview of the SKIPPER project, Parallel Computing, vol.28, issue.12, pp.1785-1808, 2002.
DOI : 10.1016/S0167-8191(02)00189-8

J. Sérot, D. Ginhac, R. Chapuis, and J. P. Dérutin, Fast prototyping of parallel-vision applications using functional skeletons, Machine Vision and Applications, vol.12, issue.6, pp.271-290, 2001.
DOI : 10.1007/s001380050146

W. Taha, A Gentle Introduction to Multi-stage Programming, Domain-Specific Program Generation, number 3016 in LNCS, pp.30-50, 2004.
DOI : 10.1007/978-3-540-25935-0_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.2543

J. Talpin and P. Jouvelot, The Type and Effect Discipline, Information and Computation, vol.111, issue.2, pp.245-296, 1994.
DOI : 10.1006/inco.1994.1046
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.5309

R. Thakur, E. Lusk, and W. Gropp, I/O characterization of a portable astrophysics application on the ibm sp and intel paragon, 1995.
DOI : 10.2172/224841

N. Thomas, G. Tanase, O. Tkachyshyn, J. Perdue, N. M. Amato et al., A framework for adaptive algorithm selection in STAPL, Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming , PPoPP '05, 2005.
DOI : 10.1145/1065944.1065981

A. Tiskin, The Design and Analysis of Bulk-Synchronous Parallel Algorithms, 1998.

A. Tiskin, A New Way to Divide and Conquer. Parallel Processing Letters, pp.409-422, 2001.

J. L. Traeff and J. Worringen, Verifying Collective MPI Calls, Proceedings of the 11th EuroPVM/MPI conference, 2004.
DOI : 10.1007/978-3-540-30218-6_11

J. D. Ullman and M. Yannakakis, The input/output complexity of transitive closure, Annals of Mathematics and Artificial Intelligence, vol.9, issue.1, pp.331-360, 1991.
DOI : 10.1007/BF01530929

J. Vachon, Une analyse statique pour le contrôle des effets de bords en Caml-Flight beta, JFLA, number 13 in Collection Didactique. INRIA, 1995.

L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181

P. B. Vasconcelos and K. Hammond, Inferring cost equations for recursive, polymorphic and higherorder functional programs, IFL'02, pp.110-125, 2003.

P. Vasil and . Vasilev, BSPGRID : Variable Resources Parallel Computation and Multiprogrammed Parallelism . Parallel Processing Letters, pp.329-340, 2003.

D. E. Vengroff and J. S. Vitter, Supporting I/O-efficient scientific computation in TPIE, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing, 1995.
DOI : 10.1109/SPDP.1995.530667

J. S. Vitter, External memory algorithms and data structures: dealing with massive data, ACM Computing Surveys, vol.33, issue.2, pp.209-271, 2001.
DOI : 10.1145/384192.384193

J. S. Vitter, External memory algorithms, ACM Symp. Principles of Database Systems, pp.119-128, 1998.

J. S. Vitter and E. A. Shriver, Algorithms for parallel memory, I: Two-level memories, Algorithmica, vol.30, issue.4, pp.110-147, 1994.
DOI : 10.1007/BF01185207

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

B. Werner, Méta-théorie du Calcul des Constructions Inductives, 1994.

T. L. Williams and R. J. Parsons, The Heterogeneous Bulk Synchronous Parallel Model, IPDPS, number 1800 in LNCS, pp.102-108, 2000.
DOI : 10.1007/3-540-45591-4_12

T. L. Williams and R. J. Parsons, Exploiting hierarchy in heterogeneous environments, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, pp.140-147, 2001.
DOI : 10.1109/IPDPS.2001.925125

N. Wirth, Algorithms + Data Structures = Programs, 1975.

X. Leroy, D. Doligez, J. Garrigue, D. Rémy, and J. Vouillon, The Objective Caml System release 3.08.3, 2005.

H. Xi and F. Pfenning, Dependent types in practical programming, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '99, pp.214-227, 1999.
DOI : 10.1145/292540.292560

K. A. Yelick, S. Chakrabarti, E. Deprit, J. Jones, A. Krishnamurthy et al., Parallel data structures for symbolic computation, Workshop on Parallel Symbolic Languages and Systems, 1995.

A. Zain, P. Trinder, H. Loidl, and G. Michaelson, Managing heterogeneity in a grid parallel haskell, International Conference on Computational Science (ICCS 2005), 2005.

A. Zavanella, Skeletons and BSP : Performance Portability for Parallel Programming, 1999.

W. Zimmermann, M. Middendoff, and W. Loewe, On optimal k-iinear scheduling of tree-like task graphs for LogP-machines, Lecture Notes in Computer Science, vol.1470, p.328, 1998.
DOI : 10.1007/BFb0057870