Paul Chiusano

Also, if it's easy: support `namespace .bar where ...`, allow absolute names for namespaces, so easy to declare definitions in paths that aren't under current namespace.

What do you think of: ``` Map [key1 => a, key2 => b] Set [a, b, c] ``` Where `(=>) a b = (a,b)`, and `Map` (the term) is an...

New user hit this recently, generating confusion.

I think this is kind of a footgun. We could fix either by lazily evaluating and caching (possibly complicated), or just evaluating the pure code strictly when the top level...

Rather than a table up front, you could just have it be built up incrementally on encode/decode, with a way in to format to reference a previously encountered `Reference`.

@stew or @ceedubs could you provide a reproducible test case? :) We do try to print multi-line strings as such, for instance, try: ``` x = """ hello my name...

The old algorithm would strip the first line if it was all whitespace, so you could write things like: ``` x = """ hello """ ``` without it starting with...

@runarorama can you make a branch for this since by the time someone looks at this, `/main` might be in a different state?

Some implementation notes of how this could be done. In `Util.Text.Pattern.hs`, I'd just change: ``` -- Stack used to track captures and to support backtracking. -- A `try` will push...

@runarorama and I discussed this. We considered the question - what should the type of `Nat.fromText` be? (or `decodeUtf8`, or `Map.lookup`, or `zlib.decompress`). Some options: ``` Nat.fromText : Text ->...