StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Rating Stats for

Cirdec

Rating
1556.33 (6,331st)

Reputation
21,954 (6,027th)

Page: 1 2 3 4 5 6 7 ... 9

Title	Δ
Convert Type Level List to a Value	0.00
How to handle lots of constants in Haskell?	+1.68
Breadth-First Search using State monad in Haskell	+1.99
Haskell - What does the input of a higher-order function look like...	0.00
Memoize Project Euler 116 in Haskell	0.00
Tie-the-knot in 2 dimensions (was: tying the knot with a comonad)	+2.00
Tie-the-knot in 2 dimensions (was: tying the knot with a comonad)	-2.00
How do you parse an Intel Hex Record with applicative functors usin...	+0.45
Optional spaces and multiple alternatives in wl-pprint-extras	0.00
Haskell: Heterogeneous list for data with phantom variable	+0.10
Efficient binary I/O over a network	-0.11
Changing order of expression evaluation on each function call in Ha...	0.00
Retrieve minimum from tree and the tree itself - haskell	+1.24
A data structure for Logical Expressions in Haskell	+0.45
No instance for (Generic (f a)) arising from a use of `from'	0.00
Leaf Trees in Haskell - non-exhaustive pattern	+0.46
What is the fastest way to draw a rectangle in a REPA array?	0.00
How can I prove to GHC that (b ~ Foo)?	-0.37
Finite State Transducers in Haskell?	0.00
GADT Type Inference with Higher-Kinded Types	+0.44
Making continuation monad wrapper instance of Monad class	0.00
Reference variable in quasiquoted LLVM	0.00
Prove that a constraint holds for a component of a product from the...	+0.43
Arrowized EDSL for Writing Lower Level Code	0.00
Is a lazy, breadth-first monadic rose tree unfold possible?	0.00
MonadBaseControl: how to lift simpleHTTP from Happstack?	0.00
Haskell - Calculating the shortest path using trees	0.00
Beginner: Converting Types in Haskell	+2.32
Example of simple parsers in haskell	+2.41
MonadBaseControl: how to lift ThreadGroup	0.00
Generalizing traversal of expressions with changes on specific nodes	0.00
How to define fmap in a GADT Expression?	0.00
Working out the details of a type indexed free monad	-0.60
Working out the details of a type indexed free monad	+1.07
Image Neighbourhood Processing in Haskell	0.00
Efficient version of 'inits'	+1.71
Linking in tree structures	0.00
How to compile Haskell into the untyped lambda calculus (or GHC cor...	0.00
"Inherited" type (via GeneralizedNewtypeDeriving) not usi...	0.00
Using a data type with Constrained fields in place of a Constraint	0.00
How do I make a list of substrings?	-0.22
Do I need Applicative Pretext for using Traversal with Lens?	0.00
Error while invoking a higher-order function	-0.43
Haskell type classes hierarchy	0.00
Scope visibility of anonymous functions	+2.67
Haskell confusion about (Bits a) inferenced type error	-0.73
Permutations one symbol back, Haskell	0.00
Type of `==` in Haskell should be `Eq a b => a -> b -> Bool`	+0.93
Syntax trees: free monad + Bound.Scope	0.00
Haskell Lens Tutorial with traverse	0.00