Search results

• Haskell Platform
  ...rm is a single, standard [[Haskell]] development environment for everyone. It offers a set of blessed libraries and tools, to save you the task of pickin
  2 KB (260 words) - 13:28, 21 January 2020
• WxHaskell/Development
  ...utes to expose a nice functional interface to the wxcore library. However, it does ''not'' try to create a new model for programming GUI interfaces: ever ...ct that puts a C wrapper around the C++ interface to wxWidgets. This makes it much easier to access the wxWidgets library from Haskell. The C wrapper con
  6 KB (743 words) - 16:02, 26 April 2017
• Xmonad/Notable changes since 0.13
  .... Unfortunately, the release version did not remove the file after reading it, causing old state information to be added to new sessions.
  2 KB (243 words) - 05:27, 19 January 2018
• 99 questions/90 to 94
  ...n one of these, put your name in the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill i ...is this one: How can a knight jump on an NxN chessboard in such a way that it visits every square exactly once? A set of solutions is given on the [[The_
  6 KB (802 words) - 06:27, 11 June 2023
• GHC/AdvancedOverlap
  declarations are identical. Nevertheless, you can code it up using ...instance makes all others redundant.) There is a good reason for this, but it's not helpful here.
  10 KB (1,575 words) - 13:27, 14 January 2015
• Scientific computing
  ...ational science) is the approach of using computers to do science, whether it be in collecting and analysis data or programming computer models and simul
  1 KB (165 words) - 21:45, 29 June 2021
• GHC/CloudAndHPCHaskell
  ...ribe here what is taking place in HPC and cloud computing, and how I think it could impact the architecture of the Haskell packages we are discussing. ...any core chips which have a NOC (network on chip) are becoming important. It is likely that these hybrid architectures which are sometimes even re-confi
  6 KB (959 words) - 08:48, 10 August 2022
• Xmonad/Using xmonad in KDE
  You've heard about the wonders of Xmonad, and you want to try it out. * You're just used to it.
  10 KB (1,540 words) - 03:32, 27 January 2024
• Haddock/Development ideas
  * It would be good to have a recursive flag that would operate on all the .hs an
  1 KB (212 words) - 19:11, 14 March 2014
• Haskore
  Ideally you can compose a song once in Haskore, and then play it by several back-ends. ...y. The right thing to do would be to factor out the real-time stuff, since it is in general hard to port.
  8 KB (1,173 words) - 10:09, 14 July 2014
• Web/Frameworks
  ...h the unique mix of technologies and a fast development process, IHP makes it very pleasant to build applications. ...ode, no need to manually recompile your app. Thanks to code generators and it's great documentation you can build real web applications with very basic k
  12 KB (1,789 words) - 17:49, 26 October 2020
• Recursion in a monad
  Or make it [[tail recursion|tail recursive]]:
  986 bytes (142 words) - 15:18, 6 February 2021
• Existential type
  ...in Haskell, even though it uses a syntax <hask>forall a...</hask>, because it is typically used in the context of the isomorphism This is an error, since the type of the buffer isn't specified on the right (it's a type variable rather than a type) but also isn't specified on the left
  13 KB (2,093 words) - 10:57, 25 October 2023
• The Monad.Reader/Issue2/Bzlib2Binding
  is part of the standard library. It enables Haskell functions to call functions. This text is for those who like me have found it difficult
  15 KB (2,511 words) - 06:03, 1 June 2022
• Compose Unconference 2017
  ...ve a project that you want to work on at the unconference, please describe it here.
  1 KB (173 words) - 22:40, 18 April 2021
• HaskellImplementorsWorkshop/2014/Call for Contributions
  2014 this year in Gothenburg. It is a forum for people involved in the It is important to distinguish the Haskell Implementors' Workshop from
  4 KB (574 words) - 07:18, 26 June 2014
• Hac Boston
  ...sachusetts Institute of Technology], '''Building 46, 3rd Floor Atrium'''. It is open to all &mdash; you do not have to be a Haskell guru to attend. All ...ck off until 5:00pm on Friday, you are welcome to arrive Friday morning if it makes for easier travel.
  7 KB (1,102 words) - 22:17, 25 June 2014
• Simonpj/Talk:OutsideIn
  ...ind enough to read this paper, please help us by jotting down any thoughts it triggers off. Things to think about: * It is a long paper; where did you get lost?
  9 KB (1,527 words) - 09:11, 10 August 2022
• Monomorphism restriction
  ...the compiler throwing type errors at you in situations where you expected it to infer a perfectly sane type for a polymorphic expression. it can be found in
  16 KB (2,628 words) - 21:19, 16 December 2022
• MuniHac2016/Projects
  ...pes like points, sizes, polygons and most importantly matrices are there. It's also easy to bind missing datatypes. We use inline-c to inline C++ code i ...ipt and ruby. A servant-python library has been requested a few times, and it would be nice to add this to servant.
  11 KB (1,776 words) - 18:15, 3 September 2016
• Haskell Quiz/FizzBuzz
  ...ve just walked into a job interview and been hit with this question. Solve it as you would under such circumstances for this week's Ruby Quiz."
  1 KB (175 words) - 15:18, 6 February 2021
• Memoization
  It turns out that such a map can be constructed recursively based on the struc and it should use memoized calls to itself.
  12 KB (1,702 words) - 16:05, 28 April 2014
• GeBoP
  and unpack it; go to the directory with the game code
  1 KB (231 words) - 13:25, 16 March 2018
• Learn Haskell in 10 minutes
  ...compiler, but you don't have to declare them), lazy (nothing is done until it needs to be) language. Its closest popular relative is probably the ML fam ...of value. (If you <hask>print</hask> a string, it will have quotes around it.)
  13 KB (1,986 words) - 17:59, 9 August 2019
• TypeCompose
  ...ip</hask> and <hask>unzip</hask> from <hask>[]</hask> to other functors. It also provides variants of type <hask>f a -> f (a,b)</hask> and <hask>f a -> For giving titles to things. I know it sounds kind of random. More useful than I first thought. Used in [[Phooey
  3 KB (498 words) - 22:44, 29 June 2021
• Applications and libraries
  ...s://hackage.haskell.org/package/base-4.12.0.0/docs/Prelude.html Prelude]. It is implicitly imported by default, and includes the most commonly used func ...bootstrap libraries]. You should not rely on this list being stable, since it is just the list of packages that are needed to build GHC itself (including
  8 KB (1,114 words) - 01:40, 1 March 2020
• Maintaining laziness
  If you want to check whether a function is lazy enough, you may feed it with undefined values. The latter one has the advantage that it cannot be hidden by some hacks like "catching" the error in the IO monad.
  20 KB (3,325 words) - 12:02, 19 April 2024
• AI
  ...n.html Haskell is a good language for modular interpreters and compilers], it would also be nice to create and refactor in Haskell an implementation of a ...be included in the project, but you're not sure where it should go, place it here! I'll start with:
  8 KB (1,161 words) - 08:26, 1 December 2018
• Xmonad/Config archive/Template xmonad.hs (0.9)
  ...ly) upgrade xmonad, because even if the config works with the new version, it probably wipes out the changes with frozen old versions. -- need to set it to something other than the default mod2Mask, (e.g. OSX).
  12 KB (1,657 words) - 16:02, 4 June 2015
• Evaluation order and state tokens
  The answer is: it's undefined. If you want to understand why, keep reading. I think most people would agree: it will print 1, then 2, then 3. Now let's tweak this a little bit:
  21 KB (3,408 words) - 09:26, 9 September 2014
• Introduction to Haskell IO
  ...tion that returns its input (like identity). x <- return 5 for example It DOES NOT "return" control flow out of the current action or do block! ### how it gets invoked
  10 KB (1,520 words) - 07:20, 10 November 2020
• Applications and libraries/Games
  .../wiki/Paper_Soccer Paper Soccer], a pencil and paper game for two players. It contains a simple interface using HOpenGL library and provides many playing ...ll, by Mun Hon Cheong. It uses Yampa, Quake 3 BSP level format and OpenGL. It is licensed under the GPL.
  15 KB (2,258 words) - 16:22, 1 July 2023
• Unicode-symbols
  ...Unicode in your Haskell source then this extension can greatly improve how it looks. The problem with the NOT symbol is that you would like to use it as an unary prefix operator:
  9 KB (1,396 words) - 23:18, 24 July 2021
• Quasiquotation
  ...://www.cs.tufts.edu/comp/150FP/archive/geoff-mainland/quasiquoting.pdf Why It's Nice to be Quoted: Quasiquoting for Haskell]. ...://www.cs.tufts.edu/comp/150FP/archive/geoff-mainland/quasiquoting.pdf Why It's Nice to be Quoted: Quasiquoting for Haskell] :: PDF
  12 KB (1,695 words) - 15:27, 12 November 2019
• GHC.Generics
  ...reps/repo/CS-2008/2008-010.pdf Scrap your boilerplate (SYB)] you could use it at this stage, but now we'll see how to do this with the GHC Generic featur For starters, try to ignore the <tt>p</tt> parameter in all types; it's there just for future compatibility. The easiest way to understand how yo
  16 KB (2,615 words) - 20:24, 19 October 2020
• Applications and libraries/GUI libraries
  ...y to create client-server applications that communicate via the Internet. It runs on Unix but not on Windows. ...ich is a short presentation of the Fudget Library and the ideas underlying it.
  16 KB (2,346 words) - 05:33, 8 June 2023
• 99 questions/Solutions/87
  Call it:
  714 bytes (91 words) - 03:50, 10 January 2017
• Implement a chat server
  conn <- accept sock -- accept a connection and handle it ...This is enough if all we want to do is have a read stream of messages, but it won't be enough if we want to have our server handle chat.
  11 KB (1,739 words) - 04:19, 19 April 2024
• ALSA
  >=1.0.14 is required but it could not be found.
  2 KB (219 words) - 08:05, 18 March 2019
• Recursive function theory
  ...g Language (MIN)] is not exactly a recursive function theory language, but it is based on natural numbers, too and its equivalent power with partal recur ...recursive function theory in a ''toy'' programming language, to play with it so that some interesting concepts can be taught in a funny way.
  13 KB (2,068 words) - 23:19, 3 June 2019
• IO tutorials timeline
  Please update this list as it becomes outdated! If you find a tutorial, article, post, comment, or messag *:It describes Haskell I/O (with lots and lots of examples) with an emphasis on
  8 KB (1,101 words) - 10:59, 2 May 2024
• Hoed
  ...ring. An arbitrary value can be used, but we use the function name to have it in the trace for constructing the computation tree. For example, the functi It is easy to make your own types <code>Observable</code> because Hoed also pr
  6 KB (896 words) - 09:12, 22 December 2015
