Results 11  20
of
20
Full Abstractness for a Functional/Concurrent Language With HigherOrder ValuePassing
, 1998
"... We study an applied typed callbyvalue calculus which in addition to the usual types for higherorder functions contains an extra type called proc, for processes. The constructors for terms of this type are similar to those found in standard process calculi such as CCS. We first give an operationa ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We study an applied typed callbyvalue calculus which in addition to the usual types for higherorder functions contains an extra type called proc, for processes. The constructors for terms of this type are similar to those found in standard process calculi such as CCS. We first give an operational semantics for this language in terms of a labelled transition system which is then used to give a behavioural preorder based on contexts: the expression N dominates M if in every appropriate context if M can produce a boolean value then so can N. Based on standard domain constructors we define a model, a prime algebraic lattice, which is fully abstract with respect to this behaviour preorder.
A Study on Mobile Language Systems
, 1999
"... The mobile form of distributed computation, called mobile computation, is investigated from the viewpoints of computational model, programming language and implementation. The emphasis of this thesis compared with the related work is on analyzing existing mobile language systems from a rather implem ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
The mobile form of distributed computation, called mobile computation, is investigated from the viewpoints of computational model, programming language and implementation. The emphasis of this thesis compared with the related work is on analyzing existing mobile language systems from a rather implementational point of view. The contribution of this thesis is threefold. (1) We present a computational model in which dynamic transference of code, data and execution state can be represented. Several mobility mechanisms in existing mobile language systems are analyzed in the model. (2) Based on the analysis, a programming language for mobile computation is designed. The distinctive feature of the language is the facility to control the transparency of migration. (3) An implementation of the mobile programming language is presented. The language is implemented as an extension of the Java language. The implementation is so portable that the program runs on any standard Java inte...
Compiler Correctness for Concurrent Languages
 in proc. Coordination'96
, 1994
"... . This paper extends previous work in compiler derivation and verification to languages with trueconcurrency semantics. We extend the calculus to model processcentered concurrent computation, and give the semantics of a small language in terms of this calculus. We then define a target abstract m ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. This paper extends previous work in compiler derivation and verification to languages with trueconcurrency semantics. We extend the calculus to model processcentered concurrent computation, and give the semantics of a small language in terms of this calculus. We then define a target abstract machine whose states have denotations in the same calculus. We prove the correctness of a compiler for our language: the denotation of the compiled code is shown to be strongly bisimilar to the denotation of the source program, and the abstract machine running the compiled code is shown to be branchingbisimilar to the source program's denotation. 1 Introduction Our original goal was to verify a compiler for Linda [8], using that language as a representative of modern concurrent language design. Upon searching the literature, we found a vast amount of work on models of concurrency, but little that was obviously applicable to compiler derivation and verification. Accordingly we decided to tac...
Denotational Semantics for a HigherOrder Extension of the Monadic πCalculus
"... We study a version of the higherorder #calculus where transmittable items include items of ground type, such as communication channel names, but functions into processes as well. After providing operational semantics to the language we lay out a basic equational theory # which includes interleavin ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study a version of the higherorder #calculus where transmittable items include items of ground type, such as communication channel names, but functions into processes as well. After providing operational semantics to the language we lay out a basic equational theory # which includes interleaving and normal form laws. We then construct a denotational model by solving an appropriate domain equation in a functor category. We provide explicit constructions of the syntactic operators and demonstrate (1) that the equational theory # presented is valid in the model. Finally, (2) we derive from validity of # a Computational Adequacy Theorem for the model.
Analysis for Concurrent Objects
 In H. Bowman and J. Derrick (Eds.), Proceedings FMOODS'97
