Scribd
Upload
47 views

Haskell For Lisp Programmers

The document summarizes differences between Lisp and Haskell, including syntax, static typing, laziness, and purity. It also discusses the Haskell Platform tools like cabal, Hackage, and cabal-install. Finally, it provides an overview of the author's work generating bindings from C++ to Lua using Haskell.

Uploaded by

Gheorghe Silviu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
47 views

Haskell For Lisp Programmers

The document summarizes differences between Lisp and Haskell, including syntax, static typing, laziness, and purity. It also discusses the Haskell Platform tools like cabal, Hackage, and cabal-install. Finally, it provides an overview of the author's work generating bindings from C++ to Lua using Haskell.

Uploaded by

Gheorghe Silviu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 27

Haskell for Lisp Programmers

Erik Charlebois

March 4th, 2009


Outline

Differences between Lisp and Haskell


Syntax
Static Types
Laziness
Purity

The Haskell Platform


cabal
Hackage
cabal-install
Other tools

What I’m up to...


Generating bindings to C++
Differences between Lisp and Haskell
Differences between Lisp and Haskell

Lisp and Haskell are opposites.

Haskell Lisp
Syntax No Syntax
Statically Typed Dynamically Typed
Pure Functions Impure Functions
Lazy Evaluation Eager Evaluation
Compile and Run Image-Based
Syntax

Lists and Tuples


> 1 : [2,3]
[1, 2, 3] :: [Integer]
> (1, "Foo")
(1, "Foo") :: (Integer, [Char])

Function Definition
cons x y = (:) x y
cons = (:)
:type cons
cons :: forall a. a -> [a] -> [a]

Function Application
cons 1 (cons 2 [])
cons 1 $ cons 2 []
> :type ($)
($) :: forall a b. (a -> b) -> a -> b
Syntax

Infix Functions
> :info (:)
data [] a = [] | a : [a]
infixr 5 :

infixr 6 ‘cons‘
1 ‘cons‘ 2 : [] -- error, ((:) (cons 1 2) [])

infixr 4 ‘cons‘
cons = (:)
1 ‘cons‘ 2 : [] -- works, (cons 1 ((:) 2 []))
Syntax

Let and Where


add x y = let a = x
b = y
in x + y

add x y = a + b
where a = x
b = y

Case and Guards


foo x y = case x of
0 -> bar y
n -> baz x y

foo x y | x == 0 = bar y
foo x y = baz x yeleganKin
Static Types
Types and Kinds
> :kind Char
Char :: *
> :kind []
[] :: * -> *
> :kind [] Char
[] Char :: *
> :type "foo"
"foo" :: [Char]

Algebraic Data Types


data Tree a = Leaf a | Node (Tree a) (Tree a)

> :kind Tree


Tree :: * -> *
> :type Leaf
Leaf :: forall a. a -> Tree a
> :type Node
Node :: forall a. Tree a -> Tree a -> Tree a
Static Types

Pattern Matching
map fn [] = []
map fn (x:xs) = fn x : map fn xs

Type Classes
class Monoid a where
mempty :: a
mappend :: a -> a -> a
class Foldable t where
fold :: Monoid m => t m -> m
instance Foldable Tree where
fold (Leaf a) = a
fold (Node a b) = fold a ‘mappend‘ fold b

> fold (Node (Node (Leaf [3]) (Leaf [4])) (Leaf [5]))
[3,4,5] :: [Integer]
Laziness

Custom control flow


myif True tp _ = tp
myif False _ fp = fp

Out of order initialization


let x = y + 1; y = 3 in x

Infinite lists
> let x = 1 : 2 : 3 : x
> x
[1,2,3,1,2,3,1,2,3,1,2,3,1,...]
> take 10 x
[1,2,3,1,2,3,1,2,3,1]
Purity

I Functions are pure – no side effects


I Sharing state or enforcing ordering requires threading a value
through calls
I Threading is programmable – Monad type class
I Do notation makes things more readable
Monads

class Monad m where


return :: a -> m a
(>>=) :: m a -> (a -> m b) -> m b

data State s a = State (s -> (s, a))

instance Monad (State s) where


return a = State (\s -> (s, a))
(>>=) (State lhs) rhs = State (\s -> case lhs s of
(s’, a) -> case rhs a of
(State fn) -> fn s’)

getState :: State s s
getState = State (\s -> (s,s))

putState :: s -> State s ()


putState s’ = State (\s -> (s’, ()))

runState :: State s a -> s -> (s, a)


runState (State fn) a = fn a
Monads

incrementBy1 = getState >>= \s -> putState (s + 1)

morefun_nosugar = incrementBy1 >>= \_ ->


getState >>= \s ->
incrementBy1 >>= \_ -> -- has no effect
putState s -- because we put an old state here

morefun_withsugar = do
incrementBy1
s <- getState
incrementBy1
putState s

runfun = runState morefun_withsugar 10

> runfun
11 :: Integer
The Haskell Platform
Haskell Platform

A 2008 proposal for a dependable Haskell platform


I cabal – a standard build system
I hackage – a single site for package hosting
I cabal-install – a standard package management tool
cabal

I Allow developers to easily build conforming packages


I Operating system independent – works on Windows!
I Capable of building mixtures of C and Haskell
Name: interpolatedstring-qq
Version: 0.1
License: BSD3
License-file: LICENSE
Category: Data
Author: Erik Charlebois

