Sun, 20 Oct 2019 21:34:29 +0200 |
wenzelm |
more robust hybrid treatment of Pure, notably for Isabelle/Dedukti;
|
changeset |
files
|
Sun, 20 Oct 2019 21:12:18 +0200 |
wenzelm |
clarified signature: name of standard_proof is authentic, otherwise empty;
|
changeset |
files
|
Sun, 20 Oct 2019 20:38:22 +0200 |
wenzelm |
clarified expand_proof/expand_name: allow more detailed control via thm_header;
|
changeset |
files
|
Sun, 20 Oct 2019 16:16:23 +0200 |
wenzelm |
option to export standardized proof terms (not scalable);
|
changeset |
files
|
Sun, 20 Oct 2019 12:56:36 +0200 |
wenzelm |
more kinds, notably for Isabelle/MMT;
|
changeset |
files
|
Sat, 19 Oct 2019 20:41:09 +0200 |
haftmann |
refined proof of concept for bit operations
|
changeset |
files
|
Sat, 19 Oct 2019 20:41:03 +0200 |
haftmann |
more lemmas
|
changeset |
files
|
Sat, 19 Oct 2019 16:16:24 +0200 |
wenzelm |
merged
|
changeset |
files
|
Sat, 19 Oct 2019 16:09:39 +0200 |
wenzelm |
export toplevel proof similar to named PThm;
|
changeset |
files
|
Sat, 19 Oct 2019 15:32:32 +0200 |
wenzelm |
tuned signature;
|
changeset |
files
|
Sat, 19 Oct 2019 11:33:36 +0200 |
wenzelm |
proper protocol_message for bootstrap proofs;
|
changeset |
files
|
Sat, 19 Oct 2019 11:29:39 +0200 |
wenzelm |
proper export of bootstrap proofs (amending a6304b4664b6);
|
changeset |
files
|
Fri, 18 Oct 2019 22:45:09 +0200 |
wenzelm |
more robust -- avoid interference with Proofterm.proofs := 0 in ML_Bootstrap.thy;
|
changeset |
files
|
Fri, 18 Oct 2019 22:44:19 +0200 |
wenzelm |
proper treatment of self thm_id;
|
changeset |
files
|
Sat, 19 Oct 2019 09:15:41 +0000 |
haftmann |
added quickcheck setup
|
changeset |
files
|
Sat, 19 Oct 2019 09:15:37 +0000 |
haftmann |
generalized
|
changeset |
files
|
Fri, 18 Oct 2019 18:41:33 +0000 |
haftmann |
moved quickcheck setup to distribution
|
changeset |
files
|
Fri, 18 Oct 2019 18:41:31 +0000 |
haftmann |
moved generic instance to distribution
|
changeset |
files
|
Fri, 18 Oct 2019 16:25:54 +0200 |
wenzelm |
clarified signature: support partial read_proof to accommodate proof term normalization vs. approximative proof_boxes as upper bound;
|
changeset |
files
|
Thu, 17 Oct 2019 21:52:16 +0200 |
wenzelm |
turn hidden terms into dummy, e.g. relevant for boundary cases of reconstruct_proof;
|
changeset |
files
|
Thu, 17 Oct 2019 21:31:53 +0200 |
wenzelm |
support dummy term;
|
changeset |
files
|
Thu, 17 Oct 2019 21:03:59 +0200 |
wenzelm |
tuned signature;
|
changeset |
files
|
Thu, 17 Oct 2019 20:56:18 +0200 |
wenzelm |
proof boxes based on proof digest (not proof term): thus it works with prune_proofs;
|
changeset |
files
|
Thu, 17 Oct 2019 20:56:09 +0200 |
wenzelm |
proper Thm.transfer;
|
changeset |
files
|
Thu, 17 Oct 2019 20:28:31 +0200 |
wenzelm |
clarified files;
|
changeset |
files
|
Thu, 17 Oct 2019 17:24:13 +0200 |
wenzelm |
clarified proof_boxes (requires prune_proofs=false);
|
changeset |
files
|
Thu, 17 Oct 2019 16:10:44 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
Thu, 17 Oct 2019 14:06:14 +0200 |
wenzelm |
more robust;
|
changeset |
files
|
Wed, 16 Oct 2019 21:55:17 +0200 |
wenzelm |
more robust: avoid looping Lazy.force due to misinterpreted interrupt;
|
changeset |
files
|
Wed, 16 Oct 2019 16:47:21 +0200 |
wenzelm |
more informative combination_proof, e.g. relevant for proper type inference in HOL.Product_Type (with export_proofs);
|
changeset |
files
|