Thomas E. Hansen d25db9e353 [ papers ] Add implementation of Dekker's algorithm ... This completes the implementation of the examples in the paper "Applications of Applicative Proof Search" (Liam O'Connor, 2016). Unfortunately, the final example is an example of something that _can_ be expressed, but _cannot_ be model-checked by the approach in the paper. (Side note on `petersonsCorrect`: The paper mentions that it checks in ~3 minutes on a 2013 MacBook Pro. Assuming they mean "type-checks", this is roughly consistent with our observations of just short of 2 minutes. I doubt that they evaluated it, since an attempt at doing this on a reasonably modern server (Intel Xeon Gold 5220R, 502 GB of RAM) was killed after just over 3 hours, producing the following resource log: Command exited with non-zero status 255 Time: 11320.46s user, 35.12s system, 3h09m46s elapsed, 99%CPU Memory: 57644016 Kbytes RAM )		2022-10-05 14:30:08 +02:00
..
Data	[ re #2675 ] Do not build libs/{contribs,papers} during bootstrap (#2677)	2022-10-04 13:37:45 +01:00
Language	[ new ] Dependent Tagless Final	2022-01-27 17:26:52 +00:00
Search	[ papers ] Add implementation of Dekker's algorithm	2022-10-05 14:30:08 +02:00
Makefile	[ libs ] move propaganda out of contrib (#2213)	2022-01-25 12:25:55 +00:00
papers.ipkg	[ papers ] Fix impl.n s.t. model-checking Peterson's works	2022-10-05 14:30:08 +02:00