Search results

• Url
  The URL library provides a module Network.URL that makes it easy to work with HTTP URLs. ...following example shows how to parse a URL and then add some parameters to it:
  829 bytes (129 words) - 15:18, 6 February 2021
• Web/Projects and Ideas
  * See wai-handler-webkit, though it would be nice if it had better Windows support. Create a WAI handler which uses Webkit to conve ...ai-fastcgi. fastcgi handler for WAI. See the hack-handler-fastcgi package; it should be a simple port.
  1 KB (194 words) - 18:09, 27 January 2018
• Foldl as foldr alternative
  ...>. Yes, there is already [[Foldl as foldr|such a page]]! This one explains it differently. ...ges in the recursion. It turns out things will be simpler later if we pull it out:
  5 KB (891 words) - 14:21, 3 January 2018
• Infinity and efficiency
  In general, it is harder to reason about time and memory complexity of an implementation t We want to call it <code>dropWhileRev</code>.
  3 KB (422 words) - 21:22, 29 June 2021
• Show instance for functions
  Why is there a Show instance, but it only prints the type? ...en optimized to <hask>\x -> x :: Int -> Int</hask>. If it's used anywhere, it might have been inlined and optimized to nothing.
  3 KB (430 words) - 00:30, 1 February 2016
• GHC/Memory Management
  ...a new value. But GHC is able to efficiently manage garbage collection, so it's not uncommon to produce 1gb of data per second (most part of which will b ...pointed to from scratch. And since values are never modified, neither can it be pointed to later. This is the key property of immutable data.
  3 KB (490 words) - 21:19, 21 November 2022
• HAC
  * Each contest should focus (e.g. graph-related logic) on one topic, but wrap it in some sort of fun game/competition ** By focussing on one topic it will most likely be more informative to people studying those topics
  1 KB (213 words) - 01:07, 12 July 2021
• Alternatives and extensions for libraries
  ...nge of Haskell packages and modules. Your help is appreciated in expanding it. When editing this table, please try to keep it in alphabetical order (by package name, then by module name), maintain refl
  5 KB (633 words) - 15:16, 6 February 2021
• Piq
  '''Note''': Piq is not ready for use yet. It's waiting for [[Reactive]] to get into better shape.
  835 bytes (127 words) - 03:18, 9 April 2021
• Thunk
  It is used in Haskell systems that implement [[non-strict semantics]] by [[laz A lazy run-time system does not evaluate a thunk unless it has to.
  3 KB (450 words) - 20:07, 19 October 2020
• Missing tutorials
  ...ications, inverses) with vectors and matrices. There are many packages and it takes a while to find the ones serving basic needs (i.e. small arrays, no s ...lications. There's two ways you could go about it. One might be to build it as a Haskell-for-Objective-C programmers, thing. Another might be Mac OS X
  1 KB (222 words) - 13:03, 5 March 2024
• MonadPlus reform proposal
  It is proposed that MonadPlus be split like this: ...us for the Maybe monad should be used as an implementation of morelse, but it is also possible to give an unbiased mplus for Maybe:
  4 KB (609 words) - 18:22, 23 June 2015
• Prelude
  If you wish to program without a prelude or to use a custom version of it you can suppress its automatic inclusion in several ways. The problem is al ...-XNoImplicitPrelude (or -fno-implicit-prelude in older [[GHC]]) that makes it not import Prelude implicitly. The option can be also specified by adding:
  1 KB (187 words) - 22:09, 28 June 2021
• Denotative
  A programming language is trivially denotative if it only permits programs to be defined in terms of denotative expressions. ...O to be managed by the denotative language's implementation, with parts of it written in a non-denotative (I/O-capable) programming language.
  4 KB (488 words) - 04:24, 5 April 2024
• Lazy evaluation
  '''Lazy evaluation''' is a method to evaluate a Haskell program. It means that expressions are not evaluated when they are bound to variables, ...o bypass undefined values (e.g. results of infinite loops) and in this way it also allows one to process formally infinite data.
  2 KB (291 words) - 15:20, 6 February 2021
• Burton-style nondeterminism
  ...nvolved in determining a <code>Decision</code> value only occur once: when it is initially used; * Once it has been determined, a <code>Decision</code> value won't change: it remains constant, even if reused.
  2 KB (341 words) - 09:18, 22 February 2022
• Jhc
  ...ient programs possible via whole program analysis and other optimizations. It also performs well as a cross compiler and is able to generate Windows prog ...project with forking jhc.] Kiwamu Okabe created a fork of [[jhc]] and used it to program a [http://en.wikipedia.org/wiki/ARM_Cortex-M Cortex-M3] processo
  2 KB (230 words) - 22:57, 23 May 2014
• Anonymous function
  An anonymous function is a [[function]] without a name. It is a [[Lambda abstraction]] and might look like this: <hask>\x -> x + 1</ha ...So if I wanted to add one to each element of a list, here's one way to do it (without anonymous functions):
  2 KB (296 words) - 06:56, 12 April 2021
• Safe Haskell
  Safe Haskell is a Haskell language extension. It is described in detail: As the Safe Haskell paper describes, it "hardens" the Haskell language by providing five properties:
  3 KB (471 words) - 03:00, 5 August 2021
• Haskell/Lazy evaluation
  ...e up in #haskell, and it seemed instructive to take the discussion and sum it up into a simple tutorial on lazy evaluation. ...empty list, and any Int. The 'any Int' part is fine, so we need to know if it's passed an empty list. Answering that question forces one step in the eval
  4 KB (708 words) - 23:10, 19 April 2021
• Euler problems
  ...:Euler problems|talk page]] for discussion. Many P.E. participants regard it as a global Internet competition which is being compromised by these readil <p><em>I solved it by using a search engine, does that matter?</em></p>
  2 KB (325 words) - 01:17, 13 February 2019
