Search results
Jump to navigation
Jump to search
- ModDur (Tempo r) d -> d / r Note d _, Rest d, ModDur _ d -> d3 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 t6 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 Stewart20 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 identifier6 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 ne14 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</t6 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 j7 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
- ...dient we need to apply only non-frozen transforms. The problem is that we don't know which are frozen and which are not. (10:17) <Martingale> It's seems like we need information we don't yet have as we traverse the tree9 KB (1,383 words) - 16:48, 18 November 2013
- ...want or need manual gap-setting ability (if you're not sure, you probably don't) can use the new contrib module XMonad.Layout.Gaps. ...pt), and the URL string. If you want to replicate the old simpleEngine, it'd look like 'newEngine = searchEngine "" "http://..."'.3 KB (451 words) - 12:13, 19 April 2021
- Don't be surprised if you leave this page more confused than before. That just ...In no way whatsoever. You don't even need flexible morals to claim it. To be more specific, it's IO that6 KB (1,032 words) - 16:45, 2 December 2020
- If you don't have an irc client you can use http://webchat.freenode.net/ ...en to everyone. To register, fill out this [https://docs.google.com/forms/d/1taZtjgYozFNebLt1TR2VnKv-ovD2Yv5sOdSZzmi_xFo/viewform registration form].5 KB (917 words) - 14:35, 5 April 2014
- ...g the latest development (GitHub) or stable (Hackage) versions of Yi, so ''don't'' try to install these two packages. Yi supports VTY and Gtk2hs directly |C-d9 KB (1,413 words) - 00:17, 24 November 2014
- (Branch 'd' Empty Empty) ...t your predicate in an appropriate way. Note: This is a difficult problem. Don't give up too early!12 KB (1,696 words) - 05:35, 11 June 2023
- '''NOTE:''' You don't ''need'' to use this config file to replicate the default config. This is -- Normally, you'd only override those defaults you care about.10 KB (1,329 words) - 15:18, 6 February 2021
- ..., Float.R2 is float-specific, and SDouble's are ADT's (boxed types), thus don't pack, so the generic V2 is sufficient. ...dth is 1/x of the diagram's width", while Measure probably does not, but I don't think it will be any worse than what we have now.10 KB (1,671 words) - 03:59, 16 August 2014
- ...it, there is also [[Help:Editing | help on editing wiki pages]]. Finally, don't forget to categorize your new page. ** have a look at [[Libraries and tools/GUI libraries]]. i'd have a look at [http://haskell.org/graphics/ HGL], [http://haskell.org/HOpe6 KB (915 words) - 06:17, 23 July 2020
- Duncan Coutts proposed contacting the maintainer. If you don't receive replies within a time frame write to the haskell-cafe mailinglist ...an't reply because they are on holiday or got very busy.. In these cases I'd like to put my patch somewhere so that others can find them.18 KB (3,049 words) - 10:29, 7 February 2021
- program you will construct at the end. but your reader don't know all these! related with lambda calculus, I don't think you can claim you9 KB (1,615 words) - 15:16, 6 February 2021
- approach. One can't help but wonder why don't we program in this (whose code, if available, we'd rather not change) and we want to8 KB (1,274 words) - 20:23, 18 July 2014
- New to Haskell? This menu will give you a first impression. Don't read all the explanations, or you'll be starved before the meal! ::The ''infinite'' list of fibonacci numbers. Just don't try to print all of it.6 KB (1,024 words) - 23:56, 25 June 2021
- In other words, we'd like to be able to write: ...rarchy has been refined to add extra functionality these existing programs don't use. This also applies to other hierachies in wide use at the moment, whe8 KB (1,232 words) - 01:58, 8 October 2014
- ...ny of the benchmarks with no clear rational for the different versions. It'd be better to have entries for "GHC" be clean, short, functional code and en -- Shortened by Don Stewart4 KB (577 words) - 17:21, 4 February 2023
- ...n particular, you can separate ''production'' and ''consumption'' of data: don't know how many prime numbers you're going to need? Just make `primes` a li ..., except if you know you're going to use their value at least once. If you don't, you have to wrap your value in a function that doesn't take any argument9 KB (1,503 words) - 13:55, 15 December 2019
- :[(1,'a'),(2,'b'),(3,'c'),(4,'d'),(5,'e')] [ ("Chris", 472), ("Don", 100), ("Simon", -5) ]17 KB (1,020 words) - 07:22, 9 June 2023
- ...ed. The resulting function won't use any heap while it is running, as you'd expect. -- Don't force: f isn't building on x, so just let g deal with it.7 KB (1,162 words) - 17:16, 8 June 2022
- (along with build's unfolding) else we'd get an infinite loop You can complete a rule system this way by hand, although it'd be quite a nice thing to automate it in GHC.19 KB (3,096 words) - 17:21, 4 February 2023
- ...t on the [[/Projects|projects page]] and set up a public repository if you don't already have one, so that other people can help hack on your project. ...l an up to date Haskell toolchain: at least ghc and cabal-install. If you don't already have these installed (or need to install from scratch on the lapt7 KB (1,102 words) - 22:17, 25 June 2014
- ...write them myself. I thought I'd check to see whether the key shortcuts I'd chosen were free but I was surprised to find that ''every one'' of these fu ...ci (you can change this by customising haskell-program-name) on your file. Don't worry if it's not an isolated module, GHCi will load all the modules it i8 KB (1,358 words) - 17:26, 9 August 2019
- ...<a t> gmail <d o t> com''. I'd be pleased to hear from any ''HNN'' user so don't hesitate ! Thank you.5 KB (611 words) - 10:56, 12 December 2020
- .../hopengl/skript.html googled tutorial in HOpenGL programming], I thought I'd write down the steps I actually can get to work in a tutorial-like fashion. We don't call <hask>display</hask> directly. In fact, we don't call any graphics drawing functions directly.10 KB (1,585 words) - 09:22, 20 September 2013
- | (d) | '''(''types don't match'')'''6 KB (988 words) - 04:35, 16 March 2021
- M1 D Data_UserTree ( ...atypes used only for providing meta-information in the representation; you don't have to worry much about them for now. Also, GHC generates these represen16 KB (2,615 words) - 20:24, 19 October 2020
- ...still be usefully provided - so long as they're done on-demand, apps that don't need them won't be restricted by tighter well-formedness constraints. -- clearly I have done some handwaving, as FuncDecs'd need tying to their source for this5 KB (735 words) - 15:20, 6 February 2021
- ...s about ThingsToAvoid, as consensus seems to be difficult to reach, and it'd be nice if newbies wouldn't bump into all kinds of Holy Wars during their f ...agree with this. Sometimes explicit recursion is simpler to design, but I don't see how it makes space usage any easier to reason about and can see how i24 KB (4,110 words) - 01:13, 7 November 2020
- | Don Stewart | Université d'Orléans (Darcs)5 KB (504 words) - 18:17, 11 March 2024
- ...if we could have the compiler tell us the types of everything in scope? It'd be much easier to see how we can 'fit' them together like puzzle pieces. OK, so I need some value of type <tt>f (Free f b)</tt> to put there. I don't know how to get that. But let's look at what's in scope:9 KB (1,711 words) - 20:19, 31 August 2014
- ...n an analogy is made with Haskell's type classes and OO interfaces (as you'd see in Java or C#). For example: ...am and need to remain faithful to the original design, if only because you don't understand it well enough to convert it to a functional design.10 KB (1,718 words) - 07:14, 10 August 2022