Interpreting Haskell Inside PostgreSQL With Singleton Types
I am currently in the early stages of a new project, plhaskell. plhaskell is a language handler for PostgreSQL that will allow you to write PostgreSQL functions in Haskell. The project has already taught me a lot, but recently I’ve had a somewhat mind bending encounter with what is almost dependently typed programming in Haskell - and I’ve just got to share it with you. Here’s the problem. At runt
24 Days of Hackage 2013
24 Days of Hackage 2013 2013 in Review linear tasty extensible-effects scotty persistent esqueleto threepenny-gui data-memocombinators sbv gloss heist pandoc async acid-state time repa unordered-containers doctest websockets web-routes-boomerang contravariant profunctors fay Chart Twitter App.net GitHub MusicBrainz Last.fm GoodReads SoundCloud (experimental) SoundCloud (older work) RSS (posts)
24 Days of Hackage: web-routes-boomerang
As you start building larger web applications, it quickly becomes important how you deal with the site’s routing. Managing simple strings rapidly becomes limiting and a maintenance nightmare; we’re so used to type safety, it’s easy to forget how cumbersome it is to pass strings around. Furthermore, we need to ensure that the routes that we accept in are the same links that were placing on web page
24 Days of Hackage: data-memocombinators
Today we look at a tiny little library that packs an awfully strong punch for it’s size. That library is data-memocombinators, maintained by Luke Palmer and Dmitry Malikov. data-memocombinators is one of a handful of memoization libraries available for Haskell, and to me, stands out for its simplicity. Before we go into the library, lets recap on what it means for a function to be memoized, and wh
24 Days of Hackage: sbv
I think you’ve all heard me ramble on about the libraries I find interesting, so today it’s with great pleasure that I turn the spotlight over to Tikhon Jelvis. Enjoy! Today we’re going to talk about sbv, a library for interacting with SMT solvers. SBV stands for “SMT-based verification”; SMT itself stands for “SAT modulo theories” and SAT is “Boolean satisfiability” — three layers of acronyms! Lu
24 Days of Hackage: extensible-effects
To a lot of programmers, the idea of programming with monads is almost synonymous with the idea of programming in Haskell. Of course, to those us who write a lot of Haskell we only consider monads a small part of our work - but it’s true, monads do have a fairly important role in how we structure our computations. Despite the benefits monads give us, they are not without their pain points. For a l
Using indexed free monads to QuickCheck JSON
One of the most satisfying parts of my job is the moment when, after months of devout studying into abstract constructions, I can finally apply what I have learnt to solve problems in the real world. One of these rare moments occured last week, and I’m eager to share what I’ve learnt with you. I’ll walk you through a definition of the problem, my first attempts at solving it, and then at the end w
Asteroids & Netwire
Since my initial foray into functional reactive programming using Netwire, I decided to challenge my newly acquired knowledge by attempting a larger project. I eventually decided to build a clone of the classic Atari game - Asteroids. I’m happy to announce that I’ve now reached a point at which I’m happy to call this complete, and want to share my findings with you in this blog post. Before we go
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
24 Days of Hackage: EKG