Reed Mullanix

As a workaround, this code works, though it is pretty dirty ```fsharp let rec private (|RecordReduction|_|) expr = let rec traverse env = function | Let(v,e,r) -> traverse (env |>...

I've been thinking about this a bit recently, and have come across the following solution: ``` query Foo { bar { fizz baz { quux } } } #$var1 :...

Build failures are unrelated to this change. Looks like something is up with the `spinner` package.

With [graphql-language-service](https://github.com/graphql/graphiql/tree/master/packages/graphql-language-service) and [lsp-mode](https://github.com/emacs-lsp/lsp-mode), you can get auto-completion with this snippet: ``` (lsp-register-client (make-lsp-client :new-connection (lsp-tcp-connection (lambda (port) `("graphql" "server" "-m" "socket" "-p" ,(number-to-string port)))) :major-modes '(graphql-mode) :initialization-options (lambda ()...

@plt-amy do you have any concrete design suggestions for this?

Good to know about the imminent deprecation! I stumbled across this when I was doing some stuff in `agda-categories` with the category of Setoids, we use it there for morphism...

We can also use the variable machinery to define solvers for commutative monoids/groups pretty easily.

The abelian group one is pretty much mandatory for abelian categories IMO

Tbh this is almost easier than (commutative) rings, as we don't need to worry about any sort of commutation of composition when designing our normal forms.

Yeah, I have most of a new shiny group solver written, will add tonight.