query: Understanding Haskell types
positive_passages.docid: 147431
positive_passages.text: Understanding Haskell Type Signatures
negative_passages.docid: 122748
negative_passages.text: Lambda conversions with unclear return type and overload resolution
negative_passages.docid: 111694
negative_passages.text: How does Haskell deal with documentation?
negative_passages.docid: 30961
negative_passages.text: How can I type-check the arguments of a Mathematica function?
negative_passages.docid: 114937
negative_passages.text: Understanding F# Value Restriction Errors
negative_passages.docid: 144166
negative_passages.text: What does the :: mean in C++?
negative_passages.docid: 66993
negative_passages.text: Haskell - What is Control.Applicative.Alternative good for?
negative_passages.docid: 68011
negative_passages.text: (![]+[])[+[]]... Explain why this works
negative_passages.docid: 132786
negative_passages.text: typeof is an operator and a function
negative_passages.docid: 81447
negative_passages.text: Defined behaviour for expressions
negative_passages.docid: 49942
negative_passages.text: Why does this polymorphic C# code print what it does?
negative_passages.docid: 18866
negative_passages.text: what is the meaning of "let x = x in x" and "data Float#" in GHC.Prim in Haskell
negative_passages.docid: 151442
negative_passages.text: What does the text inside parentheses in @interface and @implementation directives mean?
negative_passages.docid: 146082
negative_passages.text: How do I get the numbers for theorems, lemmas, examples, etc. before the type?
negative_passages.docid: 36954
negative_passages.text: What does the construct f[x_] := f[x] = ... mean?
negative_passages.docid: 112406
negative_passages.text: Abstract types versus type parameters
negative_passages.docid: 130617
negative_passages.text: Declaring a single type - "using" equivalent for single type