StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Rating Stats for

Dominique Devriese

Rating
1487.66 (4,448,211th)

Reputation
2,710 (62,367th)

Page: 1

Title	Δ
Implementation differences between parser combinators and packrat a...	+4.22
Is this use of GADTs fully equivalent to existential types?	-0.85
Why Haskell typeclasses in Agda are started with `Raw`?	0.00
Dependent type involving nat addition	-3.95
Is there a proof that runST is indeed pure?	-2.44
Why is Haskell fully declarative?	+0.76
Fullscreen and xmonad	0.00
How can I implement generalized "zipn" and "unzipn&q...	-2.28
Why is forall a. a not considered a subtype of Int while I can use...	+0.23
How are c++ concepts different to Haskell typeclasses?	-3.08
How is FRP handled in terms of memory?	-2.38
Haskell Applicative instance clarification	+4.19
Path induction implied	+0.13
In what way is haskells type system more helpful than the type syst...	-1.72
Dependent Types: How is the dependent pair type analogous to a disj...	+1.94
Installing Cabal has missing modules	-3.25
xmonad vertical resize tile/window	0.00
Unexpected pattern match in Haskell	+4.32
Arbitrary class constraints when implementing type classes in Haskell	+4.05
Can you create functions that return functions of a dependent arity...	-3.33
"Flattening" a List in Scala & Haskell	-1.42
How to add a class constraint to a Functor instance declaration in...	-2.83
Idiomatic way to express general computations in Haskell	-3.33
Defining Applicative IO	-0.01
Monadic substitution under binders	0.00
Use type synonym in type declaration mapping	0.00
How to use obvious facts in Agda proofs with "with"?	0.00
Generalized Bottom up Parser Combinators in Haskell	-2.41
Replacing => in place of -> in function type signature	+4.09
Implicit Arguments and Type Families	0.00
Do I need heterogeneous equality?	0.00
Lax monoidal functors with a different monoidal structure	-3.56
How does this particular use of MaybeT work?	-1.58
Transform a function with a typeclass constraint into a function ta...	+1.99
How to define function signatures partially in Haskell?	+4.19
Applicative functors analysis	-3.44
Assisting Agda's termination checker	-2.47
Cabal fails to install Idris language on OSX Lion	+4.02
confused about the type of the Instance of a binary tree data type...	+3.83
Using the value of a computed function for a proof in agda	-3.39
Do agda programs necessarily terminate?	-3.51
Proving a type empty in Agda	0.00
Self-reference in data structure – Checking for equality	+4.11
Defining PrimMonad instance for STT? (ST Transformer)	0.00
Group matches in case expression	-3.18