10 commits

Author	SHA1	Message	Date
Simon Cruanes	a1bc186d2e	use ocamlformat	2022-07-14 22:09:13 -04:00
Simon Cruanes	b6df2cd974	clause-less steps in proofs ... these steps are checked only once, to accelerate checking, but the result isn't known.	2022-01-03 22:59:43 -05:00
Simon Cruanes	be1c1573b1	feat(proof): emit is-a terms properly ... these occur in datatypes proofs.	2021-12-28 16:46:59 -05:00
Simon Cruanes	aad1daa4e4	feat(quip): remove lit and not-normalization from quip	2021-11-28 13:36:19 -05:00
Simon Cruanes	72d79d7c0a	fix emission of reference terms	2021-10-29 22:35:19 -04:00
Simon Cruanes	6b1b1eb587	feat(proof): process more steps in proof reconstruction ... also, use names for function application terms, so as to preserve sharing.	2021-10-28 20:48:39 -04:00
Simon Cruanes	0abe4b7020	wip: decode more proof steps to quip	2021-10-27 21:50:28 -04:00
Simon Cruanes	5a6019f834	missing module	2021-10-26 22:04:33 -04:00
Simon Cruanes	4a30a06f87	wip: reconstruct quip proof from binary proof-trace	2021-10-26 21:57:17 -04:00
Simon Cruanes	d8518ae942	wip: standalone module for Quip proofs ... the idea here is that Quip proofs will be built from proof traces, and do not need to depend on any concrete term representation. Their terms, types, etc. match exactly what we know how to print to Quip, and bare no relation to concrete representations used during proof search.	2021-10-25 19:52:00 -04:00