Skip to content
Snippets Groups Projects
Commit d8add3c1 authored by Robbert Krebbers's avatar Robbert Krebbers
Browse files

Credit `wf_guard` trick to Georges Gonthier.

parent 15c28d70
No related branches found
No related tags found
No related merge requests found
Hide whitespace changes
Inline Side-by-side
Showing
with 8 additions and 0 deletions
theories/relations.v
+ 8
− 0
View file @ d8add3c1
...@@ -533,6 +533,14 @@ Lemma Acc_impl {A} (R1 R2 : relation A) x : ...@@ -533,6 +533,14 @@ Lemma Acc_impl {A} (R1 R2 : relation A) x :
Proof. induction 1; constructor; naive_solver. Qed. Proof. induction 1; constructor; naive_solver. Qed.
Notation wf := well_founded. Notation wf := well_founded.
(** The function [wf_guard n wfR] adds [2 ^ n - 1] times an [Acc_intro]
constructor ahead of the [wfR] proof. This definition can be used to make
opaque [wf] proofs "compute". For big enough [n], say [32], computation will
reach implementation limits before running into the opaque [wf] proof.
This trick is originally due to Georges Gonthier, see
https://sympa.inria.fr/sympa/arc/coq-club/2007-07/msg00013.html *)
Definition wf_guard `{R : relation A} (n : nat) (wfR : wf R) : wf R := Definition wf_guard `{R : relation A} (n : nat) (wfR : wf R) : wf R :=
Acc_intro_generator n wfR. Acc_intro_generator n wfR.
......
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment