Search results

Lenny222/About Haskell
! What it means ! What it is good for

586 bytes (72 words) - 21:57, 23 April 2021
Monomorphism
...s for several different types - and thus, a function is ''monomorphic'' if it works only for ''one'' type. As an example, <hask>map</hask> is polymorphic. It's type is simply

692 bytes (112 words) - 20:01, 21 May 2017
BayHac2017/dynobud
Be warned that it is non-trivial to get dynobud built as it requires somewhat tricky external C++ dependencies.

325 bytes (45 words) - 00:24, 22 February 2017
BayHac2017/Karya
To get sound you'll need VSTs, a VST host, and jack if it's linux. It's easy to set up on OS X, it might be complicated on linux, but anyone

886 bytes (153 words) - 22:47, 5 April 2017
Abandoning a package
...it. You may wish to also orphan it in this case, to allow others to take it over or claim the namespace. ...package is still good and useful, but no longer have the time to maintain it, you can reach out via the usual community channels (the haskell-cafe maili

957 bytes (167 words) - 22:55, 23 October 2016
First-class module
Because it has also [[Dependent type]]s, it can leverage them so that it is not forced to have a separate module language and a core language.

585 bytes (86 words) - 06:42, 10 August 2022
Diagrams/Install
...haskell.org/platform Haskell Platform], if you don't already have it. Then it should be enough to simply run it will be installed as well.

757 bytes (105 words) - 01:44, 19 April 2015
Blueprint
...low reading a data structure like <hask>Data.Map</hask> while constructing it. It is discussed at length in

346 bytes (51 words) - 15:19, 6 February 2021
Hie-bios
''This article is a stub. Please help expand it.'' ...ng Haskell programs using [[Cabal]], [[Stack]] and other package managers. It is used to specify how [[Haskell Language Server]] and [[ghcide]] set up a

497 bytes (72 words) - 23:38, 31 July 2023
ZuriHac2015/Projects/Gipeda
It generates static files, mostly json-files, using shake to keep track of wha ...ttp://perf.haskell.org/ghc. But it is kept generic and you are free to use it for your own projects as well.

1 KB (201 words) - 08:12, 22 May 2015
Making GHCi scale better and faster
...stops being fun anymore and you start wishing you didn’t have to wait for it to load. If you want it on all the time, you can put the above line in a <code>.ghci</code> file ei

1 KB (245 words) - 18:39, 2 October 2015
Cabal/How to install a Cabal package
...http://hackage.haskell.org/ Hackage] you'd like to try. How do you install it on your system? While it is possible to "install" a library package "globally" it is most certainly a [https://en.wikipedia.org/wiki/Dependency_hell bad idea

1 KB (169 words) - 10:06, 10 March 2021
Diagrams/GSoC
..., and raise the profile of the Haskell programming language. Most of all, it's fun---you get to tangibly experience your contributions in the form of be