• Xmonad/Guided tour of the xmonad source
  Do you know a little Haskell and want to see how it can profitably be ...ut of sync, report it on the xmonad mailing list, or -- even better -- fix it!
  3 KB (531 words) - 09:09, 15 August 2017
• Humor/Dialogs
  so don't tell me how to spend it! I'll ask Mom instead. What do you care where I get them from? It's no extra work for you!
  3 KB (445 words) - 15:19, 6 February 2021
• ZuriHac2015/Projects
  ...project. Feel free to add your project or your name to a project below as it was done for [[ZuriHac2014/Projects|ZuriHac 2014]]. ...ed Boltzmann Machines using Accelerate, compiled to Cuda and run on GPU's. It's about unsupervised machine learning. Later: Convolutional RBM's. || Marku
  3 KB (355 words) - 14:25, 30 May 2015
• GHC/Kinds
  ...defines a ''promotable'' data type at the term level they are able to use it at the type level too. For instance, the user can write the following examp == How do I use it? ==
  2 KB (289 words) - 16:02, 28 February 2014
• Applications and libraries/Robotics
  :Frob is an Embedded Domain Specific Language for controlling robots. It is built using the principals of Functional Reactive Programming, as develo ...It supports direct commands, messages and many sensors (also unofficial). It has also support for a simple message-based control of a NXT brick via remo
  1 KB (178 words) - 12:02, 8 June 2023
• Avoiding partial functions
  we replace it by combination of check and computation of f. You may implement it with the partial function <hask>minimum</hask>.
  3 KB (506 words) - 04:03, 4 September 2017
• Upgrading from MTL 1 to MTL 2
  ...version 2. Most of the remainder require only small changes to upgrade to it, though that will usually render them incompatible with version 1 without s ...mers] package. You may wish to check it's the same, so you can just delete it.
  2 KB (374 words) - 00:43, 9 April 2021
