Search results

• HXT/Conversion of Haskell data from/to XML
  ...d this component. With the predefined picklers and pickler combinators, we don't have to look very much into these internals. Let's start with an example. , withValidate no -- don't validate source
  28 KB (3,540 words) - 18:19, 5 January 2015
• A brief introduction to Haskell
  ...s/caml-intro.html Introduction to OCaml], and translated from the OCaml by Don Stewart. To convert 5 to a <hask>Double</hask> we'd write:
  41 KB (6,592 words) - 22:27, 3 May 2024
• GHC/Using the FFI
  ...[http://book.realworldhaskell.org Real World Haskell] by Bryan O'Sullivan, Don Stewart, and John Goerzen. It will guide you through the writing of the bi Important: don't put "unsafe" on callerback, since it calls back to haskell via the wrappe
  29 KB (4,766 words) - 05:52, 1 June 2022
• Prime numbers
  gapsW k (d:w) s@(c:cs) | k < c = k : gapsW (k+d) w s -- set difference | otherwise = gapsW (k+d) w cs -- k==c
  58 KB (8,594 words) - 20:34, 6 May 2023
• Research papers/Data structures
  :Duncan Coutts, Don Stewart and Roman Leshchinskiy. PADL 2007. ...eralized iteration and coiteration for higher-order nested datatypes in A. D. Gordon, ed., Proc. of 6th Int. Conf. on Foundations of Software Science an
  14 KB (1,953 words) - 00:54, 5 June 2022
• Xmonad/xmonad development tutorial
  First, create an account on [https://github.com github] if you don't have one already. Then visit the [https://github.com/xmonad/xmonad xmona alias "hddck."='tmp=~/tmp/haddock; <nowiki>[[</nowiki> -d $tmp/html ]] || mkdir $tmp/html; base=`pwd`; haddock --html --source-module
  16 KB (2,392 words) - 17:44, 2 August 2021
• Haskell in practice
  ...l] <!-- Lucky seems like it could be brought up to date, but not by me - I don't understand MonadZero and MonadPlus. --> ..., B. Hausman, M. Y. Ivory, R. E. Jones, J. Kamperman, P. Lee, X. Leroy, R. D. Lins, S. Loosemore, N. R&ouml;jemo, M. Serrano, J.-P. Talpin, J. Thackray,
  14 KB (2,263 words) - 06:31, 10 August 2022
• A practical Template Haskell Tutorial
  ...sk>curry3</hask> function of type <hask>((a, b, c) -> d) -> a -> b -> c -> d</hask> in abstract syntax.<ref>Note that meta function <hask>curryN</hask> ..... |]|</code>), patterns (<code>[p| .. |]</code>), declarations (<code>[d| .. |]</code>), and types (<code>[t| .. |]</code>). Writing <code>[| .. |]<
  45 KB (6,927 words) - 18:50, 16 November 2020
• Haskell Tutorial for C Programmers
  ...ng that you have checked out the Gentle Introduction to Haskell, but still don't understand what's going on. If you don't have bzip2, you can get the latest version at [http://www.bzip.org/ www.b
  111 KB (19,450 words) - 17:55, 23 October 2019
• New monads/MonadAdvSTM
  I have not implemented either of these, but I think they'd be cool. | Of course, these solutions don't deal with the question of atomic blocks that want to perform output
  24 KB (3,463 words) - 05:20, 12 July 2021
• IO inside
  ...ptimizing C compilers try to guess which routines have no side effects and don't depend on mutable global variables. If this guess is wrong, an optimizati ...ten above. This simplifies the gluing of several I/O actions together. You don't need to use <code>do</code> for just one action; for example,
  82 KB (13,140 words) - 09:07, 3 May 2024
• Roll your own IRC bot
  $ decompose [(86400, "d"), (3600, "h"), (60, "m"), (1, "s")] (floor diff) Author: Don Stewart
  21 KB (3,285 words) - 19:34, 11 April 2024
• The I/O problem
  Functional languages are entirely mathematical, so the places where they don't work we don't want side effects to happen at compile time. Another question is
  61 KB (9,234 words) - 04:14, 5 April 2024
• News/2006
  <li><p><em>DList 0.1</em>. Don Stewart <li><p><em>PQC: QuickCheck in the Age of Concurrency</em>. Don Stewart
  93 KB (13,836 words) - 23:40, 14 August 2019
• All About Monads
  ...ibe how to get things done. Admittedly, some very simple monads like Maybe don't have much work to flow in the first place. (A mathematician might say it' ...n instance of the <code>Monad</code> class in the standard prelude, so you don't need to do it yourself. The other monad we have seen so far, the list con
  169 KB (26,630 words) - 00:15, 19 September 2021
• Typeclassopedia
  * What the heck is a monoid, and how is it different from a mon<u>a</u>d? ...; doubtless there are many examples of <code>Functor</code> instances that don’t exactly fit either of the above intuitions. The wise student will focus
  179 KB (29,519 words) - 16:10, 30 December 2022
• Haskell in education
  on Haskell. What I'd really need, though, is some life science related don't begin with that.
  40 KB (6,259 words) - 05:49, 6 June 2020

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