1 KB (165 words) - 22:48, 5 March 2014
Haste
...ily modified version of [[haddock]] 1.x for Intellisense (tab-completion). It was [http://www.haskell.org/pipermail/haskell/2005-April/015667.html announ The development of Haste has been abandoned, and as of GHC 6.8.2, it is somewhat bitrotten. A snapshot of the last sources can be found at [[Med

2 KB (310 words) - 05:54, 10 October 2013
Yhc/Primitives
...all. This allows for the possibility that the primitive might block and so it is run in a separate OS thread. ...'t run the primitive call in a separate OS-level thread because we promise it won't block.

2 KB (288 words) - 01:58, 9 April 2021
$
.../hask> has the lowest, right-associative binding precedence (infixr 0), so it sometimes allows parentheses to be omitted; for example: It is also useful in higher-order situations, such as <hask>map ($ 0) xs</hask

1 KB (208 words) - 00:09, 1 October 2016
Strict semantics
It means, that an undefined argument of a function leads to an undefined funct It may be implemented by [[eager evaluation]].

363 bytes (53 words) - 15:18, 6 February 2021
Partial functions
...it much easier to reason about your code and makes "if your code compiles, it probably works" true for your code more often. Usually if you have a partial function, it's because your types are incorrect and you should fix your types rather tha

1 KB (247 words) - 16:53, 15 November 2014
Haskell Web Server
* Björn Bringert cleaned it up and put it to http://darcs.haskell.org/hws/

543 bytes (85 words) - 03:32, 9 April 2021
Default method implementation
It's always a design question, whether to provide default implementions of met ...duces the amount of implementation work for class instances. It also makes it more probable, that no extra super-classes are needed.

2 KB (254 words) - 21:39, 19 September 2016
Xmonad/Notable changes since 0.12
...config. This is now the preferred way to use <code>ManageDocks</code>, as it can be kept up to date with any new hooks that might be added in the future ...W_TYPE_DOCK</code> window type (there is code to handle other windows, but it does not appear to be being used). Notably, this means that if you use <cod

2 KB (420 words) - 18:27, 12 December 2017
Probabilistic Functional Programming
It turns out that random variables establish a monad, namely a list monad wher ...ulate or randomize any simulation without altering the code which defines it.

2 KB (271 words) - 22:15, 27 November 2016
Constant applicative form
...since it is not a [[lambda abstraction]] it contains no variables at all. It may however contain identifiers which refer to other CAFs, e.g. ...ome shared code which will overwrite itself with some graph the first time it is evaluated. A CAF such as

2 KB (255 words) - 06:31, 12 June 2023
99 questions/Solutions/54A
are binary trees: it is just not possible to construct an invalid tree with this type. Hence, it is redundant to introduce a predicate to

1 KB (156 words) - 13:35, 25 December 2016
Haddock
...cumentation of the standard libraries that come with [[GHC]] and [[Hugs]]. It is also supported by [[Cabal]].

684 bytes (90 words) - 02:54, 28 November 2015
Intentionally omitted instance
In an equation for `it': it = 2 + 3 :: Char It is ugly that you have to enable <hask>UndecidableInstances</hask> for this

1 KB (209 words) - 14:08, 22 February 2015
Cabal
...y involved in the creation of packages and the building of their contents. It does not manage packages. ...all non cabal packaged dependencies, it cannot uninstall packages, nor can it automatically upgrade installations.

2 KB (244 words) - 12:34, 2 October 2020
99 questions/Solutions/40
...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 .... Then it looks for a pair of odd numbers where both are prime and returns it as a tuple.

1 KB (226 words) - 19:47, 18 January 2014
Space leak
That means it should preferably leak even when compiled with the latest GHC -O2, but cert It's frustrating to study about leak when the examples given no longer leak fo

1 KB (168 words) - 06:46, 4 February 2015
Infix operator
Putting parentheses around an infix operator converts it into a prefix function: Putting <code>`</code>-marks around a prefix function allows us to use it like an infix function:

1 KB (159 words) - 23:45, 25 June 2021
Commenting
It is generally a good idea to write comprehensible programs, However it is not true that every program can be become comprehensible

2 KB (315 words) - 02:39, 9 April 2021
Calling Haskell from C
It is not uncommon to want to call a Haskell function from C code. Note the foreign export. When GHC sees this, it will generate stubs

1 KB (215 words) - 17:08, 27 June 2019
Syntactic sugar
...ns]] to syntactic sugar. The goal generally being to balance the amount of it available in a language so as to maximise readability -- giving enough free ...of syntactic sugar is as cut-and-dried as some people appear to be making it.

3 KB (490 words) - 01:44, 27 October 2017
NamedAction.dpatch
This actually refers to a text darcs patch, but it works anyways.

94 bytes (15 words) - 15:19, 6 February 2021
BayHac2018/CodeWorld
== What It Is == ...CodeWorld is to be used for middle school aged children. Because of this, it defaults to a simplified variant of Haskell. However, a full Haskell versi