library
extensions: TemplateHaskell
build-depends: base, template-haskell, haskell-src-meta
hs-source-dirs: src
exposed-modules: Text.InterpolatedString.QQ
Hackage

I Repository of published packages


I Similar to CPAN, CTAN, Boost, etc
I Haddock documentation for all packages is hosted
I Anyone can upload via web or cabal
cabal-install

I Tool for automatically pulling dependencies and building them


I Similar to apt-get, emerge, etc
erikc@ermac:~$ sudo cabal install hint --global
Resolving dependencies...
Downloading hint-0.3.1.0...
Configuring hint-0.3.1.0...
Preprocessing library hint-0.3.1.0...
Building hint-0.3.1.0...
[ 1 of 21] Compiling Hint.Util
...
[21 of 21] Compiling Language.Haskell.Interpreter.GHC
ar: creating archive dist/build/libHShint-0.3.1.0.a
Installing library in /usr/local/lib/hint-0.3.1.0/ghc-6.10.1
Registering hint-0.3.1.0...
Reading package info from "dist/installed-pkg-config" ... done.
Writing new package config file... done.
Other tools

darcs Distributed source control


quickcheck Random testing for pure functions
hunit Unit testing for non-pure functions
hs-lint Lint for Haskell
haddock Javadoc-style documentation
hscolour Syntax highlighting
hoogle Type-based API search
ghc-core Dumps internal core language used by GHC compiler
Community Activity

I Research
I Formal verification
I Parallelism
I Type theory
I Commercial
I Financial sector (Credit Suisse)
I Security and encryption (Galois)
I Hardware design (Bluespec)
I Procedural city generation (gamr7)
I Multimedia content creation (Anygma)
I Open Source
I Languages (GHC, Pugs)
I Window Manager (xmonad)
I Source Control (darcs)
I Build System, Packaging (cabal)
I Web Applications (happs, hoogle)
What I’m up to...
Personal Preferences

Why I prefer Haskell to Lisp...


I Platform and community
I A good, free implementation
I Strict typing
I Works the same across Mac, Linux and Windows
What I miss from Lisp...
I Macros
I Mixture of compilation and interpretation
I Easy runtime extension
Generating bindings to C++

I Use Dwarf debug information in C++ object files to generate Lua


bindings that can access C++ code
I A Lua debugger expression evaluator for C++
I Tool Components
I Data.Elf
I Data.Dwarf
I Data.Macho
I Data.Pecoff
I InterpolatedString.QQ
I Runtime Components
I "Glua" tool
I Lua runtime
I C runtime
I Interpolated strings uses Template Haskell and Quasiquotation
to do custom syntax for Ruby-style string interpolation
[$istr|x + y is #{x + y}|] -> "x + y is " ++ show (x + y)
Questions?
Interpolated Strings

{-# LANGUAGE TemplateHaskell #-}


module Text.InterpolatedString.QQ (istr) where

import qualified Language.Haskell.TH as TH


import Language.Haskell.TH.Quote
import Language.Haskell.Meta.Parse

-- parseExp :: String -> Either String Exp


-- appE :: ExpQ -> ExpQ -> ExpQ

data Part = Lit String


| Quote String
deriving Show

parseHaskell :: String -> String -> String


parseHaskell a [] = [Lit (reverse a)]
parseHaskell a (’\\’:x:xs) = parseHaskell (x:a) xs
parseHaskell a (’\\’:[]) = parseHaskell (’\\’:a) []
parseHaskell a (’}’:xs) = Quote (reverse a) : parseStr [] xs
parseHaskell a (x:xs) = parseHaskell (x:a) xs
Interpolated Strings

parseStr :: String -> String -> [Part]


parseStr a [] = [Lit (reverse a)]
parseStr a (’\\’:x:xs) = parseStr (x:a) xs
parseStr a (’\\’:[]) = parseStr (’\\’:a) []
parseStr a (’#’:’{’:xs) = Lit (reverse a) : parseHaskell "" xs
parseStr a (x:xs) = parseStr (x:a) xs

makeExpr :: [Part] -> TH.AppE


makeExpr [] = [| "" |]
makeExpr ((Lit a):xs) = TH.appE [| (++) a |] (makeExpr xs)
makeExpr ((Quote a):xs) =
TH.appE [| (++) (show $(strToHaskell a)) |] (makeExpr xs)

strToHaskell :: String -> Exp


strToHaskell s = case parseExp s of
Left s -> TH.report True s >> [| "" |]
Right e -> return e

istr :: QuasiQuoter
istr = QuasiQuoter (makeExpr $ parseStr "") undefined
Interpolated Strings

luaBind dig di | infoTag di == kDW_TAG_member =


let attributes = infoAttributes di
typeName = getTypeName dig (attributes ! kDW_AT_type)
in [$istr|
["#{attributes ! kDW_AT_name}"] = {
typeof = "#{typeName}",
offset = #{attributes ! kDW_AT_data_member_location}
bitsize = #{attributes ! kDW_AT_bit_size},
bitoff = #{attributes ! kDW_AT_bit_offset}, },|]

luaBind dig di | infoTag di == kDW_TAG_structure_type =


let fullName = getTypeName dig di
sizeof = infoAttrs di ! kDW_AT_byte_size
members = filter (== kDW_TAG_member) (infoChilds di)
in [$istr|
["#{fullName}"] = {
mtable = glua.struct_table,
sizeof = #{sizeof},
member = { #{concat (map (luaBind dig) members)} },
}|]

You might also like