Thomas Frauenstein, Wolfgang Grieskamp, Mario Südholt  Home/Search
Context Related
| uebb.cs.tuberlin.de/pa...TR9614.ps.gz uebb.cs.tuberlin.de/le...TR9614.ps.gz uebb.cs.tuberlin.de/~t...TR9614.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: hypatia.dcs.qmw....hpc.functional (more) From: uebb.cs.tuberlin.de/leh...FUJI96 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We develop two semantics for the concurrency monad of the purely functional language Opal, which provides a general monadic choice, value-result agents and guarded client-server based communication. The transition semantics supports an operational understanding of the concurrency monad. The state-transformer semantics gives an axiomatic description of the concurrency monad by using a variant of temporal interval logic as syntactic sugar on top of LCF. In order to cope with typing problems in... (Update)
Context of citations to this paper: More
.... The canonical form exists due to the following distributivity laws: 3 A formal operational and denotational semantics is presented in [3]. signature Agent[ff] sort ff agent fun agent : com[ff] com[agent[ff] fun await : agent[ff] com[ff] Figure 3: Agents (Cmd1 Cmd2)...
.... because each compound command can be transformed to the following canonical form: 1 A formal definition of the semantics is presented in [FGPS96b] CHAPTER 3. CONCURRENT MONADIC PROGRAMMING 11 signature ComChoice[ff] sort ff fun : com[ff] Theta com[ff] com[ff] Structure...
Cited by: More
The Transformational Derivation of Parallel Programs using.. - Südholt (Correct)
Temporal Semantics of a Concurrency Monad With Choice and.. - Frauenstein, Grieskamp (Correct)
Communicating Functional Agents and their.. - Frauenstein.. (1996) (Correct)
Active bibliography (related documents): More All
1.3: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.5: Congruence Proofs for Weak Bisimulation Equivalences on.. - Baldamus, Frauenstein (1995) (Correct)
0.1: Using Concurrent Haskell to Develop Views over an.. - Einar W. Karlsen.. (1997) (Correct)
Similar documents based on text: More All
0.6: Communicating Functional Agents and their Application to.. - Frauenstein, al. (1996) (Correct)
0.3: Functional Pearls: A Poor Man's Concurrency Monad - Claessen (1999) (Correct)
0.3: Towards a Redesign of OPAL - Didrich, Exner, Gerke, Grieskamp.. (1997) (Correct)
Related documents from co-citation: More All
4: Concurrent Haskell - Jones, Gordon et al. - 1996
4: Imperative functional programming - Jones, Wadler - 1993
3: Cml: A higher-order concurrent language (context) - Reppy - 1991
BibTeX entry: (Update)
T. Frauenstein, W. Grieskamp, and M. Sudholt. On the semantics of a concurrency monad with choice and services. Technical Report TR96-14, TU Berlin, 1996. to appear. http://citeseer.ist.psu.edu/frauenstein96semantics.html More
@misc{ frauenstein96semantics,
author = "T. Frauenstein and W. Grieskamp and M. Sudholt",
title = "the semantics of a concurrency monad with choice and services",
text = "T. Frauenstein, W. Grieskamp, and M. Sudholt. On the semantics of a concurrency
monad with choice and services. Technical Report TR96-14, TU Berlin, 1996.
to appear.",
year = "1996",
url = "citeseer.ist.psu.edu/frauenstein96semantics.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
1180 The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
369 Information and Computation (context) - Moggi, computation - 1991
315 Dynamic typing in a staticallytyped language - Abadi, Cardelli et al. - 1989
293 The essence of functional programming - Wadler - 1992
281 Information Processing Letters (context) - Chaochen, Hoare et al. - 1991
261 Dynamic typing in polymorphic languages - Abadi, Cardelli et al. - 1996
248 Expressing Mobility (context) - Sangiorgi - 1993
244 Imperative functional programming - Jones, Wadler - 1993
67 Higher--order concurrency - Reppy - 1992
55 Facile antigua release programming guide (context) - Thomsen - 1993
45 A Theory of Weak Bisimulation for Core CML - Ferreira, Hennessy et al. - 1995
43 Logic and Computation (context) - Paulson - 1987
35 Plain CHOCS --- A second generation calculus for higher orde.. (context) - Thomsen - 1993
33 OPAL: Design and Implementation of an Algebraic Programming .. - Didrich, Fett et al. - 1994
31 Reasoning about Digital Circuits (context) - Moszkowski - 1983
25 Operational and algebraic semantics for facile: A symetric i.. (context) - Giacalone, Mishra et al. - 1990
24 Composing haggis - Finne, Jones - 1995
12 A fully abstract semantics for a concurrent functional langu.. - Jeffrey - 1995
11 Concurrent Haskell - Jones, Gordon et al. - 1996
8 Communicating functional agents and their application to gra.. - Frauenstein, Grieskamp et al. - 1996
2 FACILE: A symetric integration of concurrent and functional .. (context) - Giacalone, Mishra et al. - 1989
2 Ada 95 Reference Manual: Language and Standard Libraries (context) - Kempe - 1995
1 Journal of Funtional Programming (context) - Leroy, Mauny et al. - 1993
1 Crummings Publishing Comp (context) - Andrews, Olsson et al. - 1993
Documents on the same site (http://hypatia.dcs.qmw.ac.uk/SEL-HPC/Articles/GeneratedHtml/hpc.functional.html): More
A Parallel Complexity Model for Functional Languages - Guy Blelloch, John Greiner (1994) (Correct)
Computing Downwards Accumulations on Trees Quickly - Gibbons (1996) (Correct)
Expressing Nested Data Parallel Operations Through.. - Engelhardt, Wendelborn (1994) (Correct)
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