A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121--160, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....continuations between locations, and leads to a more e#cient implementation model. 1 Introduction The pi calculus and its variants have made a significant impact in research on concurrency and distribution. However, we are aware of only two distributed implementations of the pi calculus: Facile [8] which uses a hand shake discipline for communication, and an indirect encoding into the join calculus [5] which is then implemented on Jocaml [4] Other related implementations [20, 6] add explicit location constructs to the pi calculus and use di#erent mechanisms for distributed interaction. ....

A. Giacalone, P. Mishra, and S. Prasad. FACILE: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121--160, 1989.

....4 standard distributed system platforms (e.g. OMG CORBA, Sun Java, Microsoft . Net) those exhibited by recent mobile agents platforms (e.g. Voyager, Aglets, Grasshopper) or those exhibited in experimental platforms and languages such as Network Objects [4] Orca [17] Kali Scheme [11] Facile [16], Obliq [7] etc. These technologies improve on the traditional client server programming model, e.g. introducing ideas of shared objects, multi faceted components, migrating agents, or mobile code, but they fail to provide a uniform, formal model of distributed and mobile computing in a ....

A. Giacalone, P. Mishra, and S. Prasad. Facile: a symmetric integration of concurrent and functional programming. Intern. J. of Parallel Programming Vol. 18 No. 2, 1989.

....(e.g. OMG CORBA, Sun Java RMI EJB Jini, Microsoft COM Universal Plug Play . Net) those exhibited by recent mobile agents platforms (e.g. Voyager, Aglets, Grasshopper) or those exhibited in experimental platforms and languages such as Network Objects [6] Orca [4] Kali Scheme [12] Facile [19], Obliq [9] etc. These technologies improve on the traditional client server programming model, e.g. introducing ideas of shared objects, multi faceted components, migrating agents, or mobile code, but they fail to provide a uniform, formal model of distributed and mobile computing in a ....

A. Giacalone, P. Mishra, S. Prasad. Facile: a symmetric integration of concurrent and functional programming. Intern. J. of Parallel Programming Vol. 18 No. 2 (1989) 121-160.

....a convenient formalism for concurrency and communication, there has been very few work in designing programming languages that would canonically implement the paradigm. Noticeable exceptions are the language LOTOS [9] the language LCS introduced here and, to a lesser extend, the FACILE language [7]. Anatomy of LCS LCS is an high level asynchronous parallel programming language primarily aimed at exploring design, implementation and use of programming languages based upon the behavioral paradigm. The language and its implementations evolved through several versions [2] to that described ....

.... port : label # exp communication ports match : pat = exp match SML matches pat : sml pattern SML patterns communication ports is that of CCS: ports do not denote values and have global scope unless otherwise mentioned, in contrast with the treatment retained in PFL [8] or FACILE [7]. Operationally, port labels are implicitly bound to communication lines (one for each possible extension of the label) by the enclosing context. The scope of labels is controlled with restrictions. The restriction of p in b (written b p ) has the effect of delimiting the scope of ports labelled ....

[Article contains additional citation context not shown here]

A. Giacalone, P. Mishra, S. Prasad, "Facile: A symmetric integration of concurrent and functional programming". Int. Journal of Parallel Programming, 18(2), April 1989.

....of both the language ML and the CCS formalism. 2. The design of LCS 2.1 Structure, behavior expressions An important decision when designing a concurrent language is that of the respective role of functions and processes. LCS stands between the group of languages Poly ML [12] CML [18] FACILE [7], in which concurrency and communication primitives are provided as functions, and PICT [14] that exemplifies the opposite functions as processes approach. LCS is basically a process language: The highest units of computation are the processes, but abstraction and application are primitives and ....

....consistency of the pages holding updatable data. Garbage Collection is generational, with minor collections performed locally on each processor, and major collections performed globally and incrementally. 17 5. Conclusion Among the parallel functional languages designed for similar purposes [7, 12, 18], LCS is the sole strictly based upon CCS for its naming aspects. In terms of expressiveness, CCS naming forbids label passing. On another hand, one does never have to declare communication ports or pass them as parameters, this greatly simplifies programs, and the basic set of CCS process ....

A. Giacalone, P. Mishra, S. Prasad, "Facile: A symmetric integration of concurrent and functional programming". Int. Journal of Parallel Programming, 18(2), April 1989.

....language allows the system to be developed in a single, homogeneous, framework, and makes the distribution more transparent to the programmer. Functional languages potentially o er bene ts for small scale distributed programming, and several have been developed, e.g. Kali Scheme [CJK95] Facile [GMP89] OZ [HVS97] Concurrent Clean [PV98] and Pict [PT97] They allow high level distributed programming, e.g. capturing common patterns of distribution as higher order functions. Functional languages provide type safety within the constraints of a sophisticated, e.g. higher order and polymorphic, ....

....for distribution, but have parallelism implicit in control or data structures. Shared name space languages support threads, but not processes, e.g. OZ [HVS97] Oblique [CJK95] GpH [THLP98] and Linda [GC92] Distributed name space languages support processes but not threads, e.g. Facile [GMP89] PICT [PT97] and languages based on communications libraries like C with MPI [The97] Shared and distributed name space languages support both threads and processes. Threads may reside in a processes name space, as in Java [DSMS98] or may not, as in Occam [PM87] Conventional distributed ....

A. Giacalone, P. Mishra, and S. Prasad. Facile: a symmetric integration of concurrent and functional programming. In Springer-Verlag LNCS 352, editor, Tapsoft89, pages 181-209, 1989.

