History and effective use of Vim
This article is based on historical research and on simply reading the Vim user manual cover to cover. Hopefully these notes will help you (re?)discover core functionality of the editor, so you can abandon pre-packaged vimrc files and use plugins more thoughtfully. physical books To go beyond the topics in this blog post, I’d recommend getting a paper copy of the manual and a good pocket reference
Pleasant debugging with GDB and DDD
GDB is an old and ubiquitous debugger for Linux and BSD systems that has extensive language, processor, and binary format support. Its interface is a little cryptic, but learning GDB pays off. This article is a set of miscellaneous configuration and scripting tricks that illustrate reusable principles. It assumes you’re familiar with the basics of debugging, like breakpoints, stepping, inspecting
Concurrent programming, with examples
Mention concurrency and you’re bound to get two kinds of unsolicited advice: first that it’s a nightmarish problem which will melt your brain, and second that there’s a magical programming language or niche paradigm which will make all your problems disappear. We won’t run to either extreme here. Instead we’ll cover the production workhorses for concurrent software – threading and locking – and le
Inside the C Standard Library
After diving into the C language through K&R, and then studying portability (see C Portability Lessons from Weird Machines), my next challenge was to take a systematic look at the standard library. To do this I worked through P. J. Plauger’s book The Standard C Library (ISBN 978-0131315099) where he examines an implementation of all the functions. It has a chapter for each header, with background
Monad Transformer Workshop
Azad Bolour believes that monad transformers are usually explained with insufficient motivation. He presents them in relation to ordinary function composition, using a novel perspective gained from participating in a monad transformer study group. His talk has three parts: Motivation - why use transformers, how to derive them from first principles Implementation - getting into the specifics of May
The Design and Use of QuickCheck
QuickCheck is the grandfather of property-based testing libraries. Despite being imitated in over thirty languages, the original implementation remains pre-eminent due to the type system and consistent logic of the Haskell language in which it is written. Prior randomized testing tools required learning a special language and grammar to generate complex test cases. QuickCheck embeds the generator
Fast, Elegant Regexes in Haskell
“Typed, elegant and efficient – we can have all three.” Gabriel Gonzalez introduces his new regular expression library which breaks away from the conventional way of using strings to represent regexes. Gabriel’s library treats regexes as algebraic objects that can be combined together much like numbers. Not only is the library beautiful, it’s fast. The latest version approaches the speed of GNU gr
Pragmatic Haskell for Beginners, Lecture 2
In this lecture Alexandr Kurilin shows how to work with the database in Haskell. He shows how the Persistent and Esqueleto libraries create typesafe queries that are checked by the compiler for compatibility with the rest of your code. This builds on top of the example from Lecture 1. Download Video: (HD / SD). Summary Quick recap of last lecture (Sorry, slight video glitch for the first two minut
Pragmatic Haskell for Beginners, Lecture 1
Enough already with the project Euler problems and the monad enlightenment tutorials, how do you make real programs in Haskell? Alexandr Kurilin is going to show you! This lecture series covers starting a project, using test driven development, interacting with a database and the web, and more interesting and pragmatic examples. In lecture one Alex walks you through starting a project, setting up
Software Transactional Memory
Steve Severance has used Software Transactional Memory (STM) pretty intensively in trading and web crawling applications. He shares things he’s learned, some gotchas, and a comparison of the way STM works in Haskell vs other languages. Download Video: (HD / SD). STM in Haskell Summary Motivation for STM CPUs are getting more cores yet our tools remain fairly primitive Locks and lock convoys Dealin
Difference Lists and the Codensity Monad
Mio Alter shares two tricks for Haskell code optimization: the difference list and the codensity monad. The two are related, and have common history dating back to a math theorem from 1854. Watch this video to learn how Haskell’s abstraction allows us to apply ideas from long before the computer age. Download Video: (HD / SD). Summary Slides available here Difference lists and the codensity monad
Demo of IHaskell Notebook
Andrew Gibiansky shows some examples of using IHaskell Notebook, a capable graphical alternative to GHCI. He demonstrates how it can shorten development feedback loops in applications from graphs to parsers, and how the results, a.k.a. notebooks, are easy to share with other people. Download Video: (HD / SD). Summary IHaskell is based on Jupyter and provides an interactive environment for Haskell
A Clear Intro to Lenses
Accessing nested data in Haskell without lenses is “horrifically annoying,” confides Roger Curley. In this talk Roger takes a magnifying glass to lenses, showing how they emerged from the combination of structure modification functions with functors. After motivating lens construction and stepping through how they are evaluated at runtime he finishes with an example of consuming a JSON API. Downlo
What Code Does vs What Code Means
John Wiegley contrasts his work on C compilers with another way of thinking about code, a way he learned through Haskell. He now distinguishes the meaning of a program from the various physical or electronic effects it causes. In this talk John elaborates on the distinction and concludes with a tour of the Free Monad, a way of encoding meaning as a first-class value. Summary Haskell is practical a
FFT With Circat
David Banas uses the Fast Fourier Transform (FFT) in his daily work and is trying to find a way to make the calculation faster. His approach to this specific problem illustrates how to work at a high level of abstraction to minimize definition and maximize derivation. Summary David works with the Fast Fourier Transform which can be optimized with a logarithmic breakdown Conal Elliott used a simila
Phantheck, the Type-Level QuickCheck
Eric Easley wants to get code invariants out of programmers’ heads and into the type system. After trying a dependently typed language he felt it was slow going and decided to try a leaner approach in Haskell. He has invented a library called Phantheck to bring property based testing into the types themselves. This video shows how it works. Summary Phantheck weaves together quickcheck properties a
The Internet of Code
Gabriel Gonzalez explains how to compile a subset of Haskell into typed lambda calculus and share the pieces safely online. He believes that rather than distributing packages or modules we can distibute typed program fragments. This allows programs to be built safely and flexibly. Watch him give an actual demo of building programs from this code ocean. Summary Key idea: we can make it much easier
FP Graph Algorithms
Manipulating graphs has traditionally been seen as a place where imperative programming reigns supreme. Tikhon Jelvis begs to differ, and shows a trick where graph traversal can be expressed by a form of pattern matching. After explaining the approach he simulates how it works on a sample graph. Summary Traditionally graph algorithms are seen as one of the things that are really hard in functional
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Sharing Haskell Builds Across a Team
Efficient Linear Algebra with Plover