Search results

• 10分で学ぶHaskell
  :Prelude> <hask>4 ^ 2 - 1</hask> :Prelude> <hask>(1 - 5)^(3 * 2 - 4)</hask>
  17 KB (1,020 words) - 07:22, 9 June 2023
• 99 questions/Solutions/99
  Hints: (1) The problem is not easy. You will need some time to thoroughly understand extractor = filter ((>1) . length) . map (filter ((=='.').snd)) . groupBy (equaling snd)
  5 KB (741 words) - 03:47, 10 January 2017
• Euler problems/71 to 80
  problem_71=fareySeq (0%1) (3%7) ...elements would be contained in the set of reduced proper fractions for d ≤ 1,000,000?
  7 KB (972 words) - 02:57, 3 May 2015
• Euler problems/31 to 40
  p31 = length $ g 200 [200,100,50,20,10,5,2,1] problem_31 = ways [1,2,5,10,20,50,100,200] !!200
  11 KB (1,557 words) - 09:03, 19 September 2014
• Informatics 1 - Functional Programming
  The course [http://www.inf.ed.ac.uk/teaching/courses/inf1/fp/ Informatics 1 - Functional Programming] is the first programming course taught to student ...dents to verify their code using [[QuickCheck]], where writing appropriate test properties is part of the challenge. In addition, some tutorial exercises u
  3 KB (537 words) - 01:42, 20 October 2016
• Introduction to QuickCheck1
  tl <- find (n-1) -- I want to test this function, without hitting the filesystem. In C++ I
  8 KB (1,186 words) - 20:49, 28 May 2021
• Data.Semigroup
  ...v` 2 == 4</hask> is not equal to <hask>(8 `div` 4) `div` 2 == 2 `div` 2 == 1</hask>. === Test for any elements which are True in a non-empty list using <hask>sconcat</ha
  4 KB (688 words) - 22:51, 29 June 2021
• Sandbox
  ...odule=Control.Monad.State.Lazy|module-doc=Control.Monad.State.Lazy|package=test}} {| border="1"
  5 KB (503 words) - 07:14, 22 December 2021
• Memory leak
  let xs = [1..1000000::Integer] let makeXs n = [1..n::Integer]
  4 KB (648 words) - 14:59, 13 June 2016
• Regex Posix
  The regular expressions provided by the GHC bundle (up to 6.10.1) are ...sKuklewicz]]). Note that all of these tests are passed by regex-tdfa-0.97.1 (but not below
  26 KB (3,619 words) - 03:30, 10 March 2017
• QuickCheck as a test set generator
  ...span style='font-size:x-large; font-weight:bold'>Using QuickCheck as a DIY test data generator</span></p></center> test their re-implementation (in Java) of the part of the huge
  10 KB (1,529 words) - 18:30, 16 January 2017
• Simple Unix tools
  -- Return the head -1 line of a file -- Return the tail -1 line of a file
  6 KB (842 words) - 05:27, 8 February 2016
• HUnit 1.0 User's Guide
  ...The [https://en.wikipedia.org/wiki/SUnit Sunit] tool pioneered support for test-first development in Smalltalk. HUnit is an adaptation of the unit testing ...rk is designed for easy extension. (Would anyone care to write a graphical test controller for HUnit?)
  23 KB (3,542 words) - 03:11, 15 May 2020
• How to work on lists
  :Indexes are zero based, so <hask>[1,2,3] !! 0</hask> will result in <hask>1</hask>. :(Returns everything that ''passes'' the test.)
  6 KB (1,106 words) - 12:32, 15 November 2019
• Logic programming example
  * Parent 1: "The child said 'I am a boy.'" What is the sex of parent 1, parent 2, the child, and what sex did the child
  14 KB (2,307 words) - 12:23, 31 July 2014
• Learning Haskell with Chess
  ==Exercise 1 - data types== *Define the initial board (<hask>initialBoard::Board</hask>), test <hask>prettyBoard</hask> with <hask>initialBoard</hask>.
  4 KB (546 words) - 02:12, 26 April 2021
• Nonogram
  [Blank : row | row <- rows (n-1) (k:ks)] ++ else [replicate k Cross ++ Blank : row | row <- rows (n-k-1) ks]
  17 KB (2,482 words) - 20:34, 8 June 2017
• 99 questions/61 to 69
  tree4 = Branch 1 (Branch 2 Empty (Branch 4 Empty Empty)) [1,2]
  12 KB (1,696 words) - 05:35, 11 June 2023
• FFI complete examples
  [1 of 1] Compiling Main ( Main.hs, Main.o ) [1 of 2] Compiling Termios ( Termios.hs, Termios.o )
  7 KB (1,181 words) - 21:12, 30 August 2014
• HacBerlin2014/Topics
  With as few lines as possible generate as most test scripts as possible, part test-cases are combinable. Language of the test scripts: ruby, python, perl, c++, ... (it depends)
  8 KB (1,326 words) - 20:19, 28 September 2014
• WxHaskell/Building
  * '''windows'''. General Windows systems (i.e. Windows 95 to Windows 8.1). <br /> * '''windows'''. Windows 98, 2000, XP, and 7, using wxMSW 2.8.x. Windows 8.1, using wxWidgets 2.9 and 3.0
  9 KB (1,401 words) - 22:39, 1 December 2015
• Haskell program coverage
  14% boolean coverage (1/7) 16% guards (1/6), 2 always True, 2 always False, 1 unevaluated
  20 KB (2,607 words) - 17:13, 16 June 2022
• Arch Linux/Applications
  * [http://aur.archlinux.org/packages.php?ID=19810 graphmod 1.1.3-1] 0 Present the module depen * [http://aur.archlinux.org/packages.php?ID=17823 darcs-graph 1.0-1] 2 Generate graphs of darcs repository activity
  27 KB (2,482 words) - 19:02, 6 May 2020
• Prime numbers miscellaneous
  ...of the form <math>6k+1</math> or <math>6k+5</math>. Thus, we only need to test these numbers: 1:p:candidates = [6*k+r | k <- [0..], r <- [1,5]]
  18 KB (2,583 words) - 20:08, 19 December 2020
• Learn Haskell in 10 minutes
  Prelude> 4 ^ 2 - 1 Prelude> (1 - 5)^(3 * 2 - 4)
  13 KB (1,986 words) - 17:59, 9 August 2019
• Internationalization of Haskell programs using gettext
  "MIME-Version: 1.0\n" === Run and test the program ===
  10 KB (1,489 words) - 15:02, 26 October 2016
• WxHaskell/Development
  ...07/custom-controls-in-wxhaskell-part-1/ Custom Controls in wxHaskell (part 1)], [http://wewantarock.wordpress.com/2010/01/10/custom-controls-in-wxhaskel ...l-event-handling-work-part-1/ How does wxHaskell event handling work (part 1)]
  6 KB (743 words) - 16:02, 26 April 2017
• WxHaskell/Cygwin
  ...cessary to run <tt>configure</tt> and <tt>make</tt>, i.e. <tt>sh</tt>, <tt>test</tt>, <tt>sed</tt>, gnu <tt>make</tt> etc. The cygwin environment provides export PS1='\[\033[1;31m\]\w\$ \[\033[0m\]'
  5 KB (902 words) - 19:36, 5 April 2015
• Maybe
  '''Maybe''' satisfies the [[type]] equation <math>F X = 1 + X</math>, where the functor <math>F</math> takes a set to a point plus th ;<hask>isJust</hask>, <hask>isNothing</hask> :Test the argument, returing a Bool based on the constructor.
  2 KB (409 words) - 00:28, 11 November 2023
• Debugging
  -- test.hs crash = sum [1,2,3,undefined,5,6,7,8]
  9 KB (1,453 words) - 19:18, 3 February 2021
• Aprende Haskell en 10 minutos
  Prelude> 4 ^ 2 - 1 Prelude> (1 - 5)^(3 * 2 - 4)
  14 KB (2,164 words) - 16:35, 9 October 2016
• HStringTemplate
  If this is rendered with "values" set to <hask>[1..4]</hask> the result will be: 1, 2, 3, 4
  12 KB (1,726 words) - 15:16, 6 February 2021
• New monads/MonadAdvSTM
  test via retryWith may or may not be well defined. With GHC 6.6 I get "test"
  24 KB (3,463 words) - 05:20, 12 July 2021
• Euler problems/181 to 190
  fun a1 b1 = sum [ e | e <- [2..a*b-1], gcd e (a*b) == 1,
  15 KB (2,018 words) - 01:29, 26 April 2021
• Non-empty list
  test1 = safe_reverse [1,2,3] As we can see, the null test is algorithmic. After we've done it, head
  8 KB (1,274 words) - 20:23, 18 July 2014
• Contstuff
  "info" -> io $ putStrLn "This is a test computation." when (i < 10) $ goto again (i+1)
  12 KB (2,067 words) - 05:43, 9 March 2021
• FFI imports packaging utility
  The Haskell Cabal [[#1|[1]]] is a framework which defines a common interface for authors to more easi ...e the <code>runghc Setup.hs configure</code> command as specified in [[#1|[1]]].
  19 KB (2,929 words) - 23:51, 13 September 2013
• Import modules properly
  ...Otherwise you have to choose the smaller range <code>A >= a.b.c && <a.b.c+1</code>. It may also be that <hask>Another.Important.Module.open</hask> was ...e observed for sub-vectors and elements with size greater than 1 byte. The test suite did miss that.
  5 KB (816 words) - 08:28, 2 May 2015
• WxHaskell/2.8
  ...ndard FFI libraries along with cabal install should work, but we typically test new releases only against the latest version of Haskell Platform for the su * '''Windows''': You will need wx-config for Windows, MinGW 5.1.6 and MSYS 0.1.11 (these are the latest versions at the time of writing). You must select
  7 KB (1,057 words) - 03:54, 14 August 2021
• GHC/SuperClass
  * using repeated type variables in Instances to test for type equality; and This gives in effect a type-level test for equality.
  14 KB (2,091 words) - 17:28, 4 February 2023
• Avoiding IO
  ...e says more or less that almost everything must be expected. It is hard to test them, because they can in principle depend on every state of the real world ...logging becomes. To avoid this, you should generally use a type that has O(1) <code>mappend</code>, such as <code>Data.Sequence</code>, and <code>fold</
  10 KB (1,634 words) - 22:52, 6 April 2022
• Type arithmetic
  remainder, GCD, and also contains the following predicates: test for zero, test for equality and < > <= >=
  8 KB (1,365 words) - 19:23, 15 August 2019
• Regular expressions for XML Schema
  Goal was to perform the test whether a string ''w'' is a word of a given regular set (given by a regular The word test is based on two functions. The first, here called ''nullable'' checks, whet
  22 KB (3,425 words) - 22:34, 29 June 2021
• Arrow tutorial
  > g = arr (\x -> x*3 + 1) |<code>second g</code> ⇔ <code>3*y + 1</code>, where <code>y</code> is the second component of the pair
  8 KB (1,316 words) - 00:00, 17 June 2021
• Shootout/SumFile
  A Shootout Entry for the [http://shootout.alioth.debian.org/gp4/benchmark.php?test=sumcol&lang=all sum-file benchmark]. ...hmark, at 2.74 seconds[http://shootout.alioth.debian.org/gp4/benchmark.php?test=sumcol&lang=clean&id=0], and anything Clean can do Haskell should be able t
  20 KB (3,239 words) - 02:07, 26 April 2021
• Hoogle
  * <tt>--start=int</tt> 1-based index of first result to print, defaults to 1 find $1 -name '*.hoo'
  18 KB (2,779 words) - 22:27, 12 June 2017
• Programming performance
  {| border="1" cellspacing="0" cellpadding="5" align="center" | 1.5hr
  4 KB (638 words) - 23:08, 5 April 2021
• Real World Applications/Event Driven Applications
  return [EventAdd 1] Value is now: 1
  7 KB (1,076 words) - 08:53, 4 July 2014
• WxHaskell/Windows
  ...) for Haskell Platforms 2013.2.0.0, 2014.2.0.0 and 7.10.2, and MinGHC 7.10.1. The Haskell packages are installed locally. To test wxHaskell, install [[wxAsteroids]] with:
  14 KB (2,131 words) - 23:13, 11 July 2021
• OpenGL
  ...nGLRaw] contains a low-level wrapper around OpenGL, which is basically a 1:1 mapping of the C API. renderString Roman "Test string"
  9 KB (1,237 words) - 02:14, 8 August 2022
• Untypechecking
  Tue Mar 1 03:13:08 EST 2005 into GHCi -- tested on GHCi 6.2.1 or GHCi snapshot 6.3.20041106. It
  20 KB (3,458 words) - 15:19, 6 February 2021
• Tutorials/Programming Haskell/Argument handling
  let largestNumber = last [1..] * Numbers the output lines, starting at 1.
  25 KB (3,657 words) - 18:20, 12 September 2015
• Xmonad/Guided tour of the xmonad source/StackSet.hs
  just so we can test to make sure it's never called! If this were a ...ow next to the current one, and reversing the window list are all simple O(1) operations.
  16 KB (2,690 words) - 16:02, 26 December 2022
• Haskell programming tips
  | p x = 1 + count p xs [a | i <- [1..m]]
  29 KB (4,702 words) - 12:36, 4 May 2021
• How to write a Haskell program
  ...n your code's behavior. See [http://hackage.haskell.org/package/hashable-1.1.2.2/hashable.cabal this Cabal file] for an example of how to include tests ...amework for QuickCheck using some Template Haskell. For HUnit, see [[HUnit 1.0 User's Guide]]
  22 KB (3,268 words) - 04:57, 30 January 2022
• HXT/Conversion of Haskell data from/to XML
  ...from the so- called [http://www.ibiblio.org/xml/books/bible/examples/05/5-1.xml XML Bible]. The complete source for this example is included in the HITS="5" DOUBLES="1" TRIPLES="0"
  28 KB (3,540 words) - 18:19, 5 January 2015
• CouchDB
  ...compiled with an slightly earlier version of CouchDB than the current 0.10.1. -- revision 1-7fa1d1116e6ae0c1ee8d4ce89a701fdf
  12 KB (1,556 words) - 15:19, 6 February 2021
• SDL
  Installation of SDL 1.x: Linking test ...
  7 KB (1,003 words) - 23:19, 5 April 2021
• Tying the Knot
  y = 1 : x ...important to stress that this procedure allocates only two numbers - 0 and 1 - in memory, making this a truly cyclic list.
  24 KB (3,850 words) - 17:16, 28 June 2021
• Prime numbers
  ...ber'' (or a ''prime'') is such that has no divisors other than itself (and 1). This means that it cannot be represented as a product of any two of such ...', i.e. those representable as product of two natural numbers greater than 1.
  58 KB (8,594 words) - 20:34, 6 May 2023
• HaskellImplementorsWorkshop/2016
  ...of type 'IO a'. This idea has been described previously, by both Filinski [1] who named the operators 'reflect' and 'reify', as well as Pfenning and Dav [1] Representing Monads Andrzej Filinski Principles of Programming Languages,
  16 KB (2,520 words) - 06:08, 16 October 2016
• The Monad.Reader/Issue2/FunWithLinearImplicitParameters
  reset (1 + shift (\k -> k 1 + k 2)) :: Int ...k> is <hask>k = \x -> x + 1</hask>, so the expression evaluates to <hask>k 1 + k 2 = 2 + 3 = 5</hask>.
  35 KB (5,673 words) - 20:05, 7 July 2015
• CTRex
  We also provide a constraint to test that two Rows are '''disjoint'''. Corresponding to this we also provide a f <haskell> typerr1 = (x := 1 .| empty) .! y + 1 </haskell>
  25 KB (4,073 words) - 08:53, 9 December 2013
• Glome tutorial
  ...iew" as well, but to use Glome for anything other than viewing the default test scene, you may want to download the source tar file manually. ...verything works, a window should open and you should (after a pause) see a test scene with a variety of geometric shapes. If it doesn't work, then let [ht
  40 KB (6,787 words) - 01:19, 8 April 2014
• POV-Ray SDL project
  light_source {<-2, +3, -5>, colour rgb 1} pigment {colour rgb <1, 0, 0>}
  9 KB (1,391 words) - 15:17, 6 February 2021
• Library/Streams
  h <- openRawFD "test" WriteMode transformer. If you don't use any encodings other than Latin-1 -- or
  21 KB (3,181 words) - 16:03, 14 March 2014
• HXT
  ...onent is a validating and namespace-aware XML Parser that supports the XML 1.0 Standard almost completely. Extensions are a validator for RelaxNG and an <p></p>This definition corresponds 1:1 to the composition of binary relations. With the help of the <hask>(>>>)</h
  48 KB (6,937 words) - 00:20, 27 April 2016
• HacFreiburg2017
  ...Talk by <u>David Luposchainsky: "Haskell QA“</u>: Live Session explaining test frameworks and setup, benchmarking, generating and validating documentation ...t bus between the airport and Freiburg train station. Travel time is about 1 hour, a one-way ticket costs about 20 € (credit cards not accepted). The
  7 KB (1,040 words) - 11:33, 4 August 2017
• BerkeleyDBXML
  To test your installation, see if you can run the 'dbxml' command from the install Trying 127.0.0.1...
  15 KB (2,390 words) - 15:19, 6 February 2021
• Regular expressions
  {| border="1" cellspacing="0" cellpadding="5" | easier for newcomers from other languages; 0.5.1 leaks memory in some cases
  18 KB (2,819 words) - 19:20, 15 August 2019
• Why Haskell matters
  ...what this line says is just "To get the result, filter the list xs by the test p and compute the length of the result". ...rgument. Notice that filter is also a higher order function, it takes the "test function" as an argument.
  33 KB (5,613 words) - 08:24, 16 November 2020
• Simonpj/Talk:OutsideIn
  ...ocal assumptions: [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.167.4165&rep=rep1&type=pdf PDF]''' '''Version 1 comments, now dealt with; thank you!'''
  9 KB (1,527 words) - 09:11, 10 August 2022
• Haskore
  Step 1. Install the remaining packages such that at the end the following packages ....haskell.org/haskore/revised/ Design experiments] || Henning Thielemann || Test of several changes of Haskore's design targetting at more flexibility and c
  8 KB (1,173 words) - 10:09, 14 July 2014
• Haskellへのヒッチハイカーガイド
  73 KB (10,050 words) - 00:05, 19 April 2021
• Template Haskell
  ...sign can be found [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.4479&rep=rep1&type=pdf here]. It is [https://downloads.haskell.org/ghc ...size. Taken from [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.4479&rep=rep1&type=pdf this paper].
  30 KB (4,551 words) - 00:29, 15 June 2023
• Sudoku
  solve = forM [(i,j) | i <- [1..9], j <- [1..9]] $ \(i,j) -> do a <- option [1..9] -- pick a number
  67 KB (9,593 words) - 05:40, 9 March 2021
• Meet Bob The Monadic Lover
  > oneMoreTime (Lover (name,times)) = Lover (name,times + 1) Lover {loverDiary = ("Antonia ",1)}
  28 KB (4,668 words) - 15:16, 6 February 2021
• Hitchhikers guide to Haskell
  == Chapter 1: Ubiquitous "Hello world!" and other ways to do IO in Haskell == -- Taken from 'cd-fit-1-1.hs'
  69 KB (11,026 words) - 12:26, 9 January 2023
• Humor/Wanda
  -- Carl Sagan, "The Fine Art of Baloney Detection," Parade, February 1, 1987 "wisdom engineering". As a test of our ideas, we have written IMMANUEL, a
  8 KB (1,343 words) - 09:02, 13 March 2016
• Programming guidelines
  writing I use ghc-6.4.1, haddock-0.7 and (GNU-) emacs with the latest ...conditions are obviously fulfilled (i.e. by a case statement or a previous test). Particularly the call of <code>head</code> should be used with care or (e
  17 KB (2,651 words) - 09:36, 10 August 2022
• Arrow
  test = proc _ -> do ...<math>\sigma) \left(i:x\right) y \Leftrightarrow i\begin{cases}0:&x\rho y\\1:&x\sigma y\end{cases}</math>
  11 KB (1,636 words) - 20:01, 13 May 2020
• Introduction
  test/example code and had almost no implementation errors in the code! The // To sort array a[] of size n: qsort(a,0,n-1)
  26 KB (4,102 words) - 23:54, 29 February 2020
• Library/CC-delcont
  loop _ [] = return 1 We can test our iterator like so:
  25 KB (4,039 words) - 16:39, 12 March 2024
• Xmonad/Config archive/John Goerzen's Configuration
  ...aintain a Darcs tree. Most patches have been merged back as of xmobar 0.9.1, but a couple patches that shorten the number formatting are unapplied. Yo Save this and test it with ghci.
  20 KB (3,066 words) - 13:01, 24 May 2020
• Distributii Linux de Download apreciate
  ...Software tinut in Italia (de altcineva) [http://www.haskell.org/wikiupload/1/1c/Lx1.pdf Desi pe alocuri subiectiva, pledoaria mea pentru Linux a fost at 2012: Ubuntu 12.04.(1) LTS si urmatoarele Ubuntu 12.04.2, Ubuntu 12.04.3 va permit sa rulati Hask
  22 KB (2,918 words) - 04:41, 21 November 2013
• Manatee
  1) Install gold-linker to accelerate installation: I have test, Manatee can works well in Gnome, KDE, XMonad and XFCE
  12 KB (1,458 words) - 02:36, 26 April 2021
• GHC/FAQ
  ...<tt>libreadline.so.3</tt> in <tt>/usr/lib</tt>. We tried this on a SuSE 7.1 box and it seemed to work, but YMMV. ghc-6.4.1: internal error: mallocBytesRWX: failed to protect 0x0x1660730
  36 KB (5,898 words) - 06:04, 10 August 2022
• Haskell Tutorial for C Programmers
  # Save that code as a file with the extension '.hs', for instance, 'test.hs'. # In Hugs or GHCi, at the prompt type ':l test.hs'. That's a lowercase 'L'.
  111 KB (19,450 words) - 17:55, 23 October 2019
• IO inside
  cosh r = (exp r + 1/exp r)/2 cosh r = (x + 1/x)/2 where x = exp r
  82 KB (13,139 words) - 02:14, 22 April 2024
• Ru/IO Inside
  get2chars = [getchar 1, getchar 2] get2chars _ = [getchar 1, getchar 2]
  64 KB (6,046 words) - 11:23, 22 October 2022
• GHC/Type families
  ...e first stable release of GHC that properly supports type families is 6.10.1. Release 6.8 includes an early partial deprecated implementation. ...ts/indexed-types/should_run/GMapAssoc.hs] for <hask>GMap</hask> from GHC's test suite.
  42 KB (6,828 words) - 17:15, 4 February 2023
• Haskell in practice
  One of the project aims is to test the efficiency of a real-world CA * [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.34.493&rep=rep1&type=pdf Composing contracts: an adventure in financial eng
  14 KB (2,263 words) - 06:31, 10 August 2022
• HaskellImplementorsWorkshop/2014
  ...e Signatures|Partial Type Signatures]] ([http://www.haskell.org/wikiupload/1/15/PartialTypeSigs-presentation.pdf slides]) ...xisting tools (trac, the mailing lists) and practices (notes, an extensive test suite) that keep working on GHC manageable.
  22 KB (3,305 words) - 01:20, 30 September 2014
• All About Monads
  === Example 1 === ...monad. The List monad allows us to build computations which can return 0, 1, or more values.
  169 KB (26,630 words) - 00:15, 19 September 2021
• News/2006
  <ul><li><p><em>Edison 1.2.1</em>. Robert Dockins [http://archive.fo/lnkg2 announced] the 1.2.1 release of [http://www.eecs.tufts.edu/~rdocki01/ Edison]. Edison is a famou
  93 KB (13,836 words) - 23:40, 14 August 2019
• Xmonad/Frequently asked questions
  * [http://aur.archlinux.org/packages.php?do_Details=1&ID=10593 Arch] ...urrent window to that screen. When xmonad starts, workspace 1 is on screen 1, workspace 2 is on screen 2, etc. When switching workspaces to one that is
  71 KB (10,765 words) - 16:38, 22 August 2021
• QuotesPage
  In article <9pdvgc$u3d$1@news.fas.harvard.edu>, Ken Shan ...ecursions to screw in a light bulb, one to turn the light bulb once, and n-1 to screw it in.
  55 KB (8,884 words) - 01:18, 10 November 2022
• Books
  ...It has crystal-clear illustrations and guided practice. You will write and test dozens of interesting programs and dive into custom Haskell modules. You wi ...], Paperback / eBook: 498 pages, Apress (January 2014), English, ISBN: 978-1-43026-250-3
  53 KB (7,703 words) - 13:28, 28 March 2024
• Haskell in industry
  * [http://www.haskell.org/communities/12-2007/html/report.html#sect7.1.2 Barclays Capital Quantitative Analytics Group] Functor AB offers new tools for ground-breaking static analysis with pre-test case generation of programs to eliminate defects and bugs in software very
  49 KB (6,836 words) - 08:57, 19 October 2020
• Typeclassopedia
  ...e design space], and [http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.4008 Hudak et al.’s history of Haskell]. However, as often happens w ...e it as <code>(e,)</code>, by analogy with an operator section like <code>(1+)</code>, but that syntax is not allowed in types (although it is allowed i
  179 KB (29,519 words) - 16:10, 30 December 2022
• Old news
  <ul><li><p><em>ArrayRef 0.1.2</em>. Uploaded by Gwern Branwen. ...[http://hackage.haskell.org/cgi-bin/hackage-scripts/package/ArrayRef-0.1.2 ArrayRef]: Unboxed references, dynamic arrays and more.</p></li>
  76 KB (9,269 words) - 19:17, 15 August 2019
• FAQ
  ...standard] only guarantees a range of -2²⁹ to (2²⁹ - 1). Most implementations will provide a full machine-size signed integer, i.e The module [http://hackage.haskell.org/packages/archive/text/0.11.1.5/doc/html/Data-Text-Encoding.html Data.Text.Encoding] from the <tt>text</t
  36 KB (5,813 words) - 06:04, 13 April 2024
• The I/O problem
  :<small>[https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.91.3579&rep=rep1&type=pdf How to Declare an Imperative], Philip Wadler (pag :<small>[https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.95.9846&rep=rep1&type=pdf Functions, Frames and Interactions], Claus Reinke
  61 KB (9,234 words) - 04:14, 5 April 2024

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