Type classes: an exploration of the design space - Microsoft Research
When type classes were first introduced in Haskell they were regarded as a fairly experimental language feature, and therefore warranted a fairly conservative design. Since that time, practical experience has convinced many programmers of the benefits and convenience of type classes. However, on occasion, these same programmers have discovered examples where seemingly natural applications for type
A weblog of sorts - Papers I Read and Loved in 2017
I spent 2017 as a research intern working at the systems group, ETH Zurich. I worked on Polly, a loop optimizer for LLVM, so this had me read a bunch of compiler related papers. I also started implementing simplexhc, a STG to LLVM compiler. STG is the Glasgow Haskell compiler’s internal representation for Haskell. This had me reading a bunch of lazy compiler papers! I decided to make a list of pap
lightweight concurrency · Wiki · Glasgow Haskell Compiler / GHC · GitLab
The Glorious Glasgow Haskell Compiler.
scheduler · Wiki · Glasgow Haskell Compiler / GHC · GitLab
The Glorious Glasgow Haskell Compiler.
The GHC scheduler : ezyang’s blog
I’d like to talk about some nitty-gritty details of GHC’s thread scheduling, discovered over the course of working on stride scheduling for GHC. Most of these choices are merely implementation details and are not part of any specification. While these choices shouldn’t be relied upon, they are worth knowing, since many of these details were accreted over the course of many performance bugs, benchm
Into the Core - Squeezing Haskell into Nine Constructors by Simon Peyton Jones
Keynote talk from Erlang USer Conference 2016 http://www.erlang-factory.com/euc2016/ Erlang and Haskell are childhood friends who grew up together. Throughout the years, they have learnt a lot from each other. And just because they have become adults does not mean the learning stops. GHC translates all of Haskell into a tiny but super-expressive intermediate language called Core, does a lot of o
Type classes: confluence, coherence and global uniqueness : ezyang’s blog
Type classes: confluence, coherence and global uniqueness Today, I'd like to talk about some of the core design principles behind type classes, a wildly successful feature in Haskell. The discussion here is closely motivated by the work we are doing at MSRC to support type classes in Backpack. While I was doing background reading, I was flummoxed to discover widespread misuse of the terms "conflue
r/haskell - A series about optimization
I am running a series on simple performance optimization. As a teaser, I start with a very inefficient program and optimize it using very simple techniques until it is about as fast as a C reference implementation, all of that without (many) trade-offs. Part 1 - description of the problem Part 2 - using efficient libraries Part 3 - memory usage estimation, bang patterns, custom parsers, inlining P
GHCヒーププロファイリングの手引き
非正格評価をデフォルトとするHaskellは、注意を怠るとしばしばスペースリークと呼ばれる非効率なメモリの使い方を引き起こす。幸いなことにGHCには多くの場合において有効なヒーププロファイラを備えているので、実際にスペースリークを特定するのはそれほど難しくない。 GHCのヒーププロファイラについて解説した文書としてはGHCの公式マニュアルがあるが、これだけで効果的に使うのは難しいのと、非公式のツールの使い方は紹介されていないので、それらを含めてまとめてみたい。 スペースリークの正格な定義があるのかはさておき、実際の使われ方としては、プログラマが意図しない非効率なメモリの使い方を指すと言ってよいと思う。一口にスペースリークと言っても様々な原因があり、これらを分類する試みとしては例えばSpace leak zooがある。いくつかの例はあとで触れることにして、まずはスペースリークの見つけ方につい
Tracing the compilation of Hello Factorial! : ezyang’s blog
It is often said that the factorial function is the “Hello World!” of the functional programming language world. Indeed, factorial is a singularly useful way of testing the pattern matching and recursive facilities of FP languages: we don’t bother with such “petty” concerns as input-output. In this blog post, we’re going to trace the compilation of factorial through the bowels of GHC. You’ll learn
paper.dvi
ZU064-05-FPR paper 8 July 2013 9:50 Under consideration for publication in J. Functional Programming 1 The GHC Runtime System fill in Abstract (This paper describes the implementation of the GHC runtime system) Contents 1 Introduction 1 2 Storage 2 2.1 Blocks 2 2.2 Memory layout 3 2.3 Generational garbage collection 4 2.4 Parallel garbage collection 6 2.5 Summary 7 2.6 Further reading 8 3 Concurre
Top tips and tools for optimising Haskell | Pusher blog
(This blog post discusses CPU time profiling, but not space (memory) profiling. We’ll come back to that in a Part 2.) We use a range of different programming languages at Pusher and are always looking for ways to squeeze every bit of performance from them. Recently, I’ve been on a project to explore what other \[…\] (This blog post discusses CPU time profiling, but not space (memory) profiling. We
Reddit - Dive into anything
On a whim I decided I wanted to contribute something to GHC. It was very intimidating a year or two ago, but I tried it again tonight, and found that it went incredibly smoothly. The documentation was great (on the development process). I described my experience in excruciating detail here. It's more detail than anyone needs, but maybe someone will find it interesting :) I was surprised how easy i
The constraint trick for instances
and thought, “Shenanigans! Why not just have this?” Me too! I only learned of this solution relatively recently, and I know experienced Haskellers who also only understood this recently or still don’t. Hence this quick write up. Here’s the thought process. We’re writing a trivial pretty printer and we’re using Writer. We write things like:
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
http://home.smart-cactus.org/~ben/2019-10-24-gc-design.pdf
Compiling without continuations - Microsoft Research
https://www.cis.upenn.edu/~jpaykin/papers/pz_linearity_monad_2017.pdf
Understanding the Stack
jstolarek.com
The GHC Runtime System by Edward Z. Young