StackRating

An Elo-based rating system for Stack Overflow
Home   |   About   |   Stats and Analysis   |   Get a Badge
Rating Stats for

Will Ness

Rating
1462.45 (4,527,082nd)
Reputation
48,276 (2,117th)
Page: 1 ... 7 8 9 10 11 ... 36
Title Δ
Return a list without the last element +0.72
Is library.readscheme.org permanently down? Where was it moved? 0.00
Why this implementation of Fibonacci is extremely fast? -0.27
What does declaration group mean in context monomorphism restriction? 0.00
What does binding mean in Haskell? 0.00
A mystery involving putStrLn -1.72
Intermediate value in simple Haskell function -1.07
Is there an elegant way to implement this function: `(Monad m) =>... +0.14
Create a new expression without pointer from previous one 0.00
How binding works in function monads in Haskell? -0.16
Arithmetic operations in prolog +0.67
Arithmetic expression evaluation in Haskell +2.56
Equivalence of disjunction operator and definition with several rules -0.63
Understanding (Traversable Product) Type 0.00
Benchmark in GHCi, how can I enable to show number of reductions fo... 0.00
At the top level, results will persist in memory 0.00
Type of "succ(zero)" differs from type of "one"... +0.56
Why is it a memoization function? -0.42
Prolog compress list with quantity -- repeated answers +0.90
How to fix ''couldn't match expected type IO a0 with in... +0.76
Is there any straightforward way to evaluate a recursive function b... -0.59
How do I derive the type for this function: -1.39
Understanding the concept of difference lists 0.00
Euler 26 in Haskell 0.00
Haskell take first and seventh 0.00
Project Euler #24 in Haskell 0.00
Recursive Haskell Function to Determine Position of Element in List +0.48
Determine subset using recursion +0.33
Using foldr to define map (develop) +0.27
Haskell partial function application with $ 0.00
Is there a function in the Haskell standard library that replaces a... -0.18
Writing foldl as foldr confusion -0.84
How to use append/3 in Prolog to find the last 2 elements of a list +0.53
Simple example of call-by-need -1.44
How to see all of the answers in SWI-Prolog without pressing spaceb... +0.51
Predicates with =.. operator in Prolog +1.43
Haskell recursively applying function to every element but first? 0.00
How can I access the members of a custom made class if they are not... +2.32
Define a procedure that takes three numbers as arguments and return... -0.43
A faster way of generating combinations with a given length, preser... +2.23
Haskell - separate a list of pairs in two lists using fold -0.21
Understanding negation in Prolog -1.40
How to make a sorted list of multiples for several numbers? -0.18
Haskell List comprehensions infinite list problem 0.00
How to fix the error ('cannot construct the infinite type')... -0.39
Prolog program comprehension -1.45
Understanding Prolog Lists -1.05
Associative list in Prolog 0.00
Compare two lists and return false if they are not equal scheme -1.66
How to obtain ALL the combinations with repetition of the elements... +0.53