Haskell

Downloads Community Documentation Donate An advanced, purely functional programming language Declarative, statically typed code. primes = filterPrime [2..] where filterPrime (p:xs) = p : filterPrime [x | x <- xs, x `mod` p /= 0] Try it! Type Haskell expressions in here. λ Got 5 minutes? Type help to start the tutorial. Or try typing these out and see what happens (click to insert): 23 * 36 or reverse "hello" or foldr (:) [] [1,2,3] Videos Escape from the ivory tower: The Haskell journey, by Simon Peyton-Jones Haskell taketh away: limiting side effects for parallel programming, by Ryan Newton Production Haskell, by Reid Draper Haskell Amuse-Bouche, by Mark Lentczner Haskell is Not For Production and Other Tales, by Katie Miller Your First Web Application with Spock, by Oskar Wickström Features Statically typed Every expression in Haskell has a type which is determined at compile time. All the types composed together by function application have to match up. If they don't, the program will be rejected by the compiler. Types become not only a form of guarantee, but a language for expressing the construction of programs. Purely functional Every function in Haskell is a function in the mathematical sense (i.e., "pure"). Even side-effecting IO operations are but a description of what to do, produced by pure code. There are no statements or instructions, only expressions which cannot mutate variables (local or global) nor access state like time or random numbers. Type inference You don't have to explicitly write out every type in a Haskell program. Types will be inferred by unifying every type bidirectionally. However, you can write out types if you choose, or ask the compiler to write them for you for handy documentation. Concurrent Haskell lends itself well to concurrent programming due to its explicit handling of effects. Its flagship compiler, GHC, comes with a high-performance parallel garbage collector and light-weight concurrency library containing a number of useful concurrency primitives and abstractions. Lazy Functions don't evaluate their arguments. This means that programs can compose together very well, with the ability to write control constructs (such as if/else) just by writing normal functions. The purity of Haskell code makes it easy to fuse chains of functions together, allowing for performance benefits. Packages Open source contribution to Haskell is very active with a wide range of packages available on the public package servers. Sponsors DataDog provides powerful, customizable 24/7 metrics and monitoring integration for all of Haskell.org, and complains loudly for us when things go wrong. Fastly's Next Generation CDN provides low latency access for all of Haskell.org's downloads and highest traffic services, including the primary Hackage server, Haskell Platform downloads, and more. Equinix Metal provides compute, storage, and networking resources, powering almost all of Haskell.org in several regions around the world. Status.io powers https://status.haskell.org, and lets us easily tell you when we broke something. Galois provides infrastructure, funds, administrative resources and has historically hosted critical Haskell.org infrastructure, as well as helping the Haskell community at large with their work. DreamHost has teamed up to provide Haskell.org with redundant, scalable object-storage through their Dream Objects service. Webmon provides monitoring and escalation for core haskell.org infrastructure. Haskell.org Hosted and managed by Haskell.org, a 501(c)(3) non-profit. Psst! Looking for the wiki? This is the new Haskell home page! The wiki has moved to wiki.haskell.org. © 2014–2021 haskell.orgGot changes to contribute to the site? Fork or comment on GitHubHosted on Equinix Metal