Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>FWIW there are <a href="http://en.wikipedia.org/wiki/Purely_functional#Examples_of_purely_functional_data_structures" rel="nofollow">Purely functional data structures</a>, which benefit from functional programming.</p> <p>There's also a nice book on <em><a href="http://rads.stackoverflow.com/amzn/click/0521663504" rel="nofollow">Purely Functional Data Structures</a></em> by Chris Okasaki, which presents data structures from the point of view of functional languages.</p> <p>Another interesting article <a href="http://software.intel.com/en-us/blogs/2010/05/27/announcing-intel-concurrent-collections-for-haskell-01" rel="nofollow">Announcing Intel Concurrent Collections for Haskell 0.1</a>, about parallel programming, they note:</p> <blockquote> <p>Well, it happens that the CnC notion of a step is a <strong>pure function</strong>. A step does nothing but read its inputs and produce tags and items as output. This design was chosen to bring CnC to that elusive but wonderful place called <em>deterministic parallelism</em>. The decision had nothing to do with language preferences. (And indeed, the primary CnC implementations are for C++ and Java.)</p> <p>Yet what a great match Haskell and CnC would make! Haskell is the only major language where we can (1) enforce that steps be pure, and (2) directly recognize (and leverage!) the fact that both steps and graph executions <em>are</em> pure.</p> <p>Add to that the fact that Haskell is wonderfully extensible and thus the CnC "library" can feel almost like a domain-specific language.</p> </blockquote> <p>It doesn't say about performance – they promise to discuss some of the implementation details and performance in future posts, – but Haskell with its "pureness" fits nicely into parallel programming.</p>
    singulars
    1. This table or related slice is empty.
    1. POIs there a functional algorithm which is faster than an imperative one?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USYasir Arsanukaev
    1. USYasir Arsanukaev
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload