Title :
Full abstraction for Gamma
Author :
Quiroz, Francisco Hernàndez
Author_Institution :
Departamento de Matematicas, UNAM, Mexico
Abstract :
Gamma is a simple, but powerful, parallel programming language. Its only data structure is the multiset or bag. Banatre and Metayer proposed the language as a means to derive systematically programs in the spirit of Dijkstra´s discipline of programming. It has been applied to solve problems in scheduling, image processing and fractal generation. Different operational semantics models for Gamma have been proposed. We single out one of them and also produce a denotational semantics for which full abstraction is proven with respect to the operational model chosen. The result can be used as a basis for a further proof system for Gamma.
Keywords :
parallel languages; parallel programming; programming language semantics; Gamma language; data structure; fractal generation; full abstraction; image processing; operational semantics models; parallel programming language; proof system; scheduling; Chemicals; Computer languages; Data structures; Electronic mail; Fractals; Graphics; Image processing; Mathematical model; Parallel programming; Problem-solving;
Conference_Titel :
Computer Science, 2004. ENC 2004. Proceedings of the Fifth Mexican International Conference in
Print_ISBN :
0-7695-2160-6
DOI :
10.1109/ENC.2004.1342584