....they possess, as demonstrated in the Arjuna programming system [PSWL95] or at the higher level in scripting, or co ordination, languages [RSW98] 2. 3 Distributed Functional Fault Tolerance Many distributed functional languages exist e.g. Concurrent Clean [PV98] Kali Scheme [CJK95] Facile [GMP89] and Pict [PT97] but relatively few have addressed fault tolerance. 2.3.1 Erlang Erlang was developed by Ericsson for use in the telecommunications industry. It is a simple impure functional language designed for concurrent, real time, distributed fault tolerant systems [Wik94, Wik96] It ....

P. Giacalone, P. Mishra, and S. Prasad. Facile: a symmetric integration of concurrent and functional programming. In Tapsoft89, LNCS 352, pages 181{ 209. Springer-Verlag, 1989.

....has now shifted to making functional languages more usable and demonstrating their usefulness. Functional languages now interoperate with other systems using COM [19, 32] CORBA [26] and Java [5] They have solid, useful libraries [2] and often extend the functional paradigm with concurrency [37, 28, 40, 22]. Functional languages are now being used for more than writing compilers for functional languages. The Fox project at Carnegie Mellon has produced low level networking software written in SML [7] the Ensemble project at Cornell has used Objective Caml to implement a toolkit for building ....

A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121--160, 1989. 16

....of global computing has put emphasis on the techniques for programming heterogeneous networks such as the Internet. The foundational aspects of the paradigm are studied relying on process calculi like the calculus [14] the ambient calculus [3] the join calculus [10] D [16] core Facile [12]. The notion of location or locality (i.e. some way of identifying where a piece of code or a resource resides) has gained much attention in the above proposals. It appears important to know where processes and resources are located over the network to study their behaviour. In fact, minimizing ....

....compiler. Then, we show how allocation evolves during computation by establishing a sequence of locality mappings. 2 Higher Order Mobile Processes Here we recall the syntax and the basic notions of the higher order calculus (written HO) 17] enriched with a spawn operation in the Facile style [12], that we still call HO. Definition 2.1 Let N be a countable infinite set of names ranged over by a; b; x; y; with N fg = Let A be a set of agent identifiers ranged over by A; A 1 ; Let V be a set of process variables ranged over by X;Y; Processes, denoted by P; ....

A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18:121--160, 1989.

....from the perspective of secrecy. By using Confined # users can create a piece of secret information and rely on the fact that this secret information will not be leaked to those parties which they consider ineligible to obtain it. The computational model of Confined # is based on that of Facile [11] and Concurrent ML [20] It has a core set of features inherited from the call by value functional language ML [16] and it supports channel based communication between remote sites in a distributed system. All values in Confined # including functions and channels are first class; they can be ....

A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121-- 160, April 1989.

....to encompass functional, imperative, concurrent, and distributed programming paradigm in a single programming language. The original work on Facile began at the State University of New York in Stony Brook. It focused on the formal foundations of the functional, concurrent language integration [62] and on abstract implementation models. This work was influenced by the work on process calculi such as CCS and CHOCS [26, 63] Starting in 1991 a group at the European Computer Industry Research Centre 10 (ECRC) refined and implemented the language and the Facile Antigua Release was made freely ....

....also provides the constructs r spawn and r channel to create processes and channels at specific nodes. Since the implementation of the choice operator of CCS leads to problems in a real distributed setting, Facile adopts a different version of the choice operator which is discussed in detail in [62]. Facile also provides some general constructs to implement delay and time out mechanisms to get around the problems posed by blocked communications. To define the semantics of these constructs the designers of the language follow the developments in timed process algebra. 5.4 Mobility The fact ....

[Article contains additional citation context not shown here]

A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121--160, April 1989. 27

No context found.

A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121--160, 1989.

No context found.

A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. In Proceedings TAPSOFT89 conference, volume 352 of Lecture Notes in Computer Science, pages 184--209. Springer, 1989.

No context found.

A. Giacalone, P. Mishra, and S. Prasad. FACILE: A symmetric integration of concurrent and functionalpnctionalvS International Journal of Parallel Programming, 18(2):121--160, 1989.

No context found.

A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121--160, 1989.

No context found.

A. Giacalone, P. Mishra, S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2), 1989.

No context found.

P. Giacalone, P. Mishra, and S. Prasad. Facile: a symmetric integration of concurrent and functional programming. In Tapsoft89, LNCS 352, pages 181--209. Springer-Verlag, 1989.

No context found.

A. Giacalone, P. Mishra, and S. Prasad. FACILE: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121-160, April 1989.

No context found.

P. Giacalone, P. Mishra, and S. Prasad. Facile: a symmetric integration of concurrent and functional programming. In Tapsoft89, LNCS 352, pages 181-209. Springer-Verlag, 1989.

No context found.

A. Giacalone, P. Mishra, and S. Prasad. Facile: a symmetric integration of concurrent and functional programming. In SpringerVerlag LNCS 352, editor, Tapsoft89, pages 181-209, 1989.

No context found.

P. Giacalone, P. Mishra, and S. Prasad. Facile: a symmetric integration of concurrent and functional programming. In Tapsoft89, LNCS 352, pp. 181-- 209. Springer-Verlag, 1989.

No context found.

A. Giacalone, P. Mishra, S. Prasad, "FACILE: A Symmetric Integration of Concurrent and Functional Programming", LNCS 352, Springer-Verlag, Berlin 1989, 184-201.

No context found.

A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121--160, April 1989.

No context found.

A. Giacalone, P. Mishra, S. Prasad, "FACILE: A Symmetric Integration of Concurrent and Functional Programming", LNCS 352, Springer-Verlag, Berlin, 1989, 184-201.

No context found.

A. Giacalone, P. Mishra and S. Prasad, "Facile: a symmetric integration of concurrent and functional programming. Proc. Tapsoft89, SpringerVerlag LNCS 352, pp. 181-209, 1989.

First 50 documents  Next 50

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