Clément Pit-Claudel

> No. It's state × list goal → state × list goal, where state is a heap of evars. So by simply applying unification in a goal, you might solve...

> The 8.5 engine simply embraces chaos and represents a partial proof as a blob heap and lets the user define their own meaningful notion themselves. Ah, excellent! I think...

That would be very nice, indeed.

Thanks a lot, sorry for the long delay in my answer. This looks good. I think your link to #5 is quite relevant too, indeed; for now for that I...

Hey Emilio, Pretty cool :) Things seem to be going very nicely. Question: after compiling the latest build and passing async, I can see states being processed in parallel, but...

Data point: apparently it works if I call observe separately on the last state of each proof.

Ok; let me try join :) Can you reproduce the thing I'm seeing in the example above btw?

Cool, thanks. Implemented `Join` in https://github.com/cpitclaudel/elcoq/commit/17c73f175ad7a5f027fddb3bee7a7cee95db0a40. It seems to only process the last proof though (that is, if there are, say, 10 closed proofs, it just observes the last closed...

> Wow it is beautiful !!! Thanks :blush:

Sounds really exciting!