rampion

Washington, DC

del.icio.us/rampion

Age: 34

Mathematician, programmer, and researcher; with interests in algorithmic design, software engineering theory, and massively parallel computing. I'm also a keyboard junkie and an aspiring language nerd.

15h
awarded Popular Question
22h
awarded Nice Question
2d
comment Simplifying a GADT with Uniplate
Stephen Diehl: but that allows the illegal expression Add (B True) (B True) which the GADT doesn't
2d
comment Simplifying a GADT with Uniplate
Stephen Diehl: the non-GADT versions I can think of seem verbose. What are you thinking of?
2d
comment Reusing patterns in pattern guards or case expressions
I'm working on a uniplate solution now
2d
asked Simplifying a GADT with Uniplate
Aug
14
comment Reusing patterns in pattern guards or case expressions
This might be a situation to use uniplate
Aug
14
comment Tmux: bindings with key sequences
Define "hack" in this context. And like Petr said, can you show us some code that you've tried?
Aug
13
revised Beginning Haskell: A project based....How to I construct a Vector from a (Double, Double)
added 641 characters in body
Aug
13
revised Beginning Haskell: A project based....How to I construct a Vector from a (Double, Double)
added 94 characters in body
Aug
13
revised Beginning Haskell: A project based....How to I construct a Vector from a (Double, Double)
added 1362 characters in body
Aug
13
answered Beginning Haskell: A project based....How to I construct a Vector from a (Double, Double)
Aug
11
comment Bicategories in Haskell
Bob: any more questions?
Aug
10
comment Bicategories in Haskell
Bob: alternately, you could define arr as a simple function, rather than a member of a type lass, with arr :: (Category c, Functor (->) (->) (c x)) => (x -> y) -> c x y; arr f = fmap f id. But again, that would limit which categories you could talk about.
Aug
10
comment Bicategories in Haskell
Bob: like so
Aug
10
revised Bicategories in Haskell
added 13 characters in body
Aug
10
comment Bicategories in Haskell
Bob: True, but you need some way to lift Compose/unCompose from functions to morphism. You could alternately require that the the categories you want to create Functor and Bicategory instances for all support class Composable c where compose :: c (g (f x)) (Compose g f x) ; uncompose :: c (Compose g f x) (g (f x)).
Aug
9
comment Bicategories in Haskell
Bob: See updated solution.
Aug
9
revised Bicategories in Haskell
deleted 458 characters in body
Aug
9
awarded Nice Answer
1 2 3 4 5