The squeal-postgresql package

[ Tags: bsd3, database, library, program ] [ Propose Tags ]

Squeal is a type-safe embedding of PostgreSQL in Haskell

[Skip to Readme]


Dependencies aeson (>= && <2), base (>= && <5), bytestring (>= && <1), deepseq (>= && <2), generics-sop (>= && <1), lifted-base (>= && <1), monad-control (>= && <2), mtl (>=2.2.1 && <3), network-ip (>= && <1), postgresql-binary (>=0.12.1 && <1), postgresql-libpq (>= && <1), scientific (>= && <1), squeal-postgresql, text (>= && <2), time (>= && <2), transformers (>= && <1), transformers-base (>=0.4.4 && <1), uuid (>=1.3.13 && <2) [details]
License BSD3
Copyright Copyright (c) 2017 Morphism, LLC
Author Eitan Chatav
Category Database
Home page
Bug tracker
Source repository head: git clone
Uploaded Fri Sep 29 04:01:45 UTC 2017 by echatav
Distributions NixOS:, Stackage:
Executables squeal-postgresql-example
Downloads 119 total (75 in the last 30 days)
Rating 2.0 (1 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs uploaded by user [build log]
All reported builds failed as of 2017-09-29 [all 3 reports]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees

Readme for squeal-postgresql-

[back to package description]








stack install squeal-postgresql


Squeal is a deep embedding of PostgreSQL in Haskell. Let's see an example!

First, we need some language extensions because Squeal uses modern GHC features.

  , DeriveGeneric
  , OverloadedLabels
  , OverloadedStrings
  , TypeApplications
  , TypeOperators

Here comes the Main module and imports.

module Main (main) where

import Control.Monad.Base (liftBase)
import Data.Int (Int32)
import Data.Text (Text)

import Squeal.PostgreSQL

We'll use generics to easily convert between Haskell and PostgreSQL values.

import qualified Generics.SOP as SOP
import qualified GHC.Generics as GHC

The first step is to define the schema of our database. This is where we use DataKinds and TypeOperators. The schema consists of a type-level list of tables, a ::: pairing of a type level string or Symbol and a list a columns, itself a ::: pairing of a Symbol and a ColumnType. The ColumnType describes the PostgreSQL type of the column as well as whether or not it may contain NULL and whether or not inserts and updates can use a DEFAULT. For our schema, we'll define two tables, a users table and an emails table.

type Schema =
  '[ "users"  :::
       '[ "id"   ::: 'Optional ('NotNull 'PGint4)
        , "name" ::: 'Required ('NotNull 'PGtext)
   , "emails" :::
       '[ "id"      ::: 'Optional ('NotNull 'PGint4)
        , "user_id" ::: 'Required ('NotNull 'PGint4)
        , "email"   ::: 'Required ('Null 'PGtext)

Next, we'll write Definitions to set up and tear down the schema. In Squeal, a Definition is a createTable, alterTable or dropTable command and has two type parameters, corresponding to the schema before being run and the schema after. We can compose definitions using >>>. Here and in the rest of our commands we make use of overloaded labels to refer to named tables and columns in our schema.

setup :: Definition '[] Schema
setup = 
  createTable #users
    ( serial `As` #id :*
      (text & notNull) `As` #name :* Nil )
    [ primaryKey (Column #id :* Nil) ]
  createTable #emails
    ( serial `As` #id :*
      (int & notNull) `As` #user_id :*
      text `As` #email :* Nil )
    [ primaryKey (Column #id :* Nil)
    , foreignKey (Column #user_id :* Nil) #users (Column #id :* Nil)
      OnDeleteCascade OnUpdateCascade ]

Notice that setup starts with an empty schema '[] and produces Schema. In our createTable commands we included TableConstraints to define primary and foreign keys, making them somewhat complex. Our tear down Definition is simpler.

teardown :: Definition Schema '[]
teardown = dropTable #emails >>> dropTable #users

Next, we'll write Manipulations to insert data into our two tables. A Manipulation is an insertInto, update or deleteFrom command and has three type parameters, the schema it refers to, a list of parameters it can take as input, and a list of columns it produces as output. When we insert into the users table, we will need a parameter for the name field but not for the id field. Since it's optional, we can use a default value. However, since the emails table refers to the users table, we will need to retrieve the user id that the insert generates and insert it into the emails table. Take a careful look at the type and definition of both of our inserts.

insertUser :: Manipulation Schema
  '[ 'Required ('NotNull 'PGtext)]
  '[ "fromOnly" ::: 'Required ('NotNull 'PGint4) ]
insertUser = insertInto #users
  ( Values (def `As` #id :* param @1 `As` #name :* Nil) [] )
  OnConflictDoNothing (Returning (#id `As` #fromOnly :* Nil))

insertEmail :: Manipulation Schema
  '[ 'Required ('NotNull 'PGint4), 'Required ('Null 'PGtext)] '[]
insertEmail = insertInto #emails ( Values
  ( def `As` #id :*
    param @1 `As` #user_id :*
    param @2 `As` #email :* Nil) [] )
  OnConflictDoNothing (Returning Nil)

Next we write a Query to retrieve users from the database. We're not interested in the ids here, just the usernames and email addresses. We need to use an inner join to get the right result. A Query is like a Manipulation with the same kind of type parameters.

getUsers :: Query Schema '[]
  '[ "userName" ::: 'Required ('NotNull 'PGtext)
   , "userEmail" ::: 'Required ('Null 'PGtext) ]
getUsers = select
  (#u ! #name `As` #userName :* #e ! #email `As` #userEmail :* Nil)
  ( from (Table (#users `As` #u)
    & InnerJoin (Table (#emails `As` #e))
      (#u ! #id .== #e ! #user_id)) )

Now that we've defined the SQL side of things, we'll need a Haskell type for users. We give the type Generic and HasDatatypeInfo instances so that we can decode the rows we receive when we run getUsers. Notice that the record fields of the User type match the column names of getUsers.

data User = User { userName :: Text, userEmail :: Maybe Text }
  deriving (Show, GHC.Generic)
instance SOP.Generic User
instance SOP.HasDatatypeInfo User

Let's also create some users to add to the database.

users :: [User]
users = 
  [ User "Alice" (Just "")
  , User "Bob" Nothing
  , User "Carole" (Just "")

Now we can put together all the pieces into a program. The program connects to the database, sets up the schema, inserts the user data (using prepared statements as an optimization), queries the user data and prints it out and finally closes the connection. We can thread the changing schema information through by using the indexed PQ monad transformer and when the schema doesn't change we can use Monad and MonadPQ functionality.

main :: IO ()
main = void $
  withConnection "host=localhost port=5432 dbname=exampledb" . runPQ $
    define setup
    & pqThen session
    & thenDefine teardown
    session = do
      idResults <- traversePrepared insertUser (Only . userName <$> users)
      ids <- traverse (fmap fromOnly . getRow (RowNumber 0)) idResults
      traversePrepared_ insertEmail (zip (ids :: [Int32]) (userEmail <$> users))
      usersResult <- runQuery getUsers
      usersRows <- getRows usersResult
      liftBase $ print (usersRows :: [User])