jmitchell

Keybase proof

I hereby claim:

• I am jmitchell on github.
• I am jmitchell (https://keybase.io/jmitchell) on keybase.
• I have a public key whose fingerprint is A969 0865 30E3 CC01 BF2A 819C 503E 6BF1 7E66 8311

To claim this, I am signing this object:

jmitchell

1 patch for repository http://code.haskell.org/cpphs:

patch 38e413b90da67cc984b4d6873a9d1f5047df2afc
Author: [email protected]
Date:   Sat Feb 18 00:23:36 Coordinated Universal Time 2017
  * Windows path support

New patches:

[Windows path support

jmitchell

#!/usr/bin/env python

import csv
from collections import namedtuple

PriceRecord = namedtuple("PriceRecord", "date open high low close volume adjusted_close")

def parse_date(ymd):
    return map(int, ymd.split('-'))

jmitchell

#!/usr/bin/env python
import xml.etree.ElementTree as ET

tree = ET.parse("senators_cfm.xml")
root = tree.getroot()
for member in root.findall("member"):
    first_name = member.find("first_name").text
    last_name = member.find("last_name").text
    state = member.find("state").text
    phone = member.find("phone").text

jmitchell

Keybase proof

I hereby claim:

• I am jmitchell on github.
• I am jmitchell (https://keybase.io/jmitchell) on keybase.
• I have a public key whose fingerprint is BA46 498D 8842 D2D4 0CD4 3C60 15ED 7FD0 CA4A 70DB

To claim this, I am signing this object:

jmitchell

jmitchell

Require Import Vector.
Import VectorNotations.
Set Implicit Arguments.

Inductive tuple : forall {n : nat}, Vector.t Set n -> Type :=
| unit : tuple []
| push : forall {T : Set} (x : T)
           {n : nat} {ts : Vector.t Set n},
           tuple ts -> tuple (T :: ts).

jmitchell

# Monoids
Basic description of Monoid; Types with an associative binary operation and an identity element; typeclass-doc monoid

Monoid typeclass methods?; "mempty :: a
mappend :: a -> a -> a
mconcat :: [a] -> a"; typeclass-methods monoid

Monoid inherits from?; Nothing; typeclass-inherits-from monoid

typeclass of mempty?; Monoid; method-type monoid

jmitchell

module Main

import Effect.Random
import Effect.StdIO
import Effect.System

getSeed : { [SYSTEM] } Eff Integer
getSeed = do case index' 1 !getArgs of
                  Nothing => pure $ cast !time
                  Just t => pure $ cast t

jmitchell

setInsert : Eq a => Vect n a -> a -> Either (Vect n a) (Vect (S n) a)
setInsert xs x = if elem x xs
                 then Left xs
                 else Right (x :: xs)