The Haskell Cabal | Downloads
The Haskell Cabal | Downloads Install/Upgrade For installation/upgrade instructions using a previous version of cabal-install see here. Cabal library (version 3.10.1.0) Released: March 2023 Source download: Cabal-3.10.1.0.tar.gz (with a checksum in file SHA256SUMS in Cabal-3.10.1.0/) Please see the User's guide, the API documentation, and the change log. cabal-install tool (version 3.10.1.0) cabal
Functor-Applicative-Monad Proposal - HaskellWiki
Haskell calls a couple of historical accidents its own. While some of them, such as the "number classes" hierarchy, can be justified by pragmatism or lack of a strictly better suggestion, there is one thing that stood out as, well, not that: Applicative not being a superclass of Monad. The topic has been discussed multiple times in the past (cf. link section at the very end). This article describe
Smart constructors - HaskellWiki
Smart constructors This is an introduction to a programming idiom for placing extra constraints on the construction of values by using smart constructors. Sometimes you need guarantees about the values in your program beyond what can be accomplished with the usual type system checks. Smart constructors can be used for this purpose. Consider the following problem: we want to be able to specify a da
Physical units - HaskellWiki
How would one go about modeling units (seconds, meters, meters per second, etc) in Haskell? I'm particularly interested in getting the typechecker to verify proper usage, and do not want to restrict it to any particular numeric representation (i.e. both 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 Al
Hp2any - HaskellWiki
Overview The name hp2any covers a set of tools and libraries to deal with heap profiles of Haskell programs. At the present moment, the project consists of three packages: hp2any-core: a library offering functions to read heap profiles during and after run, and to perform queries on them. hp2any-graph: an OpenGL-based live grapher that can show the memory usage of local and remote processes (the l
Making GHCi scale better and faster - HaskellWiki
A common complaint with GHCi is that it doesn’t scale well when the size of the project gets bigger. Once you hit 20, 30, 50, or 150 modules, it stops being fun anymore and you start wishing you didn’t have to wait for it to load. I recommend enabling -fobject-code. This makes GHCi compile everything once and then use incremental recompilation thereafter. You’ll find that you can load 100-module p
GHC/Memory Management - HaskellWiki
Haskell computations produce a lot of memory garbage - much more than conventional imperative languages. It's because data are immutable so the only way to store every next operation's result is to create new values. In particular, every iteration of a recursive computation creates a new value. But GHC is able to efficiently manage garbage collection, so it's not uncommon to produce 1gb of data pe
FFI cook book - HaskellWiki
This attempts to be a guide/tutorial/cookbook approach to writing a library using external (FFI) functions. Some people complain that cookbook approaches encourage a lack of thinking; that may be so, but they also help novices get started faster. Being a little hard of thinking myself, I would have been grateful for something like this when I was getting started. The FFI spec, while valuable, is n
LensBeginnersCheatsheet - HaskellWiki
Many other similar functions and operators are available. Composing Lenses Use . and pretend you're using a more mainstream language: outerLens . innerLens. s = [Data.Map.singleton "bob" 7, Data.Map.fromList [("alice", 5), ("kerry", 8)], Data.Map.singleton "harry" 6] t = element 1 . at "kerry" .~ Just 42 $ s -- t = [Data.Map.singleton "bob" 7, -- Data.Map.fromList [("alice", 5), ("kerry", 42)], --
Applications and libraries/Games - HaskellWiki
This page contains a list of libraries and tools in a certain category. For a comprehensive list of such pages, see Applications and libraries. See also: Game Development See also the Game category on Hackage, and the Haskell Tiny Game Jam. Allure of the Stars A near-future Sci-Fi roguelike and tactical squad combat game. In brilliant 16-color ASCII, grid-based, turn-based, with a story, stealth,
Pattern guard - HaskellWiki
Haskell 2010 changes the syntax for guards by replacing the use of a single condition with a list of qualifiers. These qualifiers, which include both conditions and pattern guards of the form pat <- exp, serve to bind/match patterns against expressions. The syntax is comparable that of a list comprehension, where instead the types of pat and exp match. This makes it easy, for instance, to pattern
Reactive-banana - HaskellWiki
Reactive-banana is a library for Functional Reactive Programming (FRP). FRP offers an elegant and concise way to express interactive programs such as graphical user interfaces, animations, computer music or robot controllers. In particular, it promises to avoid the spaghetti code that is all too common in traditional approaches to GUI programming. The goal of the library is to provide a solid foun
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Chapter 5. Profiling
4.18. Flag reference
[Haskell-iPhone] Xcode 5 support for GHC iOS
Lazy pattern match - HaskellWiki
Jmacro - HaskellWiki
ThreadScope Tour - HaskellWiki
ThreadScope Tour/Spark - HaskellWiki
Reactive-balsa - HaskellWiki