Search results

Jump to: navigation, search
  • |Chris Smith
    4 KB (593 words) - 01:45, 27 March 2017
  • alternative to Java. According to Chris Fraser, a Microsoft research
    6 KB (876 words) - 10:45, 4 December 2006
  • .../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
    49 KB (7,108 words) - 11:51, 25 November 2021
  • <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
  • <b>Instructor:</b> [mailto:lengauer@fmi.uni-passau.de Chris Lengauer]
    40 KB (6,259 words) - 05:49, 6 June 2020
  • ...hnique Fédérale de Lausanne, [http://www.eecs.usma.edu/Personnel/okasaki Chris Okasaki], United States Military Academy,
    11 KB (1,760 words) - 21:50, 23 April 2021
  • Chris Barker's paper [http://www.cs.bham.ac.uk/~hxt/cw04/barker.pdf Continuations :Barker, Chris: [http://www.cs.bham.ac.uk/~hxt/cw04/barker.pdf Continuations in Natural La
    15 KB (2,211 words) - 16:44, 1 August 2021
  • ...lso [http://www.haskell.org/ghc/docs/edison/ earlier version of Edison] by Chris Okasaki. It provides sequences, finite maps, priority queues, and sets/bags
    17 KB (2,504 words) - 19:28, 15 August 2019
  • ...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,916 words) - 03:00, 25 July 2021
  • <p><em>Edison: Efficient Data Structures</em>. Chris Okasaki
    5 KB (630 words) - 12:09, 13 January 2007
  • 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
  • <p><em>First public release of Edison</em>. Chris Okasaki
    9 KB (1,274 words) - 12:10, 13 January 2007
  • :Manuel M. T. Chakravarty. In Pieter Koopman and Chris Clack, editors, Implementation of Functional Languages, 11th. Internationa
    9 KB (1,212 words) - 22:32, 6 August 2021
  • :Philip Wadler. Chapter in Samson Abramsky and Chris Hankin, editors, Abstract Interpretation, Ellis Horwood, 1987. :Olaf Chitil. In Chris Clack, Tony Davie, and Kevin Hammond, editors, Draft Proceedings of the 9th
    18 KB (2,524 words) - 13:34, 6 June 2014
  • :Ralf Hinze. In Chris Okasaki, editor, Proceedings of the Workshop on Algorithmic Aspects of Adva :Chris Okasaki. Haskell Workshop 2000. September 2000
    14 KB (1,950 words) - 13:55, 19 November 2010
  • :Chris Heunen and Bart Jacobs. In Electronic Notes in Theoretical Computer Science
    17 KB (2,312 words) - 15:10, 12 October 2013
  • :Chris Ryder and Simon Thompson. Technical Report 8-05, Computing Laboratory, Univ :Chris Ryder and Simon Thompson. In Marko van Eekelen and Kevin Hammond, editors,
    10 KB (1,438 words) - 22:21, 14 February 2012
  • | Chris Lample ||
    1 KB (163 words) - 20:53, 5 August 2016
  • Chris Barker: [http://www.cs.bham.ac.uk/~hxt/cw04/barker.pdf Continuations in Nat
    9 KB (1,380 words) - 05:32, 24 April 2021
  • ...rial on the details of this language I could find: Raganswamy Jagannathan, Chris Dodd. [http://newton.cs.concordia.ca/%7egipsy/publications/jagannathan96glu
    4 KB (593 words) - 15:07, 5 November 2011

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