All Python list comprehensions do is [(expression involving foo's) for foo0, …, fooN in (iterable) if (expression involving foo's that should return a boolean-i

All Python list comprehensions do is [(expression involving foo's) for foo0, …, fooN in (iterable) if (expression involving foo's that should return a boolean-ish value)]. Nothing more, nothing less. Nothing that can’t be expressed by filter-then-map. So, given the dictionary {"a": 1, "b": 4, "c": 2}, if you want ["b=4", "c=2"], you can do this in Python: d = {"a": 1, "b": 4, "c": 2} l = [f"{k}={v}" for k, v in d.items() if v % 2 == 0] # replace [] with () if you want a generator instead of a list Or this in C#: var d = new Dictionary<string, int> { {"a", 1}, {"b", 4}, {"c", 2} }; var l = d .Where(pair => pair.Value % 2 == 0) .Select(pair => $"{pair.Key}={pair.Value}") .ToList(); // remove this if you want an IEnumerable<string> instead of a List<string> The Python version has tuple unpacking, whereas the C# version iterates over KeyValuePair<TKey,TValue>. Slightly more typing, and perhaps slightly less ideal if you’re dealing with tuples without field names, but still pretty readable. The C# solution is also more obvious about the execution order. And if you want to sort the output by the dictionary value? l = [f"{k}={v}" for k, v in sorted(d.items(), key=lambda kv: kv[1]) if v % 2 == 0] # 5 3 2 1 2a 4 <- Execution order var l = d // Execution order: 1 .OrderBy(pair => pair.Value) // 2 .Where(pair => pair.Value % 2 == 0) // 3 .Select(pair => $"{pair.Key}={pair.Value}") // 4 .ToList(); // 5