query: Constraints, generic variables and arithmetic operators
positive_passages.docid: 103
positive_passages.text: Is there a constraint that restricts my generic method to numeric types?
negative_passages.docid: 113065
negative_passages.text: Proving equivalences of statements equivalent to AC
negative_passages.docid: 86064
negative_passages.text: Argument completions for user-defined functions
negative_passages.docid: 16752
negative_passages.text: Overload resolution and virtual methods
negative_passages.docid: 15842
negative_passages.text: Lambda calculus expression reduction
negative_passages.docid: 93501
negative_passages.text: Order of precedence of set operators
negative_passages.docid: 84014
negative_passages.text: Automated formula construction
negative_passages.docid: 153975
negative_passages.text: Proving mathematical induction with arbitrary base using (weak) induction
negative_passages.docid: 122201
negative_passages.text: Generic constraints, where T : struct and where T : class
negative_passages.docid: 11091
negative_passages.text: About free and bound variables
negative_passages.docid: 72662
negative_passages.text: Why does a generic type constraint result in a no implicit reference conversion error?
negative_passages.docid: 26928
negative_passages.text: Partial type inference
negative_passages.docid: 5220
negative_passages.text: Immutability, Association and typing
negative_passages.docid: 104871
negative_passages.text: Direct cut-elimination for natural deduction.
negative_passages.docid: 62676
negative_passages.text: Generic method with multiple constraints
negative_passages.docid: 16454
negative_passages.text: Enforcing correct variable bindings and avoiding renamings for conflicting variables in nested scoping constructs
negative_passages.docid: 131132
negative_passages.text: Proofs using vector properties