• Gentoo
  ...packages that are distributed via [http://hackage.haskell.org/ Hackage] as it allows us to use automated tools. ...their dependencies changed (ala revdep-rebuild/reconcilio/etc.). That is, it will rebuild packages corresponding to the libraries listed by "ghc-pkg che
  4 KB (592 words) - 08:43, 1 September 2022
• From a newbie II
  ...y good programmer I decided to take a look. Ugh, what the f*ck is this? So it never went past taking a glance from the examples in wikipedia or haskell.o ...r boredom I decided to resume my Haskell lessons. Naturally, I am enjoying it more than ever, since this 'feeling' that learning something \this\ new giv
  2 KB (390 words) - 15:19, 6 February 2021
• HQK
  ...eless, you can [http://community.haskell.org/~jeltsch/hqk.tar.gz download] it. Here are some building tips from Sönke Hahn: ...Wolfgang Jeltsch]], would be happy to hear from you whether you think that it is sensible to transform the current version into something that can be rel
  2 KB (285 words) - 06:52, 22 June 2021
• DDC/ReleaseNotes-Alpha1
  :The GC used to work on 64 bit machines also, but it hasn't been tested for a long time. [http://code.google.com/p/disciple/issu ...t support functions being partially applied to unboxed arguments. Nor does it support unboxed data being free in the closure of a function, or being used
  2 KB (394 words) - 11:57, 19 April 2021
• Gtk2Hs/Tutorials/TreeView
  ...the web i could find. Therefore i post here the solution I have working - it is not optimal and I would appreciate comments. ...our names and after clicking on one it says which one you selected. i hope it is useful for others!
  2 KB (280 words) - 00:46, 9 April 2021
• 99 questions/Solutions/5
  ...e wasteful than the one in Prelude as it repeatedly reconses the result as it is accumulated. The following variation avoids that, and thus computational
  1 KB (148 words) - 12:06, 11 August 2017
• Physical units
  ...th integral seconds and fractional seconds). If this can in fact be done, it could also be used to model coordinate system axes in, say, Geometric Algeb ...y of handling it without forcing a choice of basis. I'm also not sure how it would work -- the whole point of GA is to incorporate areas, lengths, volum
  3 KB (521 words) - 07:04, 13 September 2016
• Diagrams/GHC7.6
  ...in time to try to find an ''earlier'' version of diagrams which "works". It finds diagrams-0.2.2.3, which is quite old and happens to be the last time
  1 KB (207 words) - 15:18, 6 February 2021
• Worker wrapper
  It is sometimes easier or more efficient to write functions which have particu however this will be more efficient if it were written
  2 KB (333 words) - 12:44, 4 June 2018
• Diagrams/Dev/ReviewingAndMerging
  ...s reading carefully through their proposed changes and commenting; ideally it also means downloading and testing their code.</p><p>Some guidelines for co ** ''Be clear''. Make it clear what action(s) are necessary to improve or correct the code. Clearly
  4 KB (614 words) - 16:36, 9 May 2015
• Quotes
  <LoganCapaldo> No, it just lifts a monad in each hand <oerjan> EvilTerran: no, it's for turning cotheorems into ffee.
  3 KB (561 words) - 02:55, 26 April 2021
• ZuriHac2015/Projects/FRPGames
  ...re obvious caveats in all FRP implementations, Yampa included, so I'd love it for you to help me figure out how to make Yampa better. You do not need to ...esigners to share assets. I tend to use SDL2 and 2D graphics, only because it's easier. You can also talk to the LambdaCube3D people and combine FRP and
  3 KB (578 words) - 15:24, 29 May 2015
• Budapest Hackathon 2016/Projects
  of course work assignments, mid-term and final examinations. It is almost fully implemented in Haskell based on the Snap framework, it uses the
  5 KB (679 words) - 14:07, 5 August 2016
• Import modules properly
  ...ntifier that you never needed but only annoyed you, annoys you again, when it was meant to not bother you any longer! The first variant of import does no ...ll too often I find an old module that cannot be compiled any longer since it uses identifiers that do no longer exist. If the module imports implicitly
  5 KB (816 words) - 08:28, 2 May 2015
• Num instance for functions
  It is possible to write a <hask>Num</hask> instance for functions in Haskell: The usefulness of this instance is debatable, and it is not currently part of [[Language and library specification|the language
  1 KB (145 words) - 01:24, 28 December 2014
• Hack-Nix
  * It works the same way no matter which linux distribution you're using # In this example it's used to remove base >= 4 from the
  5 KB (726 words) - 10:39, 5 January 2018
• Let vs. Where
  ...sense of "[[Declaration vs. expression style]]", however there is more to it. ...ortant to know that <hask>let ... in ...</hask> is an expression, that is, it can be written wherever expressions are allowed. In contrast, <hask>where</
  4 KB (716 words) - 07:41, 26 January 2019
• Use of language extensions
  However, when it comes to designing libraries one should carefully think about which extensi ...ram and the compiler suggests to use a language extension to resolve that. It is a quick fix to solve the problem by enabling the extension, but if you d
  3 KB (387 words) - 05:21, 12 July 2021
• Data declaration with constraint
  The designers of Haskell 98 do now think, that it was a bad decision to allow constraints on constructors. GHC as of version ...en something pattern matches a <hask>Cons x</hask>, the context comes with it.
  2 KB (312 words) - 23:26, 19 September 2016
• Haskell-language-server
  .../ Ghcup] can install HLS, but after installation, you'll need to integrate it with an editor. The [https://github.com/haskell/haskell-language-server#con ...e-them-all.html</ref> Over time, this project became the HLS, which allows it to be used with many IDEs and code editors.
  1 KB (157 words) - 00:07, 26 April 2024
• Web/Framework Interfaces
  ...like WAI, it uses lazy bytestrings for request and response bodies, making it easier to use for some. Many backends are available, for numerous backends;
  2 KB (217 words) - 12:02, 19 April 2024
• QualifiedDo
  ...ps://gitlab.haskell.org/ghc/ghc/-/merge_requests/3436 merged] in 2020, and it is available in GHC 9 and later releases.
  347 bytes (52 words) - 23:50, 6 December 2020

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