StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Rating Stats for

Sassa NF

Rating
1441.59 (4,534,296th)

Reputation
4,389 (38,043rd)

Page: 1 2 3 ... 4

Title	Δ
Proof about a function that uses rewrite: a "vertical bars in...	0.00
Could not parse the left-hand side (m + 1) * n	-1.70
Convincing Agda that a recursive function is terminating	0.00
Intuition for difference between eta for function from top and empt...	-0.29
Expected std::iter::Iterator, but std::iter::Iterator found	+0.54
About equality in Agda	-0.42
How to prove `theorem : ¬ ⊤ ≡ ⊥` in Agda?	-0.29
How to convince the Agda compiler that an expression terminates?	0.00
Performance analysis	0.00
How to prove ¬ 2 < 1 in agda?	+1.05
Why is pattern matching sometimes "essential" in Agda?	0.00
How do I convert the result?	+2.60
Agda error when checking the inferred type	0.00
Why do function composition and application have a dependent implem...	-0.94
Why J axiom takes 2 x when giving signature of x, y?	-0.74
Re-ordering of assignments and adding a fence	-1.01
Proving a propostion of list L ++ [] ≡ L	+0.63
A more generic Functor class	-1.44
How "with" keyword works in agda ?? and also the code bel...	0.00
Continuation Monad - Int and String	0.00
Calculate N-Ary (with different types !!) Cartesian Product in Hask...	-0.29
What is indexed monad?	-1.23
Why doesn't sleep work?	-1.36
From (a->b) to (MyType->MyType)	-0.41
Construct a pipes Proxy inside-out	+0.65
Refactor pipes interface	0.00
Haskell - Flattening Objects of Lists	+0.56
Applicative's Interchange Law	-1.25
Haskell State monad explanation	+0.82
Haskell - How to transform maximum (xs ++ map (x+) xs) to max (maxi...	+0.45
Convert list op tuples into two lists of one-elemnt tuple	0.00
Haskell: Problems implementing a simple Monad case study	+1.27
refl in agda : explaining congruence property	0.00
How to pass arguments through recursive (tree) evaluation in Haskell	0.00
Use contents of a list as positional arguments to a single multi-ar...	+0.59
Is this proof I wrote correct and what's wrong if not?	-0.42
Is there any way to not use explicit recursion in this algorithm?	-0.57
A theorem prover / proof assistant supporting (multiple) subtyping...	-0.34
Haskell type unfold then fold to another type	+0.56
Confused about functional composition in Haskell	+0.57
In Agda is it possible to define a datatype that has equations?	+0.58
Dependent Types: How is the dependent pair type analogous to a disj...	-0.91
Reading multiline user's input	+0.62
How to find the node that holds the minimum element in a binary tre...	-0.98
Haskell - span elem: evaluation	0.00
Why `Just String` will be wrong in Haskell	-1.46
defining a State' monad which counts the Gets, Puts, Bind and R...	0.00
Looking ahead in Lists with list comprehension	-0.43
Defining division using Haskell	+0.57
Point-free equivalent	+0.73