Search results
Jump to navigation
Jump to search
- -- Normally, you'd only override those defaults you care about. -- Set numlockMask = 0 if you don't have a numlock key, or want to treat9 KB (1,218 words) - 15:17, 6 February 2021
- ...lied deterministically and are a matter of taste. We all know this, please don't add "this is disputable" to each item! ===Don't reinvent the wheel===29 KB (4,702 words) - 12:36, 4 May 2021
- I'd like to start a discussion on the development of an IDE for Haskell which f ...another wiki page (HaskellIde) on Haskell IDEs in general, however here I'd like to focus the discussion on more specific proposals for the development24 KB (4,039 words) - 04:38, 24 April 2021
- :Andre Pang, Don Stewart, Sean Seefried, and Manuel M. T. Chakravarty. In Proceedings of the :Don Stewart and Manuel M. T. Chakravarty. In Proceedings of the ACM SIGPLAN Wor9 KB (1,252 words) - 05:28, 1 September 2022
- ...h/papers/io-tutorial/io-tutorial.html Monadic I/O in Haskell 1.3] - Andrew D. Gordon and Kevin Hammond (PDF: [https://web.archive.org/web/20210429180440 ...o-monad-for-people-who-simply-dont.html The IO Monad for People who Simply Don't Care] - Dan Piponi8 KB (1,101 words) - 10:59, 2 May 2024
- draw (SHAPE d t) = d translate (SHAPE d t) = t13 KB (2,093 words) - 10:57, 25 October 2023
- ...<code>GetChar</code> will not occur as constructors for I/O trees if they don't correspond to system calls). ::Wouter Swierstra. Ph.D. thesis, University of Nottingham. (2009).11 KB (1,628 words) - 10:36, 5 April 2024
- ...egory of structures to some other category. For our free monoids above, it'd be: data T = C1 A B C | C2 D E T13 KB (2,245 words) - 15:18, 6 February 2021
- Don't bother keeping any records around, just pass around a big list of , Option "d" ["date-format"]10 KB (1,542 words) - 05:40, 8 June 2023
- Glome doesn't really need to be installed in order to run it. If you'd prefer, you can invoke it directly from the build directory as "./dist/buil ...g up [http://www.blender.org/ Blender] or some other modeler and editing 3-d geometry in a graphical, interactive way and then exporting the scene to Gl40 KB (6,787 words) - 01:19, 8 April 2014
- I'd gone to implement general purpose libraries and tried to maintain ...types/functions. Perhaps objects are not as great as you thought before. :D30 KB (4,685 words) - 01:34, 14 July 2021
- # Please add yourself! (decimal or d/m/s notation are ok) # [Don't forget to remove all the html stuff from the file first :) -- StefanLjung11 KB (1,031 words) - 06:16, 8 June 2023
- .../package/dump dump]: Shows values for expressions like <hask>let a = 1 in [d| a, map (+a) [1..3] |]</hask> by turning them into <hask>"(a) = 1 (map (+ Haskell abstract syntax. The catch is that we don't want to handle all values12 KB (1,695 words) - 15:27, 12 November 2019
- * I'd like to get to know the GHC codebase / become involved in compiler/RTS deve ...haven't gotten my hands dirty on any larger projects yet. Nevertheless, I'd be glad to jump in anywhere a beginner isn't too much of a hassle!"8 KB (1,326 words) - 20:19, 28 September 2014
- * D - Move right ...s grouping of nodes. Since the Graph will provide the links to children we don't need to have anything more.6 KB (988 words) - 04:52, 26 April 2021
- ...s to register event callbacks and use <hask>waitEvents</hask>. This way we don't have to put the program to sleep every 1ms because it'll not be using any d <- readIORef dirty10 KB (1,537 words) - 21:44, 2 October 2014
- Here is a transcript that shows how you'd create a minimal git and cabalised -- Copyright (c) 2006 Don Stewart - http://www.cse.unsw.edu.au/~dons/22 KB (3,268 words) - 04:57, 30 January 2022
- ...es", a basic idea of statistics. For another example, since the monad laws don't usually hold on-the-nose anyway (see discussion at [[Hask]]), sometimes i ...(is it ok to call <hask>ListT</hask> `retract'?). However, these functions don't define an isomorphism (check for example <hask>NondetT (\_ n -> liftM2 co13 KB (2,036 words) - 13:54, 4 July 2023
- ...ol if it was expressive enough to be useful, but that this would be hard. (Don't expect this anytime soon.) Any other features that may be nice, and TH projects you'd want to see.30 KB (4,551 words) - 00:29, 15 June 2023
- loop d s = if d == 0 then s else loop (d-1) (s + 1/fromIntegral d)25 KB (3,873 words) - 11:08, 6 March 2023
- However, user now don't get a ''BoundedBelowJoinable'' for free when they have defined instances data D a9 KB (1,395 words) - 23:16, 24 July 2021
- ...install the RedHat-supplied gmp-devel package, and the gmp package if you don't already have it. There have been reports that installing the RedHat packa ...f you encounter this problem, we would appreciate feedback on it, since we don't fully understand what's going on here.36 KB (5,898 words) - 06:04, 10 August 2022
- but they just return new arrays and don't modify the original one. This http://haskell.org/tutorial/arrays.html and I'd recommend that you read27 KB (4,333 words) - 06:09, 23 July 2020
- ...s, but it's rather complex to do so (I'll not include code that does, as I don't feel like figuring out all the details). However, it turns out it's easy ...re are already plenty of fine parsing libraries available, and ideally, we don't want to have to re-write a new library from scratch just to have this res25 KB (4,039 words) - 16:39, 12 March 2024
- ...sure that xfwm4 (Xfce's default WM) is no longer started. Preferably, it'd be nice if we could have XMonad started this way as well (or even set in a * Mouse: if you don't have or want to use a mouse, there's a limited type of mouse emulation av11 KB (1,742 words) - 10:28, 28 October 2013
- let d = combine (b) (combine c c) syntactic blocks. However, if you don't want to indent your code, you73 KB (10,050 words) - 00:05, 19 April 2021
- == Preface: DON'T PANIC! == lose the reader along the way. So DON'T PANIC, take your towel with you and69 KB (11,026 words) - 12:26, 9 January 2023
- ...before running it. (Though if we were really concerned with efficiency, we'd probably also need a couple more primitives.)8 KB (1,374 words) - 14:33, 15 December 2022
- :SL Peyton Jones and D Lester, Software Practice and Experience 21(5), May 1991, pp479-506. :Duncan Coutts, Don Stewart and Roman Leshchinskiy, PADL 2007.19 KB (2,599 words) - 00:14, 15 June 2023
- ...divisibility by 2 or 3 because the <hask>candidates</hask> by construction don't have these numbers as factors. We also need to exclude 1 from the candida . map (\(w,p)-> scanl (\c d-> c + p*d) (p*p) w)18 KB (2,583 words) - 20:08, 19 December 2020
- ...th sleeping bags and so forth might be simpler and certainly cheaper. Also don't forget that Imperial is about 10 mins walk from South Kensington tube sta ...ush off to meet friends, family etc then that's obviously fine, but if you'd like to stay around for a geeky evening meal then that might be fun.11 KB (1,801 words) - 09:22, 23 May 2022
- ''Authors: [http://donsbot.wordpress.com Don Stewart] (original version), [http://ics.p.lodz.pl/~stolarek Jan Stolarek] ...s (represented with data type U) or strict bytestrings (B). Delayed array (D) is a function from index to a value. Every time an element is requested fr37 KB (5,672 words) - 07:28, 10 August 2022
- If you don't like the highlighting of partially matching tokens you can turn it off: ...Many of the simplest symbols are entered with the same two characters they'd substitute for:9 KB (1,396 words) - 23:18, 24 July 2021
- somehow want to use it during the traversal. To solve this, we don't actually <tt>length</tt> don't depend on the average, so we are free to use these values to22 KB (3,703 words) - 21:20, 30 May 2021
- If you find this code algorithmically surprising, I'd suggest to have a look at [http://www.cs.ox.ac.uk/ralf.hinze/publications/i class D a where { data T a x :: * } -- Bad: x is not a class variable42 KB (6,828 words) - 17:15, 4 February 2023
- ...s in your system at the same time by optimizing for one cache for which we don't know the parameters. While Okasaki's "Purely Functional Data Structures" ...I gave a talk about Haxl when we had just started. Some 10 months later I'd like to talk about the progress we've made in pushing Haxl towards producti9 KB (1,284 words) - 18:50, 11 June 2019
- printString dpy d gc fontst str = drawImageString dpy d gc offset valign str61 KB (8,858 words) - 11:47, 5 November 2020
- -- in a composeAll hook, you'd use: fmap ("VLC" `isInfixOf`) title --> doFloat ...imply add <hask> <+> doFloat</hask> to your manage hooks. ''Warning:'' you don't want to combine this with hooks such as <hask>doF W.swapDown</hask> which37 KB (5,217 words) - 02:13, 12 April 2019
- -- Set numlockMask = 0 if you don't have a numlock key, or want to treat -- monitor 2, you'd use a list of geometries like so:11 KB (1,532 words) - 15:18, 6 February 2021
- ...Haskell are available. Each one provides its own extensions, some of which don't exist in GHC. ...he abstract type <hask>IO a</hask>. If you're only thinking about I/O, you don't need to worry about how this API generalizes.36 KB (5,814 words) - 22:06, 10 May 2024
- ...g" rules. The resulting type signature is always less polymorphic than you'd expect, so often this results in the compiler throwing type errors at you i ...ction bindings in that case anyway. If you intend to keep the MR, then you don't need to change anything. The issue with the MR is just the fact that it's16 KB (2,628 words) - 21:19, 16 December 2022
- ...an set the children to the final values ''straight away'', even though you don't know them yet! ...ary to build the descendants. Because Haskell is a non-strict language, we don't need to do anything special to make the promise. Every computation is Has24 KB (3,850 words) - 17:16, 28 June 2021
- : I like this t-shirt a lot, but I'd change 2 things: change "simple" to "lazy" (I think "pure -> lazy -> fun" i : Middle one looks a bit too much like the ghostbusters logo :D [[User:Porges|Porges]] 21:25, 15 December 2008 (UTC)34 KB (5,126 words) - 19:19, 15 August 2019
- ...kh/papers/io-tutorial/io-tutorial.html Monadic IO in Haskell 1.3] - Andrew D. Gordon and Kevin Hammond (also: [https://www.microsoft.com/en-us/research/ ...to make little computational pipelines, with rules of your choosing. They don’t manipulate values themselves — that’s the job of the blocks (functi35 KB (4,953 words) - 00:05, 9 May 2024
- * What is omitted that you'd like to see? ...rewritten to F Int ~ Bool and a ~ Bool? Or does this not matter? There don't seem to be rules to accomplish this.9 KB (1,527 words) - 09:11, 10 August 2022
- Oh like that's going to work. You'd be better off selling T-shirts that algorithm) "DON'T YOU UNDERSTAND?".55 KB (8,884 words) - 01:18, 10 November 2022
- ...age.haskell.org/cgi-bin/hackage-scripts/package/Monadius-0.91 Monadius]: 2-D arcade scroller.</p></li> <li><p><em>hmp3 1.5.1</em>. Uploaded by Don Stewart.76 KB (9,269 words) - 19:17, 15 August 2019
- By AlsonKemp. This solver is probably similar to Cale's but I don't grok the non-deterministic monad... We don't check that67 KB (9,593 words) - 05:40, 9 March 2021
- ...e, is the elegance of Haskell. To put it simply: stuff just works like you'd expect it to. ...t done yet! How is the list less and more computed? Well, remember that we don't care about sequencing in Haskell, so we've defined them below the functio33 KB (5,616 words) - 22:30, 3 May 2024
- Don't panic, this is expected behavior. XMonad is a minimal window manager, me xmonad. If you don't already have a .xsession, the minimal example71 KB (10,765 words) - 16:38, 22 August 2021