• Literate programming
  ...u might consider using [http://www.eecs.harvard.edu/~nr/noweb/ noweb] with it. It is also possible to use the LaTeX package minted, which uses pygments for r
  10 KB (1,524 words) - 22:20, 13 November 2022
• Multiplate
  That's it. Now we are ready to use out generic library to process our mutually recurs ...o is use the default <code>purePlate</code> which does nothing, and modify it to handle the cases we care about.
  7 KB (1,049 words) - 07:41, 3 March 2022
• 99 questions/Solutions/88
  You can call it:
  1 KB (123 words) - 03:51, 10 January 2017
• Haskell Brooks Curry
  to functional languages. If you have anything to offer please add it to this web page. A very short biography can be
  1 KB (209 words) - 02:41, 9 November 2023
• Functional dependencies vs. type families
  I also cannot get rid of it using a subclass, like but it can contain type functions.
  6 KB (936 words) - 20:35, 27 January 2014
• WxHaskell/Development/Debugging
  Procedure entry point not found in DLL; it is unknown why this sometimes happens, but might be resolved by cleaning up
  1 KB (221 words) - 23:10, 28 January 2016
• HaskellImplementorsWorkshop/2013/Eisenberg
  The flaw with GeneralizedNewtypeDeriving and how it can cause Haskell programs
  1 KB (187 words) - 06:34, 16 September 2013
• Control-event
  ...al API as control-timeout (relative expiration times) is available, though it is also much less efficient then either control-timeout or control-event wi
  1 KB (192 words) - 10:06, 20 April 2021
• Pattern guard
  ...ension]], where instead the types of ''pat'' and ''exp'' match. This makes it easy, for instance, to pattern match against (possibly failing) table looku
  1 KB (217 words) - 23:22, 24 July 2021
• Correctness of short cut fusion
  ...</hask>/<hask>build</hask>-rule really is a semantic equivalence, that is, it holds that ...foldr</hask>-rule is a semantic approximation from left to right, that is, it holds that
  15 KB (2,468 words) - 01:17, 8 April 2016
• CouchDB
  ...ts of Arjun Guha and Brendan Hickey to construct this interface. I think it is an improvement over the original and most convenient to use! ...kend of a "note" application (e.g. Tomboy or any other of the yellow paste-it notes look-alike). The first function is to store a note, as an example on
  12 KB (1,556 words) - 15:19, 6 February 2021
• MonadPlus
  It is proposed that the class be separated into <hask>MonadZero</hask>, <hask>
  2 KB (240 words) - 22:55, 5 April 2021
• IRC channel
  ...o https://libera.chat/ . This process is still underway, but at this point it is recommended to join the channel there, and ''not'' freenode. Since 2009, the Haskell channel has grown large enough that we've split it in two parts:
  11 KB (1,536 words) - 08:17, 29 March 2022
• Smart constructors
  unable to check that only bands of size 4 to 8 are built. It is quite it is no longer necessary to carry it around at runtime, meaning less data has
  9 KB (1,351 words) - 18:21, 6 June 2020
• Applications and libraries/Theorem provers
  ...ar to Cayenne and Agda is intended to be a (almost) full implementation of it in the future. :Equinox is a new theorem prover for pure first-order logic with equality. It finds ground proofs of the input theory, by solving successive ground insta
  6 KB (926 words) - 12:12, 16 January 2022
• Error vs. Exception
  ...terms are related and sometimes hard to distinguish, it is important to do it carefully. If you feed it a program that contains invalid syntax or inconsistent types, it emits a description of the problem.
  16 KB (2,728 words) - 16:45, 23 July 2019
• Type signature
  It is considered [[Type signatures as good style|good style]] to add a type si
  2 KB (317 words) - 10:49, 8 November 2016
• ListT done right
  ...'t usually hold on-the-nose anyway (see discussion at [[Hask]]), sometimes it doesn't matter that <hask>ListT m</hask> is not a monad on-the-nose, if we' Another point where the original <hask>ListT m</hask> is interesting is that it is a composite of two monads (<hask>m</hask> and the list monad). This lead
  13 KB (2,036 words) - 13:54, 4 July 2023
• WxHaskell/Linux
  This page records some user experiences building wxHaskell on Linux. It should be fleshed out now that wxHaskell 0.12 has been released.
  2 KB (239 words) - 18:51, 8 September 2018
• Xmonad/Config archive/yiannist's xmonad.hs
  It uses: -- It uses:
  6 KB (566 words) - 20:23, 21 June 2015
• Cookbook/Lists and strings
  Text handles character strings with better performance than Strings; it should be the prefered data type for UTF-8 encoded strings. .../Data-ByteString.html Data.ByteString], which is essentially a byte array. It can contain UTF-8 characters, but handle with care! .
  7 KB (1,020 words) - 21:02, 6 January 2019
• WxHaskell/Old wxHaskell news
  ...zedijkstra/wxHaskell) has moved to https://github.com/wxHaskell/wxHaskell. It is the intent to soon release a maintenance update working with wxWidgets 2
  2 KB (259 words) - 21:40, 1 December 2015
• Fold
  ...o the family of ''unfold'' functions which take a starting value and apply it to a function to generate a data structure. ...ill be, although the operational details will differ as to ''how'' exactly it will be calculated. To a rough approximation, you can think of the fold as
  12 KB (1,923 words) - 18:51, 28 March 2019
• OpenGL
  ...dpress.com LambdaCube 3D]: domain specific language and library that makes it possible to program GPUs in a purely functional style It's probably because the text is displayed too big. Setting a much smaller sc
  9 KB (1,237 words) - 02:14, 8 August 2022
