Search results

ModDur (Tempo r) d -> d / r Note d _, Rest d, ModDur _ d -> d

* (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))

-- Contributed by Don Stewart io s n t = printf "%s of depth %d\t check: %d\n" s n t

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.

| Don Stewart | You said you'd be there, right?

...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.

...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.)

Oh like that's going to work. You'd be better off selling T-shirts that algorithm) "DON'T YOU UNDERSTAND?".

...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.

==D== *[http://research.microsoft.com/~adg/ Andrew D. Gordon]

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 )

''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

-d --dst str destination path for generated bytecode files (default=.) --redefine Don't complain if redefining an imported identifier

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

...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))

...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.)

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

...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

(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' []]],"")

don't we? I'd like to introduce my friend Bob:

...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 tree

...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://..."'.

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 that

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].

...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-d

(Branch 'd' Empty Empty) ...t your predicate in an appropriate way. Note: This is a difficult problem. Don't give up too early!

'''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.

..., 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.

...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/HOpe

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.

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 you

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 to

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.

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, whe

...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 Stewart

...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 argument

:[(1,'a'),(2,'b'),(3,'c'),(4,'d'),(5,'e')] [ ("Chris", 472), ("Don", 100), ("Simon", -5) ]

...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.

(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.

...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 lapt

...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 i

...<a t> gmail <d o t> com''. I'd be pleased to hear from any ''HNN'' user so don't hesitate ! Thank you.

.../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.

| (d) | '''(''types don't match'')'''

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 represen

...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 this

...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 i

| Don Stewart | Université d'Orléans (Darcs)

...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:

...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.

-- Normally, you'd only override those defaults you care about. -- Set numlockMask = 0 if you don't have a numlock key, or want to treat

...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===

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 development

: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 Wor

...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 Piponi

draw (SHAPE d t) = d translate (SHAPE d t) = t

...<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).

...egory of structures to some other category. For our free monoids above, it'd be: data T = C1 A B C | C2 D E T

Don't bother keeping any records around, just pass around a big list of , Option "d" ["date-format"]

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 Gl

I'd gone to implement general purpose libraries and tried to maintain ...types/functions. Perhaps objects are not as great as you thought before. :D

# Please add yourself! (decimal or d/m/s notation are ok) # [Don't forget to remove all the html stuff from the file first :) -- StefanLjung

.../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 values

* 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!"

* D - Move right ...s grouping of nodes. Since the Graph will provide the links to children we don't need to have anything more.

...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 dirty

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/

...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 co

...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.

loop d s = if d == 0 then s else loop (d-1) (s + 1/fromIntegral d)

However, user now don't get a ''BoundedBelowJoinable'' for free when they have defined instances data D a

...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.

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 read

...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 res

...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 av

let d = combine (b) (combine c c) syntactic blocks. However, if you don't want to indent your code, you

== Preface: DON'T PANIC! == lose the reader along the way. So DON'T PANIC, take your towel with you and

...before running it. (Though if we were really concerned with efficiency, we'd probably also need a couple more primitives.)

: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.

...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)

...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.

''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 fr

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:

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 to

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 variable

...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 producti

printString dpy d gc fontst str = drawImageString dpy d gc offset valign str

-- 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> which

-- 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:

...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's

...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.

...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 Has

: 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)

...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 (functi

* 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.

Oh like that's going to work. You'd be better off selling T-shirts that algorithm) "DON'T YOU UNDERSTAND?".

...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.

By AlsonKemp. This solver is probably similar to Cale's but I don't grok the non-deterministic monad... We don't check that

...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 functio

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 example

...d this component. With the predefined picklers and pickler combinators, we don't have to look very much into these internals. Let's start with an example. , withValidate no -- don't validate source

...s/caml-intro.html Introduction to OCaml], and translated from the OCaml by Don Stewart. To convert 5 to a <hask>Double</hask> we'd write:

...[http://book.realworldhaskell.org Real World Haskell] by Bryan O'Sullivan, Don Stewart, and John Goerzen. It will guide you through the writing of the bi Important: don't put "unsafe" on callerback, since it calls back to haskell via the wrappe

gapsW k (d:w) s@(c:cs) | k < c = k : gapsW (k+d) w s -- set difference | otherwise = gapsW (k+d) w cs -- k==c

:Duncan Coutts, Don Stewart and Roman Leshchinskiy. PADL 2007. ...eralized iteration and coiteration for higher-order nested datatypes in A. D. Gordon, ed., Proc. of 6th Int. Conf. on Foundations of Software Science an

First, create an account on [https://github.com github] if you don't have one already. Then visit the [https://github.com/xmonad/xmonad xmona alias "hddck."='tmp=~/tmp/haddock; <nowiki>[[</nowiki> -d $tmp/html ]] || mkdir $tmp/html; base=`pwd`; haddock --html --source-module

...l] <!-- Lucky seems like it could be brought up to date, but not by me - I don't understand MonadZero and MonadPlus. --> ..., B. Hausman, M. Y. Ivory, R. E. Jones, J. Kamperman, P. Lee, X. Leroy, R. D. Lins, S. Loosemore, N. R&ouml;jemo, M. Serrano, J.-P. Talpin, J. Thackray,

...sk>curry3</hask> function of type <hask>((a, b, c) -> d) -> a -> b -> c -> d</hask> in abstract syntax.<ref>Note that meta function <hask>curryN</hask> ..... |]|</code>), patterns (<code>[p| .. |]</code>), declarations (<code>[d| .. |]</code>), and types (<code>[t| .. |]</code>). Writing <code>[| .. |]<

...ng that you have checked out the Gentle Introduction to Haskell, but still don't understand what's going on. If you don't have bzip2, you can get the latest version at [http://www.bzip.org/ www.b

I have not implemented either of these, but I think they'd be cool. | Of course, these solutions don't deal with the question of atomic blocks that want to perform output

...ptimizing C compilers try to guess which routines have no side effects and don't depend on mutable global variables. If this guess is wrong, an optimizati ...ten above. This simplifies the gluing of several I/O actions together. You don't need to use <code>do</code> for just one action; for example,

$ decompose [(86400, "d"), (3600, "h"), (60, "m"), (1, "s")] (floor diff) Author: Don Stewart

Functional languages are entirely mathematical, so the places where they don't work we don't want side effects to happen at compile time. Another question is

<li><p><em>DList 0.1</em>. Don Stewart <li><p><em>PQC: QuickCheck in the Age of Concurrency</em>. Don Stewart

...ibe how to get things done. Admittedly, some very simple monads like Maybe don't have much work to flow in the first place. (A mathematician might say it' ...n instance of the <code>Monad</code> class in the standard prelude, so you don't need to do it yourself. The other monad we have seen so far, the list con

* What the heck is a monoid, and how is it different from a mon<u>a</u>d? ...; doubtless there are many examples of <code>Functor</code> instances that don’t exactly fit either of the above intuitions. The wise student will focus

on Haskell. What I'd really need, though, is some life science related don't begin with that.