query: Building a replacement rule from a pattern, Assocation and RuleDelayed
positive_passages.docid: 152146
positive_passages.text: Pattern matching Association in rules
negative_passages.docid: 14404
negative_passages.text: Functions vs. patterns
negative_passages.docid: 97817
negative_passages.text: How to switch from List of rules to Association?
negative_passages.docid: 151561
negative_passages.text: Proving 'Law of Excluded Middle' in Fitch system
negative_passages.docid: 39443
negative_passages.text: Remove duplicate rules in a list?
negative_passages.docid: 79582
negative_passages.text: Nested Bounded Wildcard
negative_passages.docid: 139259
negative_passages.text: How do I generate a list of delayed rules?
negative_passages.docid: 100095
negative_passages.text: Proving replacement theorem?
negative_passages.docid: 82798
negative_passages.text: A pattern involving Times
negative_passages.docid: 120865
negative_passages.text: Implementing the decorator pattern in Python
negative_passages.docid: 65270
negative_passages.text: How do I perform string matching and replacements?
negative_passages.docid: 80152
negative_passages.text: substitution rules excluding subscripted variables
negative_passages.docid: 158728
negative_passages.text: Using induction for an easy proof for formal languages
negative_passages.docid: 146185
negative_passages.text: Convert a list of rules into 2 lists of integers
negative_passages.docid: 118234
negative_passages.text: How to Combine Pattern Constraints and Default Values for Function Arguments?
negative_passages.docid: 136284
negative_passages.text: Orderless pattern matching
negative_passages.docid: 34667
negative_passages.text: pattern matching in vim