Concurrent Monadic Interfacing

Authors:
Ian Holyer;Eleni Spiliopoulou
Affiliations:
-;-
Venue:
IFL '98 Selected Papers from the 10th International Workshop on 10th International Workshop
Year:
1998

Citing 8
Cited 3

Comprehending monads

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
The essence of functional programming

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Imperative functional programming

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lazy functional state threads

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
State in Haskell

Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
Concurrent Haskell

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compositional references for stateful functional programming

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Functional Programming and Communicating Processes

Proceedings of the Parallel Architectures and Languages Europe, Volume I

The Dynamic Properties of Hume: A Functionally-Based Concurrent Language with Bounded Time and Space Behaviour

IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Reasoning about deterministic concurrent functional i/o

IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages
Web service publishing and composition based on monadic methods and program slicing

Knowledge-Based Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we present the Brisk monadic framework, in which the usual monadic style of interfacing is adapted to accommodate a deterministic form of concurrency. Its main innovation is to allow actions on state components. This is a key issue which enables state splitting, a technique which assigns to each new thread a part of the state, a substate, to act upon. Distinct concurrent threads are restricted to access disjoint substates. A purely functional prototype implementation is presented to demonstrate these ideas. The resulting system acts as a basis for offering a purely functional form of concurrency, extending the expressiveness of functional languages without spoiling the semantics by introducing non-determinism.