サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
ノーベル賞
www.haskell.org
bgamari - 2021-06-08 In GHC 9.0 we have reworked the primops used for guaranteeing heap object lifetime in the presence of off-heap references. The result is a new primop, keepAlive#, which largely replaces the venerable touch# operation. This post will give some background on touch#, describe the rationale for this change, discuss some of the alternatives that were evaluated on the way to this ne
bgamari - 2020-05-15 The ARM architecture represents an overwhelming majority of CPUs on this planet. Furthermore, there are now GHC users (myself included) who stake their livelihood on being able to deploy their Haskell applications on ARM-based platforms. As such, the task of making GHC run well on ARM has never been more important. This task has a long history, being the project that brought m
bgamari - 2019-07-28 Imagine that I show you a fragment of a Haskell program: and pose the question: “what are the variables in this program?” You would likely respond x and y. Now I ask you: what is the difference between those two variables? One answer is that x is bound by the fragment whereas y comes from the fragment’s surrounding context. Variables like y are known as free variables. When co
Ben Gamari - 2019-07-08 GHC’s testsuite is our first line of defense against correctness regressions. However, as is often the case, the infrastructure that keeps it running has been long neglected. Our recent efforts in enforcing a CI-cleanliness in all GHC builds has resulted in a few bits of work that I thought would be nice to share. Improving testsuite driver maintainability GHC’s testsuite i
wz1000 - 2019-06-26 When GHC compiles your programs, it has to work out a bunch of information - it figures out where stuff is defined, assigns types to expressions, solves constraints and so on. However, all this information is not easily accessible to you after GHC is finished. To get your hands on this, you need to set up a GHC environment, and tediously use the GHC API to extract whatever info
Ben Gamari - 2019-04-03 Around five months ago I proposed that we undertake what became a comprehensive rebuild of GHC’s infrastructure. Since November we have been quietly working behind the scenes to make this new infrastructure a reality; this has been a massive project and however I’m happy to say we are now emerging on the other side and we are very happy with the result. In this post I want
Chapter 3 Expressions In this chapter, we describe the syntax and informal semantics of Haskell expressions, including their translations into the Haskell kernel, where appropriate. Except in the case of let expressions, these translations preserve both the static and dynamic semantics. Free variables and constructors used in these translations always refer to entities defined by the Prelude. For
Welcome to the Cabal User Guide Edit on GitHub Welcome to the Cabal User Guide 1. Getting Started with Haskell and Cabal 1.1. Installing the Haskell toolchain 1.2. Creating a new application 1.3. Run a single-file Haskell script 1.4. What Next? 2. Introduction 2.1. A tool for working with packages 2.2. What’s in a package 2.3. Cabal featureset 2.4. Similar systems 3. Package Concepts and Developm
Take Notice The packages on this page include only the GHC compiler. For most users, we recommend installing a proper Haskell distribution instead of GHC alone. A distribution includes a recent GHC release as well as other important tools (such as cabal-install, for installing libraries), and potentially a broader set of libraries known to work together. Bundled packages and cabal-install GHC 7.10
The Haskell 98 Report top | back | next | contents | function index 6 Predefined Types and Classes The Haskell Prelude contains predefined classes, types, and functions that are implicitly imported into every Haskell program. In this chapter, we describe the types and classes found in the Prelude. Most functions are not described in detail here as they can easily be understood from their definiti
Index Haskell Communities and Activities Report http://tinyurl.com/haskcar pdf version Twenty-Eighth Edition – May 2015 Mihai Maruseac, Alejandro Serrano Mena (eds.) Andreas Abel Christopher Anand Heinrich Apfelmus Emil Axelsson Christiaan Baaij Carl Baatz Doug Beardsley Jean-Philippe Bernardy Alexander Berntsen Joachim Breitner Björn Buckwalter Erik de Castro Lopo Lucas DiCioccio Roman Cheplyaka
Welcome to Hoogle Links Haskell.org Hackage GHC Manual Libraries Hoogle is a Haskell API search engine, which allows you to search the Haskell libraries on Stackage by either function name, or by approximate type signature. Example searches: map (a -> b) -> [a] -> [b] Ord a => [a] -> [a] Data.Set.insert +bytestring concat Enter your own search at the top of the page. The Hoogle manual contains mor
Und der Haifisch, der hat Zähne Und die trägt er im Gesicht Und Macheath, der hat ein Messer Doch das Messer sieht man nicht. Threepenny-gui is a GUI framework that uses the web browser as a display. Features include: Easy installation. Everyone has a reasonably modern web browser installed. Just install the library from hackage and you are ready to go. The library is cross-platform. HTML + JavaSc
Austin Seipp austin at well-typed.com Wed Apr 9 14:10:34 UTC 2014 Previous message: [Haskell] Call for papers: The 20th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2014) Next message: [Haskell] ANNOUNCE: GHC version 7.8.1 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] ============================================================== The (Interactive) Glasgow
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)], --
The MonadFix typeclass provides the mfix method for value recursion. It can be used directly, or indirectly through the RecursiveDo extension. The GHC Users Guide has a section on RecursiveDo. It is useful for building cyclic data in monadic code. What it is not and what it is It is tempting to see “recursion” and guess it means performing actions recursively or repeatedly. No. It means recursion
All About Monads is a tutorial on monads and monad transformers and a walk-through of common monad instances. You can download a PDF version here. And here is a version of the article which includes source code. Understanding Monads Introduction What is a monad? If you're approaching Haskell monads a little nervously, that's understandable. You've probably heard that monads are a very powerful cod
This article is a stub. You can help by expanding it. Introduction Android is an operating system for mobile devices, based on Linux; software development is mainly done in Java. See the Wikipedia article for more information. How to develop Android software in Haskell There are two main approaches to writing Android applications. You can either use the Java Native Interface (JNI) or the Native De
Alexander Green alexander.s.green at gmail.com Wed Jun 19 21:53:06 CEST 2013 Previous message: [Haskell] Extended deadline for a call for talk proposals: HOPE'13 (Workshop on Higher-Order Programming with Effects, affiliated with ICFP'13) Next message: [Haskell] Quipper: a quantum programming language Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] Dear Haskellers, we are proud to a
Cloud Haskell is a library for distributed concurrency in Haskell. The purpose is to make it easier to write programs for clusters of machines. It provides a message passing communication model, inspired by and very similar to that of Erlang. Availability Cloud Haskell is available from Hackage as distributed-process. You will probably also want to install a backend: The distributed-process-simple
[Haskell-cafe] The end of an era, and the dawn of a new one Simon Peyton-Jones simonpj at microsoft.com Wed Dec 5 17:56:02 CET 2012 Previous message: [Haskell-cafe] Are there REPA linear algebra routines? e.g. Eigenvalues? Next message: [Haskell-cafe] The end of an era, and the dawn of a new one Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] Friends You'll have seen Simon Marlow's
Haskell Tutorial for C Programmers, by Eric Etheridge version 3.0 - please increment with major updates original author: Eric Etheridge last major update by the original author: August 28, 2011 year of original release (on old haskell.org site): 2005 Original post, with Japanese transcripts, can be found here. A pdf wersion can be found here. Introduction Abstract Many people are accustomed to imp
Simon Marlow marlowsd at gmail.com Thu Nov 22 12:26:45 CET 2012 Previous message: [Haskell] Haskell Weekly News: Issue 251 Next message: [Haskell] CFP: EOOLT 2013 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] Today I'm announcing that I'm leaving Microsoft Research. My plan is to take a break to finish the book on Parallel and Concurrent Haskell for O'Reilly, before taking up a po
Haskell Platform The Haskell Platform is deprecated The Haskell Platform is deprecated since 2022 and is no longer the recommended way of installing Haskell. For the latest recommended way to install Haskell please see the Downloads page.
Key bindings and usage Key bindings in haskell-mode (with haskell-indent and inf-haskell.el). Code editing keys: C-c C-= inserts an = sign and lines up type signatures and other pattern matches nicely. C-c C-| inserts a guard C-c C-o inserts a guard | otherwise = and lines up existing guards C-c C-w inserts a where keyword C-c C-. aligns code over a region in a "sensible" fashion. Haskell interpre
The Haskell Implementors Workshop is an informal affair, aimed at bringing together people behind the Haskell infrastructure. It provides a forum where people working on compilers, tools, or libraries for Haskell development can bat around ideas, share experiences and ask for feedback from fellow experts. There are no proceedings, just a mixture of short talks, longer talks, discussion and demos.
次のページ
このページを最初にブックマークしてみませんか?
『Haskell Language』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く