GitLab

pm_reduce just reduces away proof mode terms using cbv; pm_prettify just prettifies user-visible connectors using cbn.
Most uses of pm_default are converted to default to keep the desired reduction behavior.

List literals reduce with a spurious `emp` at the end, which is not pretty.

With a pretty proof by Robbert

make pm_maybe_wand a BI connective; reduce BI connectives and option combinators in the proofmode with cbn

We already do the same for the goal, this avoids some scope
delimiters being displayed.

If the BI is not affine, this should not happen, as it may lead to
information loss.

This commit fixes issue #190.

move test suite out of theories/ so it does not get installed; also check output of test suite so that we can test printing

It now turns the goal into `P` and `<pers> Q`, which is dual to
`iDestruct`, which turns `P ∧ <pers> Q` into `P` and `□ Q`.

This follows the proof at https://en.wikipedia.org/wiki/L%C3%B6b's_theorem#Proof_of_L%C3%B6b's_theorem

This fixes issue #182.

Fixes #176

This reverts commit daaabf41.  We have tests for
testcase, we shouldn't depend on using arcane features in our definitions for
this purpose.  Also, this exposes that there still is a bug somewhere (see the
FIXME).