| Title |
Δ |
| Neater way of writing (Proxy :: Proxy 42) using DataKinds extension
|
0.00 |
| Composable Lensing
|
-1.90 |
| How Agda determines a type is impossible
|
0.00 |
| Formalising regular expressions with a complement operation
|
+0.07 |
| Strong Induction on Lists
|
-0.71 |
| Why does the following typecheck?
|
-2.02 |
| How can I use overloaded record fields with lenses?
|
0.00 |
| Parsec, access last user state after parsing has ended
|
0.00 |
| bifunctor in haskell after the least fixed type
|
+2.01 |
| Type mysteries. Why does this code compile?
|
-0.58 |
| Proving that Multiplication is commutative
|
+1.14 |
| How can I deal with “typedef”-style data types with a minimum of bo...
|
0.00 |
| Why does foldr return immediately?
|
+0.33 |
| Does reflection risk incoherence?
|
0.00 |
| Making `CReal` and `BigFloat e` in Data.Number instances of `Unbox`
|
0.00 |
| Algorithmic complexity of Data.Hashtable
|
+0.32 |
| How to export type constructors when using DataKinds extension?
|
0.00 |
| Free monad and the free operation
|
+1.58 |
| Are constraints possible for new types in Purescript?
|
+0.58 |
| Using lens to add key and value to a nested Map
|
+1.19 |
| How the Haskell garbage collector efficiently collects trees
|
+0.39 |
| Reducing space usage of depth first tree traversal
|
0.00 |
| Singletons in Heterogenous Lists
|
-1.30 |
| Printing the free monad
|
0.00 |
| Is there a way to emulate linear types in Haskell?
|
+0.91 |
| Inferring general typeclass instance from a series of smaller ones?
|
0.00 |
| Could we abstract over type classes?
|
-1.35 |
| Can a `ST`-like monad be executed purely (without the `ST` library)?
|
+0.04 |
| Haskell Aeson to deal with missing data
|
-0.44 |
| "Illegal polymorphic or qualified type" in instance decla...
|
0.00 |
| Haskell: a -> a -> ... -> b to [a] -> b
|
+1.65 |
| How to clean up a level traversal function?
|
-0.24 |
| Restrictions of unboxed types
|
+1.54 |
| Pattern matching on a private data constructor
|
+1.56 |
| How to create a polymorphic unboxed array within ST monad?
|
-1.19 |
| Why does :k [False] result in an error in GHCI?
|
+1.35 |
| Turtle: Prompting for input, without a trailing newline
|
0.00 |
| Recursion-schemes generalization of `tails`
|
+0.30 |
| Singletons, type families, and existential types for a FromJSON ins...
|
+1.59 |
| Propositions vs. boolean values for input validation
|
-2.40 |
| Haskell Polymorphic Recursion with Composed Maps causes Infinite Ty...
|
0.00 |
| How can I perform a scatter/gather operation on types in Haskell?
|
-0.17 |
| How do you create a function like "Data.Vector.modify", t...
|
-1.51 |
| How do I make the GHC recognize a SingI instance in this snippet?
|
0.00 |
| What is the correct way to perform constant-space nested loops in H...
|
+0.36 |
| Why summing native lists is slower than summing church-encoded list...
|
0.00 |
| Can I have a polymorphic function argument that may not need to be...
|
+1.57 |
| Sort list according to a template
|
+1.41 |
| Data.Proxy in servant's public API (why Proxy with ScopedTypeVa...
|
-0.68 |
| Forcing eager evaluation of a Haskell list
|
0.00 |