Results 1 
4 of
4
A New Process Model for Functions
 Term Graph Rewriting: Theory and Practice, chapter 20
, 1993
"... Machine [Ber90] than a traditional graph reduction machine. 6 Results A translator has been developed which will convert "programs" in an extended Calculus to the process notation. Several different translations from Calculus to processes have been implemented. The process networks are converted ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Machine [Ber90] than a traditional graph reduction machine. 6 Results A translator has been developed which will convert "programs" in an extended Calculus to the process notation. Several different translations from Calculus to processes have been implemented. The process networks are converted to the sublanguage which makes heavy use of agent definitions. This form is then converted to Dactl. The mapping from process notation to Dactl does not handle nontrivial processes with output guards (only inaction may follow an output guard). This enables us to express the new translation directly, but the ßCalculus translations of Milner cannot be translated directly. A Form of the Lazy Calculus translation modified in a manner inspired by [Hon91] has been produced. The translation is extended to handle constants. This has been called PiLazy: [[x]] u = x!u:() [[k]] u = u?v : v!k:() [[x:M ]] u = u?d: ( d!a:() j a?x: u?v: [[M ]] v )na [[M @L N ]] u = ( [[M ]] v j v!d:() j d?a: (a!t...
Asynchronous mobile processes and graph rewriting
 in PARLE92
, 1992
"... Honda and Tokoro provide a formal system for communicating systems developed from Milner’s π–calculus. Unlike other formalisms, their work is based on asynchronous communication primitives. This paper proposes some minor but practically significant extensions to a model based on asynchronous communi ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Honda and Tokoro provide a formal system for communicating systems developed from Milner’s π–calculus. Unlike other formalisms, their work is based on asynchronous communication primitives. This paper proposes some minor but practically significant extensions to a model based on asynchronous communication and shows how the resulting system may be mapped very directly onto a graph rewriting system. While the model based on asynchronous communication permits the most direct translation, a related model using synchronous communication may be implemented in a similar
A Filter Model for Concurrent λCalculus
 SIAM J. Comput
, 1998
"... Type free lazy calculus is enriched with angelic parallelism and demonic nondeterminism. Callbyname and callbyvalue abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union typ ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Type free lazy calculus is enriched with angelic parallelism and demonic nondeterminism. Callbyname and callbyvalue abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union types and we prove that the induced logical semantics is fully abstract.
A Convex Powerdomain over Lattices: its Logic and λCalculus
, 1997
"... . To model at the same time parallel and nondeterministic functional calculi we define a powerdomain functor P such that it is an endofunctor over the category of algebraic lattices. P is locally continuous and we study the initial solution D 1 of the domain equation D = P([D ! D]? ). We derive f ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. To model at the same time parallel and nondeterministic functional calculi we define a powerdomain functor P such that it is an endofunctor over the category of algebraic lattices. P is locally continuous and we study the initial solution D 1 of the domain equation D = P([D ! D]? ). We derive from the algebras of P the logic of D 1 , that is the axiomatic description of its compact elements. We then define a calculus and a type assignment system using the logic of D 1 as the related type theory. We prove that the filter model of this calculus, which is isomorphic to D 1 , is fully abstract with respect to the observational preorder of the calculus. Keywords: calculus, Nondeterminism, Full Abstraction, Powerdomain Construction, Intersection Type Disciplines. 1. Introduction One of the main issues in the design of programming languages is the achievement of a good compromise between the multiplicity of control structures and data types and the unicity of the mathematica...