• Haskell Lisp
  ...ww.ccs.neu.edu/home/stchang/pubs/ckg-popl2017.pdf Type Systems as Macros]. It is currently extremely work-in-progress. [https://github.com/lexi-lambda/ha ...or has stated that he continues to think about it and has future plans for it.
  5 KB (799 words) - 16:55, 23 March 2021
• Introduction to QuickCheck1
  -- that function to take it out of the IO monad? is mixed in with the pure computation, making it difficult to test
  8 KB (1,186 words) - 20:49, 28 May 2021
• Web/Libraries/Sessions and Authentication
  clientsession encrypts and hashes data so it can be stored in a cookie safely. This allows you to have very scalable use
  2 KB (226 words) - 05:08, 26 April 2021
• AngloHaskell/2008
  ...ould happen again, but this time at Imperial College, London. Who's up for it (add names further down)? This year it's being (un)organised by Matthew Sackman (matthew-_), Tristan Allwood (ToRA
  11 KB (1,801 words) - 09:22, 23 May 2022
• Applications and libraries/Compilers and interpreters
  ...escription of a Haskell compiler which is as understandable as possible so it can be used for education as well as research. ...al memory. According to the site referenced by the above-mentioned link, "It also contains an implementation of WAM for Haskell, so Prolog-style terms w
  12 KB (1,707 words) - 07:27, 10 March 2020
• 99 questions/Solutions/23
  ...e Alternative Solution works by removing things to create the target list, it's most efficient when the target list length is > (orig list / 2). Here's a
  4 KB (666 words) - 13:03, 10 May 2014
• TerraHS
  == What is it ? == Example of vector data that can be exported to a TerraLib database, and then it can be visualised with [http://www.dpi.inpe.br/terraview_eng/index.php Terr
  10 KB (1,345 words) - 22:49, 29 June 2021
• 99 questions/Solutions/11
  ...he result of problem 10 in such a way that if an element has no duplicates it is simply copied into the result list. Only elements with duplicates are tr
  1 KB (196 words) - 19:31, 18 January 2014
• Xmonad/xmonad development tutorial
  other people will enjoy using it, too. The only problem is, you've ...ng, either by copying and pasting the code shown here, or you can just use it as a guideline for making your own extension.
  16 KB (2,392 words) - 17:44, 2 August 2021
• Plainly partible
  * they are ''monousal'': if it is used, each value can only be used once; ...ly specified, if ''pseudodata'' is used then it remains constant - reusing it doesn't change its value. Lennart Augustsson, Mikael Rittri and Dan Synek t
  11 KB (1,656 words) - 22:33, 4 July 2022
• Performance/Modules
  ...nities that might not be available later and can greatly speed up the time it takes to compile a program.
  1 KB (183 words) - 07:47, 20 April 2021
• Type arithmetic
  representations of boolean values, lists, trees and so on. It is closely ...package, but unfortunately the arithmetic is really slow, because in fact it simulates Peano arithmetic with decimal numbers.
  8 KB (1,365 words) - 19:23, 15 August 2019
• Monad (sans metaphors)
  ...ther in that way: whatever it is the monad does, anything just thrown into it will take no part in that action, and whichever way you use that chaining o
  4 KB (668 words) - 08:53, 21 September 2021
• QuickCheck as a test set generator
  Turing-complete, but allows user to define it's own functions, printer using Quick Check. So, she asked me whether it is possible to
  10 KB (1,529 words) - 18:30, 16 January 2017
• Class system extension proposal
  It is worth pointing out several reasons why we desire to be able to just defi ...olved using the module where the function was defined not the module where it is inlined.
  8 KB (1,232 words) - 01:58, 8 October 2014
• Haskell in 5 steps
  And compile it with: factorial function. So back to the interpreter now and let's define it:
  5 KB (786 words) - 22:17, 16 December 2020
• GetOpt
  programs and thought it might be useful to catalogue them. A lot of ...-07''' ''The last major edit was around 2007: could somebody refresh this. It could also be good to rename this page to something about command line opti
  10 KB (1,542 words) - 05:40, 8 June 2023
• Game Development
  ...ears this page has not been updated often enough to remain informative, so it probably has only a historical value at this point. ...kell/comments/2f9w0p/is_it_practical_to_write_a_strong_chess_engine_in/ Is it practical to write a strong chess engine in Haskell?]
  9 KB (1,258 words) - 05:36, 8 June 2023
• Common Misunderstandings
  ...[[Haskell 2010]], and the first snippet is valid in compilers that support it (e.g. GHC 7.0.1 and later). ...f-then-else as flow control, as in most imperative languages, but think of it as construction of a value using a well formed expression.
  11 KB (1,668 words) - 15:16, 4 August 2019
• FRP explanation using reactive-banana
  ...r, event and time-varying that can be confusing for people unfamiliar with it. I'll avoid these terms at first and will focus on spreadsheets and a gener ...the budget deficit, raises the VAT rate? We'd adjust cell B1, just change it to 20. And like magic all the C cells are updated.
  25 KB (4,168 words) - 15:10, 24 October 2017
• Hackage wiki page per project discussion
  * naturally it takes some time until most recent cabal updates are used by mainstream.. Eg * it's easier to provide important information such as:
  18 KB (3,049 words) - 10:29, 7 February 2021
• HaTeX User's Guide
  you already learned it since you are reading these lines, go to the Haskell web [http://haskell.or Before we explain ''how'' HaTeX works, it is convenient to say ''what'' actually HaTeX is.
  21 KB (3,518 words) - 09:52, 14 May 2014
• 99 questions/Solutions/73
  ...age, which is used primarily for artificial intelligence problems. As such it is one of the main competitors of Prolog. In Lisp almost everything is a li
  2 KB (276 words) - 03:52, 10 January 2017
• Lightweight concurrency
  ...ed in as a part of the RTS. This precludes extensibility as well as making it difficult to maintain. Ideally, the concurrency libraries will be implement ...e when the MVar becomes full. Internally, when a thread blocks on an MVar, it switches
  19 KB (2,840 words) - 16:41, 1 August 2021
• GLFW
  This is a Haskell module for [http://www.glfw.org/ GLFW OpenGL framework]. It provides an alternative to GLUT for OpenGL based Haskell programs. ...l of Expression (SOE)] code to render Graphics in a cross-platform manner. It currently interfaces with GLFW version 2.7.2, works on Windows, Linux (i386
  10 KB (1,537 words) - 21:44, 2 October 2014
• Hac NYC
  This event will be held April 4-6, 2014. It is open to all -- you do not have to be a Haskell guru to attend. All you ...ce. Follow that about 100 yards until you are on Cadman Plaza E and follow it down the hill (past the pedestrian staircase the Brooklyn Bridge) three blo
  5 KB (917 words) - 14:35, 5 April 2014
• Yhc/Javascript/Programmers guide/Echo demo source
  -- Even >> should evaluate its LHS argument although it is "lost" -- The return function must evaluate its argument before wrapping it into
  12 KB (2,023 words) - 22:51, 5 April 2021
• Kernel Modules
  .... Additionally, a new calling convention (regparm3) has been added to make it easier to import (and export) functions from the Kernel. > ar d support/libtiny_c.a dlmalloc.o # dlmalloc assumes it manages all memory
  8 KB (1,231 words) - 18:14, 20 February 2017
• 99 questions/Solutions/99
  ...The problem is not easy. You will need some time to thoroughly understand it. So, don't give up too early! And remember that the objective is a clean so (3) For efficiency reasons it is important, at least for larger puzzles, to sort the words and the sites
  5 KB (741 words) - 03:47, 10 January 2017
• Heterogenous collections
  -- Note that it would be preferable to implement objectString as an instance of Show Object data stored in the list, and it will be cumbersome to add new types, as you'll
  5 KB (863 words) - 11:44, 22 August 2021
• Data.Foldable.foldr
  ...ach value of a <hask>Foldable</hask> structure from right to left, folding it to a single value. <hask>foldr</hask> is a method of the <hask>Foldable</ha ...</hask> is called with an empty structure for <hask>structure</hask>, then it will simply return <hask>initialValue</hask>.
  4 KB (594 words) - 22:51, 29 June 2021
• 99 questions/80 to 89
  ...n one of these, put your name in the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill i ..., the X-Y terms describe edges. If an X appears as an endpoint of an edge, it is automatically defined as a node. Our example could be written as:
  11 KB (1,679 words) - 06:20, 11 June 2023
• GPipe/Tutorial
  This page is formatted as a literate Haskell page, simply save it as &quot;<tt>box.lhs</tt>&quot; and then type ...nd for that we put an angle in an <hask>IORef</hask> so that we can update it between frames. We then create a window with [http://hackage.haskell.org/pa
  11 KB (1,451 words) - 08:50, 19 April 2014
• Meet Bob The Monadic Lover
  ...or hugs: so cut paste change and run (in emacs for instance) while reading it...''' Let's create a type for that: we'll call it "Lover", and a "Lover"
  28 KB (4,668 words) - 15:16, 6 February 2021
• FFI cook book
  although it might be better (for me) to explore more functional alternatives. ''i don't know if there are any side effects to this but it works fine for me so far'' -- eyan at eyan dot org
  16 KB (2,449 words) - 17:06, 17 April 2017
• HaskellImplementorsWorkshop/2015
  ...[#A Pretty-Printer that Says what it Means|A Pretty-Printer that Says what it Means]] ([https://wiki.haskell.org/wikiupload/4/4c/Hiw-2015-david-christian * Talk 1: It's the data, stupid (Ryan Newton) ([http://www.cs.indiana.edu/~rrnewton/talk
  15 KB (2,190 words) - 21:19, 17 February 2016
• Xmonad/Using xmonad in Gnome/0.5
  Putting it all together, a simple xmonad.hs configuraton file that works with Gnome mi ...e xmonad to be your default window manager. If gdm is your login manager, it looks in the ~/.gnomerc file for the WINDOW_MANGER variable. Let's set tha
  11 KB (1,587 words) - 07:49, 20 April 2021
• Haskell and mathematics
  Haskell is growing in popularity among mathematicians. As one blogger put it:
  2 KB (242 words) - 05:23, 12 July 2021
• UrlDisp
  This one will greet people only if the URL starts with <code>"/hello"</code>. It will give a 404 error page otherwise. ...ight operand. <code>h</code> is a special predicate that matches anything, it is used to begin a string of combinators.
  4 KB (592 words) - 21:17, 29 June 2021
• Mailing lists
  ....org haskell@haskell.org] is intended to be a low-bandwidth list, to which it is safe to subscribe without risking being buried in email. If a thread be ...s; extended discussions.<br> In Simon Peyton Jones' words: "forum in which it's acceptable to ask anything, no matter how naive, and get polite replies."
  11 KB (1,569 words) - 15:28, 7 July 2022
• HaskellImplementorsWorkshop/2013/Berthold
  ...d here is highly flexible and has interesting (and unrivalled) properties: it is orthogonal to evaluation and independent of type class mechanisms. Haske
  1 KB (204 words) - 06:38, 16 September 2013
• Introduction to QuickCheck2
  -- that function to take it out of the IO monad? is mixed in with the pure computation, making it difficult to test
  8 KB (1,214 words) - 00:46, 23 October 2017
• 99 questions/Solutions/24
  (Note that this doesn't really solve the problem, since it doesn't generate ''distinct'' numbers).
  2 KB (244 words) - 00:09, 7 April 2019
• 99 questions/Solutions/70
  It's more direct to convert Tree back to string We use two helpers to implement it:
  7 KB (1,025 words) - 02:14, 23 July 2021
• Backpack
  ...owing how Backpack maintains interoperability with Haskell while extending it with separate typechecking. Lastly, although Backpack is geared toward inte
  2 KB (285 words) - 13:42, 16 March 2018
• IO Semantics
  * <code>GetChar</code> is a node that has many children; it has one child for every character, but <code>GetChar</code> holds no data i ...at that node is output to the terminal and then its subtree is executed. It is at this point that Haskell code is evaluated in order to determine what
  11 KB (1,628 words) - 10:36, 5 April 2024
• Combinator
  ''I say COM-bin-ay-tur, since it comes from "combine". -- [[User:AndrewBromage]]''
  2 KB (256 words) - 22:11, 3 May 2024
• Ministg
  ...akes is easy to check that the interpreter follows the rules properly, and it also makes is easy to understand how new rules can be added, and what effec It is expected that Ministg will be useful to at least two main groups of peop
  15 KB (2,396 words) - 07:19, 10 August 2022
• Shootout/SumFile
  The current legal Haskell submission is #2; it takes about 16 seconds and is somewhere around the 24th rank It is the most efficient entry in any language, but it was rejected: "NOT ACCEPTED: should use built-in line-oriented I/O function
  20 KB (3,239 words) - 02:07, 26 April 2021
• Diagrams/Projects
  ...ed" compilation mode, but it's somewhat clunky and still a lot slower than it could be, probably due to overheads of compilation, linking, etc. ...op of GTK and diagrams-cairo, or for maximal platform independence perhaps it could use something like threepenny-gui and diagrams-sunroof.
  15 KB (2,206 words) - 09:10, 10 April 2016
• Weak head normal form
  An expression is in weak head normal form (WHNF), if it is either:
  2 KB (253 words) - 22:16, 5 April 2021
• WxHaskell/Windows
  ....2.0, the necessary DLLs, and an installation script to install wxHaskell. It is available in 32 bit and in 64 bit and can be used for GHC 7.10.3 and lat ...e.net/projects/wxhaskell/files/wxInstall/ installation packages] and unzip it to its destination directory.
  14 KB (2,131 words) - 23:13, 11 July 2021
• GHC/Using rules
  ...'''lots''' of output so you'll want to direct the output to a file or pipe it to <tt>less</tt>. Looking at the output of this can help you figure out why ...e possibly surprised when the rule for <hask>fusable</hask> does not fire. It may well be that <hask>fusable</hask> was inlined before rules were applied
  19 KB (3,096 words) - 17:21, 4 February 2023
• 99 questions/Solutions/89
  You can call it:
  1 KB (163 words) - 03:51, 10 January 2017
• Generalised algebraic datatype
  ...neralized algebraic data types] by François Pottier and Yann Régis-Gianas. It contains also a lot of links to other papers on GADTs. An evaluator/parser is then straightforward. Below it's written monadically for
  8 KB (1,374 words) - 14:33, 15 December 2022
• Haskell programming tips/Discussion
  ...ions 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 You may want to add your name to your comments to make it easier to refer to your words and ridicule you in public.
  24 KB (4,110 words) - 01:13, 7 November 2020
• Open research problems
  * A value is "changed" when it is not the case during an evaluation that when the old value and the new va
  1 KB (200 words) - 12:50, 31 May 2022
• 99 questions/Solutions/63
  -- Every level has twice the number of nodes as the one above it,... ...s the height of a complete binary tree, or returns <hask>Nothing</hask> if it is not complete.
  9 KB (727 words) - 03:41, 10 January 2017
• Applications and libraries/Compiler tools
  ...nerator system for Haskell, similar to the tool `yacc' for C. Like `yacc', it takes a file containing an annotated BNF specification of a grammar and pro :A parser generator for Haskell using monadic parser combinators. It was developed to be compatible with Happy.
  13 KB (1,947 words) - 14:44, 21 July 2023
• Links/O colectie de link-uri/iulie 2009
  ...F Picture library is independent of Heat but also works well together with it. .... History and Acknowledgements. I thank all the developers of Heat.
  3 KB (432 words) - 05:52, 10 August 2022
• HacBerlin2014
  It is folklore that Haskell is excellent for EDSLs, and that parsers are a prime example of how easy and compelling it is to embed a
  6 KB (915 words) - 10:16, 30 September 2014
• Xmonad/Config archive/John Goerzen's Configuration
  ...] on everything from a 1024x600 Eee PC to a 1920x1200 24" workstation, and it works well on all of them. This installs xmonad itself, everything you need to configure it, and dwm-tools, which provides the Mod-P launching feature. If you're not
  20 KB (3,066 words) - 13:01, 24 May 2020
• How to write a Haskell program
  '''Warning: This page is outdated. If you can help update it, please do!''' ...from, and uploading them to, Hackage. As a bonus, for almost all programs, it's faster than using Setup.hs scripts directly, since no time is wasted comp
  22 KB (3,268 words) - 04:57, 30 January 2022
• Haskell IO for Imperative Programmers
  ...e language is not suitable for writing practical programs. I’ve even heard it stated that one must master category theory in order to so much as write to ...at hard to do. Who here thinks Erik Meijer is a nincompoop? Show of hands? It’s not like he’s brilliant as long as he’s working on VB and then turn
  20 KB (3,555 words) - 06:05, 24 April 2024
• Xmonad/Using xmonad in MATE
  ...components. At present, Fedora ships both MATE and an xmonad session using it (<code>xmonad-mate</code> package); for other platforms, look for MATE in y ...of window managers that does not include xmonad. I have minimally modified it to support other window managers, including a first cut at user-installed o
  8 KB (1,040 words) - 08:05, 15 November 2023
• Fully-functional heterogeneous lists
  It is possible to store some elements in principle, but it is not possible to fully use them, even when using existential types. ...e long with the problem and, unfortunately, could not find any solution to it on the Internet.
  28 KB (3,716 words) - 13:01, 20 October 2017
• Library/CC-delcont
  ...continuations and related constructs, and how they can be used in Haskell. It uses the library CC-delcont as a vehicle for doing so, but the examples sho ...asier to implement (and understand) most common control flow directly than it is to implement continuations?
  25 KB (4,039 words) - 16:39, 12 March 2024
• BerkeleyDBXML
  ...orial on writing a multi-threaded Berkeley DB XML application in Haskell. It is intended for Haskell programmers who are new to Berkeley DB XML. version of Berkeley DB. In this case, it is better to use this and build Berkeley
  15 KB (2,390 words) - 15:19, 6 February 2021
• HacBerlin2014/Topics
  * most likely Haskell + FPGAs, but for it might be easier Language of the test scripts: ruby, python, perl, c++, ... (it depends)
  8 KB (1,326 words) - 20:19, 28 September 2014
• Strings
  ...ly the most common, especially for non-performance-sensitive applications. It is simply a type synonym for <hask>[Char]</hask>.
  2 KB (285 words) - 20:38, 2 March 2014
