Search results

Jump to navigation Jump to search

  • Haskell Quiz/FizzBuzz/Solution Acontorer
    desc = concat [label | (j,label) <- tags, 0 == rem i j]
    534 bytes (79 words) - 15:19, 6 February 2021
  • List comprehension
    [(i,j) | i <- [1,2], j <- [1..4] ]
    5 KB (679 words) - 17:14, 4 February 2023
  • Idiom brackets
    data J = J instance (Monad i, Idiomatic i f g) => Idiomatic i (i f) (J -> g) where
    2 KB (365 words) - 18:50, 19 September 2017
  • Random shuffle
    j <- randomRIO (i,n) vj <- readArray ar j
    5 KB (743 words) - 13:10, 9 May 2017
  • Argh!
    lllj j 2 2 1 j lDj k
    1 KB (186 words) - 15:40, 3 December 2015
  • The Monad.Reader/Discuss Issue11/FingerTreeIMap
    (Key j _) == (Key k _) = j == k compare (Key j _) (Key k _) = compare j k
    2 KB (315 words) - 15:19, 6 February 2021
  • 99 questions/Solutions/86
    petersen = Graph ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j'] ('c', 'd'), ('c', 'h'), ('d', 'e'), ('d', 'i'), ('e', 'j'),
    2 KB (325 words) - 03:50, 10 January 2017
  • Cookbook/Other data structures
    dist (0,j) = j dist (i,j) = minimum [table ! (i-1,j) + 1, table ! (i,j-1) + 1,
    4 KB (640 words) - 21:05, 6 January 2019
  • 99 questions/Solutions/18
    slice xs i j = map snd $ filter (\(x,_) -> x >= i && x <= j)
    3 KB (560 words) - 22:51, 3 December 2020
  • Algorithmic information theory
    Gregory J. Chaitin -- see [http://en.wikipedia.org/wiki/Gregory_Chaitin the Wikipedia
    440 bytes (57 words) - 06:23, 4 February 2016
  • Research papers/Authors
    *[http://www.cs.chalmers.se/~gustavss/ J&ouml;rgen Gustavsson] ==J==
    8 KB (1,251 words) - 05:43, 1 September 2022
  • Research papers/Top 10
    :John Hughes. Comput. J. 32(2): 98-107 (1989) (Cited by 357) ...Series F: Computer and systems sciences, Volume 118, August 1992. Also in J. Jeuring and E. Meijer, editors, Advanced Functional Programming, Springer
    3 KB (361 words) - 06:58, 1 June 2022
  • 99 questions/21 to 28
    * (lsort '((a b c) (d e) (f g h) (d e) (i j k l) (m n) (o))) ((O) (D E) (D E) (M N) (A B C) (F G H) (I J K L))
    6 KB (890 words) - 05:51, 10 June 2023
  • HaWiki migration
    === F to J ===
    21 KB (2,417 words) - 23:19, 9 August 2021
  • Correctness of short cut fusion
    * A. Gill, J. Launchbury, and S.L. Peyton Jones. [http://doi.acm.org/10.1145/165180.1652 * J. Svenningsson. [http://doi.acm.org/10.1145/581478.581491 Shortcut fusion fo
    15 KB (2,468 words) - 01:17, 8 April 2016
  • Prime numbers miscellaneous
    [n | n<-[2..], []==[i | i<-[2..n-1], j<-[0, i..n], j==n]] [n | n<-[2..], []==[i | i<-[2..n-1], j<-[i*i, i*i+i..n], j==n]]
    18 KB (2,583 words) - 20:08, 19 December 2020
  • Computer science
    with Julie Sussman, foreword by Alan J. Perlis).
    3 KB (357 words) - 15:18, 6 February 2021
  • Research papers/Domain specific languages
    :J Peterson, G Hager. :J Svenningsson and E Axelsson, Trends in Functional Programming, 2013. A simp
    9 KB (1,309 words) - 07:48, 18 September 2014
  • 99 questions/80 to 89
    ...'d','e'),('d','i'),('e','j'),('f','h'),('f','i'),('g','i'),('g','j'),('h','j')] [('a',1),('b',2),('c',1),('d',2),('e',3),('f',2),('g',1),('h',3),('i',3),('j',2)]
    11 KB (1,679 words) - 06:20, 11 June 2023
  • Links
    ...D. Gordon], University of Cambridge, [http://www.cs.chalmers.se/~gustavss/ J&ouml;rgen Gustavsson], Chalmers University of Technology, *<b>J:</b>[http://www.cs.chalmers.se/~patrikj/ Patrik Jansson], Chalmers Universi
    11 KB (1,759 words) - 09:41, 10 August 2022

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

Retrieved from "https://wiki.haskell.org/Special:Search"