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 2 3 ... 36

Title	Δ
Call By Need in Scheme	0.00
How does Haskell perform Beta conversion to derive a type?	0.00
How count Dijkstra guards sort executions in Prolog	-0.44
Why is foldr not returning undefined when folding over a list conta...	-1.23
What is the difference between square brackets and parentheses in r...	+0.08
How to Implement functions from type signatures?	+0.57
How does haskell break a list in a pattern for head function	-0.93
Haskell Is there a function for creating every variation of applyin...	-1.41
I am struggling to understand how concat is read in Haskell	-1.04
Understanding the type of (,) <$> length <*> head	0.00
Filter bigger element of two lists	+1.22
How can I count the number of times an element is greater than its...	0.00
Summing a finite prefix of an infinite series	-0.11
Haskell binary trees traversal order with fold	0.00
Formal parameters and free variables in dynamic scoping	0.00
Recursion scheme allowing dependencies between recursive calls (an...	+0.56
Flip functor instance Haskell	-0.20
How to pass a value between recursive calls of a function?	+0.49
Space complexity comparison between recursion and dynamic programmi...	+0.48
How to measure the size of a MultTree in Haskell?	0.00
Elegant way to get non empty list or `[[]]` (default value) in Hask...	-0.77
How can I optimize a functional mergesort for large lists	+0.55
Define the function squarefact::Int -> Int that computes for any...	-1.17
How to print individual elements of a list in Haskell?	-1.21
Implementing the transpose of a matrix using only `!!` and `length`	-1.00
Haskell dependent, independent variables in lambda function as appl...	+1.33
Convert a list of strings to a list of integers	-0.75
All combinations of elements of N lists in Haskell	0.00
How does this complex recursive code work?	-1.01
Applying append on mapcon in Lisp	-1.34
Explaining a currying implementation in Haskell	-0.88
Show that term `cons` works by showing all beta reductions	0.00
Can if-structures be used in Haskell list comprehensions?	-1.09
how can a recursive function operate if it returns to the beginning?	-1.73
Recursion and Backtracking in Haskell	0.00
Clean syntax for conditionally folding a list in Haskell	+1.32
Couldn't match expected type [Int] Haskell	0.00
How to define a function with Church numerals in lambda-terms?	0.00
Haskell, How to create a ordered data Set a = Set [a]	-0.64
I cant understand how the function subset(X,Y) works	-1.20
Haskell method that creates infinite list with all combinations of...	+1.77
How does Recursive Backtracking work? Computerphile sodoku solver	-0.73
call cc example racket	0.00
How to access the next element when using the map function?	+2.82
Implementing the map function with a list of indices	+0.54
How to call a predicate that appends two lists in Prolog?	0.00
Function that works like a `sentence` function except that it works...	+0.30
How to merge the elements in a list in a simpler way? Prolog	+2.44
Grouping list elements based on values in list	-1.24
Filtering a list with indexes MIT-scheme	0.00