Results 1 
5 of
5
Gamma And The Chemical Reaction Model: Ten Years After
"... ... This paper reviews most of the work done by various groups along these lines and the current perspectives of our own research on Gamma. For the sake of clarity we separate the contributions in three categories: (1) the relevance of the chemical reaction model for software engineering, (2) extens ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
... This paper reviews most of the work done by various groups along these lines and the current perspectives of our own research on Gamma. For the sake of clarity we separate the contributions in three categories: (1) the relevance of the chemical reaction model for software engineering, (2) extensions of the original model and (3) implementation issues.
A fully abstract semantics for concurrent graph reduction (Extended Abstract)
, 1993
"... . This paper presents a formal model of the concurrent graph reduction implementation of nonstrict functional programming. This model diers from other models in that: It represents concurrent rather than sequential graph reduction. It represents lowlevel considerations such as garbage collecti ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
. This paper presents a formal model of the concurrent graph reduction implementation of nonstrict functional programming. This model diers from other models in that: It represents concurrent rather than sequential graph reduction. It represents lowlevel considerations such as garbage collection. It uses techniques from concurrency theory to simplify the presentation. There are three presentations of this model: An operational semantics based on graph reduction. A denotational semantics in the domain D ' (D !D)? . A program logic and proof system based on coppo types. We can then use abramsky and ong's techniques from the lazy  calculus to show that the denotational semantics is fully abstract for the operational semantics. This proof requires some results about the operational semantics: Since the operational semantics includes garbage collection, reduction is not conuent. We nd a conuent reduction strategy which has the same convergence properties as gr...
Gamma And The Chemical Reaction Model
, 1996
"... Gamma was originally proposed in 1986 as a formalism for the definition of programs without artificial sequentiality. The basic idea underlying the formalism is to describe computation as a form of chemical reaction on a collection of individual pieces of data. Due to the very minimal nature of the ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Gamma was originally proposed in 1986 as a formalism for the definition of programs without artificial sequentiality. The basic idea underlying the formalism is to describe computation as a form of chemical reaction on a collection of individual pieces of data. Due to the very minimal nature of the language, and its absence of sequential bias, it has been possible to exploit this initial paradigm in various directions. This paper reviews most of the work done by various groups along these lines and the current perspectives of our own research on Gamma. For the sake of clarity we separate the contributions in three categories: (1) the relevance of the chemical reaction model for software engineering, (2) extensions of the original model and (3) implementation issues. Keywords: implicit parallelism, correctness proof, specification, program derivation, termination, abstract machine
CompileTime Pointer Reversal
, 1996
"... This paper introduces an alternative representation for λterms which has the notable property that the search for the leftmost outermost redex is restricted to two steps. This is important in the implementation of a lazy functional programming language, as this search consumes time and space. The r ..."
Abstract
 Add to MetaCart
This paper introduces an alternative representation for λterms which has the notable property that the search for the leftmost outermost redex is restricted to two steps. This is important in the implementation of a lazy functional programming language, as this search consumes time and space. The representation introduced is similar to that resulting from the implementation technique of reversing pointers in the left spine of a term while traversing it, except that here the pointers in the left spine are reversed before reduction. This paper completely develops this new representation, including rigourous proofs of the correctness as a representation for terms and a number of properties, such as the restriction on the search for the next redex. It is shown that the representation can be used with graphs, hence it can be used as the basis for an implementation of a lazy functional language. An implementation is introduced and its performance is compared with a conventional implementati...
Contents
"... Index of definitions 129 A fully abstract semantics for concurrent graph reduction ..."
Abstract
 Add to MetaCart
Index of definitions 129 A fully abstract semantics for concurrent graph reduction