Search results

Jump to navigation Jump to search
  • =Bringing Atomic Memory Operations to a Lazy Language= atomic compare-and-swap (CAS) assembly instructions. This opens up a
    999 bytes (144 words) - 13:43, 17 December 2012
  • ...include [http://en.wikipedia.org/wiki/Compare-and-swap compare-and-swap], atomic read-modify-write operations such as [http://en.wikipedia.org/wiki/Fetch-an ...s in Haskell, grab the [http://hackage.haskell.org/package/atomic-primops atomic-primops package from Hackage]. This is a low-level library that provides a
    5 KB (865 words) - 18:26, 21 November 2013
  • *Define a language which corresponds with core Haskell and its basic types (atomic types, algebraic types, list), monads (including the IO monad) and basic li
    1 KB (224 words) - 09:21, 3 April 2011
  • from what i understand, an atomic block can only have side effects on stm variables. what if i want to have a
    4 KB (656 words) - 08:12, 6 January 2009
  • ...ew article such as yours important, but we should find a better way to let atomic and overview articles to coexist. I do not consider my article being old.
    4 KB (637 words) - 13:10, 30 December 2008
  • atomic (do { dO { action <- atomic (do {
    24 KB (3,463 words) - 05:20, 12 July 2021
  • ...instructions], and also has a rudimentary ability to use [[AtomicMemoryOps|atomic memory operations]].
    3 KB (360 words) - 12:02, 9 May 2024
  • * '''[[HaskellImplementorsWorkshop/2012/Newton|Bringing Atomic Memory Operations to a Lazy Language]]''' (Ryan Newton) [http://www.youtube
    6 KB (790 words) - 03:05, 25 July 2021
  • ...n of Haskell 98, now included in [[Haskell 2010]]. Haskell 98 only allowed atomic module names like <hask>List</hask> which was later moved into the hierarch
    7 KB (717 words) - 05:40, 25 April 2012
  • ...: ha ha; I think I'll leave it!)''' Also, on p19, "a atomic" should be "an atomic" and on p21, "sophisiticated" is misspelt. '''(SLPJ: done)''' ...ther threads can still be running even though only one thread can be in an atomic block at any given time. '''SLPJ: I have re-worded. See if you prefer vers
    38 KB (6,033 words) - 09:39, 12 January 2009
  • ...modifyMVar_ childrenDone (return . (childDone:)) -- non-blocking atomic change to MVar
    8 KB (1,050 words) - 06:19, 21 February 2010
  • ...g them in the table), association, "semantic action", and how to parse an "atomic term" including the parenthesized case (the only place we do a recursive de
    8 KB (1,033 words) - 02:43, 21 March 2018
  • ...icates <math>P</math> over terms, and the logical constructions to combine atomic predicates. Since we are talking about classical logic, many constructs hav ...press this structure in our types, we define a new constructor for negated atomic predicates as well as the type for the output of Stage 2:
    42 KB (6,241 words) - 22:09, 20 September 2008
  • Of course, atomic propositions contribute little towards knowledge, and the Haskell type syst
    8 KB (1,303 words) - 15:42, 18 November 2019
  • ...ge.haskell.org/packages/archive/stm/latest/doc/html/Control-Monad-STM.html Atomic memory transactions] - software transactional memory
    13 KB (1,870 words) - 11:14, 22 October 2022
  • I start by providing axioms stating that atomic terms evaluate to themselves
    10 KB (1,653 words) - 00:25, 12 July 2021
  • ...to describe transformations (rewritings) among multi-sets of constraints (atomic formulae). CHR naturally support concurrent programming. Conjunction of con
    12 KB (1,707 words) - 07:27, 10 March 2020
  • Simple, atomic types, and pair types can be stored in a more efficient manner: consecutive
    23 KB (3,342 words) - 19:28, 25 April 2013
  • ...ck makes no difference to the semantics of the transaction: It is just as atomic if you use a read lock. But, write locks can reduce the probability of tra
    15 KB (2,390 words) - 15:19, 6 February 2021
  • # <code>block</code> is used to make the creation of the font atomic with respect to asynchronous exceptions
    29 KB (4,766 words) - 05:52, 1 June 2022

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)