: Nous pr'esentons le noyau d'un langage explicitement parall`ele et fonctionnel pur d'ordre sup'erieur CDS*. Il est bas'e sur des structures de donn'ees concr`etes explicitement distribu'ees. Nous donnons un aper¸cu de la s'emantique d'enotationnelle, op'erationnelle et d'une s'emantique de r'e'ecriture qui la r'ealise. Des exemples illustrant l'expressivit'e du langage ainsi que la simulation de leur ex'ecution sont donn'es. 1 Introduction Suivant l'approche de Berry et Curien des langages fonctionnels appliqu'ee au parall'elisme en processus statiques [10], nous avons [7], introduit les s'emantiques d'enotationnelle et op'erationnelle d'un langage explicitement parall`ele et purement fontionnel : CDS*. Il est inspir'e du langage s'equentiel fonctionnel CDS de Berry et Curien [1, 4] mais utilise les structures de donn'ees concr`etes g'en'eralis'ees de Brookes et Geva [3, 2] qui peuvent exprimer le parall'elisme. Au contraire du langage ADS0 [8] bas'e sur les structures de tableau de...

MACHINE: REWRITING SEMANTICS The rewriting semantics is defined by the tables below representing possible transitions from left columns to right columns. The global data structure is a multiset of tasks together with a function (set of pairs) mapping syntactic nodes of the term being evaluated to tables. There are two main forms of tasks. The first component of tasks is the name of a cell together with the term whose type contains it. The last component of tasks is always a mode: either a value computed for the given cell, a failure marker ? to indicate that the cell could not be filled, or a request mode. A simple request mode "?" simply means a general request to fill the cell. An indexed request mode ? c means a request with the added information that the value sought is also that of cell c. As an example of this last kind of mode, see rule CL2 in the first table. A last kind of mode ? tr indicates that a slice of state (A(x) in the operational semantics) is currently being filled....

This document describes the Hume programming language. Hume (Higher-order Unified Meta-Environment) is a strongly typed, functionally-based language with an integrated tool set for developing, proving and assessing concurrent, resource-limited systems, such as embedded or safetycritical systems. It aims to extend the frontiers of language design for such systems, introducing new levels of abstraction and provability

Nous presentons le noyau d'un langage explicitement parallele et fonctionnel pur d'ordre superieur CDS*. Il est base sur des structures de donnees concretes explicitement distribuees. Nous donnons un apercu de la semantique denotationnelle, operationnelle et d'une semantique de reecriture qui la realise. Des exemples illustrant l'expressivite du langage ainsi que la simulation de leur execution sont donnes.

Introduction. Parallel programming languages tend to waste algorithmic expressiveness to avoid deadlocks, non-determinism and the general complexity of concurrent languages. As a result, most of them don't specify data placement so that performance is unpredictable as a function of the source program (it depends on the language implementation, not its semantics). The BSP paradigm [7] demonstrates that explicit processor locations and explicit communications remove this uncertainty at the cost of a restricted programming style. We propose a solution to this dilemma by combining the events of process algebras and explicit processor locations of BSP with a higher-order functional language. The resulting language, CDS*, is derived from Berry and Curien's sequential language CDS0 and realizes Brookes and Geva's theory of deterministic parallel functions. 2 Types and constants. We first outline the concrete syntax used to declare basic types in CDS* and we give mathematical formalization

MACHINE: REWRITING SEMANTICS The rewriting semantics is defined by the tables below representing possible transitions from left columns to right columns. The global data structure is a multiset of tasks together with a function (set of pairs) mapping syntactic nodes of the term being evaluated to tables.

Abstract not found