Search results

Jump to navigation Jump to search
  • ModDur (Tempo r) d -> d / r Note d _, Rest d, ModDur _ d -> d
    3 KB (470 words) - 23:09, 11 July 2021
  • * (encode-modified '(a a a a b c c a a d e e e e)) ((4 A) B (2 C) (2 A) D (4 E))
    5 KB (839 words) - 04:58, 10 June 2023
  • -- Contributed by Don Stewart io s n t = printf "%s of depth %d\t check: %d\n" s n t
    6 KB (1,055 words) - 23:27, 18 April 2020
  • Greedy Son: Mind your own business! I don't tell you how to earn the money, so don't tell me how to spend it! I'll ask Mom instead.
    3 KB (445 words) - 15:19, 6 February 2021
  • | Don Stewart | You said you'd be there, right?
    1 KB (186 words) - 20:45, 3 July 2022
  • ...n interesting Haskell package on [http://hackage.haskell.org/ Hackage] you'd like to try. How do you install it on your system? First, check your package site for binary releases. It may turn out you don't have to build anything.
    1 KB (169 words) - 10:06, 10 March 2021
  • ...uld be an improvement to the language. I have not much missed it yet, so I don't feel strongly about it, though.) ...raints you can't quantify over is a bad idea. However if that is fixable I'd be generally in favour.)
    7 KB (1,198 words) - 05:55, 10 December 2020
  • Oh like that's going to work. You'd be better off selling T-shirts that algorithm) "DON'T YOU UNDERSTAND?".
    3 KB (561 words) - 02:55, 26 April 2021
  • ...r of 'load' via function composition instead of mutable flags. Moreover, I'd like to remove the targets, module graph and interactive context from the H -- unload stable linkables, compile the files, don't link.
    3 KB (404 words) - 23:03, 11 July 2021
  • ==D== *[http://research.microsoft.com/~adg/ Andrew D. Gordon]
    8 KB (1,251 words) - 05:43, 1 September 2022
  • 1) I implemented this problem once before in ruby (Don't think that helped too much though. The two languages have little in commo : p>f s>d d>f 100e f/ ; ( pennies -- float )
    3 KB (433 words) - 15:17, 6 February 2021
  • ''Those guys tell us these benchmarks don't favor C and then impose a limit on line length? What's the purpose of th -- Contributed by Vasile Gaburici, refactored heavily by Don Stewart
    20 KB (3,239 words) - 02:07, 26 April 2021
  • -d --dst str destination path for generated bytecode files (default=.) --redefine Don't complain if redefining an imported identifier
    6 KB (733 words) - 15:19, 6 February 2021
  • class (D a b b) => C a b ... * whereas Instance constraints don't apply until after the instance has been selected<br>(And it's a common ne
    14 KB (2,091 words) - 17:28, 4 February 2023
  • ...epository of COMPLETE WORKING EXAMPLES on how to do FFI. The examples here don't require any tools other than their respective compilers (ghc or g++). In sin d = realToFrac (c_sin (realToFrac d))
    7 KB (1,181 words) - 21:12, 30 August 2014
  • ...atically, implicitly typed ([[type]]s are checked by the compiler, but you don't have to declare them), lazy (nothing is done until it needs to be) langua ...e to be indented for this reason: if they started in the same column, they'd be separate statements, which is wrong.)
    13 KB (1,986 words) - 17:59, 9 August 2019
  • Executables intended for use from the command line, are be symlink'd into: * Cabal configuration files don't actually support <tt>~</tt>. You must replace that with <tt>/Users/xxx</t
    6 KB (862 words) - 05:34, 6 August 2014
  • ...e.haskell.org/package/Sprig Sprig], a foreign Binding to Jonny D's SDL Primitives Generator (SPriG) library ...s graphics-drawingcombinators], a functional wrapper around OpenGL, so you don't have to go into the deep, dark world of imperative stateful programming j
    7 KB (1,003 words) - 23:19, 5 April 2021
  • (We don't use a class, because we want multiple syntaxes for a given type.) Just (Node 'a' [Node 'f' [Node 'g' []],Node 'c' [],Node 'b' [Node 'd' [],Node 'e' []]],"")
    7 KB (1,025 words) - 02:14, 23 July 2021
  • don't we? I'd like to introduce my friend Bob:
    28 KB (4,668 words) - 15:16, 6 February 2021

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