Search results

Jump to navigation Jump to search
  • ...ttp://www.cs.ukc.ac.uk/people/staff/sjt/craft2e/errors.html Simon Thompson's page]. === HasFuse: <u>Has</u>kell with <u>FU</u>NDIO-based <u>s</u>ide <u>e</u>ffects ===
    9 KB (1,363 words) - 15:57, 9 March 2024
  • Here is another implementation using List's monadic behavior
    2 KB (359 words) - 20:50, 30 July 2021
  • Let's tackle the problem with some of Haskell's most powerful glue - higher-order functions. Any beginning Haskell programm cons x (s,l) = (x + s, 1.0 + l)
    22 KB (3,703 words) - 21:20, 30 May 2021
  • Turing-complete, but allows user to define it's own functions, do s <- elements chars_start
    10 KB (1,529 words) - 18:30, 16 January 2017
  • It also defer some support for opaque types to user's responsibility. This renders fficxx a rather unusable to make bindings to s
    2 KB (344 words) - 12:43, 26 May 2015
  • Here's an example. Say you want to build a circular, doubly-linked list, given a s This representation is fine for manipulation, but it's not as suitable for actually executing the DFA as it could be because we ne
    24 KB (3,850 words) - 17:16, 28 June 2021
  • hurting someone's copyrights). The other related entry :<i>We all have our own ideas about good Haskell style. There's More Than One Way To Do It. But some ways are better than others.
    17 KB (2,651 words) - 09:36, 10 August 2022
  • ...rk presumably obsoletes both references mentioned here to Lin's and Sheard's papers. ...ng time to grok details of the definition of "more general than", since it's contravariant in the constraints etc... it might be nice to add a paragraph
    9 KB (1,527 words) - 09:11, 10 August 2022
  • Use Welch-Powell's algorithm to paint the nodes of a graph in such a way that adjacent nodes h
    2 KB (325 words) - 03:50, 10 January 2017
  • There have been many ideas for improving the prelude's support for mathematics. Including the addition of algebraic classes. But
    2 KB (310 words) - 06:04, 10 December 2020
  • There is nothing fancy or mind-blowing about it; it's my first Haskell program, and I just hope it can help out other newbies. C -- which is how it's represented as an argument to the program
    5 KB (787 words) - 15:17, 6 February 2021
  • ...above using <hask>foldr</hask> (note that GHC erases the <hask>Maybe</hask>s, producing efficient code):
    3 KB (454 words) - 15:07, 2 October 2020
  • # Those who are working on the STG machine (and GHC's backend in general). * Program annotations for call-stack tracing, similar to GHC's scc annotation for cost centre stacks.
    15 KB (2,396 words) - 07:19, 10 August 2022
  • ...occur because the true domain of the function is smaller than the function's type suggests. For example, the type of <hask>head</hask> says that the fun Here's the 0th approximation of the advocated approach:
    8 KB (1,274 words) - 20:23, 18 July 2014
  • A better way to represent an edit widget's content is a time-varying value, called a ''behavior''. The basic idea is ...widget, the current value of a database entry as well as the system clock's current time. Using this model the current content of an edit widget would
    11 KB (1,615 words) - 05:58, 7 November 2022
  • ...It is written in Haskell. It is designed to be simple, fast and robust. It's very stable, with one instance running for several months. ...[[ALSA]] wrappers by [http://open-projects.net/~shahn/index.php?seite=code Sönke Hahn]
    6 KB (831 words) - 20:07, 5 December 2021
  • | just as inconvenient to convey grouping verbally, whether it's layout or punctuation
    3 KB (532 words) - 23:05, 24 July 2021
  • ...at until something emerges that you could have come up with yourself. That's an example application of equational reasoning!-) ...easily understood by beginners, or code that makes full use of the author's experience with possibly advanced Haskell abstractions. Note that there is
    6 KB (833 words) - 00:02, 6 November 2021
  • ...of section 2 of the [http://www.haskell.org/cabal/users-guide/ Cabal User's Guide]. ...m, and uploading them to, Hackage. As a bonus, for almost all programs, it's faster than using Setup.hs scripts directly, since no time is wasted compil
    22 KB (3,268 words) - 04:57, 30 January 2022
  • A simple library for fast web prototyping in Haskell, inspired by Ruby's Rack and Sinatra. Wheb's a WAI framework for building robust, high-concurrency web applications simp
    13 KB (1,880 words) - 07:32, 27 August 2020

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