| Thu, 30 Mar 2000 19:47:17 +0200 | nipkow | If all termination conditions are proved automatically, | changeset | files |
| Thu, 30 Mar 2000 19:45:51 +0200 | nipkow | recdef.rules -> recdef.simps | changeset | files |
| Thu, 30 Mar 2000 19:45:18 +0200 | nipkow | mod in recdef allows to access the correct simpset via simpset(). | changeset | files |
| Thu, 30 Mar 2000 19:44:11 +0200 | nipkow | the simplification rules returned from TFL are now paired with the row they | changeset | files |
| Thu, 30 Mar 2000 15:13:59 +0200 | wenzelm | * Isar/Pure: local results and corresponding term bindings are now | changeset | files |
| Thu, 30 Mar 2000 15:13:02 +0200 | wenzelm | support Hindley-Milner polymorphisms in results and bindings; | changeset | files |