Giacalone, A., Mishra, P., Prasad, S. 1989. FACILE: A symetric integration of concurrent and functional programming. Pages 184--201 of: Int. Joint Conference on Theory and Practice of Software Development (TAPSOFT). Lecture Notes in Computer Science, no. 352. Springer--Verlag, Berlin, Heidelberg, New York. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Semantics of a Concurrency Monad with Choice and.. - Frauenstein, Grieskamp, .. (1996) (1 citation) (Correct)
....which demands that a spontaneous agents behavior can be described by a normal command: dmode a j mode e (9 c ffl c ; term ; a nil) 6 Related and Future Work Concurrent Functional Programming. Perhaps the most influential concurrent functional programming languages are Cml [Rep92] and Facile [GMP89, T 93] However, neither approaches separates the concurrent extensions from the pure functional kernel. They are, therefore, both inherently impure, as opposed to the encapsulation of concurrency in monads. With respect to the communication model, an important difference is that we use a ....
....computation while the transition relation is describing the non deterministic concurrent computation. The use of monads in the syntax and semantics of Opal is an important difference to former research in the field of concurrent functional programming such as, for example, CML [Rep92] or Facile [GMP89, T 93] The semantics of the languages Cml, Facile and Haskell has been described operationally via (un)labelled transition relations, similar to our transition semantics. An interesting topic of further research is the development of an adequate notion of behavioural equivalence on top of ....
A. Giacalone, P. Mishra, and S. Prasad. FACILE: A symetric integration of concurrent and functional programming. In Int. Joint Conference on Theory and Practice of Software Development (TAPSOFT), number 352 in Lecture Notes in Computer Science, pages 184--201. Springer--Verlag, Berlin, Heidelberg, New York, March 1989.
Congruence Proofs for Weak Bisimulation Equivalences on.. - Baldamus, Frauenstein (1995) (1 citation) (Correct)
No context found.
Giacalone, A., Mishra, P., Prasad, S. 1989. FACILE: A symetric integration of concurrent and functional programming. Pages 184--201 of: Int. Joint Conference on Theory and Practice of Software Development (TAPSOFT). Lecture Notes in Computer Science, no. 352. Springer--Verlag, Berlin, Heidelberg, New York.
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