» tagged pages
» logout

sorted by: recent | see : popular
Content Tagged with concurrency + research

partial-vect.pdf :: Partial vectorisation of Haskell programs

Vectorisation for functional programs, also called the flattening transformation, relies on drastically reordering computations and restructuring the representation of data types. As a result, it only applies to the purely functional core of a fully-fledg

Haskell: del.icio.us tag/haskell

Software transactional memory

Software Transactional Memory, or STM, is an abstraction for concurrent communication. The main benefits of STM are composability and modularity. That is, using STM you can write concurrent abstractions that can be easily composed with any other abstracti

Haskell: del.icio.us tag/haskell

Simon Peyton Jones

Various papers on functional programming

Haskell: del.icio.us tag/haskell

Erlang Eases Expediting Elves, Reduces Reindeer Rage

Simon Peyton Jones has written an article about Software Transactional Memory in Haskell, to appear in a forthcoming book edited by Greg Wilson called "Beautiful code".

Haskell: del.icio.us tag/haskell

beautiful.pdf :: Beautiful Concurrency

Parallel programs execute in a non-deterministic way, so they are hard to test and bugs can be almost impossible to reproduce. For me, a beautiful program is one that is so simple and elegant that it obviously has no mistakes, rather than merely having no

Haskell: del.icio.us tag/haskell

Implementation of Port-based Distributed Haskell - Huch, Stolz (ResearchIndex)

We present an implementation of robust distributed open systems in Haskell via ports. The system is designed to allow an arbitrary number of applications to communicate in a peer-to-peer manner.

Haskell: del.icio.us tag/haskell

Page 1 | Next >>