Transactional events

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn 2006, Issue , 2006, Pages 124-135

  Donnelly, Kevin ^a   Fluet, Matthew ^b  

^a BOSTON UNIVERSITY   (United States)

^b Cornell University ^*  (United States)

Author keywords

Concurrency; First class events; Monads; Synchronous message passing; Transactions

Indexed keywords

FIRST-CLASS EVENTS; MONADS; SYNCHRONOUS MESSAGE PASSING;

ABSTRACTING; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; SEMANTICS; SYNCHRONIZATION;

CONCURRENT ENGINEERING;

EID: 34247230284     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1159803.1159821     Document Type: Conference Paper

References (26)

1. Joe Armstrong, Robert Virding, Claes Wikström, and Mike Williams. Concurrent Programming in Erlang. Prentice-Hall, second edition, 1996.
2. Matthew Flatt and Robert Bruce Findler. Kill-safe synchronization abstractions. In The Conference on Programming Language Design and Implementation (PLDI), pages 47-58, 2004.
3. Emden R. Gasner and John H. Reppy. A multi-threaded high-order user interface toolkit. In Len Bass and Prasun Dewan, editors, User Interface Software, volume 1 of Software Trends, chapter 4, pages 61-80. John Wiley & Sons, 1993.
4. Glasgow Haskell Compiler. http://www.haskell.org/ghc.
5. Tim Harris and Keir Fraser. Language support for lightweight transactions. In The Conference on Object-oriented Programing, Systems, Languages, and Applications (OOPSLA), pages 388-402, 2003.
6. Tim Harris, Simon Marlow, and Simon Peyton Jones. Haskell on a shared-memory multiprocessor. In The Workshop on Haskell, pages 49-61, 2005.
7. Tim Harris, Simon Marlow, Simon Peyton Jones, and Maurice Herlihy. Composable memory transactions. In The Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 48-60, 2005.
8. Maurice Herlihy and J. Eliot B. Moss. Transactional memory: architectural support for lock-free data structures. In The International Symposium on Computer Architecture (ISCA), pages 289-300, 1993.
9. Ralf Hinze. Deriving backtracking monad transformers (functional pearl). In The International Conference on Functional Programming (ICFP), pages 186-197, 2000.
10. C. A. R. Hoare. Communicating sequential processes. Commun. ACM, 21(8):666-677, 1978.
11. Alan Jeffrey. A fully abstract semantics for a concurrent functional language with monadic types. In The Symposium on Logic in Computer Science (LICS), pages 255-264, 1995.
12. Einar Karlsen. The UniForM concurrency toolkit and its extensions to Concurrent Haskell. In The Glasgow Functional Programming Workshop (GFPW), 1997.
13. Oleg Kiselyov, Chung-chieh Shan, Daniel Friedman, and Amr Sabry. Backtracking, interleaving, and terminating monad transformers (functional pearl). In The International Conference on Functional Programming (ICFP), pages 192-203, 2005.
14. Simon Marlow, Simon Peyton Jones, Andrew Moran, and John Reppy. Asynchronous exceptions in Haskell. In The Conference on Programming Language Design and Implementation (PLDI), pages 274-285, 2001.
15. Eugino Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
16. Prakash Panangaden and John Reppy. The essence of concurrent ML. In Flemming Nielson, editor, ML with Concurrency: Design, Analysis, Implementation, and Application, Springer Monographs in Computer Science. Springer-Verlag, 1997.
17. Simon Peyton Jones. Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell. In T. Hoare, B. Broy, and R. Steinbrüggen, editors, Engineering Theories of Software Construction, volume 180 of NATO Science Series: Computer & Systems Sciences. IOS Press, 2001.
18. Simon Peyton Jones, Andrew Gordon, and Sigbjorn Finne. Concurrent Haskell. In The Symposium on Principles of Programming Languages (POPL), pages 295-308, 1996.
19. Simon Peyton Jones and Philip Wadler. Imperative functional programming. In The Symposium on Principles of Programming Languages (POPL), pages 71-84, 1993.
20. Rob Pike. A concurrent window system. Computing Systems, 2(2): 133-153, 1989.
21. John Reppy. Concurrent Programming in ML. Cambridge University Press, 1999.
22. George Russell. Events in Haskell, and how to implement them. In The International Conference on Functional Programming (ICFP), pages 157-168, 2001.
23. Davide Sanggiorgi and David Walker. The π-calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
24. Franklyn Turbak. First-class synchronization barriers. In The International Conference on Functional Programming (ICFP), pages 157-168, 1996.
25. Philip Wadler. Monads for functional programming. In Johan Jeuring and Erik Meijer, editors, Advanced Functional Programming, volume 925 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
26. Adam Welc, Suresh Jagannathan, and Antony L. Hosking. Transactional monitors for concurrent objects. In The European Conference on Object-Oriented Programming (ECOOP), pages 519-542, 2004.