Repositorio Atenea de la Facultad de Ciencias, UNAM >
Repositorio Ciencias >
FACULTAD DE CIENCIAS >
Ciencias >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11154/1525
|
Title: | Full abstraction for Gamma |
Authors: | Quiroz, FH |
Issue Date: | 2004 |
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 sistematically 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. |
URI: | http://hdl.handle.net/11154/1525 |
Appears in Collections: | Ciencias
|
Files in This Item:
There are no files associated with this item.
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|