2 KB (275 words) - 21:13, 6 April 2018
Kibro
I've made this page for documenting it, and discussing ideas. ...with cabal install (to make sure all dependencies are there) and then run it on a port like 3000.

1 KB (154 words) - 05:36, 24 April 2021
Multiple instances
How is it possible? ...instance can be defined for the class/newtype pair and it is not orphan if it is defined where newtype is introduced.

2 KB (336 words) - 08:58, 30 November 2016
Binary IO
It's very simple to use, and provides a highly efficient, pure interface It is a part of the base package, so it comes with [[GHC]].

2 KB (254 words) - 19:03, 23 October 2013
Web/Libraries/Templating
...syntax for defining your templates: a Haml-inspired syntax to be precise. It also has support for type-safe URLs, and achieves very high performance by ...e Java StringTemplate library by Terrence Parr, ported by Sterling Clover. It can be used for any templating purpose, but is often used for dynamically g

1 KB (193 words) - 04:57, 26 April 2021
Gtk2Hs/Tutorials
...ses the deprecated Events module and to run some examples with gtk 0.10.1, it is necessary to include "import Graphics.UI.Gtk.Gdk.Events" in the program. A simple example how to show a list and select an entry from it.

1,006 bytes (151 words) - 04:25, 26 April 2021
Diagrams/Dev/AlignedCompose
It seems like a major wart that often, in order to compose diagrams in a certa ...some require <code>Traced</code> and some do not. That is, specifically, it is hard to imagine what type we could give to the hypothetical lens <code>a

2 KB (397 words) - 20:05, 1 June 2015
ARM
...s a [http://en.wikipedia.org/wiki/RISC RISC] instruction set architecture. It is used in most of the mobile phones and in many other consumer electronics ...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

3 KB (409 words) - 07:55, 19 October 2015
Common Language Runtime
...H JS crew have made some good progress on creating a new target for GHC so it's doable at least. ...this spin, head over to github page, and follow the READMEs carefully. It it also the only Mono compatible solution (but again, may require manual steps

2 KB (405 words) - 10:31, 9 February 2019
Haskell.org infrastructure
...It therefore also determines the policy on the uses of those machines that it pays for. If there are problems with infrastructure, it is good to check [https://status.haskell.org status.haskell.org] to see if

1 KB (208 words) - 23:49, 17 May 2018
GHC/TypeSigsAndAmbiguity
...alas not always. Perhaps this is a deficiency in GHC, but here's one way it can happen: Now GHC finished typechecking the right hand side of <tt>f</tt>, so next it checks that the constraints ''needed'' in the RHS, namely <tt>(C a b1)</tt>

4 KB (716 words) - 11:30, 24 January 2016
Maintenance of standard collection libraries
...rac (http://hackage.haskell.org/trac/ghc/wiki/CollectionLibraries) because it made better sense there.

148 bytes (22 words) - 12:16, 8 June 2023
Hac NYC/Talks
If you'd like to give a talk, announce it here; tell us your name, the title of the talk, a short description. Pleas ...tion of what "univalence" could be and why it is reasonable to expect that it should compute.

2 KB (335 words) - 15:02, 5 April 2014
Hoare Property
...no bugs in it, or write code so complex that there are no obvious bugs in it.

431 bytes (80 words) - 01:34, 17 June 2021
Emacs/Project navigation
...ll buffer which will jump directly to its definition. You can also now use it for [[Emacs/Autocompletion|autocompletion]]. or just <code>M-x customize-group haskell</code> and it's in there.

1 KB (170 words) - 18:23, 11 April 2016
ILogBase
...based, it is limited in number sizes, and has accuracy errors that render it unusable even for simple purposes such as digit counting.

1 KB (173 words) - 01:51, 14 July 2021
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 I solved it by using a search engine, does that matter?

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

Search results

Navigation menu

Search