• Type signatures as good style
  The more special signature <hask>a -> a -> a</hask> is what you want and it cannot be infered automatically.
  2 KB (267 words) - 15:18, 6 February 2021
• ZuriHac2014/Projects
  ...ork] which Erik Hesselink gave a presentation about at last years ZuriHac. It provides a declarative way to define REST resources (rest-core) which can b ...s.com/ LambdaCube 3D] is a domain specific language and library that makes it possible to program GPUs in a purely functional style.
  10 KB (1,601 words) - 10:27, 27 October 2014
• Determining the type of an expression
  ...to catch a specific exception that is thrown, but you don't know which one it is. In the repl, you can catch SomeException and use <hask>Data.Typeable.ty
  2 KB (345 words) - 08:00, 2 May 2018
• Yhc/Javascript/Programmers guide/Up from the ground
  ..., and integration with third-party Haskell code (Roman conversion module). It also demonstrates how Javascript exceptions can be handled, and how to meas ...in</code> function which is called when the page is loaded into a browser. It is important to mention that in general, such a program may have more than
  21 KB (3,466 words) - 15:19, 6 February 2021
• Windows
  :(It is advisable to use paths without spaces, because some scripts in the MinGW dlltool.exe is included in the MinGHC distribution of GHC. In 7.10.1, it is installed at "C:\Program Files\MinGHC-7.10.1\ghc-7.10.1\mingw\bin"
  12 KB (1,886 words) - 19:30, 3 February 2021
• Diagrams/FAQ
  It seems this can be caused on OS X by a mixture of 32- and 64-bit libraries.
  958 bytes (158 words) - 03:41, 29 January 2014
• Euler problems/11 to 20
  -- save the length of the sequence and the number generating it in a tuple Thinking about it as a problem in combinatorics:
  8 KB (1,028 words) - 15:16, 16 September 2015
• Future of Haskell
  ...dit. If you put <pre>[[Category:Proposals]]</pre> at the top of your page, it will be automatically linked to by the [http://www.haskell.org/haskellwiki/ ...t of Haskell 98. It was initially developed by Mark Jones and then others. It is no longer under development. See also [[Hugs]].
  11 KB (1,692 words) - 16:37, 28 January 2023
• Zipper
  ...considerations: it is not the unicity of the hole that forced us to do so. It is simply more efficient if we want to define operations later for a tree w ...spondents of the <math>c_0</math>, <math>c_1</math> of the previous image. It is the empty list that represents <math>c_2</math>.
  10 KB (1,623 words) - 21:10, 26 June 2023
• Tutorials/Programming Haskell/String IO
  it to native code with GHC. As it is an interactive system, GHCi must execute your code
  19 KB (3,139 words) - 04:08, 22 October 2021
• Cookbook/Databases access
  Using HDBC and HDBC-sqlite3 packages, you can connect and query it like this:
  2 KB (254 words) - 09:57, 29 March 2022
• WxHaskell/Quick start
  ...ww.cs.chalmers.se/~koen Koen Claessen's] excellent example, but also since it makes an interesting comparison: we reuse many concepts of yahu, most notab ...notes]] for more information on using wxHaskell on MacOS X, and how to use it from an interpreter prompt.
  14 KB (2,248 words) - 15:18, 6 February 2021
• Yi/FAQ
  :Get it from Hackage. Configure, compile and install Yi as you would do for any oth :It means that you have no UI package available. You need VTY or GTK2hs install
  9 KB (1,413 words) - 00:17, 24 November 2014
• Stupid Curry Tricks
  ...a string. This version is hard-coded to read from the file "hi.txt", but it can easily be modified to interact with standard IO or read a file passed o
  2 KB (238 words) - 15:18, 6 February 2021
• Emacs/Keybindings and simple usage
  *<code>C-c C-t</code> gets :type for symbol at point, and remembers it
  2 KB (358 words) - 18:22, 11 April 2016
• BayHac2013/Denotative Programming
  ...ut which Tony Hoare said “Here is a language so far ahead of its time that it was not only an improvement on its predecessors but also on nearly all its
  2 KB (316 words) - 14:12, 14 October 2021
• Haskell for multicores
  ...- here's a naive "hello, world" of parallel programs: parallel, naive fib. It simply tells us whether or not the SMP runtime is working: We compile it with the `-threaded` flag:
  12 KB (1,738 words) - 06:06, 23 July 2020
• HaWiki migration
  * ''This migration refers to work started in 2006. It is retained for historical purposes only.'' Pages to be migrated to the new wiki. Once a page has been moved '''delete it from this list'''.
  21 KB (2,417 words) - 23:19, 9 August 2021
• Arrow
  Reasons, when it may be worth of solving a specific problem with arrows (instead of [[monad] ...he [http://www.scannedinavian.com/~shae/blog/2006-03-14.html reference] to it in [http://www.scannedinavian.com/~shae/blog/index.html Shae Erisson's blog
  11 KB (1,636 words) - 20:01, 13 May 2020
• Tutorials/Programming Haskell/Argument handling
  It's the 'id' function of the unix shell. BSD 'cat.c' is a [http://www.cse.uns can see it does more than just concatenate files. It can also:
  25 KB (3,657 words) - 18:20, 12 September 2015
• FrontpageDraft
  ...to answer the question:"What is the name of the romanian Haskell group or it's URL?" Recommanded for readers from Romania and Rep.Moldova. Limited stock
  5 KB (636 words) - 04:07, 14 August 2021
• Euler problems/41 to 50
  ...ain of primes ending at 546-th prime, summing up to a prime - using 546 as it is the longest prefix of primes summing up to less than a million. That's n * Here's my solution, it's not the fastest but is correct, feel free to criticise (isPrime and prime
  12 KB (1,626 words) - 05:45, 9 March 2021
• Prime numbers miscellaneous
  ...removing the <code>People a</code> structure altogether, and improves upon it by using a [[Prime_numbers#Euler.27s_Sieve | wheel]] optimization. ...ders] for an explanation of the <code>People a</code> structure that makes it work.
  18 KB (2,583 words) - 20:08, 19 December 2020
• GHC/As a library
  ...ception handlers and prints an error message and exits with exit code 1 if it encounters one of these exceptions. ...getModuleGraph]. This works for haskell-platform, ghc-7.0.3 to ghc-7.6.x. It also demonstrates how to enable some extensions.
  9 KB (1,261 words) - 15:40, 22 December 2017
• Free structure
  ...theory, with pointers to some of the formal material for those who desire it. The later sections make use of some notions from [[category theory]], so s ...ere on out, we'll assume that the structure in question is a monoid, since it's simplest), the equation <math>x * y = y * x</math> should not hold unless
  13 KB (2,245 words) - 15:18, 6 February 2021
• Applications and libraries/Operating system
  ...switching, and low-level memory manager, all parts are written in Haskell. It currently supports user-space cooperative (for-now) multitasking, IPC, ELF ...ts to the darcs repository, as I suppose you can tell. It uses Gtk2Hs, but it just goes down hill from there. Help welcome! --[[User:SamB|SamB]] 03:40, 6
  11 KB (1,663 words) - 19:17, 15 August 2019
• Hoogle
  ...a text search unless it contains a combination of text and symbols, or if it starts with (::). To search for both a type and a name, place a :: between ,f (ArgNone Web) ["w","web"] [PCmdLine] "Run as though it was a CGI script"
  18 KB (2,779 words) - 22:27, 12 June 2017
• H-99: Ninety-Nine Haskell Problems
  ...n one of these, put your name in the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill i
  2 KB (327 words) - 19:49, 4 January 2024
• Impredicative types
  ...s]]) allows universal quantifiers to appear inside function types as well. It turns out that appearing to the right of function arrows is not interesting
  2 KB (347 words) - 11:46, 4 February 2023
• Xmonad/Using xmonad in Gnome
  .../xmonad.desktop</code> file on your system. If your distro doesn't provide it, create the following file: ...r; it is not possible to integrate xmonad or any other window manager with it, absent a backport of gnome-fallback / gnome-flashback.
  28 KB (4,089 words) - 18:22, 5 February 2016
• GHC/SuperClass
  ...constraints don't apply until after the instance has been selected<br>(And it's a common newbie mistake to think they restrict the selection.) Is this power made clear in the theoretical literature? It's kinda implicit in the [http://www.cse.unsw.edu.au/~chak/papers/SPCS08.ht
  14 KB (2,091 words) - 17:28, 4 February 2023
• Tying the Knot
  This creates the cyclic list consisting of 0 and 1. It is important to stress that this procedure allocates only two numbers - 0 a It can twist your brain a bit the first few times you do it, but it works fine - remember, Haskell is a ''lazy'' language. This means that whil
  24 KB (3,850 words) - 17:16, 28 June 2021
• Referential transparency
  ...m <i>t</i> is purely referential in a term or sentence <i>ψ</i>(<i>t</i>), it is purely referential also in the containing term or sentence <i>φ</i>(<i> :“[A]n operator is referentially transparent if it preserves applicability of Leibniz’s law, or substitutivity of identity:
  5 KB (774 words) - 10:59, 15 August 2023
• 99 questions/Solutions/65
  It returns the subtree annotated with positions.
  2 KB (299 words) - 03:42, 10 January 2017
• Untypechecking
  It must be emphasized that no modifications to the Haskell compiler are however surprising it may seem, we get by without `eval' -- because
  20 KB (3,458 words) - 15:19, 6 February 2021
• GHC/As a library (up to 6.8)
  * Notes about how to get it working ...odule exports the "GHC API", which is still in a state of flux. Currently it's not even Haddock-documented. You can see the [http://darcs.haskell.org/g
  18 KB (2,724 words) - 11:05, 17 January 2014
• Euler problems/1 to 10
  ...I find this a LOT easier to read. Perhaps not as good mathematically, but it runs in an instant, even for n = 25000. <!-- I just made it a oneliner... -->
  6 KB (881 words) - 02:31, 8 May 2016
• HacFreiburg2017
  ...a significant impact on teachability. If these issues are important to do, it helps to view the language and the code with the view of an outsider. What ...uage, and tell you how we used to build massive scale storage systems with it.
  7 KB (1,040 words) - 11:33, 4 August 2017
• ZuriHac2013
  ...ay event consisting of talks themed "Functional Programming in Industry". It will be held at ETH and will start with a keynote from Simon Marlow! ...on, coding in Haskell and Javascript. I will explain what we do, how we do it, and what we've found to be the strengths and weaknesses of Haskell and Jav
  16 KB (2,339 words) - 12:15, 8 April 2014
• DDC/FurtherReading
  ...yping was originally intended for O'Caml, but was not fully implemented as it was thought to complicate the interface files too much. In Haskell and Disc
  2 KB (342 words) - 00:47, 24 February 2018
• Diagrams/Dev/Migrate0.7
  ...mport <code>Diagrams.Coordinates</code> explicitly in order to make use of it.
  2 KB (297 words) - 06:13, 3 August 2013
• Creating Debian packages from Cabal package
  (Pay attention to the leading space in <tt>long_description</tt>. It's necessary due to the format of Debian's <tt>control</tt> file.)</li>
  6 KB (802 words) - 04:59, 12 July 2021
• Abbot
  ...utlines the practices and procedures used to maintain abbot. Additionally, it may contain information about downtimes and upgrades.
  2 KB (246 words) - 08:59, 9 June 2023
• Programming guidelines
  It takes some programming experience to develop something like a ...ve our own ideas about good Haskell style. There's More Than One Way To Do It. But some ways are better than others.
  17 KB (2,651 words) - 09:36, 10 August 2022
• Library/Streams
  ...Ziganshin) developed a new I/O library in 2006 that IMHO is so sharp that it can eventually replace the current I/O facilities based on using Handles. T ...r [http://hackage.haskell.org/package/io-streams io-streams] is similar in it's focus on I/O and replacing file handles.
  21 KB (3,181 words) - 16:03, 14 March 2014
• Shootout/Fannkuch
  Here's a translation of the fast C version. It's unoptimised so far, but It's not pretty (or easy to reason about -- how do the C programmers do
  22 KB (3,539 words) - 00:49, 14 December 2016
• Budapest Hackathon 2017
  ...Budapest_Hackathon_2016 and second hackathon]), and this time we will hold it in Gizmodo Media Group's Budapest office. ...quirement really, so you can join us even if you didn't fill out the form, it just helps us with the organization.
  14 KB (2,132 words) - 13:36, 10 December 2017
• DDC/EvaluationOrder
  If a value is not suspended it is called ''direct''. Both ''direct'' and ''lazy'' objects have the same ty
  2 KB (378 words) - 00:47, 24 February 2018
• FFI imports packaging utility
  It is recommended that readers of this document be familiar with the documents To build a Haskell application linked to a foreign library, it is necessary to specify the locations of certain files ('''C''' headers and
  19 KB (2,929 words) - 23:51, 13 September 2013
• FFI Introduction
  ...en I omitted termops.o at the end of the `ghc --make` command. Seems like it searches for and finds the .o automatically? --lodi ]
  2 KB (331 words) - 12:45, 17 February 2015
• Boston Area Haskell Users' Group
  .../Boston-Haskell/ meetup group] for even more entertainment! In particular, it is the most reliable source for meeting announcements and is where meeting-
  2 KB (371 words) - 09:32, 12 September 2017
• OpenGLTutorial2
  ...permission. Parts of the tutorial have been modified and extended to keep it up to date.'' ...were just about capable to open up a window, and draw some basic things in it by giving coordinate lists to the command <hask>renderPrimitive</hask>. The
  20 KB (3,092 words) - 11:52, 20 September 2013
• Template haskell/Instance deriving example
  ...in appsE $ (varE $ mkName headFunc):funcName:vars -- put it all together The main reusable function. We pass it the list of functions to
  6 KB (836 words) - 19:46, 28 December 2013
• Applications and libraries/Program development
  ...ric programming in Haskell, based on the concept of a functional strategy. It consists of a combinator library (StrategyLib) and a precompiler (DrIFT-Str ...ust link with the TH library even if it contains no references to TH after it has been compiled. Zeroth is a preprocessor which allows modules to use TH
  19 KB (2,935 words) - 13:50, 22 August 2022
• Hackage trustees
  ...l files is the most useful for curating hackage and improving quality, but it is also the most controversial.
  3 KB (413 words) - 16:23, 18 February 2016
• Regular expressions
  ...ata), a new library that works with GHC, the most recent being ghc-6.10.1. It is POSIX compliant and tested against ...a tagged DFA like the TRE c-library to provide efficient Posix matching. It also defaults to true Posix submatch capture (including ambiguous *-operato
  18 KB (2,819 words) - 19:20, 15 August 2019
• Regular expressions for XML Schema
  It is implemented with the technique of derivations of regular expression. Mai So we could expect it to also work fine for Unicode.
  22 KB (3,425 words) - 22:34, 29 June 2021
• Haskell in practice
  applications have been written in it. The following free Haskell ...s a lot more flexible than the current implementations, in particular when it comes to implementing junk mail countermeasures. <!-- Uploaded. -->
  14 KB (2,263 words) - 06:31, 10 August 2022
• Why Haskell matters
  ...languages are based upon the notion of sequencing - they can never escape it completely. The only way to raise the level of abstraction in the sequencin ...k is removed. You only care what the program is to compute not how or when it is computed. This makes Haskell a more flexible and easy to use language. H
  33 KB (5,616 words) - 22:30, 3 May 2024
• 99 questions/Solutions/12
  Or, to make it a good transformer for list fusion,
  2 KB (362 words) - 17:33, 13 June 2020
• HDBC-ODBC under Windows
  You can test it from a [[GHC/GHCi| ghci]] prompt (obviously you'll need to change the conne
  2 KB (286 words) - 08:45, 23 May 2021
• Research papers
  ...ll such a great language. In general, if a feature is not well understood, it isn't going to become part of the language.
  2 KB (287 words) - 05:37, 1 September 2022
• 99 questions/Solutions/64
  It returns the subtree annotated with positions, plus the count of <tt>Branch<
  2 KB (337 words) - 03:41, 10 January 2017
• GHC/Data Parallel Haskell
  :''Searching for Parallel Haskell? DPH is a fantastic effort, but it's not the only way to do parallelism in Haskell. Try the [[Parallel|Paralle === Where to get it ===
  21 KB (3,158 words) - 08:39, 10 August 2022
• IDEs
  ...elopment process. Leksah uses GTK+ as GUI Toolkit with the gtk2hs binding. It is platform independent and should run on any platform where GTK+, gtk2hs a :This IDE supports many languages. For Haskell it currently supports project management, syntax highlighting, building (with
  19 KB (2,866 words) - 10:23, 29 March 2022
• HIDE
  ...c and many problems are yet to be resolved (see, say, the Proxima thesis). It has to be noted, however, that no conceptual problem was encountered with t ...in version 0.4.4.1 is at a stage where it can be used for productive work. It would be interesting to compare the actual realization with the requirement
  24 KB (4,039 words) - 04:38, 24 April 2021
• Haskell programming tips
  because it is hard for the reader to find out ...It may appear in the standard libraries later, or you may later find that it is already there in an even more general way.
  29 KB (4,702 words) - 12:36, 4 May 2021
• Unamb
  <hask>unamb</hask> was originally a part of [[Reactive]]. I moved it to its own package in order to encourage experimentation.
  2 KB (356 words) - 21:36, 4 February 2014
• Software transactional memory
  ...c/home Shellac] is a framework for building read-eval-print style shells. It uses STM, but in a pretty limited way.
  3 KB (386 words) - 11:56, 15 March 2024
• New monads/MonadRandom
  generator "function" it is not possible to work with random variables, it
  6 KB (894 words) - 13:41, 2 April 2019
• ZuriHac2016
  ...elopment using the Haskell web framework «Spock» ( https://www.spock.li ). It will give a short overview of the possibilities like type-safe routing, hyp permits, look more closely at how it all works.
  13 KB (1,982 words) - 10:32, 8 September 2016
• Roll your own IRC bot
  Put this code in the module <code>1.hs</code> and we can then run it. Use whichever system you like: Or we can just compile it to an executable with GHC:
  21 KB (3,285 words) - 19:34, 11 April 2024
• ItaloHaskell
  [[Category:It]]
  2 KB (248 words) - 14:14, 27 March 2022
• Regex Posix
  please either add it and your summary results or email the results to matched a non-empty string it should not be used to match an
  26 KB (3,619 words) - 03:30, 10 March 2017
• 99 questions/Solutions/8
  Another possibility using foldr (this one is not so efficient, because it pushes the whole input onto the "stack" before doing anything else):
  3 KB (454 words) - 15:07, 2 October 2020
• Applications and libraries/Hardware verification
  ...er is capable of translating system models to synthesizable VHDL. Moreover it is able to interface with third party EDA tools such as Altera's [http://ww
  2 KB (333 words) - 11:47, 4 November 2014
• 99 questions/Solutions/94
  ...graphs, then collects all non-isomorphic graphs using graph canonization. It is somewhat of a slow solution, taking >10 s to run <hask>regular 6 3</hask
  2 KB (388 words) - 03:47, 10 January 2017
• Top level mutable state
  Everyone agrees that it is unsatisfactory. Aside from its ugliness, it uses unsafePerformIO in an unsafe manner:
  29 KB (4,624 words) - 05:37, 1 January 2022
• ALUT
  * Set the search path in such a way that there is no sh.exe in it; you can use command <code>where sh</code> to find the directories that mus
  3 KB (433 words) - 10:44, 15 October 2015
• The Monad.Reader/Issue4/Why Attribute Grammars Matter
  The purpose of this article is twofold. On the one hand it illustrates how attribute grammars can remedy these problems. On the other hand it aims to
  22 KB (3,703 words) - 21:20, 30 May 2021
• Category theory
  ...category-theoretical description of the concept of ''monad'' (but calling it a ''triple'' instead of ''monad''). .... Sadly now out of print but very little prerequisite knowledge is needed. It covers monads and the Yoneda lemma.
  9 KB (1,379 words) - 04:11, 14 February 2023
• 99 questions/31 to 41
  ...number theory that has not been proved to be correct in the general case. It has been numerically confirmed up to very large numbers (much larger than w
  6 KB (805 words) - 02:30, 11 June 2023
• Performance/GHC
  ...slower than the same program compiled with another Haskell compiler, then it's definitely a bug. Furthermore, if an equivalent OCaml, SML or Clean progr * <tt>-optc-ffast-math</tt>: A C-compiler option which allows it to be less strict with respect to the standard when compiling IEEE 754 floa
  25 KB (3,873 words) - 11:08, 6 March 2023
• Euler problems/31 to 40
  | otherwise = g n rest -- without it The above may be ''a beautiful solution'', but I couldn't understand it without major mental gymnastics. I would like to offer the following, whic
  11 KB (1,557 words) - 09:03, 19 September 2014
• GHC/Error messages
  ...h the data constructors. We construct a list of `a` elements is by writing it as `a` cons’ed onto a list of `as`, (a:as).
  2 KB (295 words) - 10:24, 21 October 2022
• 99 questions/Solutions/19
  ...the arguments is reversed so that the integer comes before the list, then it is possible to define rotation by n as rotation by (n-1) followed by rotati
  3 KB (474 words) - 20:35, 23 May 2021
• List instance
  you just convert it from or to <hask>Char</hask> with <hask>fromChar</hask> or <hask>toChar</ha
  3 KB (526 words) - 16:09, 22 March 2017
• Rubiks Cube
  ...of a face means telling where it was before any moves were made and where it is in the current state.
  8 KB (1,020 words) - 01:02, 23 September 2018
• Xmonad/Notable changes since 0.8
  (0.8.1 was a maintenance release, with no changes to user functionality. It simply included ghc-6.10.1 related updates and a ghc optimization bug worka ''by removing the obsolete ewmhDesktopsLayout from layoutHook'', (it no longer exists),
  21 KB (3,078 words) - 08:18, 23 May 2021
• All About Monads/Solutions
  ...cannot guess which <code>MonadPlus</code> to use you will need to specify it when the function is called. So, <hask>parent someSheep :: Maybe Sheep</has
  4 KB (454 words) - 02:33, 7 January 2022
• The Fibonacci sequence
  ....wikipedia.org/wiki/Linear_map linear transformation], so we can represent it as matrix and compute the ''n''th power of this matrix with ''O(log n)'' mu (It assumes that the sequence starts with 1.)
  8 KB (1,150 words) - 15:41, 5 July 2022
• User groups
  ...ber 2011. We are always looking forward to see new people. If you can make it to Munich, consider joing us! ...is a "Coding Dojo" format where we pick some interesting problem and solve it as a group.
  15 KB (2,080 words) - 07:12, 30 September 2023
• Applications and libraries/Generic programming/Lightweight
  use (specially if we would not need to handle any of the boilerplate). It is a bit outdated because with GADTs, the use can be slightly simplified. H extensions. But it has its limitations.
  5 KB (859 words) - 10:10, 20 April 2021
• 99 questions/Solutions/91
  ...is this one: How can a knight jump on an NxN chessboard in such a way that it visits every square exactly once? A set of solutions is given on the [[The_
  3 KB (449 words) - 03:45, 10 January 2017
• New monads/MonadAdvSTM
  ...imulate the correct semantics. The ''Single Thread'' code is flawed since it will get caught in a busy wait if the <code>onRetry</code> commands do not This is pure programming convenience. It's always possible to make an existing Haskell STM transaction that *returns
  24 KB (3,463 words) - 05:20, 12 July 2021
• Hac φ
  ...ennsylvania] in [http://en.wikipedia.org/wiki/Philadelphia Philadelphia]. It is open to all -- you do not have to be a Haskell guru to attend. All you ...s is a much more casual affair, with sleeping at night. We decided to name it a Haskell Exchange, as a place to exchange code, cool ideas, contacts, and
  10 KB (1,656 words) - 21:25, 21 October 2016
• Parallelism
  Speed up your code by making it run on multicore:
  3 KB (360 words) - 12:02, 9 May 2024
• Foreign Function Interface
  ...the function "c_exp" just like any other Haskell function. When evaluated, it will call "exp". so that it can be used in foreign codes, you only have to write:
  33 KB (5,008 words) - 16:46, 20 December 2023
• 99 questions/Solutions/92
  ...to solve by hand. However, for larger trees, and 14 is already very large, it is extremely difficult to find a solution. And remember, we don't know for
  3 KB (420 words) - 22:52, 7 June 2017
• Conferences
  programming language conference. It is sponsored by the Association for It gathers together people who are harnessing functional techniques in the pur
  6 KB (787 words) - 04:34, 17 January 2022
• Category theory/Monads
  ...s one of the most under-appreciated of Haskell library functions; learning it is necessary both for true mastery of Haskell monads. See [[Monad/join]] fo
  3 KB (547 words) - 07:53, 16 April 2019
• Arrays
  makes it possible to use Arrays in pure functional code along with lists. Suffice it to say that these libraries support 9 types of array
  27 KB (4,333 words) - 06:09, 23 July 2020
• Monad
  ...y Haskell's <code>Monad</code> class. All the common monads are members of it: which can be written more clearly by breaking it into several lines and omitting parentheses:
  13 KB (1,870 words) - 11:14, 22 October 2022
• Performance/Strings
  it compares FPS against the existing <tt>PackedString</tt> and <tt>[Char]</tt>
  3 KB (397 words) - 22:15, 18 April 2021
• Applications and libraries/Linguistics
  ...ar. See also [http://www.loria.fr/~kow/ Eric Kow]'s recent publications on it. * '''Saxophone''' is a fun translator from German to the Saxon dialect. It is part of the [https://sourceforge.net/projects/parallelweb ParallelWeb] p
  15 KB (2,211 words) - 16:44, 1 August 2021
• CTRex
  ...xtensible records using closed type families, datakinds and type literals. It does '''not''' use overlapping instances. ...s also means we do not have to declare the type of the record before using it. For example (in CTRex):
  25 KB (4,073 words) - 08:53, 9 December 2013
• 99 questions/95 to 99
  ...The problem is not easy. You will need some time to thoroughly understand it. So, don't give up too early! And remember that the objective is a clean so (3) For efficiency reasons it is important, at least for larger puzzles, to sort the words and the sites
  8 KB (894 words) - 02:36, 25 November 2022
• 99 questions/Solutions/10
  Or writing it [[Pointfree]] (Note that the type signature is essential here to avoid hitt
  3 KB (470 words) - 03:45, 19 May 2021
• Catamorphisms
  ...) is denoted (| f |)F. When the functor F can be determined unambiguously, it is usually written (|φ|) or <b>cata φ</b>. Due to this choice of notation The principal advantage of using Mendler-style is it is independent of the definition of the Functor definition for f.
  9 KB (1,367 words) - 09:34, 17 November 2022
• LambdaCubeEngine
  It was a long journey from a Haskell OGRE clone to a graphics EDSL and finally
  3 KB (402 words) - 14:13, 4 February 2016
• OOP vs type classes
  (this is just a sketch now. feel free to edit/comment it. I will include information you provided into the final version of this tut as much flexibility as possible, it was natural to start building large
  30 KB (4,685 words) - 01:34, 14 July 2021
• Parallel GHC Project
  ...lti-core systems. In addition to traditional threads and shared variables, it supports pure parallelism, software transactional memory (STM), and data pa ...eady for serious experiments. Compared to the prototype it is much faster; it can run on [http://hackage.haskell.org/package/network-transport multiple k
  15 KB (2,160 words) - 21:14, 10 May 2024
• Nonogram
  This is a solution done for simplicity rather than performance. It's SLOOOOW. If I were to check intermediate solutions against the blocks tha It builds all combinations of blocks in a row (stolen from solution 2 :) and t
  17 KB (2,482 words) - 20:34, 8 June 2017
• HXT/Conversion of Haskell data from/to XML
  With so called pickler functions and arrows, it becomes rather easy A so-called pickler is a value with two such conversion functions, but it needs to keep track of the external representation during encoding and deco
  28 KB (3,540 words) - 18:19, 5 January 2015
• Introduction
  Haskell is a computer programming language. In particular, it is a as Haskell, can make it easier and cheaper. For example, a new user who
  26 KB (4,102 words) - 23:54, 29 February 2020
• 99 questions/Solutions/18
  ...solution as above, but the more paranoid (maybe too paranoid?) version of it (uses guards and Maybe):
  3 KB (560 words) - 22:51, 3 December 2020
• Xmonad/Notable changes since 0.11
  ...significant performance improvements when there are many windows (formerly it was calling <code>XQueryTree()</code> on every re-layout, and there is no w
  3 KB (495 words) - 23:20, 27 June 2016
• Example code
  Library code usually differs from application code: it is often highly
  6 KB (921 words) - 11:17, 22 October 2022
• Keywords
  ...1, rather than as an operator [[Section of an infix operator|section]], as it would be for any other operator: It is syntactic sugar for the <hask>negate</hask> function in Prelude. See [[u
  22 KB (3,350 words) - 04:31, 8 June 2023
• Haskell Quiz/Bytecode Compiler/Solution Pepe Iborra
  As far as I know it passes all the tests in the original suite, but due to the parsing trick so
  3 KB (386 words) - 21:41, 23 April 2021
• OpenAL
  * unzip it
  4 KB (576 words) - 15:47, 13 October 2015
• GHC/Using the FFI
  ...rom Haskell, and Haskell functions from the C++ DLL. This illustrates that it is possible to link Haskell built with GHC to code produced by a different ...g Real World Haskell] by Bryan O'Sullivan, Don Stewart, and John Goerzen. It will guide you through the writing of the bindings to the PCRE library. Ver
  29 KB (4,766 words) - 05:52, 1 June 2022
• Haskell logos/New logo ideas
  advanced features of Haskell. However, it is looking rather dated, and doesn't necessarily reflect the mature Haskell ...ah]'s double-lambda idea, created a new version of it in Inkscape and made it aqua-like for the shiny-glossy-2.0 web world.</p>
  34 KB (5,126 words) - 19:19, 15 August 2019
• GHC/GHCi
  ...atest version of GHCi, beyond what the User's Guide covers. Please add to it! .../ghci.html#the-ghci-files documentation] has the best description of where it tries to find these files. In general, the snippets on this page can be ad
  21 KB (3,021 words) - 12:03, 15 May 2020
• Gtk2Hs/Installation
  ...You will need to add cabal-install's executable directory to your %PATH% (it will tell you which path to add in a warning after you install your first e ...he Gtk+ website]. Unpack the bundle to a path that does not have spaces in it, and add the /bin directory created by unpacking to your %PATH%. Important
  11 KB (1,699 words) - 01:39, 13 December 2017
• 99 questions/Solutions/46
  ...nstead because parsing an expression would be more verbose in haskell than it is in Lisp. Template Haskell could also be used :)
  4 KB (655 words) - 07:48, 27 April 2016
• Web/Comparison of Happstack, Snap and Yesod
  It's interesting to know who is using these frameworks. cabal: cannot configure conduit-0.0.1.1. It requires base &gt;=4.3 &amp;&amp;
  14 KB (1,908 words) - 02:23, 6 March 2017
• HUnit 1.0 User's Guide
  ...world side effects can be tested. How does an assertion assert anything if it produces no useful result? The answer is that an assertion can signal failu ...failure. The failure message is prefixed by "<code>HUnit:</code>" to mark it as an HUnit assertion failure message. The HUnit test framework interprets
  23 KB (3,542 words) - 03:11, 15 May 2020
• Algebraic data type
  Alternatively, it may be represented in what appears to be a totally different structure.
  3 KB (436 words) - 08:47, 22 May 2023
• Functional Reactive Programming
  ...rs/icfp97/ Functional Reactive Animation] by Conal Elliott and Paul Hudak. It introduces the following ''semantic functions'': ...t, then additional actions can be invoked to read its current content, set it to a specific value or to assign an event callback for when the content cha
  11 KB (1,615 words) - 05:58, 7 November 2022
• Type SK
  in a way that doesn't cause the typechecker to diverge on evaluation when it In order to do this, I define the single-step reduction relation so that it
  10 KB (1,653 words) - 00:25, 12 July 2021
• RuHaskell
  # Anton Kholomyov. What to do, if you can't write in Haskell but you want it much.
  3 KB (397 words) - 10:26, 1 May 2017
• SceneGraph
  component, it is not easy to extract a useful library. The project's aim is to provide su ...s built using [http://web.engr.oregonstate.edu/~erwig/fgl/haskell FGL]. So it remains to define a scene node to get things started:
  6 KB (988 words) - 04:52, 26 April 2021
• HaskellImplementorsWorkshop/2013
  ...fair, aimed at bringing together people behind the Haskell infrastructure. It provides a forum where people working on compilers, tools, or libraries for
  3 KB (337 words) - 14:28, 7 February 2014
• FAQ
  Learning Haskell is fun. It will expand your mind and make you a better programmer in other languages. Haskell is also a great tool for solving real-world problems, but it can take many months of study to get to that point.
  36 KB (5,814 words) - 22:06, 10 May 2024
• HaskellImplementorsWorkshop/2011
  ...fair, aimed at bringing together people behind the Haskell infrastructure. It provides a forum where people working on compilers, tools, or libraries for
  4 KB (513 words) - 02:57, 25 July 2021
• Humor
  *[[Humor/How quick can you write a ISI paper with Haskell or without it ?]]
  5 KB (667 words) - 22:52, 1 May 2024
• Template Haskell
  ...ist.psu.edu/viewdoc/download?doi=10.1.1.189.4479&rep=rep1&type=pdf here]. It is [https://downloads.haskell.org/ghc/8.10.3/docs/html/users_guide/glasgow_ ...rete syntax to an abstract syntax tree) some code, transform it and splice it back in (convert back again), or even to produce completely new code and sp
  30 KB (4,551 words) - 00:29, 15 June 2023
• Tangible Value
  ...ue part of a TV is the ''model'', and the "interface" part, or "output" as it is called below, is the ''viewer''. Outputs are built up compositionally f ...I functionality out of TV and into a small new package [[GuiTV]]. I moved it out to eliminate the dependency of core TV on [[Phooey]] and hence on [[wxH
  13 KB (1,988 words) - 02:05, 24 September 2021
• ZuriHac2015
  (*1) If you are hosting a project, please be there to both introduce it and give a summary afterwards. Also, please add your project to the [[/Proj In the process of optimizing this approach and wrapping it up in a form that can be easily consumed, we'll take a lot of detours throu
  13 KB (2,000 words) - 08:31, 31 May 2015
• HaskellImplementorsWorkshop/2014
  particular, it sees them as structural circuit descriptions. We take a although it is still in use in various places around the world. Over the last
  22 KB (3,305 words) - 01:20, 30 September 2014
• Category theory/Functor
  ...clude itself as an object, there can be no category of all categories, but it is common and useful to designate a category '''small''' when the collectio
  3 KB (543 words) - 01:17, 16 April 2019
• Links
  This page is obsolete. It's content has been replaced by: *<b>F:</b>Joseph Fasel, Los Alamos National Laboratory, [http://www.it.kth.se/~kff/ Karl-Filip Fax&eacute;n], The Royal Institute of Technology, S
  11 KB (1,759 words) - 09:41, 10 August 2022
• Abbreviations
  Note: if there is an abbreviation you cannot find here, it might be the name of a package, so check the [http://hackage.haskell.org/pa | For what it's worth
  15 KB (2,061 words) - 22:08, 12 November 2022
• HaskellImplementorsWorkshop/2016
  ...division between package manager and compiler. This is not a paper design: it is principally motivated by our (ongoing) efforts to implement Backpack in ...talk is not to explain all of the details of any of these examples, nor is it to advertise any release-ready software expected to be used in your next pr
  16 KB (2,520 words) - 06:08, 16 October 2016
• Glome tutorial
  You should be able to install GlomeTrace with "cabal install GlomeTrace". (It may be a good idea to run "cabal update" first, if you haven't done that re ...need to be installed in order to run it. If you'd prefer, you can invoke it directly from the build directory as "./dist/build/Glome/Glome". (To use m
  40 KB (6,787 words) - 01:19, 8 April 2014
• The Monad.Reader/Issue2/FunWithLinearImplicitParameters
  ...kell98, GHC's various extensions can interplay in unforeseen ways and make it possible to write side-effecting code. In this article, we take the next st ...ion uses. The code presented here is no longer available as an attachment. It has however been successfully tested with ghc-6.2.2 and ghc-6.4.
  35 KB (5,673 words) - 20:05, 7 July 2015
• 99 questions/Solutions/66
  It returns
  4 KB (637 words) - 03:42, 10 January 2017
• GHC/Type families
  ...a type. Type families permit a program to compute what data constructors it will operate on, rather than having them fixed statically (as with simple t ...inition declares its [[kind]] and its arity, or the number of type indices it takes. Instance definitions define the type family over some part of the d
  42 KB (6,828 words) - 17:15, 4 February 2023
• Haskell program coverage
  ...ts of the program <font style="background: yellow">never evaluated</font>; it also highlights boolean conditions for which recorded evaluations are <font Create a .tix file from it.
  20 KB (2,607 words) - 17:13, 16 June 2022
• GNU/Linux
  ...agement. Built on top of the [https://nixos.org/nix/ Nix] package manager, it is completely declarative, makes upgrading systems reliable, and has many o
  5 KB (691 words) - 08:44, 29 March 2022
• Applications and libraries/Mathematics
  ...fines classes and generic operations for vector spaces and affine spaces. It also defines a type of infinite towers of generalized derivatives (linear t ...l implementation of the PLE decomposition of matrices over division rings. It writes an arbitrary matrix as a product of a permutation matrix, a lower un
  21 KB (2,880 words) - 09:43, 4 May 2024
• Xmonad/General xmonad.hs config tips
  It describes general tips for configuring xmonad.hs, for example "How to make === Making window float by default, or send it to specific workspace ===
  37 KB (5,217 words) - 02:13, 12 April 2019
• Denotative programming timeline
  Please update this list as it becomes outdated! If you find a tutorial, article, post, comment, or messag
  4 KB (506 words) - 06:17, 20 April 2024
• Namespaced IO Layer
  Given a logical path, it is split into components (slash separated). The root component is replaced ...map. This is a one-level map with character keys and device table values. It is used to find proper device table for a file path starting with the '#' c
  11 KB (1,853 words) - 02:34, 26 April 2021
• Video presentations
  explosion of interest in Haskell, and it is now being used for a show you why programming in Haskell is such fun, and how it makes you
  11 KB (1,456 words) - 07:05, 7 August 2016
• A brief introduction to Haskell
  Compared to similar functional languages, Haskell differs in that it We can ask the system what type it automaticaly inferred for our
  41 KB (6,592 words) - 22:27, 3 May 2024
• GHC/FAQ
  ...ve started to add some sub-headings, but would welcome your help in making it better organised. ...e past, but currently isn't). This is the easiest type of porting job, but it still requires some careful bootstrapping.
  36 KB (5,898 words) - 06:04, 10 August 2022
• Applicative data-driven programming
  I would love to get comments on a short (4.5 page) paper ''draft''. It describes a very simple approach to data-driven computation and its applica
  3 KB (486 words) - 21:52, 29 June 2021
• HaskellImplementorsWorkshop/2012
  ...fair, aimed at bringing together people behind the Haskell infrastructure. It provides a forum where people working on compilers, tools, or libraries for
  6 KB (790 words) - 03:05, 25 July 2021
• Partibles for composing monads
  ...sorts of interaction, you tend to make a single monad support both sorts. It seems to me that instead we should be able to move smoothly from no monads
  4 KB (691 words) - 08:14, 12 June 2023
• Numeric Haskell: A Repa Tutorial
  and import it qualified: The library needs to be imported qualified as it shares the same function names as list operations in the Prelude.
  37 KB (5,672 words) - 07:28, 10 August 2022
• Cookbook/Other data structures
  Data.Arra.IArray> amap reverse it
  4 KB (640 words) - 21:05, 6 January 2019
• WxHaskell/0.13
  ...y, one can only start a wxWidgets program once with GHCi on GTK (rendering it useless).
  3 KB (499 words) - 07:16, 9 June 2023
• Haskell Quiz/Sokoban/Solution Jethr0
  ...kind of interface you could imagine. No readline, no clearscreen, you name it. But I was kinda reminded of the "good ole' days" when writing/playing this
  4 KB (516 words) - 15:19, 6 February 2021
• Prelude extensions
  It is often necessary to apply functions to either the first or the second par
  4 KB (684 words) - 02:22, 18 May 2020
• Learning Haskell with Chess
  *Implement <hask>genMoves::Board->Pos->[Board]</hask>, it takes a board b and a position p and results in the list of all boards that
  4 KB (546 words) - 02:12, 26 April 2021
• Xmonad/Screenshots
  ...exist! Please add your beautiful screenshots here, or have someone else do it for you from #xmonad. ...Layout-ShowWName.html ShowWName] flash workspace tag/name/Id when entering it
  13 KB (1,464 words) - 02:28, 20 October 2014
• Monad tutorials timeline
  Please update this list as it becomes outdated! If you find a tutorial, article, post, comment, or messag ...fa999892f2e) seems to be from 1996, according to the TeX error on page 14. It has a reference dated 1995. -->
  35 KB (4,953 words) - 00:05, 9 May 2024
• X window programming in Haskell
  While the application is fairly simple, it still requires us to know quite a few details about X and Xlib to write a p will try to write the simplest code I can (probably it will even look
  61 KB (8,858 words) - 11:47, 5 November 2020
• Testing primality
  When trying to factorize only one number or two, it might be faster to just use <code>(2:[3,5..])</code> as a source of possibl
  4 KB (605 words) - 17:09, 18 July 2022
• PkgEnv
  and when you're done with the environment, simply remove it:
  3 KB (355 words) - 15:19, 6 February 2021
• HXT
  ...references, CData parts and processing instructions. This data model makes it possible to use tree transformation functions as a uniform design of XML pr ...http://hackage.haskell.org/package/hxt hxt] forms the core of the toolbox. It contains a validating XML parser and a HTML parser, which tries to read any
  48 KB (6,937 words) - 00:20, 27 April 2016
• Random shuffle
  * allows you to not shuffle the entire list but only part of it (drawing elements without replacement)
  5 KB (743 words) - 13:10, 9 May 2017
• 99 questions/Solutions/93
  Apart from that, the Prolog solution is shorter because it uses built-in evaluation and printing of expressions.
  5 KB (621 words) - 15:30, 8 June 2017
• Euler problems/181 to 190
  low score. It turns out this approach converges rather quickly, ...pruning and guess ordering. The code is in pretty much the order I wrote it, so most prefixes of this code should also compile. This also means you sh
  15 KB (2,018 words) - 01:29, 26 April 2021
• Xmonad/Config archive/Thomas ten Cate's xmonad.hs
  -- It gives you 10 workspaces, available through Alt+F1..F10. You can move -- put it all together
  9 KB (1,195 words) - 15:17, 6 February 2021
• Tutorials
  ...grams themselves already. It makes a great follow up after finishing LYAH. It can easily be read cover-to-cover, or you can focus on the chapters that in ...unal effort by several authors to produce the definitive Haskell textbook. It's very much a work in progress at the moment, and contributions are welcome
  31 KB (4,662 words) - 08:38, 20 April 2024
• 99 questions/11 to 20
  ...he result of problem 10 in such a way that if an element has no duplicates it is simply copied into the result list. Only elements with duplicates are tr
  5 KB (839 words) - 04:58, 10 June 2023
• Pipes
  interleaving other stream effects while doing it.
  8 KB (931 words) - 17:22, 20 February 2017
• BayHac2018
  ...s not that kind of hackathon; there is no competitive coding element here. It is only a "hackathon" in the sense that a group of Haskellers will gather t
  5 KB (649 words) - 06:32, 29 April 2018
• Blog articles/Mathematics
  ...anslate normal form for an isometry of the plane in Haskell, and verifying it with QuickCheck.]
  9 KB (903 words) - 07:20, 16 April 2020
• 99 questions/70B to 73
  ...age, which is used primarily for artificial intelligence problems. As such it is one of the main competitors of Prolog. In Lisp almost everything is a li
  5 KB (876 words) - 05:50, 11 June 2023
• 99 questions/46 to 50
  ...od of "result caching" in order to make the predicate more efficient, when it is to be used repeatedly?
  5 KB (798 words) - 02:38, 11 June 2023
• Debugging
  ...r this approach is [http://hackage.haskell.org/package/hood Hood]. Even if it hasn't been distribution. Even more, Hugs has it already integrated, see the [http://cvs.haskell.org/Hugs/pages/users_guide/
  9 KB (1,453 words) - 19:18, 3 February 2021
• Pt/Haskell
  issues from basic up to an intermediate level; it also includes some
  5 KB (663 words) - 19:51, 4 April 2019
• Sandbox
  ''Feel free to edit as you wish on this page. It is here for you to experiment with WIKI edit syntax.''
  5 KB (503 words) - 07:14, 22 December 2021
• A practical Template Haskell Tutorial
  ...sgow Haskell Compiler's compile-time meta programming in Template Haskell. It motivates use cases for meta programming and explains the different Templat ...safe, compile-time meta programming in the Glasgow Haskell Compiler (GHC). It allows writing Haskell meta programs, which are evaluated at compile-time,
  45 KB (6,927 words) - 18:50, 16 November 2020
• IO inside
  ...a total mess. This is because Haskell I/O is really very different in how it actually works. ...evel definition (e.g. <code>main</code>) - this is called lazy evaluation. It's a great thing for pure mathematical computations, but how about I/O actio
  82 KB (13,140 words) - 09:07, 3 May 2024
• Prime numbers
  ...') is such that has no divisors other than itself (and 1). This means that it cannot be represented as a product of any two of such numbers. ...e can directly generate the multiples of a prime ''p'' by counting up from it in increments of ''p'', resulting in a variant of the ''sieve of Eratosthen
  58 KB (8,594 words) - 20:34, 6 May 2023
• Yampa
  ...mpaSynth}} - is a software synthesizer implemented in Haskell using Yampa. It contains a framework of sound generating and sound shaping modules (e.g. os
  7 KB (1,022 words) - 13:19, 13 October 2021
• Haskellへのヒッチハイカーガイド
  -- compute solution and print it Actually, Haskell code has to be aligned this way, or it will not
  73 KB (10,050 words) - 00:05, 19 April 2021
• Books and tutorials
  ...com/ The Monad.Reader] is an electronic magazine about all things Haskell. It is less formal than journal, but more enduring than a wiki-page or blog pos
  6 KB (838 words) - 12:31, 11 October 2019
• Hmatrix on Mac OS X
  ...vailable on [http://hackage.haskell.org/ HackageDB]. You can also download it from the darcs repository as follows:
  4 KB (674 words) - 05:29, 8 June 2023
• Xmonad/Config archive
  ...dule which sets up the configuration. Note that while this file is usable, it contains lots of uneeded extra settings; these can and in the past have cau ...es annotations showing which contrib modules are being used where, to make it easier to figure out how to use a given contrib module, or how to pull out
  29 KB (4,125 words) - 12:46, 15 January 2021
• QuotesPage
  > > choice, what would it be--Common Lisp? <Heffalump> Janni: it creates really fast Haskell code
  55 KB (8,884 words) - 01:18, 10 November 2022
• Hitchhikers guide to Haskell
  these days, it usually takes some (or quite a lot of) time to decide Oh. Wait. Let's do the usual "hello world" thing, before we forget about it,
  69 KB (11,026 words) - 12:26, 9 January 2023
• Hask
  ...e subset of Haskell where types do not have bottom values. This means that it only includes functions that terminate, and typically only finite values. T
  7 KB (1,086 words) - 10:33, 9 March 2023
• The I/O problem
  In a preliminary sense, mathematics is abstract because it is studied using highly general and formal resources. It should then be of little surprise that attempts to find a satisfactory (as
  61 KB (9,234 words) - 04:14, 5 April 2024
• ItaloHaskell/Summer 2008
  11 Agosto alla spiaggia di [http://it.wikipedia.org/wiki/Monterosso_al_Mare Monterosso], 5 Terre (Liguria). Sulla spiaggia di Monterosso c'e' un grande scoglio (vedi [http://it.wikipedia.org/wiki/Immagine:Monterosso.jpg immagine]). L'appuntamento e'dov
  4 KB (544 words) - 00:59, 12 July 2021
• AI/Genetic programming/GPLib
  should be evaluated to see if it meets our needs at least.
  5 KB (664 words) - 05:48, 12 July 2021
• Arch Linux/Applications
  ...Takes haskell source on stdin, parses it, then\nprettyprints it to stdout. ...Subscribe to an RSS feed and write it to an IRC channel
  27 KB (2,482 words) - 19:02, 6 May 2020
• Haskell user locations
  This page keeps track of the members of the #haskell IRC channel community. It is up to date with ...http://visibleearth.nasa.gov/view_rec.php?vev1id=11656 into .jpg and stick it in share/xplanet/images (I use the 170M 21600 x 10800 .tif , however you'll
  11 KB (1,031 words) - 06:16, 8 June 2023
• SDL
  ...ous platforms' graphics, sound, and input devices. Software developers use it to write computer games or other multimedia applications that can run on ma
  7 KB (1,003 words) - 23:19, 5 April 2021
• Hac5/Attendees
  | VGR IT/Chalmers
  5 KB (679 words) - 18:16, 11 March 2024
• Blow your mind
  -- or generalize it: -- many can pass at once there. Is it possible for nine horsemen to
  12 KB (1,704 words) - 17:53, 22 November 2019
• Haskell Tutorial for C Programmers
  ...amiliar with C/C++, Python, Java, or Pascal. I am writing for you because it seems that no other tutorial was written to help students overcome the diff ...not 'take a little time.' It is very different and you cannot simply pick it up, although I hope that this tutorial will help.
  111 KB (19,450 words) - 17:55, 23 October 2019
• Euler problems/21 to 30
  We can also solve it in a more naive way, without using Monads, like this:
  8 KB (1,054 words) - 15:53, 11 October 2015
• Learning Haskell
  There are several websites where you can enter a Haskell program and run it. They are (in no particular order):
  9 KB (1,327 words) - 14:24, 18 March 2024
• Ru/IO Inside
  # Is it possible to duplicate calls? In Haskell semantics - yes, but real compilers ...his greatly simplifies understanding algorithms and code optimization, but it's inappropriate in some cases. As we all know, there are plenty of algorith
  64 KB (6,046 words) - 11:23, 22 October 2022
• Type
  ...ny consider the Haskell field implementation sub-optimal, while others use it extensively. See [[Programming guidelines#Records|Programming guidelines]]
  7 KB (1,016 words) - 15:20, 6 February 2021
• Constructia Compilatoarelor Folosind Flex si Bison
  ...is a program that generates tree parsers for cost-augmented tree grammars. It is useful for writing code generators for compilers. Given a mapping of a t
  6 KB (805 words) - 22:27, 29 June 2021
• Sudoku
  ...trying possibilities until it finds one which works, and backtracking when it can no longer make a legal move. when (v == 0) $ do -- if it's empty (we represent that with a 0)
  67 KB (9,593 words) - 05:40, 9 March 2021
• Dmenu-4.0-xft.diff
  +# Xft, comment if you don't want it
  7 KB (986 words) - 15:19, 6 February 2021
• Benchmarks Game/Parallel/BinaryTrees
  When compiled with the -threaded flag, and run with +RTS -N5 -RTS, it will exploit all cores on the quad-core machine,
  6 KB (1,055 words) - 23:27, 18 April 2020
• Haskell in industry
  investment banking activities it needs to measure the counterparty risk ...applications use artificial intelligence. Rapidly changing priorities make it important to minimize the code impact of changes, which suits Haskell well.
  49 KB (6,836 words) - 08:57, 19 October 2020
• Xmonad/Frequently asked questions
  ...essed at the same time) to bring up an xterm. Once the xterm appears, use it to read xmonad's man page or point a web browser at http://xmonad.org/tour. If you have installed xmonad using your package manager, then just use it.
  71 KB (10,765 words) - 16:38, 22 August 2021
• Books
  supporting libraries. It has been considerably revised and refined time. It should be a standard reference work for anyone involved in
  53 KB (7,703 words) - 13:28, 28 March 2024
• Haskell in education
  cited it The course is in German only (sorry about that). It additionally
  40 KB (6,259 words) - 05:49, 6 June 2020
• FFI complete examples
  Here's where it gets a bit hacky. We need to capture all of Haskell's library dependencies,
  7 KB (1,181 words) - 21:12, 30 August 2014
• Xmonad/Config archive/Template xmonad.hs (0.8)
  -- modifier with Num_Lock bound to it:
  9 KB (1,218 words) - 15:17, 6 February 2021
• Dutch HUG/Meetings
  ...Nemoy talked about the status of Haskell packaging in Fedora and how to do it yourself.
  10 KB (1,483 words) - 02:59, 25 July 2021
• Typeclassopedia
  ...ublished in the Monad.Reader. Please help update and extend it by editing it yourself or by leaving comments, suggestions, and questions on the [[Talk:T * What the heck is a monoid, and how is it different from a mon<u>a</u>d?
  179 KB (29,519 words) - 16:10, 30 December 2022
• All About Monads
  ...but ... sometimes, with great power comes great (apparent) nonsensicality. It doesn't help that the word itself is obscure. Words like "data" or "type" h ...tions required to fulfill certain coherence conditions." (Wikipedia) Admit it: unless you're fresh from studying abstract algebra, you just died a little
  169 KB (26,630 words) - 00:15, 19 September 2021
• News/2006
  ...brary] for serialization using the existing generic-programming framework. It is often advocated that support for serialization should be added to the co ...a simple [http://members.cox.net/stefanor/vty terminal interface library]. It provides: handling of suspend/resume, window resizes, computation of minima
  93 KB (13,836 words) - 23:40, 14 August 2019
• Xmonad/Config archive/Template xmonad.hs (0.6)
  -- modifier with Num_Lock bound to it:
  10 KB (1,329 words) - 15:18, 6 February 2021
• Xmonad/Config archive/Don's Config.hs
  -- modifier with Num_Lock bound to it:
  11 KB (1,532 words) - 15:18, 6 February 2021
• Xmonad/Config archive/arossato's Config.hs
  -- modifier with Num_Lock bound to it:
  12 KB (1,574 words) - 15:16, 6 February 2021
• Stiri Ro/Haskell-2008
  ...ginerie. Daca lucrurile raman asa VOM face HASKELL si cu studentii sectiei IT de la Fac. de Ing. a Univ. Bacau. <br> ...nscrieti nici la Universitatea particulara nici la cursurile de Tehnologii IT (sau similare) de la Sectia de Inginerie. Acolo noi nu predam Haskell.<br>
  21 KB (3,264 words) - 14:36, 18 February 2015
• Old news
  ...l compiler on your platform to build nhc98 - a C compiler will do. Hence, it is portable to almost any unix-like machine with a 32-bit compatibility mod ...o announced] a new issue of The Monad.Reader, a 'Summer of Code Special' - it consists of three articles from student participants of Google's Summer of
  76 KB (9,269 words) - 19:17, 15 August 2019
• Research papers/Functional pearls
  * [https://www.cs.nott.ac.uk/~pszgmh/123.pdf It’s Easy As 1,2,3] - Graham Hutton. * [http://www.cs.nott.ac.uk/~gmh/wgp01/hinze-paper.pdf Haskell does it with class: Functorial unparsing] - Ralf Hinze.
  20 KB (2,961 words) - 16:50, 6 February 2024
• Xmonad/Config archive/Nnoell's xmonad.hs
  -- Wrapper for the Timer id, so it can be stored as custom mutable state ask >>= logHook . config --get the loghook and run it
  45 KB (4,625 words) - 00:21, 27 October 2013
• Research papers/Type systems
  ;[http://www.cs.nott.ac.uk/~ctm/faking.ps.gz Faking It (Simulating Dependent Types in Haskell)]
  26 KB (3,569 words) - 10:04, 1 September 2022
• Distributii Linux de Download apreciate
  '''17 dec 2009:''' Cei mai buni studenti de la informatica si inginerie IT de la Univ. V.A.din Bacau au primit cadou de Craciun CD-uri Ubuntu Linux 9.
  22 KB (2,918 words) - 04:41, 21 November 2013
• Stiri Ro/Haskell-2011
  ...collector]]", a lansat conceptul de [[time-sharing]] ca baza a industriei IT, a realizat algoritmi de IA si a studiat fundamentele rationametelor si mas
  27 KB (4,177 words) - 15:10, 18 February 2015
• Ro/Haskell
  ...e-ului din vara lui 2007, am gasit ca Ro/Haskell ar putea fi încă îmbunătățit. O sumedenie de lucruri ar putea fi adaugate, de la simple explicații pent ...t deocamndată oferite la... [[Calitate Ro/Haskell]] sau pur și simplu „As It Is”. Firește că facem eforturi pentru a îmbunătăți continuu calitat
  39 KB (6,088 words) - 16:59, 30 September 2021

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