<--- Back to Details
First PageDocument Content
Concurrency control / Thunk / Thread / Non-blocking algorithm / Glasgow Haskell Compiler / Monitor / Haskell / Evaluation strategy / Futures and promises / Computing / Software engineering / Computer programming
Date: 2006-01-25 10:53:17
Concurrency control
Thunk
Thread
Non-blocking algorithm
Glasgow Haskell Compiler
Monitor
Haskell
Evaluation strategy
Futures and promises
Computing
Software engineering
Computer programming

Haskell on a Shared-Memory Multiprocessor Tim Harris Simon Marlow Simon Peyton Jones

Add to Reading List

Source URL: research.microsoft.com

Download Document from Source Website

File Size: 186,38 KB

Share Document on Facebook

Similar Documents

Administrivia  Design of Parallel and High-Performance Computing

Administrivia  Design of Parallel and High-Performance Computing

DocID: 1rqkH - View Document

Administrivia  Design of Parallel and High-Performance Computing

Administrivia  Design of Parallel and High-Performance Computing

DocID: 1rnNM - View Document

Aaron Turon  Research Statement My research lies broadly in the areas of programming languages and verification, with the goal of building reliable software systems. I am drawn to software components that are usually cha

Aaron Turon Research Statement My research lies broadly in the areas of programming languages and verification, with the goal of building reliable software systems. I am drawn to software components that are usually cha

DocID: 1rnbf - View Document

Reagents: Expressing and Composing Fine-grained Concurrency Aaron Turon Northeastern University

Reagents: Expressing and Composing Fine-grained Concurrency Aaron Turon Northeastern University

DocID: 1rk2P - View Document

Brief Announcement: Selfishness in Transactional Memory Raphael Eidenbenz Roger Wattenhofer  Computer Engineering and Networks Lab

Brief Announcement: Selfishness in Transactional Memory Raphael Eidenbenz Roger Wattenhofer Computer Engineering and Networks Lab

DocID: 1qKkF - View Document