Benjamin C. Pierce. Programming in the Pi-Calculus: An Experiment in Programming Language Design. Distributed with the Pict implementation, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to mix up imperative and declarative programming styles arbitrarily. Moreover, if process terms are functional expressions (which may be communicated via channels and modified by functions) the specified system can be reconfigured dynamically. Languages like Facile or the calculus 2 [MPW92, Pie93] allow to address mobility of processes. But the supplementary expressivity also makes the formal reasoning on correctness issues of the specified systems more complicate. In particular, new verification techniques have to be investigated [AD96] for such a generalised framework. We aim to adopt ....

....Another approach can be found in the definition of the semantics for Concurrent ML [FH95] where the semantics of the behaviour and the data are not defined separately, e.g. the semantics of the 6 functional let expression is defined using parallelism. Another different approach is presented in [Pie93] where all data are considered as abbreviations of more complex process terms which are expanded to give them a semantics. Therefore in [Pie93] one formalism is sufficient for the definition of the formal semantics of the whole language but with the drawback of a rather un intuitive semantics of ....

[Article contains additional citation context not shown here]

Benjamin C. Pierce. Programming in the Pi--Calculus - An Experiment in Programming Language Design. Technical report, Department of Computer Science, University of Edinburgh, 1993.

....the definition of the semantics. A different approach can be found in semantics for Concurrent ML [FH95] where the semantics of the behaviour and the data are not defined separately, e.g. the semantics of the functional let expression is defined using parallelism. Another approach is presented in [Pie93] where data are considered as abbreviations of more complex process terms which are expanded to give them a semantics. Thus in [Pie93] one formalism is sufficient to define the formal semantics of the whole language but with the drawback of a rather unintuitive semantics of the data part in terms ....

....and the data are not defined separately, e.g. the semantics of the functional let expression is defined using parallelism. Another approach is presented in [Pie93] where data are considered as abbreviations of more complex process terms which are expanded to give them a semantics. Thus in [Pie93] one formalism is sufficient to define the formal semantics of the whole language but with the drawback of a rather unintuitive semantics of the data part in terms of process derivations. The data sublanguage is defined by using three reduction relations [Loo90] which model the elementary ....

[Article contains additional citation context not shown here]

Benjamin C. Pierce. Programming in the Pi--Calculus - An Experiment in Programming Language Design. Technical report, Department of Computer Science, University of Edinburgh, 1993.

.... user interfaces[4] Indeed, many concurrent programming languages including concurrent object oriented languages[27, 1] concurrent extensions of functional languages[20] concurrent constraint linear logic programming languages[22, 21, 10] and programming languages based on process calculi[17, 23] have been proposed and implemented. Of those researches, the frameworks of process calculi[13, 10] are drawing attentions as a vehicle for studying theoretical aspects of concurrent programming languages. The process calculi are based on the model that computation is performed by multiple ....

B. C. Pierce. Programming in the pi-calculus: An experiment in programming language design. Lecture notes for a course at the LFCS, University of Edinburgh., 1993.

....Vesta configuration management system [8] Vesta makes some decisions differently from the way p nets are applied in this paper, but the approaches may be complementary in some ways. The full version of this paper describes implementations of some of the build computations using the language Pict [11, 10, 12], which is based on Milner s calculus and provides useful high level constructs for describing the concurrent computations over p nets. Comparison with other configuration management languages and systems such as the various forms of concurrent make would be helpful. In any case, a suitable data ....

Benjamin C. Pierce. Programming in the pi-calculus: An experiment in programming language design. Tutorial notes on the Pict language. Available electronically, 1995.

....differently from the way p nets are applied in this paper, but the approaches may be complementary in some ways. The full version of this paper describes implementations General Operation Second IDE First IDE Figure 13: Integrating Models of some of the build computations using the language Pict [10, 9, 11], which is based on Milner s calculus and provides useful high level constructs for describing the concurrent computations over p nets. Comparison with other configuration management languages and systems would be helpful. In any case, a suitable data structure or language for p net models and ....

Benjamin C. Pierce. Programming in the pi-calculus: An experiment in programming language design. Tutorial notes on the Pict language. Available electronically, 1995.

....message queue is reduced. If only a constant number of messages are enqueued, we need only allocate an array of the fixed size for storing messages, and no boundary check is required. The same argument also holds for receiver queue; several concurrent programming languages, including CML[13] PICT[12] and HACL[6] allow multiple processes to compete for the same communication channel, hence receivers must be maintained by a queue. Using the information obtained from our analysis technique, the cost for manipulating receiver queues is also reduced. Moreover, we can also completely eliminate ....

Pierce, B. C., "Programming in the Pi-Calculus: An Experiment in Programming Language Design." Lecture notes for a course at the LFCS, University of Edinburgh., 1993.

....queue is reduced. If only a constant number of messages are enqueued, we need only allocate an array of the fixed size for storing messages, and no boundary check is required. The same argument also holds for receiver queues; several concurrent programming languages, including CML[12] PICT[11] and HACL[7] allow multiple processes to compete for the same communication channel, hence receivers must be maintained by a queue. Using the information obtained by our analysis, the cost for manipulating receiver queues is also reduced. Moreover, we can also completely eliminate message passing ....

Pierce, B. C., "Programming in the Pi-Calculus: An Experiment in Programming Language Design." Lecture notes for a course at the LFCS, University of Edinburgh. , 1993.

No context found.

Benjamin C. Pierce. Programming in the Pi-Calculus: An Experiment in Programming Language Design. Distributed with the Pict implementation, 1996.

....in its own right: we have chosen a small set of features that can be used together to tell a coherent story illustrating the power and elegance of a bottom up approach to concurrent language design. A full scale language design based on this core is underway. An early version, described in [Pie93], is available electronically with a prototype implementation. Our current implementation efforts emphasize portability, simulating concurrency on uniprocessors. The efficient implementation of calculus programs on distributed architectures poses significant compilation challenges. 3 Values At ....

Benjamin C. Pierce. Programming in the pi-calculus: An experiment in programming language design. Lecture notes for a course at the LFCS, University of Edinburgh. Available electronically, June 1993.

....We justify the use of P test by translating it itself into the language P. We first sketch the idea of expanding boolean messages and test expressions into P by using 2 adic messages. It is directly inspired from a standard protocol for encoding the behavior of persistent boolean values [Mil93, Pie96] adapted to the needs of the example, where the boolean messages correspond to ephemeral boolean variables. The encoding function e B[ acts homomorphically on every constructor of P that does not involve booleans; for those constructors that apply to or just mention booleans, e B[ is ....

B. C. Pierce. Programming in the Pi-Calculus: An Experiment in Programming Language Design. Distributed with the Pict implementation, 1996.

....6.2) plus a variety of higher level features defined by simple encodings into the core. Also like ml, the core calculus, and hence the derived forms, are statically typed. A uniprocessor implementation is publically available. The full pict language and type system are described elsewhere [Pie94, PT94a]. In this paper, we introduce just those constructs needed for the development of the examples; in particular, we shall not discuss the type system further. Most of the examples shown here do actually typecheck in the current version of pict; in a few places, however, typing annotations must be ....

Benjamin C. Pierce. Programming in the pi-calculus: An experiment in programming language design. Tutorial notes on the Pict language. Available electronically, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC