[Haskell-cafe] Free theorem for `forall z. (A,z) -> (B,z)`?

Joachim Breitner mail at joachim-breitner.de
Tue Jul 24 18:47:58 UTC 2018


Am Dienstag, den 24.07.2018, 14:22 -0400 schrieb David Feuer:
> Thank you! Are you going to add a place for auxiliary definitions?

You wish is my command:

Should be online in 10mins or so.

> Perhaps also a few default definitions like lambdabot uses?

What do you mean? It has this background theory:
(copied from free-theorems-webui)

> As it is, there doesn't seem to be a way to use non-Prelude to
> constructors.

That is fixed now, is it?

> One more thing, that was missing from the original: a good
> explanation of what the output means. "lift" is particularly
> mysterious. Lambdabot seems to replace these with calls to normal
> Haskell functions. Perhaps that can be done sometimes?

Pull requests welcome :-)

> One last thing: the FRP interface seems a bit *too* responsive. It's
> not fun to see error messages flashing on and off as I type. Perhaps
> it would make sense to add a delay before activating one of those?

I guess I can use 
for this somehow. But I guess I only want to delay errors, not
successes – I will give it a shot.

Joachim Breitner
  mail at joachim-breitner.de
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 833 bytes
Desc: This is a digitally signed message part
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20180724/b2e0e4ca/attachment.sig>

More information about the Haskell-Cafe mailing list