, 1996
"... We present a setbased control flow analysis for an imperative, concurrent object calculus extending the FisherHonsellMitchell functional objectoriented calculus described in [5]. The analysis is shown to be sound with respect to a transitionsystem semantics. Keywords: concurrent objectoriented ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We present a setbased control flow analysis for an imperative, concurrent object calculus extending the FisherHonsellMitchell functional objectoriented calculus described in [5]. The analysis is shown to be sound with respect to a transitionsystem semantics. Keywords: concurrent objectoriented, controlflow analysis, soundness, prototypebased 1
unknown title
"... A fully abstract semantics for a concurrent functional language with monadic types This paper presents a typed higherorder concurrent functional programming language, based on Moggi’s monadic metalanguage and Reppy’s Concurrent ML. We present an operational semantics for the language, and show that ..."
Abstract
 Add to MetaCart
(Show Context)
A fully abstract semantics for a concurrent functional language with monadic types This paper presents a typed higherorder concurrent functional programming language, based on Moggi’s monadic metalanguage and Reppy’s Concurrent ML. We present an operational semantics for the language, and show that a higherorder variant of the traces model is fully abstract for maytesting. This proof uses a program logic based on Hennessy– Milner logic and Abramsky’s domain theory in logical form. 1
1. What is πcalculus? FAQ on πCalculus
, 2002
"... πcalculus is a model of computation for concurrent systems. The syntax of πcalculus lets you represent processes, parallel composition of processes, synchronous communication between processes through channels, creation of fresh channels, replication of processes, and nondeterminism. That’s it! 2. ..."
Abstract
 Add to MetaCart
(Show Context)
πcalculus is a model of computation for concurrent systems. The syntax of πcalculus lets you represent processes, parallel composition of processes, synchronous communication between processes through channels, creation of fresh channels, replication of processes, and nondeterminism. That’s it! 2. What do you mean by process? By channel? A process is an abstraction of an independent thread of control. A channel is an abstraction of the communication link between two processes. Processes interact with each other by sending and receiving messages over channels. 3. Could you be a little more concrete? Let P and Q denote processes. Then • P  Q denotes a process composed of P and Q running in parallel. • a(x).P denotes a process that waits to read a value x from the channel a and then, having received it, behaves like P. • ā〈x〉.P denotes a process that first waits to send the value x along the channel a and then, after x has been accepted by some input process, behaves like P.
Functions, Concurrency, Distribution and Mobility
"... There are efforts within the research area of programming languages ..."
(Show Context)
From a Concurrent lambdacalculus to the picalculus
"... . We explore the (dynamic) semantics of a simply typed  calculus enriched with parallel composition, dynamic channel generation, and inputoutput communication primitives. The calculus, called the k  calculus, can be regarded as the kernel of concurrentfunctional languages such as LCS, CML and ..."
Abstract
 Add to MetaCart
. We explore the (dynamic) semantics of a simply typed  calculus enriched with parallel composition, dynamic channel generation, and inputoutput communication primitives. The calculus, called the k  calculus, can be regarded as the kernel of concurrentfunctional languages such as LCS, CML and Facile, and it can be taken as a basis for the definition of abstract machines, the transformation of programs, and the development of modal specification languages. The main technical contribution of this paper is the proof of adequacy of a compact translation of the k calculus into the ßcalculus. 1 Introduction Programming languages that combine functional and concurrent programming, such as LCS [4], CML [11] and Facile [5, 14], are starting to emerge and get applied  some, like Facile, in industrial settings. These languages are conceived for programming of reactive systems and distributed systems. A main motivation for using such languages is that they offer integration of differe...
A ControlFlow Analysis for a Calculus of Concurrent Objects
, 1997
"... We present a setbased control flow analysis for an imperative, concurrent object calculus extending the FisherHonsellMitchell functional objectoriented calculus described in [5]. The analysis is shown to be sound withrespect to a transition system semantics. ..."
Abstract
 Add to MetaCart
We present a setbased control flow analysis for an imperative, concurrent object calculus extending the FisherHonsellMitchell functional objectoriented calculus described in [5]. The analysis is shown to be sound withrespect to a transition system semantics.