| Fri, 23 Jun 2000 12:24:37 +0200 |
berghofe |
Subject reduction and strong normalization of simply-typed lambda terms.
|
changeset |
files
|
| Fri, 23 Jun 2000 10:43:43 +0200 |
paulson |
new theorem trans_O_subset
|
changeset |
files
|
| Fri, 23 Jun 2000 10:34:51 +0200 |
paulson |
added the AllocImpl example
|
changeset |
files
|
| Fri, 23 Jun 2000 10:34:31 +0200 |
paulson |
genPrefix_trans_O: generalizes genPrefix_trans
|
changeset |
files
|
| Fri, 23 Jun 2000 10:33:46 +0200 |
paulson |
added the allocator refinement proof
|
changeset |
files
|
| Fri, 23 Jun 2000 10:33:11 +0200 |
paulson |
sum_below f n -> setsum f (lessThan n)
|
changeset |
files
|
| Thu, 22 Jun 2000 23:04:34 +0200 |
wenzelm |
bind_thm(s);
|
changeset |
files
|
| Thu, 22 Jun 2000 11:37:13 +0200 |
paulson |
removed some finiteness conditions from bag_of/sublist theorems
|
changeset |
files
|
| Thu, 22 Jun 2000 11:36:08 +0200 |
paulson |
working proofs of the basic merge and distributor properties
|
changeset |
files
|
| Thu, 22 Jun 2000 11:35:28 +0200 |
paulson |
fixed the merge spec (NbT -> Nclients) and added the distributor spec
|
changeset |
files
|
| Thu, 22 Jun 2000 11:34:48 +0200 |
paulson |
new thoerem Always_Follows2; renamed Always_Follows -> Always_Follows1
|
changeset |
files
|
| Wed, 21 Jun 2000 20:38:25 +0200 |
wenzelm |
added with_paths;
|
changeset |
files
|
| Wed, 21 Jun 2000 18:14:28 +0200 |
wenzelm |
fixed deps;
|
changeset |
files
|
| Wed, 21 Jun 2000 18:09:09 +0200 |
wenzelm |
fixed deps;
|
changeset |
files
|
| Wed, 21 Jun 2000 15:58:23 +0200 |
wenzelm |
fixed deps;
|
changeset |
files
|
| Wed, 21 Jun 2000 10:34:33 +0200 |
paulson |
new theorems lepoll_Ord_imp_eqpoll, lesspoll_imp_eqpoll, lesspoll_nat_is_Finite
|
changeset |
files
|
| Wed, 21 Jun 2000 10:32:57 +0200 |
paulson |
new theorem UN_empty; it and Un_empty inserted by AddIffs
|
changeset |
files
|
| Wed, 21 Jun 2000 10:31:34 +0200 |
paulson |
generalized {Domain,Range}_partial_func to {Domain,Range}_Collect_split
|
changeset |
files
|
| Wed, 21 Jun 2000 10:30:36 +0200 |
paulson |
tidied; weakened the (impossible) premises of setsum_UN_disjoint
|
changeset |
files
|
| Tue, 20 Jun 2000 11:54:22 +0200 |
paulson |
new module for heaps
|
changeset |
files
|
| Tue, 20 Jun 2000 11:54:07 +0200 |
paulson |
now uses the heap data structure for BEST_FIRST
|
changeset |
files
|
| Tue, 20 Jun 2000 11:53:35 +0200 |
paulson |
new file heap.ML
|
changeset |
files
|
| Tue, 20 Jun 2000 11:53:16 +0200 |
paulson |
changed the Schubert Steamroller proof
|
changeset |
files
|
| Tue, 20 Jun 2000 11:52:38 +0200 |
paulson |
another brick in the wall
|
changeset |
files
|
| Tue, 20 Jun 2000 11:51:21 +0200 |
paulson |
changed a step for the improved rules for setsum
|
changeset |
files
|
| Tue, 20 Jun 2000 11:50:33 +0200 |
paulson |
deleted a step made redundant by the improved rules for setsum
|
changeset |
files
|
| Tue, 20 Jun 2000 11:42:24 +0200 |
paulson |
replaced the useless [p]subset_insertD by [p]subset_insert_iff
|
changeset |
files
|
| Tue, 20 Jun 2000 11:41:25 +0200 |
paulson |
now setsum f A = 0 unless A is finite
|
changeset |
files
|