Search results

Jump to navigation Jump to search
  • <li><p><em>regex-posix 0.93.1</em>. Uploaded by Chris Kuklewicz. <li><p><em>regex-base 0.93.1</em>. Uploaded by Chris Kuklewicz.
    76 KB (9,269 words) - 19:17, 15 August 2019
  • Hackers: Chris Eidhof, Christopher Done(?)
    17 KB (2,638 words) - 12:02, 26 June 2013
  • [ ("Chris", 472), ("Don", 100), ("Simon", -5) ]
    14 KB (2,164 words) - 16:35, 9 October 2016
  • <li><p><em>Very Fast Searching of ByteStrings</em>. Chris Kuklewicz <ul><li><p><em>Learn Haskell in 10 minutes</em>. Chris Smith
    78 KB (11,405 words) - 03:19, 11 February 2008
  • :Chris Heunen and Bart Jacobs. In Electronic Notes in Theoretical Computer Science
    18 KB (2,331 words) - 09:02, 1 September 2022
  • ...w16-slides/blob/master/lol.pptx Functional Lattice Crypto] (Eric Crockett, Chris Peikert)
    16 KB (2,520 words) - 06:08, 16 October 2016
  • ...esetting literate scripts in TeX. The output looks much like the code from Chris Okasaki's book "Purely Functional Data Structures", doing syntax highlighti
    19 KB (2,935 words) - 13:50, 22 August 2022
  • </em>. Chris Kuklewicz <p><em>Text.Regex.Lazy (0.33)</em>. Chris Kuklewicz
    93 KB (13,836 words) - 23:40, 14 August 2019
  • :By Chris Dutton, An "attempt to bring the ideas of functional programming to the mas
    31 KB (4,662 words) - 08:38, 20 April 2024
  • ...th.wordpress.com/2012/04/18/why-do-monads-matter/ Why Do Monads Matter?] - Chris Smith
    35 KB (4,953 words) - 00:05, 9 May 2024
  • <b>Instructor:</b> [mailto:lengauer@fmi.uni-passau.de Chris Lengauer]
    40 KB (6,259 words) - 05:49, 6 June 2020
  • ...d in development and resulting software quality. The company is founded by Chris Eidhof and Eelco Lempsink. Currently they build iPhone/iPad applications in
    49 KB (6,836 words) - 08:57, 19 October 2020
  • .../web.archive.org/web/20111116194421/www.eecs.usma.edu/webs/people/okasaki/ Chris Okasaki], 232 pp., Cambridge University Press, 1998. ISBN 0-521-63124-6
    53 KB (7,703 words) - 13:28, 28 March 2024
  • The [http://evenmere.org/~chrisk/chris-sudoku-deduce.tar.gz source code] compiles to take a list of puzzles as inp Chris Kuklewicz writes, "You can get over 47,000 distict minimal puzzles from
    67 KB (9,593 words) - 05:40, 9 March 2021
  • ...[http://www.thenewsh.com/~newsham/haskell/monad.html What’s a Monad?], and Chris Smith's excellent article [http://cdsmith.wordpress.com/2012/04/18/why-do-m
    179 KB (29,519 words) - 16:10, 30 December 2022

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