Results 1 
4 of
4
Sharing Continuations: Proofnets for Languages With Explicit Control
"... sumes it. Yet evaluating expressions is very familiar, while evaluating continuations is considered esoteric, even though both are made ofthe same stuff. The incorporation ofcontinuations as firstclass citizens in programming languages was not welcomed like the Emancipation Proclamation, but instea ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
sumes it. Yet evaluating expressions is very familiar, while evaluating continuations is considered esoteric, even though both are made ofthe same stuff. The incorporation ofcontinuations as firstclass citizens in programming languages was not welcomed like the Emancipation Proclamation, but instead regarded warily as a kind ofwitchcraft, with implementation pragmatics that are illdefined and unclear. Ifexpressions and continuations are indeed dual, then so should be the technology oftheir implementation, and the flexibility with which we reason about them. Efficient evaluation ofone should reveal dual strategies for evaluating the other. In short, everything we know about expressions we ought to know about continuations. We take a significant step towards this equality by formulating a general version ofgraph reduction that implements the sharing and optimal incremental evaluation ofboth expressions and continuations, each evaluated using the same primitive operations. By founding our technology on generic tools from logic and programming language theory, specifically the CPS transform and its relation
A Proof of the Reducibility of General Port Graph Grammars to Simple Port Graph Grammars
, 2002
"... A uniform framework of port graph grammars, encompassing connection graphs, interaction nets and Lamping's partial sharing graphs, has been presented by the author in the article `Reducibility between classes of port graph grammar'. The aims of this report are to 1. Give a complete pro ..."
Abstract
 Add to MetaCart
A uniform framework of port graph grammars, encompassing connection graphs, interaction nets and Lamping's partial sharing graphs, has been presented by the author in the article `Reducibility between classes of port graph grammar'. The aims of this report are to 1. Give a complete proof of reducibility between general PGGs and simple PGGs (only an outline of the proof was given in that article); 2. Give a short summary of the design of an implementation executing rewrite steps for simple port graph grammars, to justify the claim that port graph grammars are a reasonably efficient representation for code in a distributed environment; 3. Dicuss critically the fundamental notion of reducibility between rewrite systems provided in that article.
Reducibility Between Classes of Port Graph Grammar
, 2001
"... This paper introduces a general notion of staticport graph grammar (SPGG) that encompasses existing formalisms that have been independently proposed, such as Linear Graph Grammars [Baw93], Interaction Nets [Laf90] and Partial Sharing Graphs [Lam90]. These formalisms have been shown to provide a com ..."
Abstract
 Add to MetaCart
(Show Context)
This paper introduces a general notion of staticport graph grammar (SPGG) that encompasses existing formalisms that have been independently proposed, such as Linear Graph Grammars [Baw93], Interaction Nets [Laf90] and Partial Sharing Graphs [Lam90]. These formalisms have been shown to provide a computational framework for asynchronous computation that respects a very rigorous notion of local interaction, and have proven a suitable basis for the internal representation of program and data in the compilation of highlevel programming languages for distributed execution.