1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628 5629 5630 5631 5632 5633 5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728 5729 5730 5731 5732 5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748 5749 5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 5784 5785 5786 5787 5788 5789 5790 5791 5792 5793 5794 5795 5796 5797 5798 5799 5800 5801 5802 5803 5804 5805 5806 5807 5808 5809 5810 5811 5812 5813 5814 5815 5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827 5828 5829 5830 5831 5832 5833 5834 5835 5836 5837 5838 5839 5840 5841 5842 5843 5844 5845 5846 5847 5848 5849 5850 5851 5852 5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877 5878 5879 5880 5881 5882 5883 5884 5885 5886 5887 5888 5889 5890 5891 5892 5893 5894 5895 5896 5897 5898 5899 5900 5901 5902 5903 5904 5905 5906 5907 5908 5909 5910 5911 5912 5913 5914 5915 5916 5917 5918 5919 5920 5921 5922 5923 5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940 5941 5942 5943 5944 5945 5946 5947 5948 5949 5950 5951 5952 5953 5954 5955 5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 5967 5968 5969 5970 5971 5972 5973 5974 5975 5976 5977 5978 5979 5980 5981 5982 5983 5984 5985 5986 5987 5988 5989 5990 5991 5992 5993 5994 5995 5996 5997 5998 5999 6000 6001 6002 6003 6004 6005 6006 6007 6008 6009 6010 6011 6012 6013 6014 6015 6016 6017 6018 6019 6020 6021 6022 6023 6024 6025 6026 6027 6028 6029 6030 6031 6032 6033 6034 6035 6036 6037 6038 6039 6040 6041 6042 6043 6044 6045 6046 6047 6048 6049 6050 6051 6052 6053 6054 6055 6056 6057 6058 6059 6060 6061 6062 6063 6064 6065 6066 6067 6068 6069 6070 6071 6072 6073 6074 6075 6076 6077 6078 6079 6080 6081 6082 6083 6084 6085 6086 6087 6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 6107 6108 6109 6110 6111 6112 6113 6114 6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 6125 6126 6127 6128 6129 6130 6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 6143 6144 6145 6146 6147 6148 6149 6150 6151 6152 6153 6154 6155 6156 6157 6158 6159 6160 6161 6162 6163 6164 6165 6166 6167 6168 6169 6170 6171 6172 6173 6174 6175 6176 6177 6178 6179 6180 6181 6182 6183 6184 6185 6186 6187 6188 6189 6190 6191 6192 6193 6194 6195 6196 6197 6198 6199 6200 6201 6202 6203 6204 6205 6206 6207 6208 6209 6210 6211 6212 6213 6214 6215 6216 6217 6218 6219 6220 6221 6222 6223 6224 6225 6226 6227 6228 6229 6230 6231 6232 6233 6234 6235 6236 6237 6238 6239 6240 6241 6242 6243 6244 6245 6246 6247 6248 6249 6250 6251 6252 6253 6254 6255 6256 6257 6258 6259 6260 6261 6262 6263 6264 6265 6266 6267 6268 6269 6270 6271 6272 6273 6274 6275 6276 6277 6278 6279 6280 6281 6282 6283 6284 6285 6286 6287 6288 6289 6290 6291 6292 6293 6294 6295 6296 6297 6298 6299 6300 6301 6302 6303 6304 6305 6306 6307 6308 6309 6310 6311 6312 6313 6314 6315 6316 6317 6318 6319 6320 6321 6322 6323 6324 6325 6326 6327 6328 6329 6330 6331 6332 6333 6334 6335 6336 6337 6338 6339 6340 6341 6342 6343 6344 6345 6346 6347 6348 6349 6350 6351 6352 6353 6354 6355 6356 6357 6358 6359 6360 6361 6362 6363 6364 6365 6366 6367 6368 6369 6370 6371 6372 6373 6374 6375 6376 6377 6378 6379 6380 6381 6382 6383 6384 6385 6386 6387 6388 6389 6390 6391 6392 6393 6394 6395 6396 6397 6398 6399 6400 6401 6402 6403 6404 6405 6406 6407 6408 6409 6410 6411 6412 6413 6414 6415 6416 6417 6418 6419 6420 6421 6422 6423 6424 6425 6426 6427 6428 6429 6430 6431 6432 6433 6434 6435 6436 6437 6438 6439 6440 6441 6442 6443 6444 6445 6446 6447 6448 6449 6450 6451 6452 6453 6454 6455 6456 6457 6458 6459 6460 6461 6462 6463 6464 6465 6466 6467 6468 6469 6470 6471 6472 6473 6474 6475 6476 6477 6478 6479 6480 6481 6482 6483 6484 6485 6486 6487 6488 6489 6490 6491 6492 6493 6494 6495 6496 6497 6498 6499 6500 6501 6502 6503 6504 6505 6506 6507 6508 6509 6510 6511 6512 6513 6514 6515 6516 6517 6518 6519 6520 6521 6522 6523 6524 6525 6526 6527 6528 6529 6530 6531 6532 6533 6534 6535 6536 6537 6538 6539 6540 6541 6542 6543 6544 6545 6546 6547 6548 6549 6550 6551 6552 6553 6554 6555 6556 6557 6558 6559 6560 6561 6562 6563 6564 6565 6566 6567 6568 6569 6570 6571 6572 6573 6574 6575 6576 6577 6578 6579 6580 6581 6582 6583 6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 6598 6599 6600 6601 6602 6603 6604 6605 6606 6607 6608 6609 6610 6611 6612 6613 6614 6615 6616 6617 6618 6619 6620 6621 6622 6623 6624 6625 6626 6627 6628 6629 6630 6631 6632 6633 6634 6635 6636 6637 6638 6639 6640 6641 6642 6643 6644 6645 6646 6647 6648 6649 6650 6651 6652 6653 6654 6655 6656 6657 6658 6659 6660 6661 6662 6663 6664 6665 6666 6667 6668 6669 6670 6671 6672 6673 6674 6675 6676 6677 6678 6679 6680 6681 6682 6683 6684 6685 6686 6687 6688 6689 6690 6691 6692 6693 6694 6695 6696 6697 6698 6699 6700 6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 6712 6713 6714 6715 6716 6717 6718 6719 6720 6721 6722 6723 6724 6725 6726 6727 6728 6729 6730 6731 6732 6733 6734 6735 6736 6737 6738 6739 6740 6741 6742 6743 6744 6745 6746 6747 6748 6749 6750 6751 6752 6753 6754 6755 6756 6757 6758 6759 6760 6761 6762 6763 6764 6765 6766 6767 6768 6769 6770 6771 6772 6773 6774 6775 6776 6777 6778 6779 6780 6781 6782 6783 6784 6785 6786 6787 6788 6789 6790 6791 6792 6793 6794 6795 6796 6797 6798 6799 6800 6801 6802 6803 6804 6805 6806 6807 6808 6809 6810 6811 6812 6813 6814 6815 6816 6817 6818 6819 6820 6821 6822 6823 6824 6825 6826 6827 6828 6829 6830 6831 6832 6833 6834 6835 6836 6837 6838 6839 6840 6841 6842 6843 6844 6845 6846 6847 6848 6849 6850 6851 6852 6853 6854 6855 6856 6857 6858 6859 6860 6861 6862 6863 6864 6865 6866 6867 6868 6869 6870 6871 6872 6873 6874 6875 6876 6877 6878 6879 6880 6881 6882 6883 6884 6885 6886 6887 6888 6889 6890 6891 6892 6893 6894 6895 6896 6897 6898 6899 6900 6901 6902 6903 6904 6905 6906 6907 6908 6909 6910 6911 6912 6913 6914 6915 6916 6917 6918 6919 6920 6921 6922 6923 6924 6925 6926 6927 6928 6929 6930 6931 6932 6933 6934 6935 6936 6937 6938 6939 6940 6941 6942 6943 6944 6945 6946 6947 6948 6949 6950 6951 6952 6953 6954 6955 6956 6957 6958 6959 6960 6961 6962 6963 6964 6965 6966 6967 6968 6969 6970 6971 6972 6973 6974 6975 6976 6977 6978 6979 6980 6981 6982 6983 6984 6985 6986 6987 6988 6989 6990 6991 6992 6993 6994 6995 6996 6997 6998 6999 7000 7001 7002 7003 7004 7005 7006 7007 7008 7009 7010 7011 7012 7013 7014 7015 7016 7017 7018 7019 7020 7021 7022 7023 7024 7025 7026 7027 7028 7029 7030 7031 7032 7033 7034 7035 7036 7037 7038 7039 7040 7041 7042 7043 7044 7045 7046 7047 7048 7049 7050 7051 7052 7053 7054 7055 7056 7057 7058 7059 7060 7061 7062 7063 7064 7065 7066 7067 7068 7069 7070 7071 7072 7073 7074 7075 7076 7077 7078 7079 7080 7081 7082 7083 7084 7085 7086 7087 7088 7089 7090 7091 7092 7093 7094 7095 7096 7097 7098 7099 7100 7101 7102 7103 7104 7105 7106 7107 7108 7109 7110 7111 7112 7113 7114 7115 7116 7117 7118 7119 7120 7121 7122 7123 7124 7125 7126 7127 7128 7129 7130 7131 7132 7133 7134 7135 7136 7137 7138 7139 7140 7141 7142 7143 7144 7145 7146 7147 7148 7149 7150 7151 7152 7153 7154 7155 7156 7157 7158 7159 7160 7161 7162 7163 7164 7165 7166 7167 7168 7169 7170 7171 7172 7173 7174 7175 7176 7177 7178 7179 7180 7181 7182 7183 7184 7185 7186 7187 7188 7189 7190 7191 7192 7193 7194 7195 7196 7197 7198 7199 7200 7201 7202 7203 7204 7205 7206 7207 7208 7209 7210 7211 7212 7213 7214 7215 7216 7217 7218 7219 7220 7221 7222 7223 7224 7225 7226 7227 7228 7229 7230 7231 7232 7233 7234 7235 7236 7237 7238 7239 7240 7241 7242 7243 7244 7245 7246 7247 7248 7249 7250 7251 7252 7253 7254 7255 7256 7257 7258 7259 7260 7261 7262 7263 7264 7265 7266 7267 7268 7269 7270 7271 7272 7273 7274 7275 7276 7277 7278 7279 7280 7281 7282 7283 7284 7285 7286 7287 7288 7289 7290 7291 7292 7293 7294 7295 7296 7297 7298 7299 7300 7301 7302 7303 7304 7305 7306 7307 7308 7309 7310 7311 7312 7313 7314 7315 7316 7317 7318 7319 7320 7321 7322 7323 7324 7325 7326 7327 7328 7329 7330 7331 7332 7333 7334 7335 7336 7337 7338 7339 7340 7341 7342 7343 7344 7345 7346 7347 7348 7349 7350 7351 7352 7353 7354 7355 7356 7357 7358 7359 7360 7361 7362 7363 7364 7365 7366 7367 7368 7369 7370 7371 7372 7373 7374 7375 7376 7377 7378 7379 7380 7381 7382 7383 7384 7385 7386 7387 7388 7389 7390 7391 7392 7393 7394 7395 7396 7397 7398 7399 7400 7401 7402 7403 7404 7405 7406 7407 7408 7409 7410 7411 7412 7413 7414 7415 7416 7417 7418 7419 7420 7421 7422 7423 7424 7425 7426 7427 7428 7429 7430 7431 7432 7433 7434 7435 7436 7437 7438 7439 7440 7441 7442 7443 7444 7445 7446 7447 7448 7449 7450 7451 7452 7453 7454 7455 7456 7457 7458 7459 7460 7461 7462 7463 7464 7465 7466 7467 7468 7469 7470 7471 7472 7473 7474 7475 7476 7477 7478 7479 7480 7481 7482 7483 7484 7485 7486 7487 7488 7489 7490 7491 7492 7493 7494 7495 7496 7497 7498 7499 7500 7501 7502 7503 7504 7505 7506 7507 7508 7509 7510 7511 7512 7513 7514 7515 7516 7517 7518 7519 7520 7521 7522 7523 7524 7525 7526 7527 7528 7529 7530 7531 7532 7533 7534 7535 7536 7537 7538 7539 7540 7541 7542 7543 7544 7545 7546 7547 7548 7549 7550 7551 7552 7553 7554 7555 7556 7557 7558 7559 7560 7561 7562 7563 7564 7565 7566 7567 7568 7569 7570 7571 7572 7573 7574 7575 7576 7577 7578 7579 7580 7581 7582 7583 7584 7585 7586 7587 7588 7589 7590 7591 7592 7593 7594 7595 7596 7597 7598 7599 7600 7601 7602 7603 7604 7605 7606 7607 7608 7609 7610 7611 7612 7613 7614 7615 7616 7617 7618 7619 7620 7621 7622 7623 7624 7625 7626 7627 7628 7629 7630 7631 7632 7633 7634 7635 7636 7637 7638 7639 7640 7641 7642 7643 7644 7645 7646 7647 7648 7649 7650 7651 7652 7653 7654 7655 7656 7657 7658 7659 7660 7661 7662 7663 7664 7665 7666 7667 7668 7669 7670 7671 7672 7673 7674 7675 7676 7677 7678 7679 7680 7681 7682 7683 7684 7685 7686 7687 7688 7689 7690 7691 7692 7693 7694 7695 7696 7697 7698 7699 7700 7701 7702 7703 7704 7705 7706 7707 7708 7709 7710 7711 7712 7713 7714 7715 7716 7717 7718 7719 7720 7721 7722 7723 7724 7725 7726 7727 7728 7729 7730 7731 7732 7733 7734 7735 7736 7737 7738 7739 7740 7741 7742 7743 7744 7745 7746 7747 7748 7749 7750 7751 7752 7753 7754 7755 7756 7757 7758 7759 7760 7761 7762 7763 7764 7765 7766 7767 7768 7769 7770 7771 7772 7773 7774 7775 7776 7777 7778 7779 7780 7781 7782 7783 7784 7785 7786 7787 7788 7789 7790 7791 7792 7793 7794 7795 7796 7797 7798 7799 7800 7801 7802 7803 7804 7805 7806 7807 7808 7809 7810 7811 7812 7813 7814 7815 7816 7817 7818 7819 7820 7821 7822 7823 7824 7825 7826 7827 7828 7829 7830 7831 7832 7833 7834 7835 7836 7837 7838 7839 7840 7841 7842 7843 7844 7845 7846 7847 7848 7849 7850 7851 7852 7853 7854 7855 7856 7857 7858 7859 7860 7861 7862 7863 7864 7865 7866 7867 7868 7869 7870 7871 7872 7873 7874 7875 7876 7877 7878 7879 7880 7881 7882 7883 7884 7885 7886 7887 7888 7889 7890 7891 7892 7893 7894 7895 7896 7897 7898 7899 7900 7901 7902 7903 7904 7905 7906 7907 7908 7909 7910 7911 7912 7913 7914 7915 7916 7917 7918 7919 7920 7921 7922 7923 7924 7925 7926 7927 7928 7929 7930 7931 7932 7933 7934 7935 7936 7937 7938 7939 7940 7941 7942 7943 7944 7945 7946 7947 7948 7949 7950 7951 7952 7953 7954 7955 7956 7957 7958 7959 7960 7961 7962 7963 7964 7965 7966 7967 7968 7969 7970 7971 7972 7973 7974 7975 7976 7977 7978 7979 7980 7981 7982 7983 7984 7985 7986 7987 7988 7989 7990 7991 7992 7993 7994 7995 7996 7997 7998 7999 8000 8001 8002 8003 8004 8005 8006 8007 8008 8009 8010 8011 8012 8013 8014 8015 8016 8017 8018 8019 8020 8021 8022 8023 8024 8025 8026 8027 8028 8029 8030 8031 8032 8033 8034 8035 8036 8037 8038 8039 8040 8041 8042 8043 8044 8045 8046 8047 8048 8049 8050 8051 8052 8053 8054 8055 8056 8057 8058 8059 8060 8061 8062 8063 8064 8065 8066 8067 8068 8069 8070 8071 8072 8073 8074 8075 8076 8077 8078 8079 8080 8081 8082 8083 8084 8085 8086 8087 8088 8089 8090 8091 8092 8093 8094 8095 8096 8097 8098 8099 8100 8101 8102 8103 8104 8105 8106 8107 8108 8109 8110 8111 8112 8113 8114 8115 8116 8117 8118 8119 8120 8121 8122 8123 8124 8125 8126 8127 8128 8129 8130 8131 8132 8133 8134 8135 8136 8137 8138 8139 8140 8141 8142 8143 8144 8145 8146 8147 8148 8149 8150 8151 8152 8153 8154 8155 8156 8157 8158 8159 8160 8161 8162 8163 8164 8165 8166 8167 8168 8169 8170 8171 8172 8173 8174 8175 8176 8177 8178 8179 8180 8181 8182 8183 8184 8185 8186 8187 8188 8189 8190 8191 8192 8193 8194 8195 8196 8197 8198 8199 8200 8201 8202 8203 8204 8205 8206 8207 8208 8209 8210 8211 8212 8213 8214 8215 8216 8217 8218 8219 8220 8221 8222 8223 8224 8225 8226 8227 8228 8229 8230 8231 8232 8233 8234 8235 8236 8237 8238 8239 8240 8241 8242 8243 8244 8245 8246 8247 8248 8249 8250 8251 8252 8253 8254 8255 8256 8257 8258 8259 8260 8261 8262 8263 8264 8265 8266 8267 8268 8269 8270 8271 8272 8273 8274 8275 8276 8277 8278 8279 8280 8281 8282 8283 8284 8285 8286 8287 8288 8289 8290 8291 8292 8293 8294 8295 8296 8297 8298 8299 8300 8301 8302 8303 8304 8305 8306 8307 8308 8309 8310 8311 8312 8313 8314 8315 8316 8317 8318 8319 8320 8321 8322 8323 8324 8325 8326 8327 8328 8329 8330 8331 8332 8333 8334 8335 8336 8337 8338 8339 8340 8341 8342 8343 8344 8345 8346 8347 8348 8349 8350 8351 8352 8353 8354 8355 8356 8357 8358 8359 8360 8361 8362 8363 8364 8365 8366 8367 8368 8369 8370 8371 8372 8373 8374 8375 8376 8377 8378 8379 8380 8381 8382 8383 8384 8385 8386 8387 8388 8389 8390 8391 8392 8393 8394 8395 8396 8397 8398 8399 8400 8401 8402 8403 8404 8405 8406 8407 8408 8409 8410 8411 8412 8413 8414 8415 8416 8417 8418 8419 8420 8421 8422 8423 8424 8425 8426 8427 8428 8429 8430 8431 8432 8433 8434 8435 8436 8437 8438 8439 8440 8441 8442 8443 8444 8445 8446 8447 8448 8449 8450 8451 8452 8453 8454 8455 8456 8457 8458 8459 8460 8461 8462 8463 8464 8465 8466 8467 8468 8469 8470 8471 8472 8473 8474 8475 8476 8477 8478 8479 8480 8481 8482 8483 8484 8485 8486 8487 8488 8489 8490 8491 8492 8493 8494 8495 8496 8497 8498 8499 8500 8501 8502 8503 8504 8505 8506 8507 8508 8509 8510 8511 8512 8513 8514 8515 8516 8517 8518 8519 8520 8521 8522 8523 8524 8525 8526 8527 8528 8529 8530 8531 8532 8533 8534 8535 8536 8537 8538 8539 8540 8541 8542 8543 8544 8545 8546 8547 8548 8549 8550 8551 8552 8553 8554 8555 8556 8557 8558 8559 8560 8561 8562 8563 8564 8565 8566 8567 8568 8569 8570 8571 8572 8573 8574 8575 8576 8577 8578 8579 8580 8581 8582 8583 8584 8585 8586 8587 8588 8589 8590 8591 8592 8593 8594 8595 8596 8597 8598 8599 8600 8601 8602 8603 8604 8605 8606 8607 8608 8609 8610 8611 8612 8613 8614 8615 8616 8617 8618 8619 8620 8621 8622 8623 8624 8625 8626 8627 8628 8629 8630 8631 8632 8633 8634 8635 8636 8637 8638 8639 8640 8641 8642 8643 8644 8645 8646 8647 8648 8649 8650 8651 8652 8653 8654 8655 8656 8657 8658 8659 8660 8661 8662 8663 8664 8665 8666 8667 8668 8669 8670 8671 8672 8673 8674 8675 8676 8677 8678 8679 8680 8681 8682 8683 8684 8685 8686 8687 8688 8689 8690 8691 8692 8693 8694 8695 8696 8697 8698 8699 8700 8701 8702 8703 8704 8705 8706 8707 8708 8709 8710 8711 8712 8713 8714 8715 8716 8717 8718 8719 8720 8721 8722 8723 8724 8725 8726 8727 8728 8729 8730 8731 8732 8733 8734 8735 8736 8737 8738 8739 8740 8741 8742 8743 8744 8745 8746 8747 8748 8749 8750 8751 8752 8753 8754 8755 8756 8757 8758 8759 8760 8761 8762 8763 8764 8765 8766 8767 8768 8769 8770 8771 8772 8773 8774 8775 8776 8777 8778 8779 8780 8781 8782 8783 8784 8785 8786 8787 8788 8789 8790 8791 8792 8793 8794 8795 8796 8797 8798 8799 8800 8801 8802 8803 8804 8805 8806 8807 8808 8809 8810 8811 8812 8813 8814 8815 8816 8817 8818 8819 8820 8821 8822 8823 8824 8825 8826 8827 8828 8829 8830 8831 8832 8833 8834 8835 8836 8837 8838 8839 8840 8841 8842 8843 8844 8845 8846 8847 8848 8849 8850 8851 8852 8853 8854 8855 8856 8857 8858 8859 8860 8861 8862 8863 8864 8865 8866 8867 8868 8869 8870 8871 8872 8873 8874 8875 8876 8877 8878 8879 8880 8881 8882 8883 8884 8885 8886 8887 8888 8889 8890 8891 8892 8893 8894 8895 8896 8897 8898 8899 8900 8901 8902 8903 8904 8905 8906 8907 8908 8909 8910 8911 8912 8913 8914 8915 8916 8917 8918 8919 8920 8921 8922 8923 8924 8925 8926 8927 8928 8929 8930 8931 8932 8933 8934 8935 8936 8937 8938 8939 8940 8941 8942 8943 8944 8945 8946 8947 8948 8949 8950 8951 8952 8953 8954 8955 8956 8957 8958 8959 8960 8961 8962 8963 8964 8965 8966 8967 8968 8969 8970 8971 8972 8973 8974 8975 8976 8977 8978 8979 8980 8981 8982 8983 8984 8985 8986 8987 8988 8989 8990 8991 8992 8993 8994 8995 8996 8997 8998 8999 9000 9001 9002 9003 9004 9005 9006 9007 9008 9009 9010 9011 9012 9013 9014 9015 9016 9017 9018 9019 9020 9021 9022 9023 9024 9025 9026 9027 9028 9029 9030 9031 9032 9033 9034 9035 9036 9037 9038 9039 9040 9041 9042 9043 9044 9045 9046 9047 9048 9049 9050 9051 9052 9053 9054 9055 9056 9057 9058 9059 9060 9061 9062 9063 9064 9065 9066 9067 9068 9069 9070 9071 9072 9073 9074 9075 9076 9077 9078 9079 9080 9081 9082 9083 9084 9085 9086 9087 9088 9089 9090 9091 9092 9093 9094 9095 9096 9097 9098 9099 9100 9101 9102 9103 9104 9105 9106 9107 9108 9109 9110 9111 9112 9113 9114 9115 9116 9117 9118 9119 9120 9121 9122 9123 9124 9125 9126 9127 9128 9129 9130 9131 9132 9133 9134 9135 9136 9137 9138 9139 9140 9141 9142 9143 9144 9145 9146 9147 9148 9149 9150 9151 9152 9153 9154 9155 9156 9157 9158 9159 9160 9161 9162 9163 9164 9165 9166 9167 9168 9169 9170 9171 9172 9173 9174 9175 9176 9177 9178 9179 9180 9181 9182 9183 9184 9185 9186 9187 9188 9189 9190 9191 9192 9193 9194 9195 9196 9197 9198 9199 9200 9201 9202 9203 9204 9205 9206 9207 9208 9209 9210 9211 9212 9213 9214 9215 9216 9217 9218 9219 9220 9221 9222 9223 9224 9225 9226 9227 9228 9229 9230 9231 9232 9233 9234 9235 9236 9237 9238 9239 9240 9241 9242 9243 9244 9245 9246 9247 9248 9249 9250 9251 9252 9253 9254 9255 9256 9257 9258 9259 9260 9261 9262 9263 9264 9265 9266 9267 9268 9269 9270 9271 9272 9273 9274 9275 9276 9277 9278 9279 9280 9281 9282 9283 9284 9285 9286 9287 9288 9289 9290 9291 9292 9293 9294 9295 9296 9297 9298 9299 9300 9301 9302 9303 9304 9305 9306 9307 9308 9309 9310 9311 9312 9313 9314 9315 9316 9317 9318 9319 9320 9321 9322 9323 9324 9325 9326 9327 9328 9329 9330 9331 9332 9333 9334 9335 9336 9337 9338 9339 9340 9341 9342 9343 9344 9345 9346 9347 9348 9349 9350 9351 9352 9353 9354 9355 9356 9357 9358 9359 9360 9361 9362 9363 9364 9365 9366 9367 9368 9369 9370 9371 9372 9373 9374 9375 9376 9377 9378 9379 9380 9381 9382 9383 9384 9385 9386 9387 9388 9389 9390 9391 9392 9393 9394 9395 9396 9397 9398 9399 9400 9401 9402 9403 9404 9405 9406 9407 9408 9409 9410 9411 9412 9413 9414 9415 9416 9417 9418 9419 9420 9421 9422 9423 9424 9425 9426 9427 9428 9429 9430 9431 9432 9433 9434 9435 9436 9437 9438 9439 9440 9441 9442 9443 9444 9445 9446 9447 9448 9449 9450 9451 9452 9453 9454 9455 9456 9457 9458 9459 9460 9461 9462 9463 9464 9465 9466 9467 9468 9469 9470 9471 9472 9473 9474 9475 9476 9477 9478 9479 9480 9481 9482 9483 9484 9485 9486 9487 9488 9489 9490 9491 9492 9493 9494 9495 9496 9497 9498 9499 9500 9501 9502 9503 9504 9505 9506 9507 9508 9509 9510 9511 9512 9513 9514 9515 9516 9517 9518 9519 9520 9521 9522 9523 9524 9525 9526 9527 9528 9529 9530 9531 9532 9533 9534 9535 9536 9537 9538 9539 9540 9541 9542 9543 9544 9545 9546 9547 9548 9549 9550 9551 9552 9553 9554 9555 9556 9557 9558 9559 9560 9561 9562 9563 9564 9565 9566 9567 9568 9569 9570 9571 9572 9573 9574 9575 9576 9577 9578 9579 9580 9581 9582 9583 9584 9585 9586 9587 9588 9589 9590 9591 9592 9593 9594 9595 9596 9597 9598 9599 9600 9601 9602 9603 9604 9605 9606 9607 9608 9609 9610 9611 9612 9613 9614 9615 9616 9617 9618 9619 9620 9621 9622 9623 9624 9625 9626 9627 9628 9629 9630 9631 9632 9633 9634 9635 9636 9637 9638 9639 9640 9641 9642 9643 9644 9645 9646 9647 9648 9649 9650 9651 9652 9653 9654 9655 9656 9657 9658 9659 9660 9661 9662 9663 9664 9665 9666 9667 9668 9669 9670 9671 9672 9673 9674 9675 9676 9677 9678 9679 9680 9681 9682 9683 9684 9685 9686 9687 9688 9689 9690 9691 9692 9693 9694 9695 9696 9697 9698 9699 9700 9701 9702 9703 9704 9705 9706 9707 9708 9709 9710 9711 9712 9713 9714 9715 9716 9717 9718 9719 9720 9721 9722 9723 9724 9725 9726 9727 9728 9729 9730 9731 9732 9733 9734 9735 9736 9737 9738 9739 9740 9741 9742 9743 9744 9745 9746 9747 9748 9749 9750 9751 9752 9753 9754 9755 9756 9757 9758 9759 9760 9761 9762 9763 9764 9765 9766 9767 9768 9769 9770 9771 9772 9773 9774 9775 9776 9777 9778 9779 9780 9781 9782 9783 9784 9785 9786 9787 9788 9789 9790 9791 9792 9793 9794 9795 9796 9797 9798 9799 9800 9801 9802 9803 9804 9805 9806 9807 9808 9809 9810 9811 9812 9813 9814 9815 9816 9817 9818 9819 9820 9821 9822 9823 9824 9825 9826 9827 9828 9829 9830 9831 9832 9833 9834 9835 9836 9837 9838 9839 9840 9841 9842 9843 9844 9845 9846 9847 9848 9849 9850 9851 9852 9853 9854 9855 9856 9857 9858 9859 9860 9861 9862 9863 9864 9865 9866 9867 9868 9869 9870 9871 9872 9873 9874 9875 9876 9877 9878 9879 9880 9881 9882 9883 9884 9885 9886 9887 9888 9889 9890 9891 9892 9893 9894 9895 9896 9897 9898 9899 9900 9901 9902 9903 9904 9905 9906 9907 9908 9909 9910 9911 9912 9913 9914 9915 9916 9917 9918 9919 9920 9921 9922 9923 9924 9925 9926 9927 9928 9929 9930 9931 9932 9933 9934 9935 9936 9937 9938 9939 9940 9941 9942 9943 9944 9945 9946 9947 9948 9949 9950 9951 9952 9953 9954 9955 9956 9957 9958 9959 9960 9961 9962 9963 9964 9965 9966 9967 9968 9969 9970 9971 9972 9973 9974 9975 9976 9977 9978 9979 9980 9981 9982 9983 9984 9985 9986 9987 9988 9989 9990 9991 9992 9993 9994 9995 9996 9997 9998 9999 10000 10001 10002 10003 10004 10005 10006 10007 10008 10009 10010 10011 10012 10013 10014 10015 10016 10017 10018 10019 10020 10021 10022 10023 10024 10025 10026 10027 10028 10029 10030 10031 10032 10033 10034 10035 10036 10037 10038 10039 10040 10041 10042 10043 10044 10045 10046 10047 10048 10049 10050 10051 10052 10053 10054 10055 10056 10057 10058 10059 10060 10061 10062 10063 10064 10065 10066 10067 10068 10069 10070 10071 10072 10073 10074 10075 10076 10077 10078 10079 10080 10081 10082 10083 10084 10085 10086 10087 10088 10089 10090 10091 10092 10093 10094 10095 10096 10097 10098 10099 10100 10101 10102 10103 10104 10105 10106 10107 10108 10109 10110 10111 10112 10113 10114 10115 10116 10117 10118 10119 10120 10121 10122 10123 10124 10125 10126 10127 10128 10129 10130 10131 10132 10133 10134 10135 10136 10137 10138 10139 10140 10141 10142 10143 10144 10145 10146 10147 10148 10149 10150 10151 10152 10153 10154 10155 10156 10157 10158 10159 10160 10161 10162 10163 10164 10165 10166 10167 10168 10169 10170 10171 10172 10173 10174 10175 10176 10177 10178 10179 10180 10181 10182 10183 10184 10185 10186 10187 10188 10189 10190 10191 10192 10193 10194 10195 10196 10197 10198 10199 10200 10201 10202 10203 10204 10205 10206 10207 10208 10209 10210 10211 10212 10213 10214 10215 10216 10217 10218 10219 10220 10221 10222 10223 10224 10225 10226 10227 10228 10229 10230 10231 10232 10233 10234 10235 10236 10237 10238 10239 10240 10241 10242 10243 10244 10245 10246 10247 10248 10249 10250 10251 10252 10253 10254 10255 10256 10257 10258 10259 10260 10261 10262 10263 10264 10265 10266 10267 10268 10269 10270 10271 10272 10273 10274 10275 10276 10277 10278 10279 10280 10281 10282 10283 10284 10285 10286 10287 10288 10289 10290 10291 10292 10293 10294 10295 10296 10297 10298 10299 10300 10301 10302 10303 10304 10305 10306 10307 10308 10309 10310 10311 10312 10313 10314 10315 10316 10317 10318 10319 10320 10321 10322 10323 10324 10325 10326 10327 10328 10329 10330 10331 10332 10333 10334 10335 10336 10337 10338 10339 10340 10341 10342 10343 10344 10345 10346 10347 10348 10349 10350 10351 10352 10353 10354 10355 10356 10357 10358 10359 10360 10361 10362 10363 10364 10365 10366 10367 10368 10369 10370 10371 10372 10373 10374 10375 10376 10377 10378 10379 10380 10381 10382 10383 10384 10385 10386 10387 10388 10389 10390 10391 10392 10393 10394 10395 10396 10397 10398 10399 10400 10401 10402 10403 10404 10405 10406 10407 10408 10409 10410 10411 10412 10413 10414 10415 10416 10417 10418 10419 10420 10421 10422 10423 10424 10425 10426 10427 10428 10429 10430 10431 10432 10433 10434 10435 10436 10437 10438 10439 10440 10441 10442 10443 10444 10445 10446 10447 10448 10449 10450 10451 10452 10453 10454 10455 10456 10457 10458 10459 10460 10461 10462 10463 10464 10465 10466 10467 10468 10469 10470 10471 10472 10473 10474 10475 10476 10477 10478 10479 10480 10481 10482 10483 10484 10485 10486 10487 10488 10489 10490 10491 10492 10493 10494 10495 10496 10497 10498 10499 10500 10501 10502 10503 10504 10505 10506 10507 10508 10509 10510 10511 10512 10513 10514 10515 10516 10517 10518 10519 10520 10521 10522 10523 10524 10525 10526 10527 10528 10529 10530 10531 10532 10533 10534 10535 10536 10537 10538 10539 10540 10541 10542 10543 10544 10545 10546 10547 10548 10549 10550 10551 10552 10553 10554 10555 10556 10557 10558 10559 10560 10561 10562 10563 10564 10565 10566 10567 10568 10569 10570 10571 10572 10573 10574 10575 10576 10577 10578 10579 10580 10581 10582 10583 10584 10585 10586 10587 10588 10589 10590 10591 10592 10593 10594 10595 10596 10597 10598 10599 10600 10601 10602 10603 10604 10605 10606 10607 10608 10609 10610 10611 10612 10613 10614 10615 10616 10617 10618 10619 10620 10621 10622 10623 10624 10625 10626 10627 10628 10629 10630 10631 10632 10633 10634 10635 10636 10637 10638 10639 10640 10641 10642 10643 10644 10645 10646 10647 10648 10649 10650 10651 10652 10653 10654 10655 10656 10657 10658 10659 10660 10661 10662 10663 10664 10665 10666 10667 10668 10669 10670 10671 10672 10673 10674 10675 10676 10677 10678 10679 10680 10681 10682 10683 10684 10685 10686 10687 10688 10689 10690 10691 10692 10693 10694 10695 10696 10697 10698 10699 10700 10701 10702 10703 10704 10705 10706 10707 10708 10709 10710 10711 10712 10713 10714 10715 10716 10717 10718 10719 10720 10721 10722 10723 10724 10725 10726 10727 10728 10729 10730 10731 10732 10733 10734 10735 10736 10737 10738 10739 10740 10741 10742 10743 10744 10745 10746 10747 10748 10749 10750 10751 10752 10753 10754 10755 10756 10757 10758 10759 10760 10761 10762 10763 10764 10765 10766 10767 10768 10769 10770 10771 10772 10773 10774 10775 10776 10777 10778 10779 10780 10781 10782 10783 10784 10785 10786 10787 10788 10789 10790 10791 10792 10793 10794 10795 10796 10797 10798 10799 10800 10801 10802 10803 10804 10805 10806 10807 10808 10809 10810 10811 10812 10813 10814 10815 10816 10817 10818 10819 10820 10821 10822 10823 10824 10825 10826 10827 10828 10829 10830 10831 10832 10833 10834 10835 10836 10837 10838 10839 10840 10841 10842 10843 10844 10845 10846 10847 10848 10849 10850 10851 10852 10853 10854 10855 10856 10857 10858 10859 10860 10861 10862 10863 10864 10865 10866 10867 10868 10869 10870 10871 10872 10873 10874 10875 10876 10877 10878 10879 10880 10881 10882 10883 10884 10885 10886 10887 10888 10889 10890 10891 10892 10893 10894 10895 10896 10897 10898 10899 10900 10901 10902 10903 10904 10905 10906 10907 10908 10909 10910 10911 10912 10913 10914 10915 10916 10917 10918 10919 10920 10921 10922 10923 10924 10925 10926 10927 10928 10929 10930 10931 10932 10933 10934 10935 10936 10937 10938 10939 10940 10941 10942 10943 10944 10945 10946 10947 10948 10949 10950 10951 10952 10953 10954 10955 10956 10957 10958 10959 10960 10961 10962 10963 10964 10965 10966 10967 10968 10969 10970 10971 10972 10973 10974 10975 10976 10977 10978 10979 10980 10981 10982 10983 10984 10985 10986 10987 10988 10989 10990 10991 10992 10993 10994 10995 10996 10997 10998 10999 11000 11001 11002 11003 11004 11005 11006 11007 11008 11009 11010 11011 11012 11013 11014 11015 11016 11017 11018 11019 11020 11021 11022 11023 11024 11025 11026 11027 11028 11029 11030 11031 11032 11033 11034 11035 11036 11037 11038 11039 11040 11041 11042 11043 11044 11045 11046 11047 11048 11049 11050 11051 11052 11053 11054 11055 11056 11057 11058 11059 11060 11061 11062 11063 11064 11065 11066 11067 11068 11069 11070 11071 11072 11073 11074 11075 11076 11077 11078 11079 11080 11081 11082 11083 11084 11085 11086 11087 11088 11089 11090 11091 11092 11093 11094 11095 11096 11097 11098 11099 11100 11101 11102 11103 11104 11105 11106 11107 11108 11109 11110 11111 11112 11113 11114 11115 11116 11117 11118 11119 11120 11121 11122 11123 11124 11125 11126 11127 11128 11129 11130 11131 11132 11133 11134 11135 11136 11137 11138 11139 11140 11141 11142 11143 11144 11145 11146 11147 11148 11149 11150 11151 11152 11153 11154 11155 11156 11157 11158 11159 11160 11161 11162 11163 11164 11165 11166 11167 11168 11169 11170 11171 11172 11173 11174 11175 11176 11177 11178 11179 11180 11181 11182 11183 11184 11185 11186 11187 11188 11189 11190 11191 11192 11193 11194 11195 11196 11197 11198 11199 11200 11201 11202 11203 11204 11205 11206 11207 11208 11209 11210 11211 11212 11213 11214 11215 11216 11217 11218 11219 11220 11221 11222 11223 11224 11225 11226 11227 11228 11229 11230 11231 11232 11233 11234 11235 11236 11237 11238 11239 11240 11241 11242 11243 11244 11245 11246 11247 11248 11249 11250 11251 11252 11253 11254 11255 11256 11257 11258 11259 11260 11261 11262 11263 11264 11265 11266 11267 11268 11269 11270 11271 11272 11273 11274 11275 11276 11277 11278 11279 11280 11281 11282 11283 11284 11285 11286 11287 11288 11289 11290 11291 11292 11293 11294 11295 11296 11297 11298 11299 11300 11301 11302 11303 11304 11305 11306 11307 11308 11309 11310 11311 11312 11313 11314 11315 11316 11317 11318 11319 11320 11321 11322 11323 11324 11325 11326 11327 11328 11329 11330 11331 11332 11333 11334 11335 11336 11337 11338 11339 11340 11341 11342 11343 11344 11345 11346 11347 11348 11349 11350 11351 11352 11353 11354 11355 11356 11357 11358 11359 11360 11361 11362 11363 11364 11365 11366 11367 11368 11369 11370 11371 11372 11373 11374 11375 11376 11377 11378 11379 11380 11381 11382 11383 11384 11385 11386 11387 11388 11389 11390 11391 11392 11393 11394 11395 11396 11397 11398 11399 11400 11401 11402 11403 11404 11405 11406 11407 11408 11409 11410 11411 11412 11413 11414 11415 11416 11417 11418 11419 11420 11421 11422 11423 11424 11425 11426 11427 11428 11429 11430 11431 11432 11433 11434 11435 11436 11437 11438 11439 11440 11441 11442 11443 11444 11445 11446 11447 11448 11449 11450 11451 11452 11453 11454 11455 11456 11457 11458 11459 11460 11461 11462 11463 11464 11465 11466 11467 11468 11469 11470 11471 11472 11473 11474 11475 11476 11477 11478 11479 11480 11481 11482 11483 11484 11485 11486 11487 11488 11489 11490 11491 11492 11493 11494 11495 11496 11497 11498 11499 11500 11501 11502 11503 11504 11505 11506 11507 11508 11509 11510 11511 11512 11513 11514 11515 11516 11517 11518 11519 11520 11521 11522 11523 11524 11525 11526 11527 11528 11529 11530 11531 11532 11533 11534 11535 11536 11537 11538 11539 11540 11541 11542 11543 11544 11545 11546 11547 11548 11549 11550 11551 11552 11553 11554 11555 11556 11557 11558 11559 11560 11561 11562 11563 11564 11565 11566 11567 11568 11569 11570 11571 11572 11573 11574 11575 11576 11577 11578 11579 11580 11581 11582 11583 11584 11585 11586 11587 11588 11589 11590 11591 11592 11593 11594 11595 11596 11597 11598 11599 11600 11601 11602 11603 11604 11605 11606 11607 11608 11609 11610 11611 11612 11613 11614 11615 11616 11617 11618 11619 11620 11621 11622 11623 11624 11625 11626 11627 11628 11629 11630 11631 11632 11633 11634 11635 11636 11637 11638 11639 11640 11641 11642 11643 11644 11645 11646 11647 11648 11649 11650 11651 11652 11653 11654 11655 11656 11657 11658 11659 11660 11661 11662 11663 11664 11665 11666 11667 11668 11669 11670 11671 11672 11673 11674 11675 11676 11677 11678 11679 11680 11681 11682 11683 11684 11685 11686 11687 11688 11689 11690 11691 11692 11693 11694 11695 11696 11697 11698 11699 11700 11701 11702 11703 11704 11705 11706 11707 11708 11709 11710 11711 11712 11713 11714 11715 11716 11717 11718 11719 11720 11721 11722 11723 11724 11725 11726 11727 11728 11729 11730 11731 11732 11733 11734 11735 11736 11737 11738 11739 11740 11741 11742 11743 11744 11745 11746 11747 11748 11749 11750 11751 11752 11753 11754 11755 11756 11757 11758 11759 11760 11761 11762 11763 11764 11765 11766 11767 11768 11769 11770 11771 11772 11773 11774 11775 11776 11777 11778 11779 11780 11781 11782 11783 11784 11785 11786 11787 11788 11789 11790 11791 11792 11793 11794 11795 11796 11797 11798 11799 11800 11801 11802 11803 11804 11805 11806 11807 11808 11809 11810 11811 11812 11813 11814 11815 11816 11817 11818 11819 11820 11821 11822 11823 11824 11825 11826 11827 11828 11829 11830 11831 11832 11833 11834 11835 11836 11837 11838 11839 11840 11841 11842 11843 11844 11845 11846 11847 11848 11849 11850 11851 11852 11853 11854 11855 11856 11857 11858 11859 11860 11861 11862 11863 11864 11865 11866 11867 11868 11869 11870 11871 11872 11873 11874 11875 11876 11877 11878 11879 11880 11881 11882 11883 11884 11885 11886 11887 11888 11889 11890 11891 11892 11893 11894 11895 11896 11897 11898 11899 11900 11901 11902 11903 11904 11905 11906 11907 11908 11909 11910 11911 11912 11913 11914 11915 11916 11917 11918 11919 11920 11921 11922 11923 11924 11925 11926 11927 11928 11929 11930 11931 11932 11933 11934 11935 11936 11937 11938 11939 11940 11941 11942 11943 11944 11945 11946 11947 11948 11949 11950 11951 11952 11953 11954 11955 11956 11957 11958 11959 11960 11961 11962 11963 11964 11965 11966 11967 11968 11969 11970 11971 11972 11973 11974 11975 11976 11977 11978 11979 11980 11981 11982 11983 11984 11985 11986 11987 11988 11989 11990 11991 11992 11993 11994 11995 11996 11997 11998 11999 12000 12001 12002 12003 12004 12005 12006 12007 12008 12009 12010 12011 12012 12013 12014 12015 12016 12017 12018 12019 12020 12021 12022 12023 12024 12025 12026 12027 12028 12029 12030 12031 12032 12033 12034 12035 12036 12037 12038 12039 12040 12041 12042 12043 12044 12045 12046 12047 12048 12049 12050 12051 12052 12053 12054 12055 12056 12057 12058 12059 12060 12061 12062 12063 12064 12065 12066 12067 12068 12069 12070 12071 12072 12073 12074 12075 12076 12077 12078 12079 12080 12081 12082 12083 12084 12085 12086 12087 12088 12089 12090 12091 12092 12093 12094 12095 12096 12097 12098 12099 12100 12101 12102 12103 12104 12105 12106 12107 12108 12109 12110 12111 12112 12113 12114 12115 12116 12117 12118 12119 12120 12121 12122 12123 12124 12125 12126 12127 12128 12129 12130 12131 12132 12133 12134 12135 12136 12137 12138 12139 12140 12141 12142 12143 12144 12145 12146 12147 12148 12149 12150 12151 12152 12153 12154 12155 12156 12157 12158 12159 12160 12161 12162 12163 12164 12165 12166 12167 12168 12169 12170 12171 12172 12173 12174 12175 12176 12177 12178 12179 12180 12181 12182 12183 12184 12185 12186 12187 12188 12189 12190 12191 12192 12193 12194 12195 12196 12197 12198 12199 12200 12201 12202 12203 12204 12205 12206 12207 12208 12209 12210 12211 12212 12213 12214 12215 12216 12217 12218 12219 12220 12221 12222 12223 12224 12225 12226 12227 12228 12229 12230 12231 12232 12233 12234 12235 12236 12237 12238 12239 12240 12241 12242 12243 12244 12245 12246 12247 12248 12249 12250 12251 12252 12253 12254 12255 12256 12257 12258 12259 12260 12261 12262 12263 12264 12265 12266 12267 12268 12269 12270 12271 12272 12273 12274 12275 12276 12277 12278 12279 12280 12281 12282 12283 12284 12285 12286 12287 12288 12289 12290 12291 12292 12293 12294 12295 12296 12297 12298 12299 12300 12301 12302 12303 12304 12305 12306 12307 12308 12309 12310 12311 12312 12313 12314 12315 12316 12317 12318 12319 12320 12321 12322 12323 12324 12325 12326 12327 12328 12329 12330 12331 12332 12333 12334 12335 12336 12337 12338 12339 12340 12341 12342 12343 12344 12345 12346 12347 12348 12349 12350 12351 12352 12353 12354 12355 12356 12357 12358 12359 12360 12361 12362 12363 12364 12365 12366 12367 12368 12369 12370 12371 12372 12373 12374 12375 12376 12377 12378 12379 12380 12381 12382 12383 12384 12385 12386 12387 12388 12389 12390 12391 12392 12393 12394 12395 12396 12397 12398 12399 12400 12401 12402 12403 12404 12405 12406 12407 12408 12409 12410 12411 12412 12413 12414 12415 12416 12417 12418 12419 12420 12421 12422 12423 12424 12425 12426 12427 12428 12429 12430 12431 12432 12433 12434 12435 12436 12437 12438 12439 12440 12441 12442 12443 12444 12445 12446 12447 12448 12449 12450 12451 12452 12453 12454 12455 12456 12457 12458 12459 12460 12461 12462 12463 12464 12465 12466 12467 12468 12469 12470 12471 12472 12473 12474 12475 12476 12477 12478 12479 12480 12481 12482 12483 12484 12485 12486 12487 12488 12489 12490 12491 12492 12493 12494 12495 12496 12497 12498 12499 12500 12501 12502 12503 12504 12505 12506 12507 12508 12509 12510 12511 12512 12513 12514 12515 12516 12517 12518 12519 12520 12521 12522 12523 12524 12525 12526 12527 12528 12529 12530 12531 12532 12533 12534 12535 12536 12537 12538 12539 12540 12541 12542 12543 12544 12545 12546 12547 12548 12549 12550 12551 12552 12553 12554 12555 12556 12557 12558 12559 12560 12561 12562 12563 12564 12565 12566 12567 12568 12569 12570 12571 12572 12573 12574 12575 12576 12577 12578 12579 12580 12581 12582 12583 12584 12585 12586 12587 12588 12589 12590 12591 12592 12593 12594 12595 12596 12597 12598 12599 12600 12601 12602 12603 12604 12605 12606 12607 12608 12609 12610 12611 12612 12613 12614 12615 12616 12617 12618 12619 12620 12621 12622 12623 12624 12625 12626 12627 12628 12629 12630 12631 12632 12633 12634 12635 12636 12637 12638 12639 12640 12641 12642 12643 12644 12645 12646 12647 12648 12649 12650 12651 12652 12653 12654 12655 12656 12657 12658 12659 12660 12661 12662 12663 12664 12665 12666 12667 12668 12669 12670 12671 12672 12673 12674 12675 12676 12677 12678 12679 12680 12681 12682 12683 12684 12685 12686 12687 12688 12689 12690 12691 12692 12693 12694 12695 12696 12697 12698 12699 12700 12701 12702 12703 12704 12705 12706 12707 12708 12709 12710 12711 12712 12713 12714 12715 12716 12717 12718 12719 12720 12721 12722 12723 12724 12725 12726 12727 12728 12729 12730 12731 12732 12733 12734 12735 12736 12737 12738 12739 12740 12741 12742 12743 12744 12745 12746 12747 12748 12749 12750 12751 12752 12753 12754 12755 12756 12757 12758 12759 12760 12761 12762 12763 12764 12765 12766 12767 12768 12769 12770 12771 12772 12773 12774 12775 12776 12777 12778 12779 12780 12781 12782 12783 12784 12785 12786 12787 12788 12789 12790 12791 12792 12793 12794 12795 12796 12797 12798 12799 12800 12801 12802 12803 12804 12805 12806 12807 12808 12809 12810 12811 12812 12813 12814 12815 12816 12817 12818 12819 12820 12821 12822 12823 12824 12825 12826 12827 12828 12829 12830 12831 12832 12833 12834 12835 12836 12837 12838 12839 12840 12841 12842 12843 12844 12845 12846 12847 12848 12849 12850 12851 12852 12853 12854 12855 12856 12857 12858 12859 12860 12861 12862 12863 12864 12865 12866 12867 12868 12869 12870 12871 12872 12873 12874 12875 12876 12877 12878 12879 12880 12881 12882 12883 12884 12885 12886 12887 12888 12889 12890 12891 12892 12893 12894 12895 12896 12897 12898 12899 12900 12901 12902 12903 12904 12905 12906 12907 12908 12909 12910 12911 12912 12913 12914 12915 12916 12917 12918 12919 12920 12921 12922 12923 12924 12925 12926 12927 12928 12929 12930 12931 12932 12933 12934 12935 12936 12937 12938 12939 12940 12941 12942 12943 12944 12945 12946 12947 12948 12949 12950 12951 12952 12953 12954 12955 12956 12957 12958 12959 12960 12961 12962 12963 12964 12965 12966 12967 12968 12969 12970 12971 12972 12973 12974 12975 12976 12977 12978 12979 12980 12981 12982 12983 12984 12985 12986 12987 12988 12989 12990 12991 12992 12993 12994 12995 12996 12997 12998 12999 13000 13001 13002 13003 13004 13005 13006 13007 13008 13009 13010 13011 13012 13013 13014 13015 13016 13017 13018 13019 13020 13021 13022 13023 13024 13025 13026 13027 13028 13029 13030 13031 13032 13033 13034 13035 13036 13037 13038 13039 13040 13041 13042 13043 13044 13045 13046 13047 13048 13049 13050 13051 13052 13053 13054 13055 13056 13057 13058 13059 13060 13061 13062 13063 13064 13065 13066 13067 13068 13069 13070 13071 13072 13073 13074 13075 13076 13077 13078 13079 13080 13081 13082 13083 13084 13085 13086 13087 13088 13089 13090 13091 13092 13093 13094 13095 13096 13097 13098 13099 13100 13101 13102 13103 13104 13105 13106 13107 13108 13109 13110 13111 13112 13113 13114 13115 13116 13117 13118 13119 13120 13121 13122 13123 13124 13125 13126 13127 13128 13129 13130 13131 13132 13133 13134 13135 13136 13137 13138 13139 13140 13141 13142 13143 13144 13145 13146 13147 13148 13149 13150 13151 13152 13153 13154 13155 13156 13157 13158 13159 13160 13161 13162 13163 13164 13165 13166 13167 13168 13169 13170 13171 13172 13173 13174 13175 13176 13177 13178 13179 13180 13181 13182 13183 13184 13185 13186 13187 13188 13189 13190 13191 13192 13193 13194 13195 13196 13197 13198 13199 13200 13201 13202 13203 13204 13205 13206 13207 13208 13209 13210 13211 13212 13213 13214 13215 13216 13217 13218 13219 13220 13221 13222 13223 13224 13225 13226 13227 13228 13229 13230 13231 13232 13233 13234 13235 13236 13237 13238 13239 13240 13241 13242 13243 13244 13245 13246 13247 13248 13249 13250 13251 13252 13253 13254 13255 13256 13257 13258 13259 13260 13261 13262 13263 13264 13265 13266 13267 13268 13269 13270 13271 13272 13273 13274 13275 13276 13277 13278 13279 13280 13281 13282 13283 13284 13285 13286 13287 13288 13289 13290 13291 13292 13293 13294 13295 13296 13297 13298 13299 13300 13301 13302 13303 13304 13305 13306 13307 13308 13309 13310 13311 13312 13313 13314 13315 13316 13317 13318 13319 13320 13321 13322 13323 13324 13325 13326 13327 13328 13329 13330 13331 13332 13333 13334 13335 13336 13337 13338 13339 13340 13341 13342 13343 13344 13345 13346 13347 13348 13349 13350 13351 13352 13353 13354 13355 13356 13357 13358 13359 13360 13361 13362 13363 13364 13365 13366 13367 13368 13369 13370 13371 13372 13373 13374 13375 13376 13377 13378 13379 13380 13381 13382 13383 13384 13385 13386 13387 13388 13389 13390 13391 13392 13393 13394 13395 13396 13397 13398 13399 13400 13401 13402 13403 13404 13405 13406 13407 13408 13409 13410 13411 13412 13413 13414 13415 13416 13417 13418 13419 13420 13421 13422 13423 13424 13425 13426 13427 13428 13429 13430 13431 13432 13433 13434 13435 13436 13437 13438 13439 13440 13441 13442 13443 13444 13445 13446 13447 13448 13449 13450 13451 13452 13453 13454 13455 13456 13457 13458 13459 13460 13461 13462 13463 13464 13465 13466 13467 13468 13469 13470 13471 13472 13473 13474 13475 13476 13477 13478 13479 13480 13481 13482 13483 13484 13485 13486 13487 13488 13489 13490 13491 13492 13493 13494 13495 13496 13497 13498 13499 13500 13501 13502 13503 13504 13505 13506 13507 13508 13509 13510 13511 13512 13513 13514 13515 13516 13517 13518 13519 13520 13521 13522 13523 13524 13525 13526 13527 13528 13529 13530 13531 13532 13533 13534 13535 13536 13537 13538 13539 13540 13541 13542 13543 13544 13545 13546 13547 13548 13549 13550 13551 13552 13553 13554 13555 13556 13557 13558 13559 13560 13561 13562 13563 13564 13565 13566 13567 13568 13569 13570 13571 13572 13573 13574 13575 13576 13577 13578 13579 13580 13581 13582 13583 13584 13585 13586 13587 13588 13589 13590 13591 13592 13593 13594 13595 13596 13597 13598 13599 13600 13601 13602 13603 13604 13605 13606 13607 13608 13609 13610 13611 13612 13613 13614 13615 13616 13617 13618 13619 13620 13621 13622 13623 13624 13625 13626 13627 13628 13629 13630 13631 13632 13633 13634 13635 13636 13637 13638 13639 13640 13641 13642 13643 13644 13645 13646 13647 13648 13649 13650 13651 13652 13653 13654 13655 13656 13657 13658 13659 13660 13661 13662 13663 13664 13665 13666 13667 13668 13669 13670 13671 13672 13673 13674 13675 13676 13677 13678 13679 13680 13681 13682 13683 13684 13685 13686 13687 13688 13689 13690 13691 13692 13693 13694 13695 13696 13697 13698 13699 13700 13701 13702 13703 13704 13705 13706 13707 13708 13709 13710 13711 13712 13713 13714 13715 13716 13717 13718 13719 13720 13721 13722 13723 13724 13725 13726 13727 13728 13729 13730 13731 13732 13733 13734 13735 13736 13737 13738 13739 13740 13741 13742 13743 13744 13745 13746 13747 13748 13749 13750 13751 13752 13753 13754 13755 13756 13757 13758 13759 13760 13761 13762 13763 13764 13765 13766 13767 13768 13769 13770 13771 13772 13773 13774 13775 13776 13777 13778 13779 13780 13781 13782 13783 13784 13785 13786 13787 13788 13789 13790 13791 13792 13793 13794 13795 13796 13797 13798 13799 13800 13801 13802 13803 13804 13805 13806 13807 13808 13809 13810 13811 13812 13813 13814 13815 13816 13817 13818 13819 13820 13821 13822 13823 13824 13825 13826 13827 13828 13829 13830 13831 13832 13833 13834 13835 13836 13837 13838 13839 13840 13841 13842 13843 13844 13845 13846 13847 13848 13849 13850 13851 13852 13853 13854 13855 13856 13857 13858 13859 13860 13861 13862 13863 13864 13865 13866 13867 13868 13869 13870 13871 13872 13873 13874 13875 13876 13877 13878 13879 13880 13881 13882 13883 13884 13885 13886 13887 13888 13889 13890 13891 13892 13893 13894 13895 13896 13897 13898 13899 13900 13901 13902 13903 13904 13905 13906 13907 13908 13909 13910 13911 13912 13913 13914 13915 13916 13917 13918 13919 13920 13921 13922 13923 13924 13925 13926 13927 13928 13929 13930 13931 13932 13933 13934 13935 13936 13937 13938 13939 13940 13941 13942 13943 13944 13945 13946 13947 13948 13949 13950 13951 13952 13953 13954 13955 13956 13957 13958 13959 13960 13961 13962 13963 13964 13965 13966 13967 13968 13969 13970 13971 13972 13973 13974 13975 13976 13977 13978 13979 13980 13981 13982 13983 13984 13985 13986 13987 13988 13989 13990 13991 13992 13993 13994 13995 13996 13997 13998 13999 14000 14001 14002 14003 14004 14005 14006 14007 14008 14009 14010 14011 14012 14013 14014 14015 14016 14017 14018 14019 14020 14021 14022 14023 14024 14025 14026 14027 14028 14029 14030 14031 14032 14033 14034 14035 14036 14037 14038 14039 14040 14041 14042 14043 14044 14045 14046 14047 14048 14049 14050 14051 14052 14053 14054 14055 14056 14057 14058 14059 14060 14061 14062 14063 14064 14065 14066 14067 14068 14069 14070 14071 14072 14073 14074 14075 14076 14077 14078 14079 14080 14081 14082 14083 14084 14085 14086 14087 14088 14089 14090 14091 14092 14093 14094 14095 14096 14097 14098 14099 14100 14101 14102 14103 14104 14105 14106 14107 14108 14109 14110 14111 14112 14113 14114 14115 14116 14117 14118 14119 14120 14121 14122 14123 14124 14125 14126 14127 14128 14129 14130 14131 14132 14133 14134 14135 14136 14137 14138 14139 14140 14141 14142 14143 14144 14145 14146 14147 14148 14149 14150 14151 14152 14153 14154 14155 14156 14157 14158 14159 14160 14161 14162 14163 14164 14165 14166 14167 14168 14169 14170 14171 14172 14173 14174 14175 14176 14177 14178 14179 14180 14181 14182 14183 14184 14185 14186 14187 14188 14189 14190 14191 14192 14193 14194 14195 14196 14197 14198 14199 14200 14201 14202 14203 14204 14205 14206 14207 14208 14209 14210 14211 14212 14213 14214 14215 14216 14217 14218 14219 14220 14221 14222 14223 14224 14225 14226 14227 14228 14229 14230 14231 14232 14233 14234 14235 14236 14237 14238 14239 14240 14241 14242 14243 14244 14245 14246 14247 14248 14249 14250 14251 14252 14253 14254 14255 14256 14257 14258 14259 14260 14261 14262 14263 14264 14265 14266 14267 14268 14269 14270 14271 14272 14273 14274 14275 14276 14277 14278 14279 14280 14281 14282 14283 14284 14285 14286 14287 14288 14289 14290 14291 14292 14293 14294 14295 14296 14297 14298 14299 14300 14301 14302 14303 14304 14305 14306 14307 14308 14309 14310 14311 14312 14313 14314 14315 14316 14317 14318 14319 14320 14321 14322 14323 14324 14325 14326 14327 14328 14329 14330 14331 14332 14333 14334 14335 14336 14337 14338 14339 14340 14341 14342 14343 14344 14345 14346 14347 14348 14349 14350 14351 14352 14353 14354 14355 14356 14357 14358 14359 14360 14361 14362 14363 14364 14365 14366 14367 14368 14369 14370 14371 14372 14373 14374 14375 14376 14377 14378 14379 14380 14381 14382 14383 14384 14385 14386 14387 14388 14389 14390 14391 14392 14393 14394 14395 14396 14397 14398 14399 14400 14401 14402 14403 14404 14405 14406 14407 14408 14409 14410 14411 14412 14413 14414 14415 14416 14417 14418 14419 14420 14421 14422 14423 14424 14425 14426 14427 14428 14429 14430 14431 14432 14433 14434 14435 14436 14437 14438 14439 14440 14441 14442 14443 14444 14445 14446 14447 14448 14449 14450 14451 14452 14453 14454 14455 14456 14457 14458 14459 14460 14461 14462 14463 14464 14465 14466 14467 14468 14469 14470 14471 14472 14473 14474 14475 14476 14477 14478 14479 14480 14481 14482 14483 14484 14485 14486 14487 14488 14489 14490 14491 14492 14493 14494 14495 14496 14497 14498 14499 14500 14501 14502 14503 14504 14505 14506 14507 14508 14509 14510 14511 14512 14513 14514 14515 14516 14517 14518 14519 14520 14521 14522 14523 14524 14525 14526 14527 14528 14529 14530 14531 14532 14533 14534 14535 14536 14537 14538 14539 14540 14541 14542 14543 14544 14545 14546 14547 14548 14549 14550 14551 14552 14553 14554 14555 14556 14557 14558 14559 14560 14561 14562 14563 14564 14565 14566 14567 14568 14569 14570 14571 14572 14573 14574 14575 14576 14577 14578 14579 14580 14581 14582 14583 14584 14585 14586 14587 14588 14589 14590 14591 14592 14593 14594 14595 14596 14597 14598 14599 14600 14601 14602 14603 14604 14605 14606 14607 14608 14609 14610 14611 14612 14613 14614 14615 14616 14617 14618 14619 14620 14621 14622 14623 14624 14625 14626 14627 14628 14629 14630 14631 14632 14633 14634 14635 14636 14637 14638 14639 14640 14641 14642 14643 14644 14645 14646 14647 14648 14649 14650 14651 14652 14653 14654 14655 14656 14657 14658 14659 14660 14661 14662 14663 14664 14665 14666 14667 14668 14669 14670 14671 14672 14673 14674 14675 14676 14677 14678 14679 14680 14681 14682 14683 14684 14685 14686 14687 14688 14689 14690 14691 14692 14693 14694 14695 14696 14697 14698 14699 14700 14701 14702 14703 14704 14705 14706 14707 14708 14709 14710 14711 14712 14713 14714 14715 14716 14717 14718 14719 14720 14721 14722 14723 14724 14725 14726 14727 14728 14729 14730 14731 14732 14733 14734 14735 14736 14737 14738 14739 14740 14741 14742 14743 14744 14745 14746 14747 14748 14749 14750 14751 14752 14753 14754 14755 14756 14757 14758 14759 14760 14761 14762 14763 14764 14765 14766 14767 14768 14769 14770 14771 14772 14773 14774 14775 14776 14777 14778 14779 14780 14781 14782 14783 14784 14785 14786 14787 14788 14789 14790 14791 14792 14793 14794 14795 14796 14797 14798 14799 14800 14801 14802 14803 14804 14805 14806 14807 14808 14809 14810 14811 14812 14813 14814 14815 14816 14817 14818 14819 14820 14821 14822 14823 14824 14825 14826 14827 14828 14829 14830 14831 14832 14833 14834 14835 14836 14837 14838 14839 14840 14841 14842 14843 14844 14845 14846 14847 14848 14849 14850 14851 14852 14853 14854 14855 14856 14857 14858 14859 14860 14861 14862 14863 14864 14865 14866 14867 14868 14869 14870 14871 14872 14873 14874 14875 14876 14877 14878 14879 14880 14881 14882 14883 14884 14885 14886 14887 14888 14889 14890 14891 14892 14893 14894 14895 14896 14897 14898 14899 14900 14901 14902 14903 14904 14905 14906 14907 14908 14909 14910 14911 14912 14913 14914 14915 14916 14917 14918 14919 14920 14921 14922 14923 14924 14925 14926 14927 14928 14929 14930 14931 14932 14933 14934 14935 14936 14937 14938 14939 14940 14941 14942 14943 14944 14945 14946 14947 14948 14949 14950 14951 14952 14953 14954 14955 14956 14957 14958 14959 14960 14961 14962 14963 14964 14965 14966 14967 14968 14969 14970 14971 14972 14973 14974 14975 14976 14977 14978 14979 14980 14981 14982 14983 14984 14985 14986 14987 14988 14989 14990 14991 14992 14993 14994 14995 14996 14997 14998 14999 15000 15001 15002 15003 15004 15005 15006 15007 15008 15009 15010 15011 15012 15013 15014 15015 15016 15017 15018 15019 15020 15021 15022 15023 15024 15025 15026 15027 15028 15029 15030 15031 15032 15033 15034 15035 15036 15037 15038 15039 15040 15041 15042 15043 15044 15045 15046 15047 15048 15049 15050 15051 15052 15053 15054 15055 15056 15057 15058 15059 15060 15061 15062 15063 15064 15065 15066 15067 15068 15069 15070 15071 15072 15073 15074 15075 15076 15077 15078 15079 15080 15081 15082 15083 15084 15085 15086 15087 15088 15089 15090 15091 15092 15093 15094 15095 15096 15097 15098 15099 15100 15101 15102 15103 15104 15105 15106 15107 15108 15109 15110 15111 15112 15113 15114 15115 15116 15117 15118 15119 15120 15121 15122 15123 15124 15125 15126 15127 15128 15129 15130 15131 15132 15133 15134 15135 15136 15137 15138 15139 15140 15141 15142 15143 15144 15145 15146 15147 15148 15149 15150 15151 15152 15153 15154 15155 15156 15157 15158 15159 15160 15161 15162 15163 15164 15165 15166 15167 15168 15169 15170 15171 15172 15173 15174 15175 15176 15177 15178 15179 15180 15181 15182 15183 15184 15185 15186 15187 15188 15189 15190 15191 15192 15193 15194 15195 15196 15197 15198 15199 15200 15201 15202 15203 15204 15205 15206 15207 15208 15209 15210 15211 15212 15213 15214 15215 15216 15217 15218 15219 15220 15221 15222 15223 15224 15225 15226 15227 15228 15229 15230 15231 15232 15233 15234 15235 15236 15237 15238 15239 15240 15241 15242 15243 15244 15245 15246 15247 15248 15249 15250 15251 15252 15253 15254 15255 15256 15257 15258 15259 15260 15261 15262 15263 15264 15265 15266 15267 15268 15269 15270 15271 15272 15273 15274 15275 15276 15277 15278 15279 15280 15281 15282 15283 15284 15285 15286 15287 15288 15289 15290 15291 15292 15293 15294 15295 15296 15297 15298 15299 15300 15301 15302 15303 15304 15305 15306 15307 15308 15309 15310 15311 15312 15313 15314 15315 15316 15317 15318 15319 15320 15321 15322 15323 15324 15325 15326 15327 15328 15329 15330 15331 15332 15333 15334 15335 15336 15337 15338 15339 15340 15341 15342 15343 15344 15345 15346 15347 15348 15349 15350 15351 15352 15353 15354 15355 15356 15357 15358 15359 15360 15361 15362 15363 15364 15365 15366 15367 15368 15369 15370 15371 15372 15373 15374 15375 15376 15377 15378 15379 15380 15381 15382 15383 15384 15385 15386 15387 15388 15389 15390 15391 15392 15393 15394 15395 15396 15397 15398 15399 15400 15401 15402 15403 15404 15405 15406 15407 15408 15409 15410 15411 15412 15413 15414 15415 15416 15417 15418 15419 15420 15421 15422 15423 15424 15425 15426 15427 15428 15429 15430 15431 15432 15433 15434 15435 15436 15437 15438 15439 15440 15441 15442 15443 15444 15445 15446 15447 15448 15449 15450 15451 15452 15453 15454 15455 15456 15457 15458 15459 15460 15461 15462 15463 15464 15465 15466 15467 15468 15469 15470 15471 15472 15473 15474 15475 15476 15477 15478 15479 15480 15481 15482 15483 15484 15485 15486 15487 15488 15489 15490 15491 15492 15493 15494 15495 15496 15497 15498 15499 15500 15501 15502 15503 15504 15505 15506 15507 15508 15509 15510 15511 15512 15513 15514 15515 15516 15517 15518 15519 15520 15521 15522 15523 15524 15525 15526 15527 15528 15529 15530 15531 15532 15533 15534 15535 15536 15537 15538 15539 15540 15541 15542 15543 15544 15545 15546 15547 15548 15549 15550 15551 15552 15553 15554 15555 15556 15557 15558 15559 15560 15561 15562 15563 15564 15565 15566 15567 15568 15569 15570 15571 15572 15573 15574 15575 15576 15577 15578 15579 15580 15581 15582 15583 15584 15585 15586 15587 15588 15589 15590 15591 15592 15593 15594 15595 15596 15597 15598 15599 15600 15601 15602 15603 15604 15605 15606 15607 15608 15609 15610 15611 15612 15613 15614 15615 15616 15617 15618 15619 15620 15621 15622 15623 15624 15625 15626 15627 15628 15629 15630 15631 15632 15633 15634 15635 15636 15637 15638 15639 15640 15641 15642 15643 15644 15645 15646 15647 15648 15649 15650 15651 15652 15653 15654 15655 15656 15657 15658 15659 15660 15661 15662 15663 15664 15665 15666 15667 15668 15669 15670 15671 15672 15673 15674 15675 15676 15677 15678 15679 15680 15681 15682 15683 15684 15685 15686 15687 15688 15689 15690 15691 15692 15693 15694 15695 15696 15697 15698 15699 15700 15701 15702 15703 15704 15705 15706 15707 15708 15709 15710 15711 15712 15713 15714 15715 15716 15717 15718 15719 15720 15721 15722 15723 15724 15725 15726 15727 15728 15729 15730 15731 15732 15733 15734 15735 15736 15737 15738 15739 15740 15741 15742 15743 15744 15745 15746 15747 15748 15749 15750 15751 15752 15753 15754 15755 15756 15757 15758 15759 15760 15761 15762 15763 15764 15765 15766 15767 15768 15769 15770 15771 15772 15773 15774 15775 15776 15777 15778 15779 15780 15781 15782 15783 15784 15785 15786 15787 15788 15789 15790 15791 15792 15793 15794 15795 15796 15797 15798 15799 15800 15801 15802 15803 15804 15805 15806 15807 15808 15809 15810 15811 15812 15813 15814 15815 15816 15817 15818 15819 15820 15821 15822 15823 15824 15825 15826 15827 15828 15829 15830 15831 15832 15833 15834 15835 15836 15837 15838 15839 15840 15841 15842 15843 15844 15845 15846 15847 15848 15849 15850 15851 15852 15853 15854 15855 15856 15857 15858 15859 15860 15861 15862 15863 15864 15865 15866 15867 15868 15869 15870 15871 15872 15873 15874 15875 15876 15877 15878 15879 15880 15881 15882 15883 15884 15885 15886 15887 15888 15889 15890 15891 15892 15893 15894 15895 15896 15897 15898 15899 15900 15901 15902 15903 15904 15905 15906 15907 15908 15909 15910 15911 15912 15913 15914 15915 15916 15917 15918 15919 15920 15921 15922 15923 15924 15925 15926 15927 15928 15929 15930 15931 15932 15933 15934 15935 15936 15937 15938 15939 15940 15941 15942 15943 15944 15945 15946 15947 15948 15949 15950 15951 15952 15953 15954 15955 15956 15957 15958 15959 15960 15961 15962 15963 15964 15965 15966 15967 15968 15969 15970 15971 15972 15973 15974 15975 15976 15977 15978 15979 15980 15981 15982 15983 15984 15985 15986 15987 15988 15989 15990 15991 15992 15993 15994 15995 15996 15997 15998 15999 16000 16001 16002 16003 16004 16005 16006 16007 16008 16009 16010 16011 16012 16013 16014 16015 16016 16017 16018 16019 16020 16021 16022 16023 16024 16025 16026 16027 16028 16029 16030 16031 16032 16033 16034 16035 16036 16037 16038 16039 16040 16041 16042 16043 16044 16045 16046 16047 16048 16049 16050 16051 16052 16053 16054 16055 16056 16057 16058 16059 16060 16061 16062 16063 16064 16065 16066 16067 16068 16069 16070 16071 16072 16073 16074 16075 16076 16077 16078 16079 16080 16081 16082 16083 16084 16085 16086 16087 16088 16089 16090 16091 16092 16093 16094 16095 16096 16097 16098 16099 16100 16101 16102 16103 16104 16105 16106 16107 16108 16109 16110 16111 16112 16113 16114 16115 16116 16117 16118 16119 16120 16121 16122 16123 16124 16125 16126 16127 16128 16129 16130 16131 16132 16133 16134 16135 16136 16137 16138 16139 16140 16141 16142 16143 16144 16145 16146 16147 16148 16149 16150 16151 16152 16153 16154 16155 16156 16157 16158 16159 16160 16161 16162 16163 16164 16165 16166 16167 16168 16169 16170 16171 16172 16173 16174 16175 16176 16177 16178 16179 16180 16181 16182 16183 16184 16185 16186 16187 16188 16189 16190 16191 16192 16193 16194 16195 16196 16197 16198 16199 16200 16201 16202 16203 16204 16205 16206 16207 16208 16209 16210 16211 16212 16213 16214 16215 16216 16217 16218 16219 16220 16221 16222 16223 16224 16225 16226 16227 16228 16229 16230 16231 16232 16233 16234 16235 16236 16237 16238 16239 16240 16241 16242 16243 16244 16245 16246 16247 16248 16249 16250 16251 16252 16253 16254 16255 16256 16257 16258 16259 16260 16261 16262 16263 16264 16265 16266 16267 16268 16269 16270 16271 16272 16273 16274 16275 16276 16277 16278 16279 16280 16281 16282 16283 16284 16285 16286 16287 16288 16289 16290 16291 16292 16293 16294 16295 16296 16297 16298 16299 16300 16301 16302 16303 16304 16305 16306 16307 16308 16309 16310 16311 16312 16313 16314 16315 16316 16317 16318 16319 16320 16321 16322 16323 16324 16325 16326 16327 16328 16329 16330 16331 16332 16333 16334 16335 16336 16337 16338 16339 16340 16341 16342 16343 16344 16345 16346 16347 16348 16349 16350 16351 16352 16353 16354 16355 16356 16357 16358 16359 16360 16361 16362 16363 16364 16365 16366 16367 16368 16369 16370 16371 16372 16373 16374 16375 16376 16377 16378 16379 16380 16381 16382 16383 16384 16385 16386 16387 16388 16389 16390 16391 16392 16393 16394 16395 16396 16397 16398 16399 16400 16401 16402 16403 16404 16405 16406 16407 16408 16409 16410 16411 16412 16413 16414 16415 16416 16417 16418 16419 16420 16421 16422 16423 16424 16425 16426 16427 16428 16429 16430 16431 16432 16433 16434 16435 16436 16437 16438 16439 16440 16441 16442 16443 16444 16445 16446 16447 16448 16449 16450 16451 16452 16453 16454 16455 16456 16457 16458 16459 16460 16461 16462 16463 16464 16465 16466 16467 16468 16469 16470 16471 16472 16473 16474 16475 16476 16477 16478 16479 16480 16481 16482 16483 16484 16485 16486 16487 16488 16489 16490 16491 16492 16493 16494 16495 16496 16497 16498 16499 16500 16501 16502 16503 16504 16505 16506 16507 16508 16509 16510 16511 16512 16513 16514 16515 16516 16517 16518 16519 16520 16521 16522 16523 16524 16525 16526 16527 16528 16529 16530 16531 16532 16533 16534 16535 16536 16537 16538 16539 16540 16541 16542 16543 16544 16545 16546 16547 16548 16549 16550 16551 16552 16553 16554 16555 16556 16557 16558 16559 16560 16561 16562 16563 16564 16565 16566 16567 16568 16569 16570 16571 16572 16573 16574 16575 16576 16577 16578 16579 16580 16581 16582 16583 16584 16585 16586 16587 16588 16589 16590 16591 16592 16593 16594 16595 16596 16597 16598 16599 16600 16601 16602 16603 16604 16605 16606 16607 16608 16609 16610 16611 16612 16613 16614 16615 16616 16617 16618 16619 16620 16621 16622 16623 16624 16625 16626 16627 16628 16629 16630 16631 16632 16633 16634 16635 16636 16637 16638 16639 16640 16641 16642 16643 16644 16645 16646 16647 16648 16649 16650 16651 16652 16653 16654 16655 16656 16657 16658 16659 16660 16661 16662 16663 16664 16665 16666 16667 16668 16669 16670 16671 16672 16673 16674 16675 16676 16677 16678 16679 16680 16681 16682 16683 16684 16685 16686 16687 16688 16689 16690 16691 16692 16693 16694 16695 16696 16697 16698 16699 16700 16701 16702 16703 16704 16705 16706 16707 16708 16709 16710 16711 16712 16713 16714 16715 16716 16717 16718 16719 16720 16721 16722 16723 16724 16725 16726 16727 16728 16729 16730 16731 16732 16733 16734 16735 16736 16737 16738 16739 16740 16741 16742 16743 16744 16745 16746 16747 16748 16749 16750 16751 16752 16753 16754 16755 16756 16757 16758 16759 16760 16761 16762 16763 16764 16765 16766 16767 16768 16769 16770 16771 16772 16773 16774 16775 16776 16777 16778 16779 16780 16781 16782 16783 16784 16785 16786 16787 16788 16789 16790 16791 16792 16793 16794 16795 16796 16797 16798 16799 16800 16801 16802 16803 16804 16805 16806 16807 16808 16809 16810 16811 16812 16813 16814 16815 16816 16817 16818 16819 16820 16821 16822 16823 16824 16825 16826 16827 16828 16829 16830 16831 16832 16833 16834 16835 16836 16837 16838 16839 16840 16841 16842 16843 16844 16845 16846 16847 16848 16849 16850 16851 16852 16853 16854 16855 16856 16857 16858 16859 16860 16861 16862 16863 16864 16865 16866 16867 16868 16869 16870 16871 16872 16873 16874 16875 16876 16877 16878 16879 16880 16881 16882 16883 16884 16885 16886 16887 16888 16889 16890 16891 16892 16893 16894 16895 16896 16897 16898 16899 16900 16901 16902 16903 16904 16905 16906 16907 16908 16909 16910 16911 16912 16913 16914 16915 16916 16917 16918 16919 16920 16921 16922 16923 16924 16925 16926 16927 16928 16929 16930 16931 16932 16933 16934 16935 16936 16937 16938 16939 16940 16941 16942 16943 16944 16945 16946 16947 16948 16949 16950 16951 16952 16953 16954 16955 16956 16957 16958 16959 16960 16961 16962 16963 16964 16965 16966 16967 16968 16969 16970 16971 16972 16973 16974 16975 16976 16977 16978 16979 16980 16981 16982 16983 16984 16985 16986 16987 16988 16989 16990 16991 16992 16993 16994 16995 16996 16997 16998 16999 17000 17001 17002 17003 17004 17005 17006 17007 17008 17009 17010 17011 17012 17013 17014 17015 17016 17017 17018 17019 17020 17021 17022 17023 17024 17025 17026 17027 17028 17029 17030 17031 17032 17033 17034 17035 17036 17037 17038 17039 17040 17041 17042 17043 17044 17045 17046 17047 17048 17049 17050 17051 17052 17053 17054 17055 17056 17057 17058 17059 17060 17061 17062 17063 17064 17065 17066 17067 17068 17069 17070 17071 17072 17073 17074 17075 17076 17077 17078 17079 17080 17081 17082 17083 17084 17085 17086 17087 17088 17089 17090 17091 17092 17093 17094 17095 17096 17097 17098 17099 17100 17101 17102 17103 17104 17105 17106 17107 17108 17109 17110 17111 17112 17113 17114 17115 17116 17117 17118 17119 17120 17121 17122 17123 17124 17125 17126 17127 17128 17129 17130 17131 17132 17133 17134 17135 17136 17137 17138 17139 17140 17141 17142 17143 17144 17145 17146 17147 17148 17149 17150 17151 17152 17153 17154 17155 17156 17157 17158 17159 17160 17161 17162 17163 17164 17165 17166 17167 17168 17169 17170 17171 17172 17173 17174 17175 17176 17177 17178 17179 17180 17181 17182 17183 17184 17185 17186 17187 17188 17189 17190 17191 17192 17193 17194 17195 17196 17197 17198 17199 17200 17201 17202 17203 17204 17205 17206 17207 17208 17209 17210 17211 17212 17213 17214 17215 17216 17217 17218 17219 17220 17221 17222 17223 17224 17225 17226 17227 17228 17229 17230 17231 17232 17233 17234 17235 17236 17237 17238 17239 17240 17241 17242 17243 17244 17245 17246 17247 17248 17249 17250 17251 17252 17253 17254 17255 17256 17257 17258 17259 17260 17261 17262 17263 17264 17265 17266 17267 17268 17269 17270 17271 17272 17273 17274 17275 17276 17277 17278 17279 17280 17281 17282 17283 17284 17285 17286 17287 17288 17289 17290 17291 17292 17293 17294 17295 17296 17297 17298 17299 17300 17301 17302 17303 17304 17305 17306 17307 17308 17309 17310 17311 17312 17313 17314 17315 17316 17317 17318 17319 17320 17321 17322 17323 17324 17325 17326 17327 17328 17329 17330 17331 17332 17333 17334 17335 17336 17337 17338 17339 17340 17341 17342 17343 17344 17345 17346 17347 17348 17349 17350 17351 17352 17353 17354 17355 17356 17357 17358 17359 17360 17361 17362 17363 17364 17365 17366 17367 17368 17369 17370 17371 17372 17373 17374 17375 17376 17377 17378 17379 17380 17381 17382 17383 17384 17385 17386 17387 17388 17389 17390 17391 17392 17393 17394 17395 17396 17397 17398 17399 17400 17401 17402 17403 17404 17405 17406 17407 17408 17409 17410 17411 17412 17413 17414 17415 17416 17417 17418 17419 17420 17421 17422 17423 17424 17425 17426 17427 17428 17429 17430 17431 17432 17433 17434 17435 17436 17437 17438 17439 17440 17441 17442 17443 17444 17445 17446 17447 17448 17449 17450 17451 17452 17453 17454 17455 17456 17457 17458 17459 17460 17461 17462 17463 17464 17465 17466 17467 17468 17469 17470 17471 17472 17473 17474 17475 17476 17477 17478 17479 17480 17481 17482 17483 17484 17485 17486 17487 17488 17489 17490 17491 17492 17493 17494 17495 17496 17497 17498 17499 17500 17501 17502 17503 17504 17505 17506 17507 17508 17509 17510 17511 17512 17513 17514 17515 17516 17517 17518 17519 17520 17521 17522 17523 17524 17525 17526 17527 17528 17529 17530 17531 17532 17533 17534 17535 17536 17537 17538 17539 17540 17541 17542 17543 17544 17545 17546 17547 17548 17549 17550 17551 17552 17553 17554 17555 17556 17557 17558 17559 17560 17561 17562 17563 17564 17565 17566 17567 17568 17569 17570 17571 17572 17573 17574 17575 17576 17577 17578 17579 17580 17581 17582 17583 17584 17585 17586 17587 17588 17589 17590 17591 17592 17593 17594 17595 17596 17597 17598 17599 17600 17601 17602 17603 17604 17605 17606 17607 17608 17609 17610 17611 17612 17613 17614 17615 17616 17617 17618 17619 17620 17621 17622 17623 17624 17625 17626 17627 17628 17629 17630 17631 17632 17633 17634 17635 17636 17637 17638 17639 17640 17641 17642 17643 17644 17645 17646 17647 17648 17649 17650 17651 17652 17653 17654 17655 17656 17657 17658 17659 17660 17661 17662 17663 17664 17665 17666 17667 17668 17669 17670 17671 17672 17673 17674 17675 17676 17677 17678 17679 17680 17681 17682 17683 17684 17685 17686 17687 17688 17689 17690 17691 17692 17693 17694 17695 17696 17697 17698 17699 17700 17701 17702 17703 17704 17705 17706 17707 17708 17709 17710 17711 17712 17713 17714 17715 17716 17717 17718 17719 17720 17721 17722 17723 17724 17725 17726 17727 17728 17729 17730 17731 17732 17733 17734 17735 17736 17737 17738 17739 17740 17741 17742 17743 17744 17745 17746 17747 17748 17749 17750 17751 17752 17753 17754 17755 17756 17757 17758 17759 17760 17761 17762 17763 17764 17765 17766 17767 17768 17769 17770 17771 17772 17773 17774 17775 17776 17777 17778 17779 17780 17781 17782 17783 17784 17785 17786 17787 17788 17789 17790 17791 17792 17793 17794 17795 17796 17797 17798 17799 17800 17801 17802 17803 17804 17805 17806 17807 17808 17809 17810 17811 17812 17813 17814 17815 17816 17817 17818 17819 17820 17821 17822 17823 17824 17825 17826 17827 17828 17829 17830 17831 17832 17833 17834 17835 17836 17837 17838 17839 17840 17841 17842 17843 17844 17845 17846 17847 17848 17849 17850 17851 17852 17853 17854 17855 17856 17857 17858 17859 17860 17861 17862 17863 17864 17865 17866 17867 17868 17869 17870 17871 17872 17873 17874 17875 17876 17877 17878 17879 17880 17881 17882 17883 17884 17885 17886 17887 17888 17889 17890 17891 17892 17893 17894 17895 17896 17897 17898 17899 17900 17901 17902 17903 17904 17905 17906 17907 17908 17909 17910 17911 17912 17913 17914 17915 17916 17917 17918 17919 17920 17921 17922 17923 17924 17925 17926 17927 17928 17929 17930 17931 17932 17933 17934 17935 17936 17937 17938 17939 17940 17941 17942 17943 17944 17945 17946 17947 17948 17949 17950 17951 17952 17953 17954 17955 17956 17957 17958 17959 17960 17961 17962 17963 17964 17965 17966 17967 17968 17969 17970 17971 17972 17973 17974 17975 17976 17977 17978 17979 17980 17981 17982 17983 17984 17985 17986 17987 17988 17989 17990 17991 17992 17993 17994 17995 17996 17997 17998 17999 18000 18001 18002 18003 18004 18005 18006 18007 18008 18009 18010 18011 18012 18013 18014 18015 18016 18017 18018 18019 18020 18021 18022 18023 18024 18025 18026 18027 18028 18029 18030 18031 18032 18033 18034 18035 18036 18037 18038 18039 18040 18041 18042 18043 18044 18045 18046 18047 18048 18049 18050 18051 18052 18053 18054 18055 18056 18057 18058 18059 18060 18061 18062 18063 18064 18065 18066 18067 18068 18069 18070 18071 18072 18073 18074 18075 18076 18077 18078 18079 18080 18081 18082 18083 18084 18085 18086 18087 18088 18089 18090 18091 18092 18093 18094 18095 18096 18097 18098 18099 18100 18101 18102 18103 18104 18105 18106 18107 18108 18109 18110 18111 18112 18113 18114 18115 18116 18117 18118 18119 18120 18121 18122 18123 18124 18125 18126 18127 18128 18129 18130 18131 18132 18133 18134 18135 18136 18137 18138 18139 18140 18141 18142 18143 18144 18145 18146 18147 18148 18149 18150 18151 18152 18153 18154 18155 18156 18157 18158 18159 18160 18161 18162 18163 18164 18165 18166 18167 18168 18169 18170 18171 18172 18173 18174 18175 18176 18177 18178 18179 18180 18181 18182 18183 18184 18185 18186 18187 18188 18189 18190 18191 18192 18193 18194 18195 18196 18197 18198 18199 18200 18201 18202 18203 18204 18205 18206 18207 18208 18209 18210 18211 18212 18213 18214 18215 18216 18217 18218 18219 18220 18221 18222 18223 18224 18225 18226 18227 18228 18229 18230 18231 18232 18233 18234 18235 18236 18237 18238 18239 18240 18241 18242 18243 18244 18245 18246 18247 18248 18249 18250 18251 18252 18253 18254 18255 18256 18257 18258 18259 18260 18261 18262 18263 18264 18265 18266 18267 18268 18269 18270 18271 18272 18273 18274 18275 18276 18277 18278 18279 18280 18281 18282 18283 18284 18285 18286 18287 18288 18289 18290 18291 18292 18293 18294 18295 18296 18297 18298 18299 18300 18301 18302 18303 18304 18305 18306 18307 18308 18309 18310 18311 18312 18313 18314 18315 18316 18317 18318 18319 18320 18321 18322 18323 18324 18325 18326 18327 18328 18329 18330 18331 18332 18333 18334 18335 18336 18337 18338 18339 18340 18341 18342 18343 18344 18345 18346 18347 18348 18349 18350 18351 18352 18353 18354 18355 18356 18357 18358 18359 18360 18361 18362 18363 18364 18365 18366 18367 18368 18369 18370 18371 18372 18373 18374 18375 18376 18377 18378 18379 18380 18381 18382 18383 18384 18385 18386 18387 18388 18389 18390 18391 18392 18393 18394 18395 18396 18397 18398 18399 18400 18401 18402 18403 18404 18405 18406 18407 18408 18409 18410 18411 18412 18413 18414 18415 18416 18417 18418 18419 18420 18421 18422 18423 18424 18425 18426 18427 18428 18429 18430 18431 18432 18433 18434 18435 18436 18437 18438 18439 18440 18441 18442 18443 18444 18445 18446 18447 18448 18449 18450 18451 18452 18453 18454 18455 18456 18457 18458 18459 18460 18461 18462 18463 18464 18465 18466 18467 18468 18469 18470 18471 18472 18473 18474 18475 18476 18477 18478 18479 18480 18481 18482 18483 18484 18485 18486 18487 18488 18489 18490 18491 18492 18493 18494 18495 18496 18497 18498 18499 18500 18501 18502 18503 18504 18505 18506 18507 18508 18509 18510 18511 18512 18513 18514 18515 18516 18517 18518 18519 18520 18521 18522 18523 18524 18525 18526 18527 18528 18529 18530 18531 18532 18533 18534 18535 18536 18537 18538 18539 18540 18541 18542 18543 18544 18545 18546 18547 18548 18549 18550 18551 18552 18553 18554 18555 18556 18557 18558 18559 18560 18561 18562 18563 18564 18565 18566 18567 18568 18569 18570 18571 18572 18573 18574 18575 18576 18577 18578 18579 18580 18581 18582 18583 18584 18585 18586 18587 18588 18589 18590 18591 18592 18593 18594 18595 18596 18597 18598 18599 18600 18601 18602 18603 18604 18605 18606 18607 18608 18609 18610 18611 18612 18613 18614 18615 18616 18617 18618 18619 18620 18621 18622 18623 18624 18625 18626 18627 18628 18629 18630 18631 18632 18633 18634 18635 18636 18637 18638 18639 18640 18641 18642 18643 18644 18645 18646 18647 18648 18649 18650 18651 18652 18653 18654 18655 18656 18657 18658 18659 18660 18661 18662 18663 18664 18665 18666 18667 18668 18669 18670 18671 18672 18673 18674 18675 18676 18677 18678 18679 18680 18681 18682 18683 18684 18685 18686 18687 18688 18689 18690 18691 18692 18693 18694 18695 18696 18697 18698 18699 18700 18701 18702 18703 18704 18705 18706 18707 18708 18709 18710 18711 18712 18713 18714 18715 18716 18717 18718 18719 18720 18721 18722 18723 18724 18725 18726 18727 18728 18729 18730 18731 18732 18733 18734 18735 18736 18737 18738 18739 18740 18741 18742 18743 18744 18745 18746 18747 18748 18749 18750 18751 18752 18753 18754 18755 18756 18757 18758 18759 18760 18761 18762 18763 18764 18765 18766 18767 18768 18769 18770 18771 18772 18773 18774 18775 18776 18777 18778 18779 18780 18781 18782 18783 18784 18785 18786 18787 18788 18789 18790 18791 18792 18793 18794 18795 18796 18797 18798 18799 18800 18801 18802 18803 18804 18805 18806 18807 18808 18809 18810 18811 18812 18813 18814 18815 18816 18817 18818 18819 18820 18821 18822 18823 18824 18825 18826 18827 18828 18829 18830 18831 18832 18833 18834 18835 18836 18837 18838 18839 18840 18841 18842 18843 18844 18845 18846 18847 18848 18849 18850 18851 18852 18853 18854 18855 18856 18857 18858 18859 18860 18861 18862 18863 18864 18865 18866 18867 18868 18869 18870 18871 18872 18873 18874 18875 18876 18877 18878 18879 18880 18881 18882 18883 18884 18885 18886 18887 18888 18889 18890 18891 18892 18893 18894 18895 18896 18897 18898 18899 18900 18901 18902 18903 18904 18905 18906 18907 18908 18909 18910 18911 18912 18913 18914 18915 18916 18917 18918 18919 18920 18921 18922 18923 18924 18925 18926 18927 18928 18929 18930 18931 18932 18933 18934 18935 18936 18937 18938 18939 18940 18941 18942 18943 18944 18945 18946 18947 18948 18949 18950 18951 18952 18953 18954 18955 18956 18957 18958 18959 18960 18961 18962 18963 18964 18965 18966 18967 18968 18969 18970 18971 18972 18973 18974 18975 18976 18977 18978 18979 18980 18981 18982 18983 18984 18985 18986 18987 18988 18989 18990 18991 18992 18993 18994 18995 18996 18997 18998 18999 19000 19001 19002 19003 19004 19005 19006 19007 19008 19009 19010 19011 19012 19013 19014 19015 19016 19017 19018 19019 19020 19021 19022 19023 19024 19025 19026 19027 19028 19029 19030 19031 19032 19033 19034 19035 19036 19037 19038 19039 19040 19041 19042 19043 19044 19045 19046 19047 19048 19049 19050 19051 19052 19053 19054 19055 19056 19057 19058 19059 19060 19061 19062 19063 19064 19065 19066 19067 19068 19069 19070 19071 19072 19073 19074 19075 19076 19077 19078 19079 19080 19081 19082 19083 19084 19085 19086 19087 19088 19089 19090 19091 19092 19093 19094 19095 19096 19097 19098 19099 19100 19101 19102 19103 19104 19105 19106 19107 19108 19109 19110 19111 19112 19113 19114 19115 19116 19117 19118 19119 19120 19121 19122 19123 19124 19125 19126 19127 19128 19129 19130 19131 19132 19133 19134 19135 19136 19137 19138 19139 19140 19141 19142 19143 19144 19145 19146 19147 19148 19149 19150 19151 19152 19153 19154 19155 19156 19157 19158 19159 19160 19161 19162 19163 19164 19165 19166 19167 19168 19169 19170 19171 19172 19173 19174 19175 19176 19177 19178 19179 19180 19181 19182 19183 19184 19185 19186 19187 19188 19189 19190 19191 19192 19193 19194 19195 19196 19197 19198 19199 19200 19201 19202 19203 19204 19205 19206 19207 19208 19209 19210 19211 19212 19213 19214 19215 19216 19217 19218 19219 19220 19221 19222 19223 19224 19225 19226 19227 19228 19229 19230 19231 19232 19233 19234 19235 19236 19237 19238 19239 19240 19241 19242 19243 19244 19245 19246 19247 19248 19249 19250 19251 19252 19253 19254 19255 19256 19257 19258 19259 19260 19261 19262 19263 19264 19265 19266 19267 19268 19269 19270 19271 19272 19273 19274 19275 19276 19277 19278 19279 19280 19281 19282 19283 19284 19285 19286 19287 19288 19289 19290 19291 19292 19293 19294 19295 19296 19297 19298 19299 19300 19301 19302 19303 19304 19305 19306 19307 19308 19309 19310 19311 19312 19313 19314 19315 19316 19317 19318 19319 19320 19321 19322 19323 19324 19325 19326 19327 19328 19329 19330 19331 19332 19333 19334 19335 19336 19337 19338 19339 19340 19341 19342 19343 19344 19345 19346 19347 19348 19349 19350 19351 19352 19353 19354 19355 19356 19357 19358 19359 19360 19361 19362 19363 19364 19365 19366 19367 19368 19369 19370 19371 19372 19373 19374 19375 19376 19377 19378 19379 19380 19381 19382 19383 19384 19385 19386 19387 19388 19389 19390 19391 19392 19393 19394 19395 19396 19397 19398 19399 19400 19401 19402 19403 19404 19405 19406 19407 19408 19409 19410 19411 19412 19413 19414 19415 19416 19417 19418 19419 19420 19421 19422 19423 19424 19425 19426 19427 19428 19429 19430 19431 19432 19433 19434 19435 19436 19437 19438 19439 19440 19441 19442 19443 19444 19445 19446 19447 19448 19449 19450 19451 19452 19453 19454 19455 19456 19457 19458 19459 19460 19461 19462 19463 19464 19465 19466 19467 19468 19469 19470 19471 19472 19473 19474 19475 19476 19477 19478 19479 19480 19481 19482 19483 19484 19485 19486 19487 19488 19489 19490 19491 19492 19493 19494 19495 19496 19497 19498 19499 19500 19501 19502 19503 19504 19505 19506 19507 19508 19509 19510 19511 19512 19513 19514 19515 19516 19517 19518 19519 19520 19521 19522 19523 19524 19525 19526 19527 19528 19529 19530 19531 19532 19533 19534 19535 19536 19537 19538 19539 19540 19541 19542 19543 19544 19545 19546 19547 19548 19549 19550 19551 19552 19553 19554 19555 19556 19557 19558 19559 19560 19561 19562 19563 19564 19565 19566 19567 19568 19569 19570 19571 19572 19573 19574 19575 19576 19577 19578 19579 19580 19581 19582 19583 19584 19585 19586 19587 19588 19589 19590 19591 19592 19593 19594 19595 19596 19597 19598 19599 19600 19601 19602 19603 19604 19605 19606 19607 19608 19609 19610 19611 19612 19613 19614 19615 19616 19617 19618 19619 19620 19621 19622 19623 19624 19625 19626 19627 19628 19629 19630 19631 19632 19633 19634 19635 19636 19637 19638 19639 19640 19641 19642 19643 19644 19645 19646 19647 19648 19649 19650 19651 19652 19653 19654 19655 19656 19657 19658 19659 19660 19661 19662 19663 19664 19665 19666 19667 19668 19669 19670 19671 19672 19673 19674 19675 19676 19677 19678 19679 19680 19681 19682 19683 19684 19685 19686 19687 19688 19689 19690 19691 19692 19693 19694 19695 19696 19697 19698 19699 19700 19701 19702 19703 19704 19705 19706 19707 19708 19709 19710 19711 19712 19713 19714 19715 19716 19717 19718 19719 19720 19721 19722 19723 19724 19725 19726 19727 19728 19729 19730 19731 19732 19733 19734 19735 19736 19737 19738 19739 19740 19741 19742 19743 19744 19745 19746 19747 19748 19749 19750 19751 19752 19753 19754 19755 19756 19757 19758 19759 19760 19761 19762 19763 19764 19765 19766 19767 19768 19769 19770 19771 19772 19773 19774 19775 19776 19777 19778 19779 19780 19781 19782 19783 19784 19785 19786 19787 19788 19789 19790 19791 19792 19793 19794 19795 19796 19797 19798 19799 19800 19801 19802 19803 19804 19805 19806 19807 19808 19809 19810 19811 19812 19813 19814 19815 19816 19817 19818 19819 19820 19821 19822 19823 19824 19825 19826 19827 19828 19829 19830 19831 19832 19833 19834 19835 19836 19837 19838 19839 19840 19841 19842 19843 19844 19845 19846 19847 19848 19849 19850 19851 19852 19853 19854 19855 19856 19857 19858 19859 19860 19861 19862 19863 19864 19865 19866 19867 19868 19869 19870 19871 19872 19873 19874 19875 19876 19877 19878 19879 19880 19881 19882 19883 19884 19885 19886 19887 19888 19889 19890 19891 19892 19893 19894 19895 19896 19897 19898 19899 19900 19901 19902 19903 19904 19905 19906 19907 19908 19909 19910 19911 19912 19913 19914 19915 19916 19917 19918 19919 19920 19921 19922 19923 19924 19925 19926 19927 19928 19929 19930 19931 19932 19933 19934 19935 19936 19937 19938 19939 19940 19941 19942 19943 19944 19945 19946 19947 19948 19949 19950 19951 19952 19953 19954 19955 19956 19957 19958 19959 19960 19961 19962 19963 19964 19965 19966 19967 19968 19969 19970 19971 19972 19973 19974 19975 19976 19977 19978 19979 19980 19981 19982 19983 19984 19985 19986 19987 19988 19989 19990 19991 19992 19993 19994 19995 19996 19997 19998 19999 20000 20001 20002 20003 20004 20005 20006 20007 20008 20009 20010 20011 20012 20013 20014 20015 20016 20017 20018 20019 20020 20021 20022 20023 20024 20025 20026 20027 20028 20029 20030 20031 20032 20033 20034 20035 20036 20037 20038 20039 20040 20041 20042 20043 20044 20045 20046 20047 20048 20049 20050 20051 20052 20053 20054 20055 20056 20057 20058 20059 20060 20061 20062 20063 20064 20065 20066 20067 20068 20069 20070 20071 20072 20073 20074 20075 20076 20077 20078 20079 20080 20081 20082 20083 20084 20085 20086 20087 20088 20089 20090 20091 20092 20093 20094 20095 20096 20097 20098 20099 20100 20101 20102 20103 20104 20105 20106 20107 20108 20109 20110 20111 20112 20113 20114 20115 20116 20117 20118 20119 20120 20121 20122 20123 20124 20125 20126 20127 20128 20129 20130 20131 20132 20133 20134 20135 20136 20137 20138 20139 20140 20141 20142 20143 20144 20145 20146 20147 20148 20149 20150 20151 20152 20153 20154 20155 20156 20157 20158 20159 20160 20161 20162 20163 20164 20165 20166 20167 20168 20169 20170 20171 20172 20173 20174 20175 20176 20177 20178 20179 20180 20181 20182 20183 20184 20185 20186 20187 20188 20189 20190 20191 20192 20193 20194 20195 20196 20197 20198 20199 20200 20201 20202 20203 20204 20205 20206 20207 20208 20209 20210 20211 20212 20213 20214 20215 20216 20217 20218 20219 20220 20221 20222 20223 20224 20225 20226 20227 20228 20229 20230 20231 20232 20233 20234 20235 20236 20237 20238 20239 20240 20241 20242 20243 20244 20245 20246 20247 20248 20249 20250 20251 20252 20253 20254 20255 20256 20257 20258 20259 20260 20261 20262 20263 20264 20265 20266 20267 20268 20269 20270 20271 20272 20273 20274 20275 20276 20277 20278 20279 20280 20281 20282 20283 20284 20285 20286 20287 20288 20289 20290 20291 20292 20293 20294 20295 20296 20297 20298 20299 20300 20301 20302 20303 20304 20305 20306 20307 20308 20309 20310 20311 20312 20313 20314 20315 20316 20317 20318 20319 20320 20321 20322 20323 20324 20325 20326 20327 20328 20329 20330 20331 20332 20333 20334 20335 20336 20337 20338 20339 20340 20341 20342 20343 20344 20345 20346 20347 20348 20349 20350 20351 20352 20353 20354 20355 20356 20357 20358 20359 20360 20361 20362 20363 20364 20365 20366 20367 20368 20369 20370 20371 20372 20373 20374 20375 20376 20377 20378 20379 20380 20381 20382 20383 20384 20385 20386 20387 20388 20389 20390 20391 20392 20393 20394 20395 20396 20397 20398 20399 20400 20401 20402 20403 20404 20405 20406 20407 20408 20409 20410 20411 20412 20413 20414 20415 20416 20417 20418 20419 20420 20421 20422 20423 20424 20425 20426 20427 20428 20429 20430 20431 20432 20433 20434 20435 20436 20437 20438 20439 20440 20441 20442 20443 20444 20445 20446 20447 20448 20449 20450 20451 20452 20453 20454 20455 20456 20457 20458 20459 20460 20461 20462 20463 20464 20465 20466 20467 20468 20469 20470 20471 20472 20473 20474 20475 20476 20477 20478 20479 20480 20481 20482 20483 20484 20485 20486 20487 20488 20489 20490 20491 20492 20493 20494 20495 20496 20497 20498 20499 20500 20501 20502 20503 20504 20505 20506 20507 20508 20509 20510 20511 20512 20513 20514 20515 20516 20517 20518 20519 20520 20521 20522 20523 20524 20525 20526 20527 20528 20529 20530 20531 20532 20533 20534 20535 20536 20537 20538 20539 20540 20541 20542 20543 20544 20545 20546 20547 20548 20549 20550 20551 20552 20553 20554 20555 20556 20557 20558 20559 20560 20561 20562 20563 20564 20565 20566 20567 20568 20569 20570 20571 20572 20573 20574 20575 20576 20577 20578 20579 20580 20581 20582 20583 20584 20585 20586 20587 20588 20589 20590 20591 20592 20593 20594 20595 20596 20597 20598 20599 20600 20601 20602 20603 20604 20605 20606 20607 20608 20609 20610 20611 20612 20613 20614 20615 20616 20617 20618 20619 20620 20621 20622 20623 20624 20625 20626 20627 20628 20629 20630 20631 20632 20633 20634 20635 20636 20637 20638 20639 20640 20641 20642 20643 20644 20645 20646 20647 20648 20649 20650 20651 20652 20653 20654 20655 20656 20657 20658 20659 20660 20661 20662 20663 20664 20665 20666 20667 20668 20669 20670 20671 20672 20673 20674 20675 20676 20677 20678 20679 20680 20681 20682 20683 20684 20685 20686 20687 20688 20689 20690 20691 20692 20693 20694 20695 20696 20697 20698 20699 20700 20701 20702 20703 20704 20705 20706 20707 20708 20709 20710 20711 20712 20713 20714 20715 20716 20717 20718 20719 20720 20721 20722 20723 20724 20725 20726 20727 20728 20729 20730 20731 20732 20733 20734 20735 20736 20737 20738 20739 20740 20741 20742 20743 20744 20745 20746 20747 20748 20749 20750 20751 20752 20753 20754 20755 20756 20757 20758 20759 20760 20761 20762 20763 20764 20765 20766 20767 20768 20769 20770 20771 20772 20773 20774 20775 20776 20777 20778 20779 20780 20781 20782 20783 20784 20785 20786 20787 20788 20789 20790 20791 20792 20793 20794 20795 20796 20797 20798 20799 20800 20801 20802 20803 20804 20805 20806 20807 20808 20809 20810 20811 20812 20813 20814 20815 20816 20817 20818 20819 20820 20821 20822 20823 20824 20825 20826 20827 20828 20829 20830 20831 20832 20833 20834 20835 20836 20837 20838 20839 20840 20841 20842 20843 20844 20845 20846 20847 20848 20849 20850 20851 20852 20853 20854 20855 20856 20857 20858 20859 20860 20861 20862 20863 20864 20865 20866 20867 20868 20869 20870 20871 20872 20873 20874 20875 20876 20877 20878 20879 20880 20881 20882 20883 20884 20885 20886 20887 20888 20889 20890 20891 20892 20893 20894 20895 20896 20897 20898 20899 20900 20901 20902 20903 20904 20905 20906 20907 20908 20909 20910 20911 20912 20913 20914 20915 20916 20917 20918 20919 20920 20921 20922 20923 20924 20925 20926 20927 20928 20929 20930 20931 20932 20933 20934 20935 20936 20937 20938 20939 20940 20941 20942 20943 20944 20945 20946 20947 20948 20949 20950 20951 20952 20953 20954 20955 20956 20957 20958 20959 20960 20961 20962 20963 20964 20965 20966 20967 20968 20969 20970 20971 20972 20973 20974 20975 20976 20977 20978 20979 20980 20981 20982 20983 20984 20985 20986 20987 20988 20989 20990 20991 20992 20993 20994 20995 20996 20997 20998 20999 21000 21001 21002 21003 21004 21005 21006 21007 21008 21009 21010 21011 21012 21013 21014 21015 21016 21017 21018 21019 21020 21021 21022 21023 21024 21025 21026 21027 21028 21029 21030 21031 21032 21033 21034 21035 21036 21037 21038 21039 21040 21041 21042 21043 21044 21045 21046 21047 21048 21049 21050 21051 21052 21053 21054 21055 21056 21057 21058 21059 21060 21061 21062 21063 21064 21065 21066 21067 21068 21069 21070 21071 21072 21073 21074 21075 21076 21077 21078 21079 21080 21081 21082 21083 21084 21085 21086 21087 21088 21089 21090 21091 21092 21093 21094 21095 21096 21097 21098 21099 21100 21101 21102 21103 21104 21105 21106 21107 21108 21109 21110 21111 21112 21113 21114 21115 21116 21117 21118 21119 21120 21121 21122 21123 21124 21125 21126 21127 21128 21129 21130 21131 21132 21133 21134 21135 21136 21137 21138 21139 21140 21141 21142 21143 21144 21145 21146 21147 21148 21149 21150 21151 21152 21153 21154 21155 21156 21157 21158 21159 21160 21161 21162 21163 21164 21165 21166 21167 21168 21169 21170 21171 21172 21173 21174 21175 21176 21177 21178 21179 21180 21181 21182 21183 21184 21185 21186 21187 21188 21189 21190 21191 21192 21193 21194 21195 21196 21197 21198 21199 21200 21201 21202 21203 21204 21205 21206 21207 21208 21209 21210 21211 21212 21213 21214 21215 21216 21217 21218 21219 21220 21221 21222 21223 21224 21225 21226 21227 21228 21229 21230 21231 21232 21233 21234 21235 21236 21237 21238 21239 21240 21241 21242 21243 21244 21245 21246 21247 21248 21249 21250 21251 21252 21253 21254 21255 21256 21257 21258 21259 21260 21261 21262 21263 21264 21265 21266 21267 21268 21269 21270 21271 21272 21273 21274 21275 21276 21277 21278 21279 21280 21281 21282 21283 21284 21285 21286 21287 21288 21289 21290 21291 21292 21293 21294 21295 21296 21297 21298 21299 21300 21301 21302 21303 21304 21305 21306 21307 21308 21309 21310 21311 21312 21313 21314 21315 21316 21317 21318 21319 21320 21321 21322 21323 21324 21325 21326 21327 21328 21329 21330 21331 21332 21333 21334 21335 21336 21337 21338 21339 21340 21341 21342 21343 21344 21345 21346 21347 21348 21349 21350 21351 21352 21353 21354 21355 21356 21357 21358 21359 21360 21361 21362 21363 21364 21365 21366 21367 21368 21369 21370 21371 21372 21373 21374 21375 21376 21377 21378 21379 21380 21381 21382 21383 21384 21385 21386 21387 21388 21389 21390 21391 21392 21393 21394 21395 21396 21397 21398 21399 21400 21401 21402 21403 21404 21405 21406 21407 21408 21409 21410 21411 21412 21413 21414 21415 21416 21417 21418 21419 21420 21421 21422 21423 21424 21425 21426 21427 21428 21429 21430 21431 21432 21433 21434 21435 21436 21437 21438 21439 21440 21441 21442 21443 21444 21445 21446 21447 21448 21449 21450 21451 21452 21453 21454 21455 21456 21457 21458 21459 21460 21461 21462 21463 21464 21465 21466 21467 21468 21469 21470 21471 21472 21473 21474 21475 21476 21477 21478 21479 21480 21481 21482 21483 21484 21485 21486 21487 21488 21489 21490 21491 21492 21493 21494 21495 21496 21497 21498 21499 21500 21501 21502 21503 21504 21505 21506 21507 21508 21509 21510 21511 21512 21513 21514 21515 21516 21517 21518 21519 21520 21521 21522 21523 21524 21525 21526 21527 21528 21529 21530 21531 21532 21533 21534 21535 21536 21537 21538 21539 21540 21541 21542 21543 21544 21545 21546 21547 21548 21549 21550 21551 21552 21553 21554 21555 21556 21557 21558 21559 21560 21561 21562 21563 21564 21565 21566 21567 21568 21569 21570 21571 21572 21573 21574 21575 21576 21577 21578 21579 21580 21581 21582 21583 21584 21585 21586 21587 21588 21589 21590 21591 21592 21593 21594 21595 21596 21597 21598 21599 21600 21601 21602 21603 21604 21605 21606 21607 21608 21609 21610 21611 21612 21613 21614 21615 21616 21617 21618 21619 21620 21621 21622 21623 21624 21625 21626 21627 21628 21629 21630 21631 21632 21633 21634 21635 21636 21637 21638 21639 21640 21641 21642 21643 21644 21645 21646 21647 21648 21649 21650 21651 21652 21653 21654 21655 21656 21657 21658 21659 21660 21661 21662 21663 21664 21665 21666 21667 21668 21669 21670 21671 21672 21673 21674 21675 21676 21677 21678 21679 21680 21681 21682 21683 21684 21685 21686 21687 21688 21689 21690 21691 21692 21693 21694 21695 21696 21697 21698 21699 21700 21701 21702 21703 21704 21705 21706 21707 21708 21709 21710 21711 21712 21713 21714 21715 21716 21717 21718 21719 21720 21721 21722 21723 21724 21725 21726 21727 21728 21729 21730 21731 21732 21733 21734 21735 21736 21737 21738 21739 21740 21741 21742 21743 21744 21745 21746 21747 21748 21749 21750 21751 21752 21753 21754 21755 21756 21757 21758 21759 21760 21761 21762 21763 21764 21765 21766 21767 21768 21769 21770 21771 21772 21773 21774 21775 21776 21777 21778 21779 21780 21781 21782 21783 21784 21785 21786 21787 21788 21789 21790 21791 21792 21793 21794 21795 21796 21797 21798 21799 21800 21801 21802 21803 21804 21805 21806 21807 21808 21809 21810 21811 21812 21813 21814 21815 21816 21817 21818 21819 21820 21821 21822 21823 21824 21825 21826 21827 21828 21829 21830 21831 21832 21833 21834 21835 21836 21837 21838 21839 21840 21841 21842 21843 21844 21845 21846 21847 21848 21849 21850 21851 21852 21853 21854 21855 21856 21857 21858 21859 21860 21861 21862 21863 21864 21865 21866 21867 21868 21869 21870 21871 21872 21873 21874 21875 21876 21877 21878 21879 21880 21881 21882 21883 21884 21885 21886 21887 21888 21889 21890 21891 21892 21893 21894 21895 21896 21897 21898 21899 21900 21901 21902 21903 21904 21905 21906 21907 21908 21909 21910 21911 21912 21913 21914 21915 21916 21917 21918 21919 21920 21921 21922 21923 21924 21925 21926 21927 21928 21929 21930 21931 21932 21933 21934 21935 21936 21937 21938 21939 21940 21941 21942 21943 21944 21945 21946 21947 21948 21949 21950 21951 21952 21953 21954 21955 21956 21957 21958 21959 21960 21961 21962 21963 21964 21965 21966 21967 21968 21969 21970 21971 21972 21973 21974 21975 21976 21977 21978 21979 21980 21981 21982 21983 21984 21985 21986 21987 21988 21989 21990 21991 21992 21993 21994 21995 21996 21997 21998 21999 22000 22001 22002 22003 22004 22005 22006 22007 22008 22009 22010 22011 22012 22013 22014 22015 22016 22017 22018 22019 22020 22021 22022 22023 22024 22025 22026 22027 22028 22029 22030 22031 22032 22033 22034 22035 22036 22037 22038 22039 22040 22041 22042 22043 22044 22045 22046 22047 22048 22049 22050 22051 22052 22053 22054 22055 22056 22057 22058 22059 22060 22061 22062 22063 22064 22065 22066 22067 22068 22069 22070 22071 22072 22073 22074 22075 22076 22077 22078 22079 22080 22081 22082 22083 22084 22085 22086 22087 22088 22089 22090 22091 22092 22093 22094 22095 22096 22097 22098 22099 22100 22101 22102 22103 22104 22105 22106 22107 22108 22109 22110 22111 22112 22113 22114 22115 22116 22117 22118 22119 22120 22121 22122 22123 22124 22125 22126 22127 22128 22129 22130 22131 22132 22133 22134 22135 22136 22137 22138 22139 22140 22141 22142 22143 22144 22145 22146 22147 22148 22149 22150 22151 22152 22153 22154 22155 22156 22157 22158 22159 22160 22161 22162 22163 22164 22165 22166 22167 22168 22169 22170 22171 22172 22173 22174 22175 22176 22177 22178 22179 22180 22181 22182 22183 22184 22185 22186 22187 22188 22189 22190 22191 22192 22193 22194 22195 22196 22197 22198 22199 22200 22201 22202 22203 22204 22205 22206 22207 22208 22209 22210 22211 22212 22213 22214 22215 22216 22217 22218 22219 22220 22221 22222 22223 22224 22225 22226 22227 22228 22229 22230 22231 22232 22233 22234 22235 22236 22237 22238 22239 22240 22241 22242 22243 22244 22245 22246 22247 22248 22249 22250 22251 22252 22253 22254 22255 22256 22257 22258 22259 22260 22261 22262 22263 22264 22265 22266 22267 22268 22269 22270 22271 22272 22273 22274 22275 22276 22277 22278 22279 22280 22281 22282 22283 22284 22285 22286 22287 22288 22289 22290 22291 22292 22293 22294 22295 22296 22297 22298 22299 22300 22301 22302 22303 22304 22305 22306 22307 22308 22309 22310 22311 22312 22313 22314 22315 22316 22317 22318 22319 22320 22321 22322 22323 22324 22325 22326 22327 22328 22329 22330 22331 22332 22333 22334 22335 22336 22337 22338 22339 22340 22341 22342 22343 22344 22345 22346 22347 22348 22349 22350 22351 22352 22353 22354 22355 22356 22357 22358 22359 22360 22361 22362 22363 22364 22365 22366 22367 22368 22369 22370 22371 22372 22373 22374 22375 22376 22377 22378 22379 22380 22381 22382 22383 22384 22385 22386 22387 22388 22389 22390 22391 22392 22393 22394 22395 22396 22397 22398 22399 22400 22401 22402 22403 22404 22405 22406 22407 22408 22409 22410 22411 22412 22413 22414 22415 22416 22417 22418 22419 22420 22421 22422 22423 22424 22425 22426 22427 22428 22429 22430 22431 22432 22433 22434 22435 22436 22437 22438 22439 22440 22441 22442 22443 22444 22445 22446 22447 22448 22449 22450 22451 22452 22453 22454 22455 22456 22457 22458 22459 22460 22461 22462 22463 22464 22465 22466 22467 22468 22469 22470 22471 22472 22473 22474 22475 22476 22477 22478 22479 22480 22481 22482 22483 22484 22485 22486 22487 22488 22489 22490 22491 22492 22493 22494 22495 22496 22497 22498 22499 22500 22501 22502 22503 22504 22505 22506 22507 22508 22509 22510 22511 22512 22513 22514 22515 22516 22517 22518 22519 22520 22521 22522 22523 22524 22525 22526 22527 22528 22529 22530 22531 22532 22533 22534 22535 22536 22537 22538 22539 22540 22541 22542 22543 22544 22545 22546 22547 22548 22549 22550 22551 22552 22553 22554 22555 22556 22557 22558 22559 22560 22561 22562 22563 22564 22565 22566 22567 22568 22569 22570 22571 22572 22573 22574 22575 22576 22577 22578 22579 22580 22581 22582 22583 22584 22585 22586 22587 22588 22589 22590 22591 22592 22593 22594 22595 22596 22597 22598 22599 22600 22601 22602 22603 22604 22605 22606 22607 22608 22609 22610 22611 22612 22613 22614 22615 22616 22617 22618 22619 22620 22621 22622 22623 22624 22625 22626 22627 22628 22629 22630 22631 22632 22633 22634 22635 22636 22637 22638 22639 22640 22641 22642 22643 22644 22645 22646 22647 22648 22649 22650 22651 22652 22653 22654 22655 22656 22657 22658 22659 22660 22661 22662 22663 22664 22665 22666 22667 22668 22669 22670 22671 22672 22673 22674 22675 22676 22677 22678 22679 22680 22681 22682 22683 22684 22685 22686 22687 22688 22689 22690 22691 22692 22693 22694 22695 22696 22697 22698 22699 22700 22701 22702 22703 22704 22705 22706 22707 22708 22709 22710 22711 22712 22713 22714 22715 22716 22717 22718 22719 22720 22721 22722 22723 22724 22725 22726 22727 22728 22729 22730 22731 22732 22733 22734 22735 22736 22737 22738 22739 22740 22741 22742 22743 22744 22745 22746 22747 22748 22749 22750 22751 22752 22753 22754 22755 22756 22757 22758 22759 22760 22761 22762 22763 22764 22765 22766 22767 22768 22769 22770 22771 22772 22773 22774 22775 22776 22777 22778 22779 22780 22781 22782 22783 22784 22785 22786 22787 22788 22789 22790 22791 22792 22793 22794 22795 22796 22797 22798 22799 22800 22801 22802 22803 22804 22805 22806 22807 22808 22809 22810 22811 22812 22813 22814 22815 22816 22817 22818 22819 22820 22821 22822 22823 22824 22825 22826 22827 22828 22829 22830 22831 22832 22833 22834 22835 22836 22837 22838 22839 22840 22841 22842 22843 22844 22845 22846 22847 22848 22849 22850 22851 22852 22853 22854 22855 22856 22857 22858 22859 22860 22861 22862 22863 22864 22865 22866 22867 22868 22869 22870 22871 22872 22873 22874 22875 22876 22877 22878 22879 22880 22881 22882 22883 22884 22885 22886 22887 22888 22889 22890 22891 22892 22893 22894 22895 22896 22897 22898 22899 22900 22901 22902 22903 22904 22905 22906 22907 22908 22909 22910 22911 22912 22913 22914 22915 22916 22917 22918 22919 22920 22921 22922 22923 22924 22925 22926 22927 22928 22929 22930 22931 22932 22933 22934 22935 22936 22937 22938 22939 22940 22941 22942 22943 22944 22945 22946 22947 22948 22949 22950 22951 22952 22953 22954 22955 22956 22957 22958 22959 22960 22961 22962 22963 22964 22965 22966 22967 22968 22969 22970 22971 22972 22973 22974 22975 22976 22977 22978 22979 22980 22981 22982 22983 22984 22985 22986 22987 22988 22989 22990 22991 22992 22993 22994 22995 22996 22997 22998 22999 23000 23001 23002 23003 23004 23005 23006 23007 23008 23009 23010 23011 23012 23013 23014 23015 23016 23017 23018 23019 23020 23021 23022 23023 23024 23025 23026 23027 23028 23029 23030 23031 23032 23033 23034 23035 23036 23037 23038 23039 23040 23041 23042 23043 23044 23045 23046 23047 23048 23049 23050 23051 23052 23053 23054 23055 23056 23057 23058 23059 23060 23061 23062 23063 23064 23065 23066 23067 23068 23069 23070 23071 23072 23073 23074 23075 23076 23077 23078 23079 23080 23081 23082 23083 23084 23085 23086 23087 23088 23089 23090 23091 23092 23093 23094 23095 23096 23097 23098 23099 23100 23101 23102 23103 23104 23105 23106 23107 23108 23109 23110 23111 23112 23113 23114 23115 23116 23117 23118 23119 23120 23121 23122 23123 23124 23125 23126 23127 23128 23129 23130 23131 23132 23133 23134 23135 23136 23137 23138 23139 23140 23141 23142 23143 23144 23145 23146 23147 23148 23149 23150 23151 23152 23153 23154 23155 23156 23157 23158 23159 23160 23161 23162 23163 23164 23165 23166 23167 23168 23169 23170 23171 23172 23173 23174 23175 23176 23177 23178 23179 23180 23181 23182 23183 23184 23185 23186 23187 23188 23189 23190 23191 23192 23193 23194 23195 23196 23197 23198 23199 23200 23201 23202 23203 23204 23205 23206 23207 23208 23209 23210 23211 23212 23213 23214 23215 23216 23217 23218 23219 23220 23221 23222 23223 23224 23225 23226 23227 23228 23229 23230 23231 23232 23233 23234 23235 23236 23237 23238 23239 23240 23241 23242 23243 23244 23245 23246 23247 23248 23249 23250 23251 23252 23253 23254 23255 23256 23257 23258 23259 23260 23261 23262 23263 23264 23265 23266 23267 23268 23269 23270 23271 23272 23273 23274 23275 23276 23277 23278 23279 23280 23281 23282 23283 23284 23285 23286 23287 23288 23289 23290 23291 23292 23293 23294 23295 23296 23297 23298 23299 23300 23301 23302 23303 23304 23305 23306 23307 23308 23309 23310 23311 23312 23313 23314 23315 23316 23317 23318 23319 23320 23321 23322 23323 23324 23325 23326 23327 23328 23329 23330 23331 23332 23333 23334 23335 23336 23337 23338 23339 23340 23341 23342 23343 23344 23345 23346 23347 23348 23349 23350 23351 23352 23353 23354 23355 23356 23357 23358 23359 23360 23361 23362 23363 23364 23365 23366 23367 23368 23369 23370 23371 23372 23373 23374 23375 23376 23377 23378 23379 23380 23381 23382 23383 23384 23385 23386 23387 23388 23389 23390 23391 23392 23393 23394 23395 23396 23397 23398 23399 23400 23401 23402 23403 23404 23405 23406 23407 23408 23409 23410 23411 23412 23413 23414 23415 23416 23417 23418 23419 23420 23421 23422 23423 23424 23425 23426 23427 23428 23429 23430 23431 23432 23433 23434 23435 23436 23437 23438 23439 23440 23441 23442 23443 23444 23445 23446 23447 23448 23449 23450 23451 23452 23453 23454 23455 23456 23457 23458 23459 23460 23461 23462 23463 23464 23465 23466 23467 23468 23469 23470 23471 23472 23473 23474 23475 23476 23477 23478 23479 23480 23481 23482 23483 23484 23485 23486 23487 23488 23489 23490 23491 23492 23493 23494 23495 23496 23497 23498 23499 23500 23501 23502 23503 23504 23505 23506 23507 23508 23509 23510 23511 23512 23513 23514 23515 23516 23517 23518 23519 23520 23521 23522 23523 23524 23525 23526 23527 23528 23529 23530 23531 23532 23533 23534 23535 23536 23537 23538 23539 23540 23541 23542 23543 23544 23545 23546 23547 23548 23549 23550 23551 23552 23553 23554 23555 23556 23557 23558 23559 23560 23561 23562 23563 23564 23565 23566 23567 23568 23569 23570 23571 23572 23573 23574 23575 23576 23577 23578 23579 23580 23581 23582 23583 23584 23585 23586 23587 23588 23589 23590 23591 23592 23593 23594 23595 23596 23597 23598 23599 23600 23601 23602 23603 23604 23605 23606 23607 23608 23609 23610 23611 23612 23613 23614 23615 23616 23617 23618 23619 23620 23621 23622 23623 23624 23625 23626 23627 23628 23629 23630 23631 23632 23633 23634 23635 23636 23637 23638 23639 23640 23641 23642 23643 23644 23645 23646 23647 23648 23649 23650 23651 23652 23653 23654 23655 23656 23657 23658 23659 23660 23661 23662 23663 23664 23665 23666 23667 23668 23669 23670 23671 23672 23673 23674 23675 23676 23677 23678 23679 23680 23681 23682 23683 23684 23685 23686 23687 23688 23689 23690 23691 23692 23693 23694 23695 23696 23697 23698 23699 23700 23701 23702 23703 23704 23705 23706 23707 23708 23709 23710 23711 23712 23713 23714 23715 23716 23717 23718 23719 23720 23721 23722 23723 23724 23725 23726 23727 23728 23729 23730 23731 23732 23733 23734 23735 23736 23737 23738 23739 23740 23741 23742 23743 23744 23745 23746 23747 23748 23749 23750 23751 23752 23753 23754 23755 23756 23757 23758 23759 23760 23761 23762 23763 23764 23765 23766 23767 23768 23769 23770 23771 23772 23773 23774 23775 23776 23777 23778 23779 23780 23781 23782 23783 23784 23785 23786 23787 23788 23789 23790 23791 23792 23793 23794 23795 23796 23797 23798 23799 23800 23801 23802 23803 23804 23805 23806 23807 23808 23809 23810 23811 23812 23813 23814 23815 23816 23817 23818 23819 23820 23821 23822 23823 23824 23825 23826 23827 23828 23829 23830 23831 23832 23833 23834 23835 23836 23837 23838 23839 23840 23841 23842 23843 23844 23845 23846 23847 23848 23849 23850 23851 23852 23853 23854 23855 23856 23857 23858 23859 23860 23861 23862 23863 23864 23865 23866 23867 23868 23869 23870 23871 23872 23873 23874 23875 23876 23877 23878 23879 23880 23881 23882 23883 23884 23885 23886 23887 23888 23889 23890 23891 23892 23893 23894 23895 23896 23897 23898 23899 23900 23901 23902 23903 23904 23905 23906 23907 23908 23909 23910 23911 23912 23913 23914 23915 23916 23917 23918 23919 23920 23921 23922 23923 23924 23925 23926 23927 23928 23929 23930 23931 23932 23933 23934 23935 23936 23937 23938 23939 23940 23941 23942 23943 23944 23945 23946 23947 23948 23949 23950 23951 23952 23953 23954 23955 23956 23957 23958 23959 23960 23961 23962 23963 23964 23965 23966 23967 23968 23969 23970 23971 23972 23973 23974 23975 23976 23977 23978 23979 23980 23981 23982 23983 23984 23985 23986 23987 23988 23989 23990 23991 23992 23993 23994 23995 23996 23997 23998 23999 24000 24001 24002 24003 24004 24005 24006 24007 24008 24009 24010 24011 24012 24013 24014 24015 24016 24017 24018 24019 24020 24021 24022 24023 24024 24025 24026 24027 24028 24029 24030 24031 24032 24033 24034 24035 24036 24037 24038 24039 24040 24041 24042 24043 24044 24045 24046 24047 24048 24049 24050 24051 24052 24053 24054 24055 24056 24057 24058 24059 24060 24061 24062 24063 24064 24065 24066 24067 24068 24069 24070 24071 24072 24073 24074 24075 24076 24077 24078 24079 24080 24081 24082 24083 24084 24085 24086 24087 24088 24089 24090 24091 24092 24093 24094 24095 24096 24097 24098 24099 24100 24101 24102 24103 24104 24105 24106 24107 24108 24109 24110 24111 24112 24113 24114 24115 24116 24117 24118 24119 24120 24121 24122 24123 24124 24125 24126 24127 24128 24129 24130 24131 24132 24133 24134 24135 24136 24137 24138 24139 24140 24141 24142 24143 24144 24145 24146 24147 24148 24149 24150 24151 24152 24153 24154 24155 24156 24157 24158 24159 24160 24161 24162 24163 24164 24165 24166 24167 24168 24169 24170 24171 24172 24173 24174 24175 24176 24177 24178 24179 24180 24181 24182 24183 24184 24185 24186 24187 24188 24189 24190 24191 24192 24193 24194 24195 24196 24197 24198 24199 24200 24201 24202 24203 24204 24205 24206 24207 24208 24209 24210 24211 24212 24213 24214 24215 24216 24217 24218 24219 24220 24221 24222 24223 24224 24225 24226 24227 24228 24229 24230 24231 24232 24233 24234 24235 24236 24237 24238 24239 24240 24241 24242 24243 24244 24245 24246 24247 24248 24249 24250 24251 24252 24253 24254 24255 24256 24257 24258 24259 24260 24261 24262 24263 24264 24265 24266 24267 24268 24269 24270 24271 24272 24273 24274 24275 24276 24277 24278 24279 24280 24281 24282 24283 24284 24285 24286 24287 24288 24289 24290 24291 24292 24293 24294 24295 24296 24297 24298 24299 24300 24301 24302 24303 24304 24305 24306 24307 24308 24309 24310 24311 24312 24313 24314 24315 24316 24317 24318 24319 24320 24321 24322 24323 24324 24325 24326 24327 24328 24329 24330 24331 24332 24333 24334 24335 24336 24337 24338 24339 24340 24341 24342 24343 24344 24345 24346 24347 24348 24349 24350 24351 24352 24353 24354 24355 24356 24357 24358 24359 24360 24361 24362 24363 24364 24365 24366 24367 24368 24369 24370 24371 24372 24373 24374 24375 24376 24377 24378 24379 24380 24381 24382 24383 24384 24385 24386 24387 24388 24389 24390 24391 24392 24393 24394 24395 24396 24397 24398 24399 24400 24401 24402 24403 24404 24405 24406 24407 24408 24409 24410 24411 24412 24413 24414 24415 24416 24417 24418 24419 24420 24421 24422 24423 24424 24425 24426 24427 24428 24429 24430 24431 24432 24433 24434 24435 24436 24437 24438 24439 24440 24441 24442 24443 24444 24445 24446 24447 24448 24449 24450 24451 24452 24453 24454 24455 24456 24457 24458 24459 24460 24461 24462 24463 24464 24465 24466 24467 24468 24469 24470 24471 24472 24473 24474 24475 24476 24477 24478 24479 24480 24481 24482 24483 24484 24485 24486 24487 24488 24489 24490 24491 24492 24493 24494 24495 24496 24497 24498 24499 24500 24501 24502 24503 24504 24505 24506 24507 24508 24509 24510 24511 24512 24513 24514 24515 24516 24517 24518 24519 24520 24521 24522 24523 24524 24525 24526 24527 24528 24529 24530 24531 24532 24533 24534 24535 24536 24537 24538 24539 24540 24541 24542 24543 24544 24545 24546 24547 24548 24549 24550 24551 24552 24553 24554 24555 24556 24557 24558 24559 24560 24561 24562 24563 24564 24565 24566 24567 24568 24569 24570 24571 24572 24573 24574 24575 24576 24577 24578 24579 24580 24581 24582 24583 24584 24585 24586 24587 24588 24589 24590 24591 24592 24593 24594 24595 24596 24597 24598 24599 24600 24601 24602 24603 24604 24605 24606 24607 24608 24609 24610 24611 24612 24613 24614 24615 24616 24617 24618 24619 24620 24621 24622 24623 24624 24625 24626 24627 24628 24629 24630 24631 24632 24633 24634 24635 24636 24637 24638 24639 24640 24641 24642 24643 24644 24645 24646 24647 24648 24649 24650 24651 24652 24653 24654 24655 24656 24657 24658 24659 24660 24661 24662 24663 24664 24665 24666 24667 24668 24669 24670 24671 24672 24673 24674 24675 24676 24677 24678 24679 24680 24681 24682 24683 24684 24685 24686 24687 24688 24689 24690 24691 24692 24693 24694 24695 24696 24697 24698 24699 24700 24701 24702 24703 24704 24705 24706 24707 24708 24709 24710 24711 24712 24713 24714 24715 24716 24717 24718 24719 24720 24721 24722 24723 24724 24725 24726 24727 24728 24729 24730 24731 24732 24733 24734 24735 24736 24737 24738 24739 24740 24741 24742 24743 24744 24745 24746 24747 24748 24749 24750 24751 24752 24753 24754 24755 24756 24757 24758 24759 24760 24761 24762 24763 24764 24765 24766 24767 24768 24769 24770 24771 24772 24773 24774 24775 24776 24777 24778 24779 24780 24781 24782 24783 24784 24785 24786 24787 24788 24789 24790 24791 24792 24793 24794 24795 24796 24797 24798 24799 24800 24801 24802 24803 24804 24805 24806 24807 24808 24809 24810 24811 24812 24813 24814 24815 24816 24817 24818 24819 24820 24821 24822 24823 24824 24825 24826 24827 24828 24829 24830 24831 24832 24833 24834 24835 24836 24837 24838 24839 24840 24841 24842 24843 24844 24845 24846 24847 24848 24849 24850 24851 24852 24853 24854 24855 24856 24857 24858 24859 24860 24861 24862 24863 24864 24865 24866 24867 24868 24869 24870 24871 24872 24873 24874 24875 24876 24877 24878 24879 24880 24881 24882 24883 24884 24885 24886 24887 24888 24889 24890 24891 24892 24893 24894 24895 24896 24897 24898 24899 24900 24901 24902 24903 24904 24905 24906 24907 24908 24909 24910 24911 24912 24913 24914 24915 24916 24917 24918 24919 24920 24921 24922 24923 24924 24925 24926 24927 24928 24929 24930 24931 24932 24933 24934 24935 24936 24937 24938 24939 24940 24941 24942 24943 24944 24945 24946 24947 24948 24949 24950 24951 24952 24953 24954 24955 24956 24957 24958 24959 24960 24961 24962 24963 24964 24965 24966 24967 24968 24969 24970 24971 24972 24973 24974 24975 24976 24977 24978 24979 24980 24981 24982 24983 24984 24985 24986 24987 24988 24989 24990 24991 24992 24993 24994 24995 24996 24997 24998 24999 25000 25001 25002 25003 25004 25005 25006 25007 25008 25009 25010 25011 25012 25013 25014 25015 25016 25017 25018 25019 25020 25021 25022 25023 25024 25025 25026 25027 25028 25029 25030 25031 25032 25033 25034 25035 25036 25037 25038 25039 25040 25041 25042 25043 25044 25045 25046 25047 25048 25049 25050 25051 25052 25053 25054 25055 25056 25057 25058 25059 25060 25061 25062 25063 25064 25065 25066 25067 25068 25069 25070 25071 25072 25073 25074 25075 25076 25077 25078 25079 25080 25081 25082 25083 25084 25085 25086 25087 25088 25089 25090 25091 25092 25093 25094 25095 25096 25097 25098 25099 25100 25101 25102 25103 25104 25105 25106 25107 25108 25109 25110 25111 25112 25113 25114 25115 25116 25117 25118 25119 25120 25121 25122 25123 25124 25125 25126 25127 25128 25129 25130 25131 25132 25133 25134 25135 25136 25137 25138 25139 25140 25141 25142 25143 25144 25145 25146 25147 25148 25149 25150 25151 25152 25153 25154 25155 25156 25157 25158 25159 25160 25161 25162 25163 25164 25165 25166 25167 25168 25169 25170 25171 25172 25173 25174 25175 25176 25177 25178 25179 25180 25181 25182 25183 25184 25185 25186 25187 25188 25189 25190 25191 25192 25193 25194 25195 25196 25197 25198 25199 25200 25201 25202 25203 25204 25205 25206 25207 25208 25209 25210 25211 25212 25213 25214 25215 25216 25217 25218 25219 25220 25221 25222 25223 25224 25225 25226 25227 25228 25229 25230 25231 25232 25233 25234 25235 25236 25237 25238 25239 25240 25241 25242 25243 25244 25245 25246 25247 25248 25249 25250 25251 25252 25253 25254 25255 25256 25257 25258 25259 25260 25261 25262 25263 25264 25265 25266 25267 25268 25269 25270 25271 25272 25273 25274 25275 25276 25277 25278 25279 25280 25281 25282 25283 25284 25285 25286 25287 25288 25289 25290 25291 25292 25293 25294 25295 25296 25297 25298 25299 25300 25301 25302 25303 25304 25305 25306 25307 25308 25309 25310 25311 25312 25313 25314 25315 25316 25317 25318 25319 25320 25321 25322 25323 25324 25325 25326 25327 25328 25329 25330 25331 25332 25333 25334 25335 25336 25337 25338 25339 25340 25341 25342 25343 25344 25345 25346 25347 25348 25349 25350 25351 25352 25353 25354 25355 25356 25357 25358 25359 25360 25361 25362 25363 25364 25365 25366 25367 25368 25369 25370 25371 25372 25373 25374 25375 25376 25377 25378 25379 25380 25381 25382 25383 25384 25385 25386 25387 25388 25389 25390 25391 25392 25393 25394 25395 25396 25397 25398 25399 25400 25401 25402 25403 25404 25405 25406 25407 25408 25409 25410 25411 25412 25413 25414 25415 25416 25417 25418 25419 25420 25421 25422 25423 25424 25425 25426 25427 25428 25429 25430 25431 25432 25433 25434 25435 25436 25437 25438 25439 25440 25441 25442 25443 25444 25445 25446 25447 25448 25449 25450 25451 25452 25453 25454 25455 25456 25457 25458 25459 25460 25461 25462 25463 25464 25465 25466 25467 25468 25469 25470 25471 25472 25473 25474 25475 25476 25477 25478 25479 25480 25481 25482 25483 25484 25485 25486 25487 25488 25489 25490 25491 25492 25493 25494 25495 25496 25497 25498 25499 25500 25501 25502 25503 25504 25505 25506 25507 25508 25509 25510 25511 25512 25513 25514 25515 25516 25517 25518 25519 25520 25521 25522 25523 25524 25525 25526 25527 25528 25529 25530 25531 25532 25533 25534 25535 25536 25537 25538 25539 25540 25541 25542 25543 25544 25545 25546 25547 25548 25549 25550 25551 25552 25553 25554 25555 25556 25557 25558 25559 25560 25561 25562 25563 25564 25565 25566 25567 25568 25569 25570 25571 25572 25573 25574 25575 25576 25577 25578 25579 25580 25581 25582 25583 25584 25585 25586 25587 25588 25589 25590 25591 25592 25593 25594 25595 25596 25597 25598 25599 25600 25601 25602 25603 25604 25605 25606 25607 25608 25609 25610 25611 25612 25613 25614 25615 25616 25617 25618 25619 25620 25621 25622 25623 25624 25625 25626 25627 25628 25629 25630 25631 25632 25633 25634 25635 25636 25637 25638 25639 25640 25641 25642 25643 25644 25645 25646 25647 25648 25649 25650 25651 25652 25653 25654 25655 25656 25657 25658 25659 25660 25661 25662 25663 25664 25665 25666 25667 25668 25669 25670 25671 25672 25673 25674 25675 25676 25677 25678 25679 25680 25681 25682 25683 25684 25685 25686 25687 25688 25689 25690 25691 25692 25693 25694 25695 25696 25697 25698 25699 25700 25701 25702 25703 25704 25705 25706 25707 25708 25709 25710 25711 25712 25713 25714 25715 25716 25717 25718 25719 25720 25721 25722 25723 25724 25725 25726 25727 25728 25729 25730 25731 25732 25733 25734 25735 25736 25737 25738 25739 25740 25741 25742 25743 25744 25745 25746 25747 25748 25749 25750 25751 25752 25753 25754 25755 25756 25757 25758 25759 25760 25761 25762 25763 25764 25765 25766 25767 25768 25769 25770 25771 25772 25773 25774 25775 25776 25777 25778 25779 25780 25781 25782 25783 25784 25785 25786 25787 25788 25789 25790 25791 25792 25793 25794 25795 25796 25797 25798 25799 25800 25801 25802 25803 25804 25805 25806 25807 25808 25809 25810 25811 25812 25813 25814 25815 25816 25817 25818 25819 25820 25821 25822 25823 25824 25825 25826 25827 25828 25829 25830 25831 25832 25833 25834 25835 25836 25837 25838 25839 25840 25841 25842 25843 25844 25845 25846 25847 25848 25849 25850 25851 25852 25853 25854 25855 25856 25857 25858 25859 25860 25861 25862 25863 25864 25865 25866 25867 25868 25869 25870 25871 25872 25873 25874 25875 25876 25877 25878 25879 25880 25881 25882 25883 25884 25885 25886 25887 25888 25889 25890 25891 25892 25893 25894 25895 25896 25897 25898 25899 25900 25901 25902 25903 25904 25905 25906 25907 25908 25909 25910 25911 25912 25913 25914 25915 25916 25917 25918 25919 25920 25921 25922 25923 25924 25925 25926 25927 25928 25929 25930 25931 25932 25933 25934 25935 25936 25937 25938 25939 25940 25941 25942 25943 25944 25945 25946 25947 25948 25949 25950 25951 25952 25953 25954 25955 25956 25957 25958 25959 25960 25961 25962 25963 25964 25965 25966 25967 25968 25969 25970 25971 25972 25973 25974 25975 25976 25977 25978 25979 25980 25981 25982 25983 25984 25985 25986 25987 25988 25989 25990 25991 25992 25993 25994 25995 25996 25997 25998 25999 26000 26001 26002 26003 26004 26005 26006 26007 26008 26009 26010 26011 26012 26013 26014 26015 26016 26017 26018 26019 26020 26021 26022 26023 26024 26025 26026 26027 26028 26029 26030 26031 26032 26033 26034 26035 26036 26037 26038 26039 26040 26041 26042 26043 26044 26045 26046 26047 26048 26049 26050 26051 26052 26053 26054 26055 26056 26057 26058 26059 26060 26061 26062 26063 26064 26065 26066 26067 26068 26069 26070 26071 26072 26073 26074 26075 26076 26077 26078 26079 26080 26081 26082 26083 26084 26085 26086 26087 26088 26089 26090 26091 26092 26093 26094 26095 26096 26097 26098 26099 26100 26101 26102 26103 26104 26105 26106 26107 26108 26109 26110 26111 26112 26113 26114 26115 26116 26117 26118 26119 26120 26121 26122 26123 26124 26125 26126 26127 26128 26129 26130 26131 26132 26133 26134 26135 26136 26137 26138 26139 26140 26141 26142 26143 26144 26145 26146 26147 26148 26149 26150 26151 26152 26153 26154 26155 26156 26157 26158 26159 26160 26161 26162 26163 26164 26165 26166 26167 26168 26169 26170 26171 26172 26173 26174 26175 26176 26177 26178 26179 26180 26181 26182 26183 26184 26185 26186 26187 26188 26189 26190 26191 26192 26193 26194 26195 26196 26197 26198 26199 26200 26201 26202 26203 26204 26205 26206 26207 26208 26209 26210 26211 26212 26213 26214 26215 26216 26217 26218 26219 26220 26221 26222 26223 26224 26225 26226 26227 26228 26229 26230 26231 26232 26233 26234 26235 26236 26237 26238 26239 26240 26241 26242 26243 26244 26245 26246 26247 26248 26249 26250 26251 26252 26253 26254 26255 26256 26257 26258 26259 26260 26261 26262 26263 26264 26265 26266 26267 26268 26269 26270 26271 26272 26273 26274 26275 26276 26277 26278 26279 26280 26281 26282 26283 26284 26285 26286 26287 26288 26289 26290 26291 26292 26293 26294 26295 26296 26297 26298 26299 26300 26301 26302 26303 26304 26305 26306 26307 26308 26309 26310 26311 26312 26313 26314 26315 26316 26317 26318 26319 26320 26321 26322 26323 26324 26325 26326 26327 26328 26329 26330 26331 26332 26333 26334 26335 26336 26337 26338 26339 26340 26341 26342 26343 26344 26345 26346 26347 26348 26349 26350 26351 26352 26353 26354 26355 26356 26357 26358 26359 26360 26361 26362 26363 26364 26365 26366 26367 26368 26369 26370 26371 26372 26373 26374 26375 26376 26377 26378 26379 26380 26381 26382 26383 26384 26385 26386 26387 26388 26389 26390 26391 26392 26393 26394 26395 26396 26397 26398 26399 26400 26401 26402 26403 26404 26405 26406 26407 26408 26409 26410 26411 26412 26413 26414 26415 26416 26417 26418 26419 26420 26421 26422 26423 26424 26425 26426 26427 26428 26429 26430 26431 26432 26433 26434 26435 26436 26437 26438 26439 26440 26441 26442 26443 26444 26445 26446 26447 26448 26449 26450 26451 26452 26453 26454 26455 26456 26457 26458 26459 26460 26461 26462 26463 26464 26465 26466 26467 26468 26469 26470 26471 26472 26473 26474 26475 26476 26477 26478 26479 26480 26481 26482 26483 26484 26485 26486 26487 26488 26489 26490 26491 26492 26493 26494 26495 26496 26497 26498 26499 26500 26501 26502 26503 26504 26505 26506 26507 26508 26509 26510 26511 26512 26513 26514 26515 26516 26517 26518 26519 26520 26521 26522 26523 26524 26525 26526 26527 26528 26529 26530 26531 26532 26533 26534 26535 26536 26537 26538 26539 26540 26541 26542 26543 26544 26545 26546 26547 26548 26549 26550 26551 26552 26553 26554 26555 26556 26557 26558 26559 26560 26561 26562 26563 26564 26565 26566 26567 26568 26569 26570 26571 26572 26573 26574 26575 26576 26577 26578 26579 26580 26581 26582 26583 26584 26585 26586 26587 26588 26589 26590 26591 26592 26593 26594 26595 26596 26597 26598 26599 26600 26601 26602 26603 26604 26605 26606 26607 26608 26609 26610 26611 26612 26613 26614 26615 26616 26617 26618 26619 26620 26621 26622 26623 26624 26625 26626 26627 26628 26629 26630 26631 26632 26633 26634 26635 26636 26637 26638 26639 26640 26641 26642 26643 26644 26645 26646 26647 26648 26649 26650 26651 26652 26653 26654 26655 26656 26657 26658 26659 26660 26661 26662 26663 26664 26665 26666 26667 26668 26669 26670 26671 26672 26673 26674 26675 26676 26677 26678 26679 26680 26681 26682 26683 26684 26685 26686 26687 26688 26689 26690 26691 26692 26693 26694 26695 26696 26697 26698 26699 26700 26701 26702 26703 26704 26705 26706 26707 26708 26709 26710 26711 26712 26713 26714 26715 26716 26717 26718 26719 26720 26721 26722 26723 26724 26725 26726 26727 26728 26729 26730 26731 26732 26733 26734 26735 26736 26737 26738 26739 26740 26741 26742 26743 26744 26745 26746 26747 26748 26749 26750 26751 26752 26753 26754 26755 26756 26757 26758 26759 26760 26761 26762 26763 26764 26765 26766 26767 26768 26769 26770 26771 26772 26773 26774 26775 26776 26777 26778 26779 26780 26781 26782 26783 26784 26785 26786 26787 26788 26789 26790 26791 26792 26793 26794 26795 26796 26797 26798 26799 26800 26801 26802 26803 26804 26805 26806 26807 26808 26809 26810 26811 26812 26813 26814 26815 26816 26817 26818 26819 26820 26821 26822 26823 26824 26825 26826 26827 26828 26829 26830 26831 26832 26833 26834 26835 26836 26837 26838 26839 26840 26841 26842 26843 26844 26845 26846 26847 26848 26849 26850 26851 26852 26853 26854 26855 26856 26857 26858 26859 26860 26861 26862 26863 26864 26865 26866 26867 26868 26869 26870 26871 26872 26873 26874 26875 26876 26877 26878 26879 26880 26881 26882 26883 26884 26885 26886 26887 26888 26889 26890 26891 26892 26893 26894 26895 26896 26897 26898 26899 26900 26901 26902 26903 26904 26905 26906 26907 26908 26909 26910 26911 26912 26913 26914 26915 26916 26917 26918 26919 26920 26921 26922 26923 26924 26925 26926 26927 26928 26929 26930 26931 26932 26933 26934 26935 26936 26937 26938 26939 26940 26941 26942 26943 26944 26945 26946 26947 26948 26949 26950 26951 26952 26953 26954 26955 26956 26957 26958 26959 26960 26961 26962 26963 26964 26965 26966 26967 26968 26969 26970 26971 26972 26973 26974 26975 26976 26977
|
Description: <short summary of the patch>
TODO: Put a short summary on the line above and replace this paragraph
with a longer explanation of this change. Complete the meta-information
with other relevant fields (see below for details). To make it easier, the
information below has been extracted from the changelog. Adjust it or drop
it.
.
hol88 (2.02.19940316-15) unstable; urgency=low
.
* lintian fixes
* 3.0 quilt source format
Author: Camm Maguire <camm@debian.org>
---
The information above should follow the Patch Tagging Guidelines, please
checkout http://dep.debian.net/deps/dep3/ to learn about the format. Here
are templates for supplementary fields that you might want to add:
Origin: <vendor|upstream|other>, <url of original patch>
Bug: <url in upstream bugtracker>
Bug-Debian: http://bugs.debian.org/<bugnumber>
Bug-Ubuntu: https://launchpad.net/bugs/<bugnumber>
Forwarded: <no|not-needed|url proving that it has been forwarded>
Reviewed-By: <name and email of someone who approved the patch>
Last-Update: <YYYY-MM-DD>
--- hol88-2.02.19940316.orig/Makefile
+++ hol88-2.02.19940316/Makefile
@@ -150,7 +150,7 @@ SHELL=/bin/sh
LispType=cl
Obj=o
-Lisp=akcl
+Lisp=gcl
Liszt=
LisztComm=
Allegro=(set-case-mode :case-insensitive-upper)
@@ -159,7 +159,7 @@ AllegroV4.0= $(Allegro) (setq *cltl1-in-
AllegroV4.1= $(AllegroV4.0) (setq *enable-package-locked-errors* nil)
AllegroStuff= (progn () $(AllegroV4.1))
-HOLdir=/usr/local/hol
+HOLdir=$(shell pwd)
Theory=$(HOLdir)/theories
Library=$(HOLdir)/Library
Help=$(HOLdir)/help/ENTRIES/
@@ -168,7 +168,7 @@ Hol=hol
LispDir=${HOLdir}/lisp
ExeName = hol
-Version = 2.02 (SUN4/AKCL)
+Version = 2.02 (GCL)
# =====================================================================
# Default (from Phil Windley)
@@ -221,6 +221,34 @@ HolMl=ml/load_thms.ml ml/numconv_ml.o ml
# ---------------------------------------------------------------------
hol: basic-hol ${Theory}/HOL.th $(HolMl) lisp/banner.$(Obj) lisp/akcl.l
+# echo 'set_search_path[``; `${Theory}/`];;'\
+# 'load_theory `HOL`;;'\
+# 'loadf `ml/load_thms`;;'\
+# 'loadf `ml/lib_loader`;;'\
+# 'loadf `ml/numconv`;;'\
+# 'loadf `ml/tydefs`;;'\
+# 'loadf `ml/ind`;;'\
+# 'loadf `ml/prim_rec`;;'\
+# 'loadf `ml/tyfns`;;'\
+# 'loadf `ml/num`;;'\
+# 'loadf `ml/list`;;'\
+# 'map delete_cache [`arithmetic`;`sum`;`list`];;'\
+# 'map delete_cache [`tree`;`ltree`;`prim_rec`];;'\
+# 'lisp `(load "lisp/banner")`;;'\
+# 'lisp `(setq %system-name "HOL")`;;'\
+# 'lisp `(setq %hol-dir "$(HOLdir)")`;;'\
+# 'lisp `(setq %lib-dir "$(Library)")`;;'\
+# 'lisp `(setq %liszt "$(LisztComm)")`;;'\
+# 'lisp `(setq %version "$(Version)")`;;'\
+# 'set_flag(`abort_when_fail`,false);;'\
+# 'set_search_path[``; `~/`; `${Theory}/`];;'\
+# 'set_help_search_path (words `$(Help)`);;'\
+# 'set_library_search_path [`${Library}/`];;'\
+# 'lisp `(setup)`;;'\
+# 'save `${ExeName}`;;'\
+# 'set_thm_count 0;;'\
+# 'quit();;'\
+# | basic-hol
echo 'set_search_path[``; `${Theory}/`];;'\
'load_theory `HOL`;;'\
'loadf `ml/load_thms`;;'\
@@ -244,12 +272,8 @@ hol: basic-hol ${Theory}/HOL.th $(HolMl)
'set_search_path[``; `~/`; `${Theory}/`];;'\
'set_help_search_path (words `$(Help)`);;'\
'set_library_search_path [`${Library}/`];;'\
- 'lisp `(load "lisp/akcl.l")`;;'\
- 'lisp `(setup)`;;'\
- 'save `${ExeName}`;;'\
- 'set_thm_count 0;;'\
- 'quit();;'\
- | basic-hol
+ 'lisp `(setup)`;;' >foo2
+ echo 'lisp `(throw (quote eof) t)`;; #+native-reloc(progn (with-open-file (s "foo2") (let ((*standard-input* s)) (tml)))(ml-save "hol")) #-native-reloc(let ((si::*collect-binary-modules* t)(si::*binary-modules* (with-open-file (s "bm.l") (read s)))) (with-open-file (s "foo2") (let ((*standard-input* s)) (tml)))(compiler::link (remove-duplicates si::*binary-modules* :test (function equal)) "hol" "(progn (load \"debian/gcl_patch.l\")(load \"foo\")(with-open-file (s \"foo1\") (let ((*standard-input* s)) (tml)))(with-open-file (s \"foo2\") (let ((*standard-input* s)) (tml)))(ml-save \"hol\")(quit))" "" nil)(quit))`;;' | basic-hol
make permissions
@echo "=======> hol88 version $(Version) made"
@@ -291,11 +315,12 @@ Exec=hol hol-lcf basic-hol Manual/LaTeX/
Manual/Reference/bin/mktex Manual/Reference/bin/typecheck
permissions:
- find . \( -type d -user $(USER) -exec chmod $(Dperm) {} \; \) -o\
- \( -type f -user $(USER) -exec chmod $(Tperm) {} \; \)
- @for f in $(Exec) ; do\
- ( if [ -f $$f ]; then\
- find $$f \( -user $(USER) \) -exec chmod $(Eperm) {} \; ;fi) ; \
+ find $$(ls -1 | grep -v debian) \
+ \( -type d -exec chmod $(Dperm) {} \; \) -o\
+ \( -type f -exec chmod $(Tperm) {} \; \)
+ for f in $(Exec) ; do\
+ ( if [ -f $$f ] ; then\
+ find $$f -exec chmod $(Eperm) {} \; ;fi) ; \
done
@@ -482,6 +507,31 @@ BasicHolMl=ml/genfns_ml.o ml/hol-syn_ml.
# ---------------------------------------------------------------------
basic-hol: hol-lcf $(BasicHolLisp) ${Theory}/BASIC-HOL.th $(BasicHolMl)
+# echo 'set_search_path[``; `${Theory}/`];;'\
+# 'load_theory `BASIC-HOL`;;'\
+# 'loadf `ml/hol-in-out`;;'\
+# 'loadf `ml/hol-rule`;;'\
+# 'loadf `ml/hol-drule`;;'\
+# 'loadf `ml/drul`;;'\
+# 'loadf `ml/tacticals`;;'\
+# 'loadf `ml/tacont`;;'\
+# 'loadf `ml/tactics`;;'\
+# 'loadf `ml/conv`;;'\
+# 'loadf `ml/hol-net`;;'\
+# 'loadf `ml/rewrite`;;'\
+# 'loadf `ml/resolve`;;'\
+# 'loadf `ml/hol-thyfn`;;'\
+# 'loadf `ml/goals`;;'\
+# 'loadf `ml/stack`;;'\
+# 'loadf `ml/abs-rep`;;'\
+# 'activate_binders `bool`;;'\
+# 'lisp `(setq %liszt "$(LisztComm)")`;;'\
+# 'lisp `(setq %version "$(Version)")`;;'\
+# 'lisp `(setq %system-name "BASIC-HOL")`;;'\
+# 'lisp `(setup)`;;'\
+# 'save `basic-hol`;;'\
+# 'quit();;'\
+# | hol-lcf
echo 'set_search_path[``; `${Theory}/`];;'\
'load_theory `BASIC-HOL`;;'\
'loadf `ml/hol-in-out`;;'\
@@ -503,10 +553,8 @@ basic-hol: hol-lcf $(BasicHolLisp) ${The
'lisp `(setq %liszt "$(LisztComm)")`;;'\
'lisp `(setq %version "$(Version)")`;;'\
'lisp `(setq %system-name "BASIC-HOL")`;;'\
- 'lisp `(setup)`;;'\
- 'save `basic-hol`;;'\
- 'quit();;'\
- | hol-lcf
+ 'lisp `(setup)`;;' >foo1
+ echo 'lisp `(throw (quote eof) t)`;; #+native-reloc(progn (with-open-file (s "foo1") (let ((*standard-input* s)) (tml)))(ml-save "basic-hol")) #-native-reloc(let ((si::*collect-binary-modules* t)(si::*binary-modules* (with-open-file (s "bm.l") (read s)))) (with-open-file (s "foo1") (let ((*standard-input* s)) (tml)))(compiler::link (remove-duplicates si::*binary-modules* :test (function equal)) "basic-hol" "(progn (load \"debian/gcl_patch.l\")(load \"foo\")(with-open-file (s \"foo1\") (let ((*standard-input* s)) (tml)))(ml-save \"basic-hol\")(quit))" "" nil)(with-open-file (s "bm.l" :direction :output) (prin1 si::*binary-modules* s))(quit))`;;' | hol-lcf
@echo "=======> basic-hol88 made"
# ---------------------------------------------------------------------
@@ -780,6 +828,23 @@ HolLcfMl=ml/ml-curry_ml.o ml/lis_ml.o ml
# ---------------------------------------------------------------------
hol-lcf: $(HolLcfLisp) $(HolLcfMl)
+# echo '#+allegro $(AllegroStuff)'\
+# '(load "lisp/mk-ml")'\
+# '(load "lisp/mk-hol-lcf")'\
+# '(setq %version "$(Version)")'\
+# '(set-make)'\
+# '(tml)'\
+# 'load(`ml/site`,false);;'\
+# 'load(`ml/ml-curry`,false);;'\
+# 'load(`ml/lis`,false);;'\
+# 'load(`ml/gen`,false);;'\
+# 'load(`ml/killpp`,false);;'\
+# 'lisp `(setq %system-name "HOL-LCF")`;;'\
+# 'lisp `(setq %liszt "$(LisztComm)")`;;'\
+# 'lisp `(setup)`;;'\
+# 'save `hol-lcf`;;'\
+# 'quit();;'\
+# | $(Lisp)
echo '#+allegro $(AllegroStuff)'\
'(load "lisp/mk-ml")'\
'(load "lisp/mk-hol-lcf")'\
@@ -793,10 +858,8 @@ hol-lcf: $(HolLcfLisp) $(HolLcfMl)
'load(`ml/killpp`,false);;'\
'lisp `(setq %system-name "HOL-LCF")`;;'\
'lisp `(setq %liszt "$(LisztComm)")`;;'\
- 'lisp `(setup)`;;'\
- 'save `hol-lcf`;;'\
- 'quit();;'\
- | $(Lisp)
+ 'lisp `(setup)`;;' >foo
+ echo '#+native-reloc(progn (load "foo")(ml-save "hol-lcf"))#-native-reloc(let ((si::*collect-binary-modules* t)(si::*binary-modules* nil)) (load "foo")(compiler::link (remove-duplicates si::*binary-modules* :test (function equal)) "hol-lcf" "(load \"debian/gcl_patch.l\")(load \"foo\")(ml-save \"hol-lcf\")" "" nil)(with-open-file (s "bm.l" :direction :output) (prin1 si::*binary-modules* s)))(quit)' | $(Lisp)
@echo "=======> hol-lcf made"
# =====================================================================
--- hol88-2.02.19940316.orig/Manual/Makefile
+++ hol88-2.02.19940316/Manual/Makefile
@@ -41,3 +41,5 @@ all:
make tutorial;make description; make reference;make libraries;make covers
@echo "=======> MANUAL made"
+clean:
+ for i in Tutorial Description Reference Libraries Covers ; do $(MAKE) -C $$i clean ; done
--- hol88-2.02.19940316.orig/Manual/Description/description.tex
+++ hol88-2.02.19940316/Manual/Description/description.tex
@@ -34,7 +34,7 @@
\include{title} % description title page
\include{preface} % preface to entire description
- \include{../LaTeX/ack} % global acknowledgements
+ \include{ack} % global acknowledgements
\include{contents} % table of contents
--- hol88-2.02.19940316.orig/Manual/Tutorial/tutorial.tex
+++ hol88-2.02.19940316/Manual/Tutorial/tutorial.tex
@@ -38,7 +38,7 @@
\include{title} % tutorial title page
\include{preface} % preface to entire tutorial
- \include{../LaTeX/ack} % global acknowledgements
+ \include{ack} % global acknowledgements
\include{contents} % table of contents
\pagenumbering{arabic} % arabic page numbers
--- hol88-2.02.19940316.orig/Manual/Covers/Makefile
+++ hol88-2.02.19940316/Manual/Covers/Makefile
@@ -20,12 +20,12 @@ default:
endpages.dvi: CRC.ps DESCRIPTION.ps LANTERN.ps REFERENCE.ps TUTORIAL.ps \
arms.ps endpages.tex endpages.sty
- $(LATEX) endpages
+ TEXINPUTS=$$(pwd)/psfig:$$TEXINPUTS $(LATEX) endpages
@echo "===> endpages.dvi created"
titlepages.dvi: CRC.ps DESCRIPTION.ps LANTERN.ps REFERENCE.ps TUTORIAL.ps \
arms.ps titlepages.tex titlepages.sty
- $(LATEX) titlepages
+ TEXINPUTS=$$(pwd)/psfig:$$TEXINPUTS $(LATEX) titlepages
@echo "===> titlepages.dvi created"
dvi: endpages.dvi titlepages.dvi
--- hol88-2.02.19940316.orig/Manual/LaTeX/ref-macros.tex
+++ hol88-2.02.19940316/Manual/LaTeX/ref-macros.tex
@@ -172,3 +172,8 @@
% ---------------------------------------------------------------------
\def\none{{\it none}}
+
+\newcommand\nintt{\fontsize{9pt}{11pt}\normalfont\ttfamily}
+\newcommand\tenrm{\fontsize{10pt}{12pt}\normalfont\rmfamily}
+%\def\ptt{\fam\ttfam\nintt}\textfont\ttfam\nintt\scriptfont\ttfam\nintt\scriptscriptfont\ttfam\nintt
+\def\ptt{\fam\ttfam\nintt}%\textfont\ttfam\nintt\scriptfont\ttfam\nintt\scriptscriptfont\ttfam\nintt
--- hol88-2.02.19940316.orig/Manual/LaTeX/layout.sty
+++ hol88-2.02.19940316/Manual/LaTeX/layout.sty
@@ -52,9 +52,9 @@
% MATH INDENTATION. = \tabcolsep + three small verbatim spaces (!)
% ---------------------------------------------------------------------
\setlength{\mathindent}{\tabcolsep}
-\addtolength{\mathindent}{\the\fontdimen2\elvtt}
-\addtolength{\mathindent}{\the\fontdimen2\elvtt}
-\addtolength{\mathindent}{\the\fontdimen2\elvtt}
+%\addtolength{\mathindent}{\the\fontdimen2\elvtt}
+%\addtolength{\mathindent}{\the\fontdimen2\elvtt}
+%\addtolength{\mathindent}{\the\fontdimen2\elvtt}
% ---------------------------------------------------------------------
% HEAD: spacing to match header macro below.
--- hol88-2.02.19940316.orig/Manual/Reference/theorems.tex
+++ hol88-2.02.19940316/Manual/Reference/theorems.tex
@@ -1,7 +1,4 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\section{Definitions of Basic Logical Constants}
-\THEOREM AND\_DEF bool
+\chapter{Pre-proved Theorems}\input{theorems-intro}\section{Definitions of Basic Logical Constants}\THEOREM AND\_DEF bool
|- $/\ = (\t1 t2. !t. (t1 ==> t2 ==> t) ==> t)
\ENDTHEOREM
\THEOREM EXISTS\_DEF bool
@@ -10,12 +7,12 @@
\THEOREM EXISTS\_UNIQUE\_DEF bool
|- $?! = (\P. $? P /\ (!x y. P x /\ P y ==> (x = y)))
\ENDTHEOREM
-\THEOREM FORALL\_DEF bool
-|- $! = (\P. P = (\x. T))
-\ENDTHEOREM
\THEOREM F\_DEF bool
|- F = (!t. t)
\ENDTHEOREM
+\THEOREM FORALL\_DEF bool
+|- $! = (\P. P = (\x. T))
+\ENDTHEOREM
\THEOREM NOT\_DEF bool
|- $~ = (\t. t ==> F)
\ENDTHEOREM
@@ -25,8 +22,7 @@
\THEOREM T\_DEF bool
|- T = ((\x. x) = (\x. x))
\ENDTHEOREM
-\section{Constants for syntactic abbreviations}
-\THEOREM ARB bool
+\section{Constants for syntactic abbreviations}\THEOREM ARB bool
|- ARB = (@x. T)
\ENDTHEOREM
\THEOREM COND\_DEF bool
@@ -49,8 +45,7 @@
\THEOREM RES\_SELECT bool
|- !P B. RES_SELECT P B = (@x. P x /\ B x)
\ENDTHEOREM
-\section{Axioms}
-\THEOREM ARB\_THM bool
+\section{Axioms}\THEOREM ARB\_THM bool
|- $= = $=
\ENDTHEOREM
\THEOREM BOOL\_CASES\_AX bool
@@ -68,8 +63,7 @@
\THEOREM SELECT\_AX bool
|- !P x. P x ==> P($@ P)
\ENDTHEOREM
-\section{Logical tautologies}
-\THEOREM AND1\_THM {\none}
+\section{Logical tautologies}\THEOREM AND1\_THM {\none}
|- !t1 t2. t1 /\ t2 ==> t1
\ENDTHEOREM
\THEOREM AND2\_THM {\none}
@@ -171,13 +165,13 @@
\THEOREM FALSITY {\none}
|- !t. F ==> t
\ENDTHEOREM
+\THEOREM F\_IMP {\none}
+|- !t. ~t ==>(t ==> F)
+\ENDTHEOREM
\THEOREM FORALL\_SIMP {\none}
|- !t. (!x. t) = t
\ENDTHEOREM
-\THEOREM F\_IMP {\none}
-|- !t. ~t ==>(t ==> F)
-\ENDTHEOREM
\THEOREM IMP\_CLAUSES {\none}
|- !t. (T ==> t) = t /\
(t ==> T) = T /\
@@ -258,8 +252,7 @@
\THEOREM TRUTH {\none}
|- T
\ENDTHEOREM
-\section{Theorems about functions}
-\THEOREM ABS\_SIMP {\none}
+\section{Theorems about functions}\THEOREM ABS\_SIMP {\none}
|- !t1 t2. (\x. t1)t2 = t1
\ENDTHEOREM
@@ -309,24 +302,22 @@
\THEOREM RIGHT\_ID\_DEF fun
|- !f e. RIGHT_ID f e = (!x. f x e = x)
\ENDTHEOREM
-\section{Theorems about the type {\tt one}}
-\THEOREM one one
-|- !v. v = one
+\section{Theorems about the type {\tt one}}\THEOREM one\_axiom one
+|- !f g. f = g
\ENDTHEOREM
\THEOREM one\_Axiom one
|- !e. ?! fn. fn one = e
\ENDTHEOREM
-\THEOREM one\_axiom one
-|- !f g. f = g
-\ENDTHEOREM
\THEOREM one\_DEF one
|- one = (@x. T)
\ENDTHEOREM
+\THEOREM one one
+|- !v. v = one
+\ENDTHEOREM
\THEOREM one\_TY\_DEF one
|- ?rep. TYPE_DEFINITION(\b. b)rep
\ENDTHEOREM
-\section{Theorems about combinators}
-\THEOREM I\_DEF combin
+\section{Theorems about combinators}\THEOREM I\_DEF combin
|- I = S K K
\ENDTHEOREM
\THEOREM I\_o\_ID combin
@@ -356,19 +347,18 @@
\THEOREM S\_THM combin
|- !f g x. S f g x = f x(g x)
\ENDTHEOREM
-\section{Theorems about pairs}
-\THEOREM COMMA\_DEF bool
+\section{Theorems about pairs}\THEOREM COMMA\_DEF bool
|- !x y. x,y = (@p. REP_prod p = MK_PAIR x y)
\ENDTHEOREM
\THEOREM CURRY\_DEF bool
|- !f x y. CURRY f x y = f(x,y)
\ENDTHEOREM
-\THEOREM FST bool
-|- !x y. FST(x,y) = x
-\ENDTHEOREM
\THEOREM FST\_DEF bool
|- !p. FST p = (@x. ?y. MK_PAIR x y = REP_prod p)
\ENDTHEOREM
+\THEOREM FST bool
+|- !x y. FST(x,y) = x
+\ENDTHEOREM
\THEOREM IS\_PAIR\_DEF bool
|- !p. IS_PAIR p = (?x y. p = MK_PAIR x y)
\ENDTHEOREM
@@ -390,28 +380,27 @@
(!p' p''. (rep p' = rep p'') ==> (p' = p'')) /\
(!p. IS_PAIR p = (?p'. p = rep p')))
\ENDTHEOREM
-\THEOREM SND bool
-|- !x y. SND(x,y) = y
-\ENDTHEOREM
\THEOREM SND\_DEF bool
|- !p. SND p = (@y. ?x. MK_PAIR x y = REP_prod p)
\ENDTHEOREM
+\THEOREM SND bool
+|- !x y. SND(x,y) = y
+\ENDTHEOREM
\THEOREM UNCURRY\_DEF bool
|- !f x y. UNCURRY f(x,y) = f x y
\ENDTHEOREM
-\section{Theorems about disjoint sums}
+\section{Theorems about disjoint sums}\THEOREM INL\_DEF sum
+|- !e. INL e = ABS_sum(\b x y. (x = e) /\ b)
+\ENDTHEOREM
\THEOREM INL sum
|- !x. ISL x ==> (INL(OUTL x) = x)
\ENDTHEOREM
-\THEOREM INL\_DEF sum
-|- !e. INL e = ABS_sum(\b x y. (x = e) /\ b)
+\THEOREM INR\_DEF sum
+|- !e. INR e = ABS_sum(\b x y. (y = e) /\ ~b)
\ENDTHEOREM
\THEOREM INR sum
|- !x. ISR x ==> (INR(OUTR x) = x)
\ENDTHEOREM
-\THEOREM INR\_DEF sum
-|- !e. INR e = ABS_sum(\b x y. (y = e) /\ ~b)
-\ENDTHEOREM
\THEOREM ISL sum
|- (!x. ISL(INL x)) /\ (!y. ~ISL(INR y))
\ENDTHEOREM
@@ -433,12 +422,12 @@
\THEOREM OUTR sum
|- !x. OUTR(INR x) = x
\ENDTHEOREM
-\THEOREM sum\_Axiom sum
-|- !f g. ?! h. (!x. h(INL x) = f x) /\ (!x. h(INR x) = g x)
-\ENDTHEOREM
\THEOREM sum\_axiom sum
|- !f g. ?! h. (h o INL = f) /\ (h o INR = g)
\ENDTHEOREM
+\THEOREM sum\_Axiom sum
+|- !f g. ?! h. (!x. h(INL x) = f x) /\ (!x. h(INR x) = g x)
+\ENDTHEOREM
\THEOREM sum\_ISO\_DEF sum
|- (!a. ABS_sum(REP_sum a) = a) /\
(!r. IS_SUM_REP r = (REP_sum(ABS_sum r) = r))
@@ -446,16 +435,12 @@
\THEOREM sum\_TY\_DEF sum
|- ?rep. TYPE_DEFINITION IS_SUM_REP rep
\ENDTHEOREM
-\section{Theorems about arithmetic}
-\THEOREM ADD arithmetic
-|- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n))
+\section{Theorems about arithmetic}\THEOREM ADD\_0 arithmetic
+|- !m. m + 0 = m
\ENDTHEOREM
\THEOREM ADD1 arithmetic
|- !m. SUC m = m + 1
\ENDTHEOREM
-\THEOREM ADD\_0 arithmetic
-|- !m. m + 0 = m
-\ENDTHEOREM
\THEOREM ADD\_ASSOC arithmetic
|- !m n p. m + (n + p) = (m + n) + p
\ENDTHEOREM
@@ -465,6 +450,9 @@
((SUC m) + n = SUC(m + n)) /\
(m + (SUC n) = SUC(m + n))
\ENDTHEOREM
+\THEOREM ADD arithmetic
+|- (!n. 0 + n = n) /\ (!m n. (SUC m) + n = SUC(m + n))
+\ENDTHEOREM
\THEOREM ADD\_EQ\_0 arithmetic
|- !m n. (m + n = 0) = (m = 0) /\ (n = 0)
\ENDTHEOREM
@@ -523,15 +511,15 @@
\THEOREM EQ\_MONO\_ADD\_EQ arithmetic
|- !m n p. (m + p = n + p) = (m = n)
\ENDTHEOREM
-\THEOREM EVEN arithmetic
-|- (EVEN 0 = T) /\ (!n. EVEN(SUC n) = ~EVEN n)
-\ENDTHEOREM
\THEOREM EVEN\_ADD arithmetic
|- !m n. EVEN(m + n) = (EVEN m = EVEN n)
\ENDTHEOREM
\THEOREM EVEN\_AND\_ODD arithmetic
|- !n. ~(EVEN n /\ ODD n)
\ENDTHEOREM
+\THEOREM EVEN arithmetic
+|- (EVEN 0 = T) /\ (!n. EVEN(SUC n) = ~EVEN n)
+\ENDTHEOREM
\THEOREM EVEN\_DOUBLE arithmetic
|- !n. EVEN(2 * n)
\ENDTHEOREM
@@ -550,12 +538,12 @@
\THEOREM EVEN\_OR\_ODD arithmetic
|- !n. EVEN n \/ ODD n
\ENDTHEOREM
-\THEOREM EXP arithmetic
-|- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n))
-\ENDTHEOREM
\THEOREM EXP\_ADD arithmetic
|- !p q n. n EXP (p + q) = (n EXP p) * (n EXP q)
\ENDTHEOREM
+\THEOREM EXP arithmetic
+|- (!m. m EXP 0 = 1) /\ (!m n. m EXP (SUC n) = m * (m EXP n))
+\ENDTHEOREM
\THEOREM FACT arithmetic
|- (FACT 0 = 1) /\ (!n. FACT(SUC n) = (SUC n) * (FACT n))
\ENDTHEOREM
@@ -609,24 +597,21 @@
\THEOREM LEFT\_SUB\_DISTRIB arithmetic
|- !m n p. p * (m - n) = (p * m) - (p * n)
\ENDTHEOREM
-\THEOREM LESS prim\_rec
-|- !m n. m < n = (?P. (!n'. P(SUC n') ==> P n') /\ P m /\ ~P n)
-\ENDTHEOREM
-\THEOREM LESS\_0 prim\_rec
-|- !n. 0 < (SUC n)
-\ENDTHEOREM
\THEOREM LESS\_0\_0 prim\_rec
|- 0 < (SUC 0)
\ENDTHEOREM
\THEOREM LESS\_0\_CASES arithmetic
|- !m. (0 = m) \/ 0 < m
\ENDTHEOREM
-\THEOREM LESS\_ADD arithmetic
-|- !m n. n < m ==> (?p. p + n = m)
+\THEOREM LESS\_0 prim\_rec
+|- !n. 0 < (SUC n)
\ENDTHEOREM
\THEOREM LESS\_ADD\_1 arithmetic
|- !m n. n < m ==> (?p. m = n + (p + 1))
\ENDTHEOREM
+\THEOREM LESS\_ADD arithmetic
+|- !m n. n < m ==> (?p. p + n = m)
+\ENDTHEOREM
\THEOREM LESS\_ADD\_NONZERO arithmetic
|- !m n. ~(n = 0) ==> m < (m + n)
\ENDTHEOREM
@@ -642,14 +627,8 @@
\THEOREM LESS\_CASES\_IMP arithmetic
|- !m n. ~m < n /\ ~(m = n) ==> n < m
\ENDTHEOREM
-\THEOREM LESS\_EQ arithmetic
-|- !m n. m < n = (SUC m) <= n
-\ENDTHEOREM
-\THEOREM LESS\_EQUAL\_ADD arithmetic
-|- !m n. m <= n ==> (?p. n = m + p)
-\ENDTHEOREM
-\THEOREM LESS\_EQUAL\_ANTISYM arithmetic
-|- !n m. n <= m /\ m <= n ==> (n = m)
+\THEOREM LESS prim\_rec
+|- !m n. m < n = (?P. (!n'. P(SUC n') ==> P n') /\ P m /\ ~P n)
\ENDTHEOREM
\THEOREM LESS\_EQ\_0 arithmetic
|- !n. n <= 0 = (n = 0)
@@ -666,6 +645,9 @@
\THEOREM LESS\_EQ\_CASES arithmetic
|- !m n. m <= n \/ n <= m
\ENDTHEOREM
+\THEOREM LESS\_EQ arithmetic
+|- !m n. m < n = (SUC m) <= n
+\ENDTHEOREM
\THEOREM LESS\_EQ\_EXISTS arithmetic
|- !m n. m <= n = (?p. n = m + p)
\ENDTHEOREM
@@ -678,12 +660,12 @@
\THEOREM LESS\_EQ\_LESS\_TRANS arithmetic
|- !m n p. m <= n /\ n < p ==> m < p
\ENDTHEOREM
-\THEOREM LESS\_EQ\_MONO arithmetic
-|- !n m. (SUC n) <= (SUC m) = n <= m
-\ENDTHEOREM
\THEOREM LESS\_EQ\_MONO\_ADD\_EQ arithmetic
|- !m n p. (m + p) <= (n + p) = m <= n
\ENDTHEOREM
+\THEOREM LESS\_EQ\_MONO arithmetic
+|- !n m. (SUC n) <= (SUC m) = n <= m
+\ENDTHEOREM
\THEOREM LESS\_EQ\_REFL arithmetic
|- !m. m <= m
\ENDTHEOREM
@@ -696,6 +678,12 @@
\THEOREM LESS\_EQ\_TRANS arithmetic
|- !m n p. m <= n /\ n <= p ==> m <= p
\ENDTHEOREM
+\THEOREM LESS\_EQUAL\_ADD arithmetic
+|- !m n. m <= n ==> (?p. n = m + p)
+\ENDTHEOREM
+\THEOREM LESS\_EQUAL\_ANTISYM arithmetic
+|- !n m. n <= m /\ m <= n ==> (n = m)
+\ENDTHEOREM
\THEOREM LESS\_EXP\_SUC\_MONO arithmetic
|- !n m. ((SUC(SUC m)) EXP n) < ((SUC(SUC m)) EXP (SUC n))
\ENDTHEOREM
@@ -723,9 +711,6 @@
\THEOREM LESS\_MOD arithmetic
|- !n k. k < n ==> (k MOD n = k)
\ENDTHEOREM
-\THEOREM LESS\_MONO prim\_rec
-|- !m n. m < n ==> (SUC m) < (SUC n)
-\ENDTHEOREM
\THEOREM LESS\_MONO\_ADD arithmetic
|- !m n p. m < n ==> (m + p) < (n + p)
\ENDTHEOREM
@@ -735,6 +720,9 @@
\THEOREM LESS\_MONO\_ADD\_INV arithmetic
|- !m n p. (m + p) < (n + p) ==> m < n
\ENDTHEOREM
+\THEOREM LESS\_MONO prim\_rec
+|- !m n. m < n ==> (SUC m) < (SUC n)
+\ENDTHEOREM
\THEOREM LESS\_MONO\_EQ arithmetic
|- !m n. (SUC m) < (SUC n) = m < n
\ENDTHEOREM
@@ -759,12 +747,12 @@
\THEOREM LESS\_OR arithmetic
|- !m n. m < n ==> (SUC m) <= n
\ENDTHEOREM
-\THEOREM LESS\_OR\_EQ arithmetic
-|- !m n. m <= n = m < n \/ (m = n)
-\ENDTHEOREM
\THEOREM LESS\_OR\_EQ\_ADD arithmetic
|- !n m. n < m \/ (?p. n = p + m)
\ENDTHEOREM
+\THEOREM LESS\_OR\_EQ arithmetic
+|- !m n. m <= n = m < n \/ (m = n)
+\ENDTHEOREM
\THEOREM LESS\_REFL prim\_rec
|- !n. ~n < n
\ENDTHEOREM
@@ -822,9 +810,6 @@
\THEOREM MONOID\_MULT\_1 arithmetic
|- MONOID $* 1
\ENDTHEOREM
-\THEOREM MULT arithmetic
-|- (!n. 0 * n = 0) /\ (!m n. (SUC m) * n = (m * n) + n)
-\ENDTHEOREM
\THEOREM MULT\_0 arithmetic
|- !m. m * 0 = 0
\ENDTHEOREM
@@ -840,6 +825,9 @@
((SUC m) * n = (m * n) + n) /\
(m * (SUC n) = m + (m * n))
\ENDTHEOREM
+\THEOREM MULT arithmetic
+|- (!n. 0 * n = 0) /\ (!m n. (SUC m) * n = (m * n) + n)
+\ENDTHEOREM
\THEOREM MULT\_EQ\_0 arithmetic
|- !m n. (m * n = 0) = (m = 0) \/ (n = 0)
\ENDTHEOREM
@@ -879,12 +867,12 @@
\THEOREM NOT\_LEQ arithmetic
|- !m n. ~m <= n = (SUC n) <= m
\ENDTHEOREM
-\THEOREM NOT\_LESS arithmetic
-|- !m n. ~m < n = n <= m
-\ENDTHEOREM
\THEOREM NOT\_LESS\_0 prim\_rec
|- !n. ~n < 0
\ENDTHEOREM
+\THEOREM NOT\_LESS arithmetic
+|- !m n. ~m < n = n <= m
+\ENDTHEOREM
\THEOREM NOT\_LESS\_EQ prim\_rec
|- !m n. (m = n) ==> ~m < n
\ENDTHEOREM
@@ -897,18 +885,18 @@
\THEOREM NOT\_ODD\_EQ\_EVEN arithmetic
|- !n m. ~(SUC(n + n) = m + m)
\ENDTHEOREM
-\THEOREM NOT\_SUC num
-|- !n. ~(SUC n = 0)
-\ENDTHEOREM
\THEOREM NOT\_SUC\_ADD\_LESS\_EQ arithmetic
|- !m n. ~(SUC(m + n)) <= m
\ENDTHEOREM
-\THEOREM NOT\_SUC\_LESS\_EQ arithmetic
-|- !n m. ~(SUC n) <= m = m <= n
+\THEOREM NOT\_SUC num
+|- !n. ~(SUC n = 0)
\ENDTHEOREM
\THEOREM NOT\_SUC\_LESS\_EQ\_0 arithmetic
|- !n. ~(SUC n) <= 0
\ENDTHEOREM
+\THEOREM NOT\_SUC\_LESS\_EQ arithmetic
+|- !n m. ~(SUC n) <= m = m <= n
+\ENDTHEOREM
\THEOREM num\_Axiom prim\_rec
|- !e f. ?! fn. (fn 0 = e) /\ (!n. fn(SUC n) = f(fn n)n)
\ENDTHEOREM
@@ -922,12 +910,12 @@
\THEOREM num\_TY\_DEF num
|- ?rep. TYPE_DEFINITION IS_NUM_REP rep
\ENDTHEOREM
-\THEOREM ODD arithmetic
-|- (ODD 0 = F) /\ (!n. ODD(SUC n) = ~ODD n)
-\ENDTHEOREM
\THEOREM ODD\_ADD arithmetic
|- !m n. ODD(m + n) = ~(ODD m = ODD n)
\ENDTHEOREM
+\THEOREM ODD arithmetic
+|- (ODD 0 = F) /\ (!n. ODD(SUC n) = ~ODD n)
+\ENDTHEOREM
\THEOREM ODD\_DOUBLE arithmetic
|- !n. ODD(SUC(2 * n))
\ENDTHEOREM
@@ -946,18 +934,18 @@
\THEOREM OR\_LESS arithmetic
|- !m n. (SUC m) <= n ==> m < n
\ENDTHEOREM
-\THEOREM PRE prim\_rec
-|- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m)
-\ENDTHEOREM
\THEOREM PRE\_DEF prim\_rec
|- !m. PRE m = ((m = 0) => 0 | (@n. m = SUC n))
\ENDTHEOREM
-\THEOREM PRE\_SUB arithmetic
-|- !m n. PRE(m - n) = (PRE m) - n
+\THEOREM PRE prim\_rec
+|- (PRE 0 = 0) /\ (!m. PRE(SUC m) = m)
\ENDTHEOREM
\THEOREM PRE\_SUB1 arithmetic
|- !m. PRE m = m - 1
\ENDTHEOREM
+\THEOREM PRE\_SUB arithmetic
+|- !m n. PRE(m - n) = (PRE m) - n
+\ENDTHEOREM
\THEOREM PRE\_SUC\_EQ arithmetic
|- !m n. 0 < n ==> ((m = PRE n) = (SUC m = n))
\ENDTHEOREM
@@ -1013,9 +1001,6 @@
(SIMP_REC x f 0 = x) /\
(!m. SIMP_REC x f(SUC m) = f(SIMP_REC x f m))
\ENDTHEOREM
-\THEOREM SUB arithmetic
-|- (!m. 0 - m = 0) /\ (!m n. (SUC m) - n = (m < n => 0 | SUC(m - n)))
-\ENDTHEOREM
\THEOREM SUB\_0 arithmetic
|- !m. (0 - m = 0) /\ (m - 0 = m)
\ENDTHEOREM
@@ -1025,8 +1010,8 @@
\THEOREM SUB\_CANCEL arithmetic
|- !p n m. n <= p /\ m <= p ==> ((p - n = p - m) = (n = m))
\ENDTHEOREM
-\THEOREM SUB\_EQUAL\_0 arithmetic
-|- !c. c - c = 0
+\THEOREM SUB arithmetic
+|- (!m. 0 - m = 0) /\ (!m n. (SUC m) - n = (m < n => 0 | SUC(m - n)))
\ENDTHEOREM
\THEOREM SUB\_EQ\_0 arithmetic
|- !m n. (m - n = 0) = m <= n
@@ -1034,6 +1019,9 @@
\THEOREM SUB\_EQ\_EQ\_0 arithmetic
|- !m n. (m - n = m) = (m = 0) \/ (n = 0)
\ENDTHEOREM
+\THEOREM SUB\_EQUAL\_0 arithmetic
+|- !c. c - c = 0
+\ENDTHEOREM
\THEOREM SUB\_LEFT\_ADD arithmetic
|- !m n p. m + (n - p) = (n <= p => m | (m + n) - p)
\ENDTHEOREM
@@ -1061,12 +1049,12 @@
\THEOREM SUB\_LESS\_0 arithmetic
|- !n m. m < n = 0 < (n - m)
\ENDTHEOREM
-\THEOREM SUB\_LESS\_EQ arithmetic
-|- !n m. (n - m) <= n
-\ENDTHEOREM
\THEOREM SUB\_LESS\_EQ\_ADD arithmetic
|- !m p. m <= p ==> (!n. (p - m) <= n = p <= (m + n))
\ENDTHEOREM
+\THEOREM SUB\_LESS\_EQ arithmetic
+|- !n m. (n - m) <= n
+\ENDTHEOREM
\THEOREM SUB\_LESS\_OR arithmetic
|- !m n. n < m ==> n <= (m - 1)
\ENDTHEOREM
@@ -1148,12 +1136,7 @@
\THEOREM ZERO\_REP\_DEF num
|- ZERO_REP = (@x. !y. ~(x = SUC_REP y))
\ENDTHEOREM
-\section{Theorems about lists}
-\THEOREM ALL\_EL list
-|- (!P. ALL_EL P[] = T) /\
- (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l)
-\ENDTHEOREM
-\THEOREM ALL\_EL\_APPEND list
+\section{Theorems about lists}\THEOREM ALL\_EL\_APPEND list
|- !P l1 l2. ALL_EL P(APPEND l1 l2) = ALL_EL P l1 /\ ALL_EL P l2
\ENDTHEOREM
\THEOREM ALL\_EL\_BUTFIRSTN list
@@ -1166,6 +1149,10 @@
\THEOREM ALL\_EL\_CONJ list
|- !P Q l. ALL_EL(\x. P x /\ Q x)l = ALL_EL P l /\ ALL_EL Q l
\ENDTHEOREM
+\THEOREM ALL\_EL list
+|- (!P. ALL_EL P[] = T) /\
+ (!P x l. ALL_EL P(CONS x l) = P x /\ ALL_EL P l)
+\ENDTHEOREM
\THEOREM ALL\_EL\_FIRSTN list
|- !P l. ALL_EL P l ==> (!m. m <= (LENGTH l) ==> ALL_EL P(FIRSTN m l))
\ENDTHEOREM
@@ -1214,13 +1201,12 @@
(!h t l. AP(CONS h t)l = CONS(h(HD l))(AP t(TL l)))
\ENDTHEOREM
-\THEOREM APPEND list
-|- (!l. APPEND[]l = l) /\
- (!l1 l2 h. APPEND(CONS h l1)l2 = CONS h(APPEND l1 l2))
-\ENDTHEOREM
\THEOREM APPEND\_ASSOC list
|- !l1 l2 l3. APPEND l1(APPEND l2 l3) = APPEND(APPEND l1 l2)l3
\ENDTHEOREM
+\THEOREM APPEND\_BUTLAST\_LAST list
+|- !l. ~(l = []) ==> (APPEND(BUTLAST l)[LAST l] = l)
+\ENDTHEOREM
\THEOREM APPEND\_BUTLASTN\_BUTFIRSTN list
|- !m n l.
(m + n = LENGTH l) ==> (APPEND(BUTLASTN m l)(BUTFIRSTN n l) = l)
@@ -1228,8 +1214,9 @@
\THEOREM APPEND\_BUTLASTN\_LASTN list
|- !n l. n <= (LENGTH l) ==> (APPEND(BUTLASTN n l)(LASTN n l) = l)
\ENDTHEOREM
-\THEOREM APPEND\_BUTLAST\_LAST list
-|- !l. ~(l = []) ==> (APPEND(BUTLAST l)[LAST l] = l)
+\THEOREM APPEND list
+|- (!l. APPEND[]l = l) /\
+ (!l1 l2 h. APPEND(CONS h l1)l2 = CONS h(APPEND l1 l2))
\ENDTHEOREM
\THEOREM APPEND\_FIRSTN\_BUTFIRSTN list
|- !n l. n <= (LENGTH l) ==> (APPEND(FIRSTN n l)(BUTFIRSTN n l) = l)
@@ -1273,10 +1260,6 @@
LEFT_ID f e ==>
(!l. FOLDR f e(FLAT l) = FOLDR f e(MAP(FOLDR f e)l)))
\ENDTHEOREM
-\THEOREM BUTFIRSTN list
-|- (!l. BUTFIRSTN 0 l = l) /\
- (!n x l. BUTFIRSTN(SUC n)(CONS x l) = BUTFIRSTN n l)
-\ENDTHEOREM
\THEOREM BUTFIRSTN\_APPEND1 list
|- !n l1.
n <= (LENGTH l1) ==>
@@ -1292,6 +1275,10 @@
(n + m) <= (LENGTH l) ==>
(BUTFIRSTN n(BUTFIRSTN m l) = BUTFIRSTN(n + m)l)
\ENDTHEOREM
+\THEOREM BUTFIRSTN list
+|- (!l. BUTFIRSTN 0 l = l) /\
+ (!n x l. BUTFIRSTN(SUC n)(CONS x l) = BUTFIRSTN n l)
+\ENDTHEOREM
\THEOREM BUTFIRSTN\_LASTN list
|- !n l. n <= (LENGTH l) ==> (BUTFIRSTN n l = LASTN((LENGTH l) - n)l)
\ENDTHEOREM
@@ -1313,13 +1300,12 @@
n <= (LENGTH l) ==>
(!x. BUTFIRSTN n(SNOC x l) = SNOC x(BUTFIRSTN n l))
\ENDTHEOREM
+\THEOREM BUTLAST\_DEF list
+|- !l. BUTLAST l = SEG(PRE(LENGTH l))0 l
+\ENDTHEOREM
\THEOREM BUTLAST list
|- !x l. BUTLAST(SNOC x l) = l
\ENDTHEOREM
-\THEOREM BUTLASTN list
-|- (!l. BUTLASTN 0 l = l) /\
- (!n x l. BUTLASTN(SUC n)(SNOC x l) = BUTLASTN n l)
-\ENDTHEOREM
\THEOREM BUTLASTN\_1 list
|- !l. ~(l = []) ==> (BUTLASTN 1 l = BUTLAST l)
\ENDTHEOREM
@@ -1347,6 +1333,10 @@
n <= (LENGTH l) ==>
(!x. BUTLASTN n(CONS x l) = CONS x(BUTLASTN n l))
\ENDTHEOREM
+\THEOREM BUTLASTN list
+|- (!l. BUTLASTN 0 l = l) /\
+ (!n x l. BUTLASTN(SUC n)(SNOC x l) = BUTLASTN n l)
+\ENDTHEOREM
\THEOREM BUTLASTN\_FIRSTN list
|- !n l. n <= (LENGTH l) ==> (BUTLASTN n l = FIRSTN((LENGTH l) - n)l)
\ENDTHEOREM
@@ -1381,9 +1371,6 @@
\THEOREM BUTLASTN\_SUC\_BUTLAST list
|- !n l. n < (LENGTH l) ==> (BUTLASTN(SUC n)l = BUTLASTN n(BUTLAST l))
\ENDTHEOREM
-\THEOREM BUTLAST\_DEF list
-|- !l. BUTLAST l = SEG(PRE(LENGTH l))0 l
-\ENDTHEOREM
\THEOREM COMM\_ASSOC\_FOLDL\_REVERSE list
|- !f. COMM f ==> ASSOC f ==> (!e l. FOLDL f e(REVERSE l) = FOLDL f e l)
\ENDTHEOREM
@@ -1400,9 +1387,6 @@
COMM f ==>
(!e'. MONOID f e' ==> (!e l. FOLDR f e l = f e(FOLDR f e' l)))
\ENDTHEOREM
-\THEOREM CONS list
-|- !l. ~NULL l ==> (CONS(HD l)(TL l) = l)
-\ENDTHEOREM
\THEOREM CONS\_11 list
|- !h t h' t'. (CONS h t = CONS h' t') = (h = h') /\ (t = t')
\ENDTHEOREM
@@ -1415,11 +1399,28 @@
ABS_list
((\m. ((m = 0) => h | FST(REP_list t)(PRE m))),SUC(SND(REP_list t)))
\ENDTHEOREM
+\THEOREM CONS list
+|- !l. ~NULL l ==> (CONS(HD l)(TL l) = l)
+\ENDTHEOREM
+\THEOREM EL\_APPEND1 list
+|- !n l1 l2. n < (LENGTH l1) ==> (EL n(APPEND l1 l2) = EL n l1)
+\ENDTHEOREM
+\THEOREM EL\_APPEND2 list
+|- !l1 n.
+ (LENGTH l1) <= n ==>
+ (!l2. EL n(APPEND l1 l2) = EL(n - (LENGTH l1))l2)
+\ENDTHEOREM
+\THEOREM EL\_CONS list
+|- !n. 0 < n ==> (!x l. EL n(CONS x l) = EL(PRE n)l)
+\ENDTHEOREM
\THEOREM EL list
|- (!l. EL 0 l = HD l) /\ (!l n. EL(SUC n)l = EL n(TL l))
\ENDTHEOREM
-\THEOREM ELL list
-|- (!l. ELL 0 l = LAST l) /\ (!n l. ELL(SUC n)l = ELL n(BUTLAST l))
+\THEOREM EL\_ELL list
+|- !n l. n < (LENGTH l) ==> (EL n l = ELL(PRE((LENGTH l) - n))l)
+\ENDTHEOREM
+\THEOREM EL\_IS\_EL list
+|- !n l. n < (LENGTH l) ==> IS_EL(EL n l)l
\ENDTHEOREM
\THEOREM ELL\_0\_SNOC list
|- !l x. ELL 0(SNOC x l) = x
@@ -1435,9 +1436,18 @@
\THEOREM ELL\_CONS list
|- !n l. n < (LENGTH l) ==> (!x. ELL n(CONS x l) = ELL n l)
\ENDTHEOREM
+\THEOREM ELL list
+|- (!l. ELL 0 l = LAST l) /\ (!n l. ELL(SUC n)l = ELL n(BUTLAST l))
+\ENDTHEOREM
\THEOREM ELL\_EL list
|- !n l. n < (LENGTH l) ==> (ELL n l = EL(PRE((LENGTH l) - n))l)
\ENDTHEOREM
+\THEOREM EL\_LENGTH\_APPEND list
+|- !l2 l1. ~NULL l2 ==> (EL(LENGTH l1)(APPEND l1 l2) = HD l2)
+\ENDTHEOREM
+\THEOREM EL\_LENGTH\_SNOC list
+|- !l x. EL(LENGTH l)(SNOC x l) = x
+\ENDTHEOREM
\THEOREM ELL\_IS\_EL list
|- !n l. n < (LENGTH l) ==> IS_EL(EL n l)l
\ENDTHEOREM
@@ -1475,29 +1485,6 @@
\THEOREM ELL\_SUC\_SNOC list
|- !n x l. ELL(SUC n)(SNOC x l) = ELL n l
\ENDTHEOREM
-\THEOREM EL\_APPEND1 list
-|- !n l1 l2. n < (LENGTH l1) ==> (EL n(APPEND l1 l2) = EL n l1)
-\ENDTHEOREM
-\THEOREM EL\_APPEND2 list
-|- !l1 n.
- (LENGTH l1) <= n ==>
- (!l2. EL n(APPEND l1 l2) = EL(n - (LENGTH l1))l2)
-\ENDTHEOREM
-\THEOREM EL\_CONS list
-|- !n. 0 < n ==> (!x l. EL n(CONS x l) = EL(PRE n)l)
-\ENDTHEOREM
-\THEOREM EL\_ELL list
-|- !n l. n < (LENGTH l) ==> (EL n l = ELL(PRE((LENGTH l) - n))l)
-\ENDTHEOREM
-\THEOREM EL\_IS\_EL list
-|- !n l. n < (LENGTH l) ==> IS_EL(EL n l)l
-\ENDTHEOREM
-\THEOREM EL\_LENGTH\_APPEND list
-|- !l2 l1. ~NULL l2 ==> (EL(LENGTH l1)(APPEND l1 l2) = HD l2)
-\ENDTHEOREM
-\THEOREM EL\_LENGTH\_SNOC list
-|- !l x. EL(LENGTH l)(SNOC x l) = x
-\ENDTHEOREM
\THEOREM EL\_MAP list
|- !n l. n < (LENGTH l) ==> (!f. EL n(MAP f l) = f(EL n l))
\ENDTHEOREM
@@ -1548,17 +1535,17 @@
LEFT_ID g e ==>
(!l. FOLDR f e(FLAT l) = FOLDR g e(MAP(FOLDR f e)l)))
\ENDTHEOREM
-\THEOREM FILTER list
-|- (!P. FILTER P[] = []) /\
- (!P x l.
- FILTER P(CONS x l) = (P x => CONS x(FILTER P l) | FILTER P l))
-\ENDTHEOREM
\THEOREM FILTER\_APPEND list
|- !f l1 l2. FILTER f(APPEND l1 l2) = APPEND(FILTER f l1)(FILTER f l2)
\ENDTHEOREM
\THEOREM FILTER\_COMM list
|- !f1 f2 l. FILTER f1(FILTER f2 l) = FILTER f2(FILTER f1 l)
\ENDTHEOREM
+\THEOREM FILTER list
+|- (!P. FILTER P[] = []) /\
+ (!P x l.
+ FILTER P(CONS x l) = (P x => CONS x(FILTER P l) | FILTER P l))
+\ENDTHEOREM
\THEOREM FILTER\_FILTER list
|- !P Q l. FILTER P(FILTER Q l) = FILTER(\x. P x /\ Q x)l
\ENDTHEOREM
@@ -1583,10 +1570,6 @@
\THEOREM FILTER\_SNOC list
|- !P x l. FILTER P(SNOC x l) = (P x => SNOC x(FILTER P l) | FILTER P l)
\ENDTHEOREM
-\THEOREM FIRSTN list
-|- (!l. FIRSTN 0 l = []) /\
- (!n x l. FIRSTN(SUC n)(CONS x l) = CONS x(FIRSTN n l))
-\ENDTHEOREM
\THEOREM FIRSTN\_APPEND1 list
|- !n l1.
n <= (LENGTH l1) ==> (!l2. FIRSTN n(APPEND l1 l2) = FIRSTN n l1)
@@ -1599,6 +1582,10 @@
\THEOREM FIRSTN\_BUTLASTN list
|- !n l. n <= (LENGTH l) ==> (FIRSTN n l = BUTLASTN((LENGTH l) - n)l)
\ENDTHEOREM
+\THEOREM FIRSTN list
+|- (!l. FIRSTN 0 l = []) /\
+ (!n x l. FIRSTN(SUC n)(CONS x l) = CONS x(FIRSTN n l))
+\ENDTHEOREM
\THEOREM FIRSTN\_FIRSTN list
|- !m l.
m <= (LENGTH l) ==>
@@ -1619,12 +1606,12 @@
\THEOREM FIRSTN\_SNOC list
|- !n l. n <= (LENGTH l) ==> (!x. FIRSTN n(SNOC x l) = FIRSTN n l)
\ENDTHEOREM
-\THEOREM FLAT list
-|- (FLAT[] = []) /\ (!h t. FLAT(CONS h t) = APPEND h(FLAT t))
-\ENDTHEOREM
\THEOREM FLAT\_APPEND list
|- !l1 l2. FLAT(APPEND l1 l2) = APPEND(FLAT l1)(FLAT l2)
\ENDTHEOREM
+\THEOREM FLAT list
+|- (FLAT[] = []) /\ (!h t. FLAT(CONS h t) = APPEND h(FLAT t))
+\ENDTHEOREM
\THEOREM FLAT\_FLAT list
|- !l. FLAT(FLAT l) = FLAT(MAP FLAT l)
\ENDTHEOREM
@@ -1640,13 +1627,13 @@
\THEOREM FLAT\_SNOC list
|- !x l. FLAT(SNOC x l) = APPEND(FLAT l)x
\ENDTHEOREM
+\THEOREM FOLDL\_APPEND list
+|- !f e l1 l2. FOLDL f e(APPEND l1 l2) = FOLDL f(FOLDL f e l1)l2
+\ENDTHEOREM
\THEOREM FOLDL list
|- (!f e. FOLDL f e[] = e) /\
(!f e x l. FOLDL f e(CONS x l) = FOLDL f(f e x)l)
\ENDTHEOREM
-\THEOREM FOLDL\_APPEND list
-|- !f e l1 l2. FOLDL f e(APPEND l1 l2) = FOLDL f(FOLDL f e l1)l2
-\ENDTHEOREM
\THEOREM FOLDL\_FILTER list
|- !f e P l. FOLDL f e(FILTER P l) = FOLDL(\x y. (P y => f x y | x))e l
\ENDTHEOREM
@@ -1668,16 +1655,16 @@
\THEOREM FOLDL\_SNOC\_NIL list
|- !l. FOLDL(\xs x. SNOC x xs)[]l = l
\ENDTHEOREM
-\THEOREM FOLDR list
-|- (!f e. FOLDR f e[] = e) /\
- (!f e x l. FOLDR f e(CONS x l) = f x(FOLDR f e l))
-\ENDTHEOREM
\THEOREM FOLDR\_APPEND list
|- !f e l1 l2. FOLDR f e(APPEND l1 l2) = FOLDR f(FOLDR f e l2)l1
\ENDTHEOREM
\THEOREM FOLDR\_CONS\_NIL list
|- !l. FOLDR CONS[]l = l
\ENDTHEOREM
+\THEOREM FOLDR list
+|- (!f e. FOLDR f e[] = e) /\
+ (!f e x l. FOLDR f e(CONS x l) = f x(FOLDR f e l))
+\ENDTHEOREM
\THEOREM FOLDR\_FILTER list
|- !f e P l. FOLDR f e(FILTER P l) = FOLDR(\x y. (P x => f x y | y))e l
\ENDTHEOREM
@@ -1716,10 +1703,6 @@
\THEOREM HD list
|- !h t. HD(CONS h t) = h
\ENDTHEOREM
-\THEOREM IS\_EL list
-|- (!x. IS_EL x[] = F) /\
- (!y x l. IS_EL y(CONS x l) = (y = x) \/ IS_EL y l)
-\ENDTHEOREM
\THEOREM IS\_EL\_APPEND list
|- !l1 l2 x. IS_EL x(APPEND l1 l2) = IS_EL x l1 \/ IS_EL x l2
\ENDTHEOREM
@@ -1732,6 +1715,10 @@
\THEOREM IS\_EL\_DEF list
|- !x l. IS_EL x l = SOME_EL($= x)l
\ENDTHEOREM
+\THEOREM IS\_EL list
+|- (!x. IS_EL x[] = F) /\
+ (!y x l. IS_EL y(CONS x l) = (y = x) \/ IS_EL y l)
+\ENDTHEOREM
\THEOREM IS\_EL\_FILTER list
|- !P x. P x ==> (!l. IS_EL x(FILTER P l) = IS_EL x l)
\ENDTHEOREM
@@ -1772,15 +1759,15 @@
\THEOREM IS\_list\_REP list
|- !r. IS_list_REP r = (?f n. r = (\m. (m < n => f m | (@x. T))),n)
\ENDTHEOREM
+\THEOREM IS\_PREFIX\_APPEND list
+|- !l1 l2. IS_PREFIX l1 l2 = (?l. l1 = APPEND l2 l)
+\ENDTHEOREM
\THEOREM IS\_PREFIX list
|- (!l. IS_PREFIX l[] = T) /\
(!x l. IS_PREFIX[](CONS x l) = F) /\
(!x1 l1 x2 l2.
IS_PREFIX(CONS x1 l1)(CONS x2 l2) = (x1 = x2) /\ IS_PREFIX l1 l2)
\ENDTHEOREM
-\THEOREM IS\_PREFIX\_APPEND list
-|- !l1 l2. IS_PREFIX l1 l2 = (?l. l1 = APPEND l2 l)
-\ENDTHEOREM
\THEOREM IS\_PREFIX\_IS\_SUBLIST list
|- !l1 l2. IS_PREFIX l1 l2 ==> IS_SUBLIST l1 l2
\ENDTHEOREM
@@ -1790,6 +1777,9 @@
\THEOREM IS\_PREFIX\_REVERSE list
|- !l1 l2. IS_PREFIX(REVERSE l1)(REVERSE l2) = IS_SUFFIX l1 l2
\ENDTHEOREM
+\THEOREM IS\_SUBLIST\_APPEND list
+|- !l1 l2. IS_SUBLIST l1 l2 = (?l l'. l1 = APPEND l(APPEND l2 l'))
+\ENDTHEOREM
\THEOREM IS\_SUBLIST list
|- (!l. IS_SUBLIST l[] = T) /\
(!x l. IS_SUBLIST[](CONS x l) = F) /\
@@ -1797,33 +1787,32 @@
IS_SUBLIST(CONS x1 l1)(CONS x2 l2) =
(x1 = x2) /\ IS_PREFIX l1 l2 \/ IS_SUBLIST l1(CONS x2 l2))
\ENDTHEOREM
-\THEOREM IS\_SUBLIST\_APPEND list
-|- !l1 l2. IS_SUBLIST l1 l2 = (?l l'. l1 = APPEND l(APPEND l2 l'))
-\ENDTHEOREM
\THEOREM IS\_SUBLIST\_REVERSE list
|- !l1 l2. IS_SUBLIST(REVERSE l1)(REVERSE l2) = IS_SUBLIST l1 l2
\ENDTHEOREM
+\THEOREM IS\_SUFFIX\_APPEND list
+|- !l1 l2. IS_SUFFIX l1 l2 = (?l. l1 = APPEND l l2)
+\ENDTHEOREM
\THEOREM IS\_SUFFIX list
|- (!l. IS_SUFFIX l[] = T) /\
(!x l. IS_SUFFIX[](SNOC x l) = F) /\
(!x1 l1 x2 l2.
IS_SUFFIX(SNOC x1 l1)(SNOC x2 l2) = (x1 = x2) /\ IS_SUFFIX l1 l2)
\ENDTHEOREM
-\THEOREM IS\_SUFFIX\_APPEND list
-|- !l1 l2. IS_SUFFIX l1 l2 = (?l. l1 = APPEND l l2)
-\ENDTHEOREM
\THEOREM IS\_SUFFIX\_IS\_SUBLIST list
|- !l1 l2. IS_SUFFIX l1 l2 ==> IS_SUBLIST l1 l2
\ENDTHEOREM
\THEOREM IS\_SUFFIX\_REVERSE list
|- !l1 l2. IS_SUFFIX(REVERSE l1)(REVERSE l2) = IS_PREFIX l1 l2
\ENDTHEOREM
+\THEOREM LAST\_DEF list
+|- !l. LAST l = HD(SEG 1(PRE(LENGTH l))l)
+\ENDTHEOREM
\THEOREM LAST list
|- !x l. LAST(SNOC x l) = x
\ENDTHEOREM
-\THEOREM LASTN list
-|- (!l. LASTN 0 l = []) /\
- (!n x l. LASTN(SUC n)(SNOC x l) = SNOC x(LASTN n l))
+\THEOREM LAST\_LASTN\_LAST list
+|- !n l. n <= (LENGTH l) ==> 0 < n ==> (LAST(LASTN n l) = LAST l)
\ENDTHEOREM
\THEOREM LASTN\_1 list
|- !l. ~(l = []) ==> (LASTN 1 l = [LAST l])
@@ -1847,6 +1836,10 @@
\THEOREM LASTN\_CONS list
|- !n l. n <= (LENGTH l) ==> (!x. LASTN n(CONS x l) = LASTN n l)
\ENDTHEOREM
+\THEOREM LASTN list
+|- (!l. LASTN 0 l = []) /\
+ (!n x l. LASTN(SUC n)(SNOC x l) = SNOC x(LASTN n l))
+\ENDTHEOREM
\THEOREM LASTN\_LASTN list
|- !l n m.
m <= (LENGTH l) ==> n <= m ==> (LASTN n(LASTN m l) = LASTN n l)
@@ -1866,15 +1859,6 @@
\THEOREM LASTN\_SEG list
|- !n l. n <= (LENGTH l) ==> (LASTN n l = SEG n((LENGTH l) - n)l)
\ENDTHEOREM
-\THEOREM LAST\_DEF list
-|- !l. LAST l = HD(SEG 1(PRE(LENGTH l))l)
-\ENDTHEOREM
-\THEOREM LAST\_LASTN\_LAST list
-|- !n l. n <= (LENGTH l) ==> 0 < n ==> (LAST(LASTN n l) = LAST l)
-\ENDTHEOREM
-\THEOREM LENGTH list
-|- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t))
-\ENDTHEOREM
\THEOREM LENGTH\_APPEND list
|- !l1 l2. LENGTH(APPEND l1 l2) = (LENGTH l1) + (LENGTH l2)
\ENDTHEOREM
@@ -1891,14 +1875,17 @@
|- !l n.
(LENGTH l = SUC n) = (?h l'. (LENGTH l' = n) /\ (l = CONS h l'))
\ENDTHEOREM
-\THEOREM LENGTH\_EQ list
-|- !x y. (x = y) ==> (LENGTH x = LENGTH y)
+\THEOREM LENGTH list
+|- (LENGTH[] = 0) /\ (!h t. LENGTH(CONS h t) = SUC(LENGTH t))
\ENDTHEOREM
\THEOREM LENGTH\_EQ\_CONS list
|- !P n.
(!l. (LENGTH l = SUC n) ==> P l) =
(!l. (LENGTH l = n) ==> (\l. !x. P(CONS x l))l)
\ENDTHEOREM
+\THEOREM LENGTH\_EQ list
+|- !x y. (x = y) ==> (LENGTH x = LENGTH y)
+\ENDTHEOREM
\THEOREM LENGTH\_EQ\_NIL list
|- !P. (!l. (LENGTH l = 0) ==> P l) = P[]
\ENDTHEOREM
@@ -1920,9 +1907,6 @@
\THEOREM LENGTH\_LASTN list
|- !n l. n <= (LENGTH l) ==> (LENGTH(LASTN n l) = n)
\ENDTHEOREM
-\THEOREM LENGTH\_MAP list
-|- !l f. LENGTH(MAP f l) = LENGTH l
-\ENDTHEOREM
\THEOREM LENGTH\_MAP2 list
|- !l1 l2.
(LENGTH l1 = LENGTH l2) ==>
@@ -1930,6 +1914,9 @@
(LENGTH(MAP2 f l1 l2) = LENGTH l1) /\
(LENGTH(MAP2 f l1 l2) = LENGTH l2))
\ENDTHEOREM
+\THEOREM LENGTH\_MAP list
+|- !l f. LENGTH(MAP f l) = LENGTH l
+\ENDTHEOREM
\THEOREM LENGTH\_NIL list
|- !l. (LENGTH l = 0) = (l = [])
\ENDTHEOREM
@@ -1984,9 +1971,6 @@
\THEOREM list\_TY\_DEF list
|- ?rep. TYPE_DEFINITION IS_list_REP rep
\ENDTHEOREM
-\THEOREM MAP list
-|- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t))
-\ENDTHEOREM
\THEOREM MAP2 list
|- (!f. MAP2 f[][] = []) /\
(!f h1 t1 h2 t2.
@@ -2000,6 +1984,9 @@
\THEOREM MAP\_APPEND list
|- !f l1 l2. MAP f(APPEND l1 l2) = APPEND(MAP f l1)(MAP f l2)
\ENDTHEOREM
+\THEOREM MAP list
+|- (!f. MAP f[] = []) /\ (!f h t. MAP f(CONS h t) = CONS(f h)(MAP f t))
+\ENDTHEOREM
\THEOREM MAP\_FILTER list
|- !f P l.
(!x. P(f x) = P x) ==> (MAP f(FILTER P l) = FILTER P(MAP f l))
@@ -2052,12 +2039,12 @@
\THEOREM NOT\_SOME\_EL\_ALL\_EL list
|- !P l. ~SOME_EL P l = ALL_EL($~ o P)l
\ENDTHEOREM
-\THEOREM NULL list
-|- NULL[] /\ (!h t. ~NULL(CONS h t))
-\ENDTHEOREM
\THEOREM NULL\_DEF list
|- (NULL[] = T) /\ (!h t. NULL(CONS h t) = F)
\ENDTHEOREM
+\THEOREM NULL list
+|- NULL[] /\ (!h t. ~NULL(CONS h t))
+\ENDTHEOREM
\THEOREM NULL\_EQ\_NIL list
|- !l. NULL l = (l = [])
\ENDTHEOREM
@@ -2081,13 +2068,13 @@
(!n t l.
PART(CONS n t)l = CONS(FST(SPLIT n l))(PART t(SND(SPLIT n l))))
\ENDTHEOREM
+\THEOREM PREFIX\_DEF list
+|- !P l. PREFIX P l = FST(SPLITP($~ o P)l)
+\ENDTHEOREM
\THEOREM PREFIX list
|- (!P. PREFIX P[] = []) /\
(!P x l. PREFIX P(CONS x l) = (P x => CONS x(PREFIX P l) | []))
\ENDTHEOREM
-\THEOREM PREFIX\_DEF list
-|- !P l. PREFIX P l = FST(SPLITP($~ o P)l)
-\ENDTHEOREM
\THEOREM PREFIX\_FOLDR list
|- !P l. PREFIX P l = FOLDR(\x l'. (P x => CONS x l' | []))[]l
\ENDTHEOREM
@@ -2095,12 +2082,12 @@
|- (!x. REPLICATE 0 x = []) /\
(!n x. REPLICATE(SUC n)x = CONS x(REPLICATE n x))
\ENDTHEOREM
-\THEOREM REVERSE list
-|- (REVERSE[] = []) /\ (!x l. REVERSE(CONS x l) = SNOC x(REVERSE l))
-\ENDTHEOREM
\THEOREM REVERSE\_APPEND list
|- !l1 l2. REVERSE(APPEND l1 l2) = APPEND(REVERSE l2)(REVERSE l1)
\ENDTHEOREM
+\THEOREM REVERSE list
+|- (REVERSE[] = []) /\ (!x l. REVERSE(CONS x l) = SNOC x(REVERSE l))
+\ENDTHEOREM
\THEOREM REVERSE\_EQ\_NIL list
|- !l. (REVERSE l = []) = (l = [])
\ENDTHEOREM
@@ -2128,22 +2115,9 @@
(!f e x l.
SCANR f e(CONS x l) = CONS(f x(HD(SCANR f e l)))(SCANR f e l))
\ENDTHEOREM
-\THEOREM SEG list
-|- (!k l. SEG 0 k l = []) /\
- (!m x l. SEG(SUC m)0(CONS x l) = CONS x(SEG m 0 l)) /\
- (!m k x l. SEG(SUC m)(SUC k)(CONS x l) = SEG(SUC m)k l)
-\ENDTHEOREM
\THEOREM SEG\_0\_SNOC list
|- !m l x. m <= (LENGTH l) ==> (SEG m 0(SNOC x l) = SEG m 0 l)
\ENDTHEOREM
-\THEOREM SEG\_APPEND list
-|- !m l1 n l2.
- m < (LENGTH l1) /\
- (LENGTH l1) <= (n + m) /\
- (n + m) <= ((LENGTH l1) + (LENGTH l2)) ==>
- (SEG n m(APPEND l1 l2) =
- APPEND(SEG((LENGTH l1) - m)m l1)(SEG((n + m) - (LENGTH l1))0 l2))
-\ENDTHEOREM
\THEOREM SEG\_APPEND1 list
|- !n m l1.
(n + m) <= (LENGTH l1) ==> (!l2. SEG n m(APPEND l1 l2) = SEG n m l1)
@@ -2153,6 +2127,19 @@
(LENGTH l1) <= m /\ n <= (LENGTH l2) ==>
(SEG n m(APPEND l1 l2) = SEG n(m - (LENGTH l1))l2)
\ENDTHEOREM
+\THEOREM SEG\_APPEND list
+|- !m l1 n l2.
+ m < (LENGTH l1) /\
+ (LENGTH l1) <= (n + m) /\
+ (n + m) <= ((LENGTH l1) + (LENGTH l2)) ==>
+ (SEG n m(APPEND l1 l2) =
+ APPEND(SEG((LENGTH l1) - m)m l1)(SEG((n + m) - (LENGTH l1))0 l2))
+\ENDTHEOREM
+\THEOREM SEG list
+|- (!k l. SEG 0 k l = []) /\
+ (!m x l. SEG(SUC m)0(CONS x l) = CONS x(SEG m 0 l)) /\
+ (!m k x l. SEG(SUC m)(SUC k)(CONS x l) = SEG(SUC m)k l)
+\ENDTHEOREM
\THEOREM SEG\_FIRSTN\_BUTFISTN list
|- !n m l.
(n + m) <= (LENGTH l) ==> (SEG n m l = FIRSTN n(BUTFIRSTN m l))
@@ -2184,10 +2171,6 @@
\THEOREM SEG\_SUC\_CONS list
|- !m n l x. SEG m(SUC n)(CONS x l) = SEG m n l
\ENDTHEOREM
-\THEOREM SNOC list
-|- (!x. SNOC x[] = [x]) /\
- (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l))
-\ENDTHEOREM
\THEOREM SNOC\_11 list
|- !x l x' l'. (SNOC x l = SNOC x' l') = (x = x') /\ (l = l')
\ENDTHEOREM
@@ -2200,6 +2183,10 @@
\THEOREM SNOC\_CASES list
|- !l. (l = []) \/ (?l' x. l = SNOC x l')
\ENDTHEOREM
+\THEOREM SNOC list
+|- (!x. SNOC x[] = [x]) /\
+ (!x x' l. SNOC x(CONS x' l) = CONS x'(SNOC x l))
+\ENDTHEOREM
\THEOREM SNOC\_EQ\_LENGTH\_EQ list
|- !x1 l1 x2 l2. (SNOC x1 l1 = SNOC x2 l2) ==> (LENGTH l1 = LENGTH l2)
\ENDTHEOREM
@@ -2212,10 +2199,6 @@
\THEOREM SNOC\_REVERSE\_CONS list
|- !x l. SNOC x l = REVERSE(CONS x(REVERSE l))
\ENDTHEOREM
-\THEOREM SOME\_EL list
-|- (!P. SOME_EL P[] = F) /\
- (!P x l. SOME_EL P(CONS x l) = P x \/ SOME_EL P l)
-\ENDTHEOREM
\THEOREM SOME\_EL\_APPEND list
|- !P l1 l2. SOME_EL P(APPEND l1 l2) = SOME_EL P l1 \/ SOME_EL P l2
\ENDTHEOREM
@@ -2230,6 +2213,10 @@
\THEOREM SOME\_EL\_DISJ list
|- !P Q l. SOME_EL(\x. P x \/ Q x)l = SOME_EL P l \/ SOME_EL Q l
\ENDTHEOREM
+\THEOREM SOME\_EL list
+|- (!P. SOME_EL P[] = F) /\
+ (!P x l. SOME_EL P(CONS x l) = P x \/ SOME_EL P l)
+\ENDTHEOREM
\THEOREM SOME\_EL\_FIRSTN list
|- !m l. m <= (LENGTH l) ==> (!P. SOME_EL P(FIRSTN m l) ==> SOME_EL P l)
\ENDTHEOREM
@@ -2277,12 +2264,12 @@
\THEOREM SUFFIX\_DEF list
|- !P l. SUFFIX P l = FOLDL(\l' x. (P x => SNOC x l' | []))[]l
\ENDTHEOREM
-\THEOREM SUM list
-|- (SUM[] = 0) /\ (!h t. SUM(CONS h t) = h + (SUM t))
-\ENDTHEOREM
\THEOREM SUM\_APPEND list
|- !l1 l2. SUM(APPEND l1 l2) = (SUM l1) + (SUM l2)
\ENDTHEOREM
+\THEOREM SUM list
+|- (SUM[] = 0) /\ (!h t. SUM(CONS h t) = h + (SUM t))
+\ENDTHEOREM
\THEOREM SUM\_FLAT list
|- !l. SUM(FLAT l) = SUM(MAP SUM l)
\ENDTHEOREM
@@ -2336,8 +2323,7 @@
\THEOREM ZIP\_UNZIP list
|- !l. ZIP(UNZIP l) = l
\ENDTHEOREM
-\section{Theorems about trees}
-\THEOREM AP ltree
+\section{Theorems about trees}\THEOREM AP ltree
|- (!l. AP[]l = []) /\
(!h t l. AP(CONS h t)l = CONS(h(HD l))(AP t(TL l)))
\ENDTHEOREM
@@ -2372,21 +2358,21 @@
\THEOREM ltree\_TY\_DEF ltree
|- ?rep. TYPE_DEFINITION Is_ltree rep
\ENDTHEOREM
-\THEOREM Node ltree
-|- !v tl.
- Node v tl =
- ABS_ltree
- (node(MAP(FST o REP_ltree)tl),CONS v(FLAT(MAP(SND o REP_ltree)tl)))
-\ENDTHEOREM
-\THEOREM node tree
-|- !tl. node tl = ABS_tree(node_REP(MAP REP_tree tl))
+\THEOREM node\_11 tree
+|- !tl1 tl2. (node tl1 = node tl2) = (tl1 = tl2)
\ENDTHEOREM
\THEOREM Node\_11 ltree
|- !v1 v2 trl1 trl2.
(Node v1 trl1 = Node v2 trl2) = (v1 = v2) /\ (trl1 = trl2)
\ENDTHEOREM
-\THEOREM node\_11 tree
-|- !tl1 tl2. (node tl1 = node tl2) = (tl1 = tl2)
+\THEOREM node tree
+|- !tl. node tl = ABS_tree(node_REP(MAP REP_tree tl))
+\ENDTHEOREM
+\THEOREM Node ltree
+|- !v tl.
+ Node v tl =
+ ABS_ltree
+ (node(MAP(FST o REP_ltree)tl),CONS v(FLAT(MAP(SND o REP_ltree)tl)))
\ENDTHEOREM
\THEOREM Node\_onto ltree
|- !l. ?v trl. l = Node v trl
@@ -2426,8 +2412,7 @@
trf n f =
(@fn. !trl. (HT(node trl)) <= n ==> (fn(node trl) = f(MAP fn trl)))
\ENDTHEOREM
-\section{Theorems used to define types}
-\THEOREM ABS\_REP\_THM BASIC-HOL
+\section{Theorems used to define types}\THEOREM ABS\_REP\_THM BASIC-HOL
|- !P.
(?rep. TYPE_DEFINITION P rep) ==>
(?rep abs. (!a. abs(rep a) = a) /\ (!r. P r = (rep(abs r) = r)))
@@ -2435,17 +2420,11 @@
\THEOREM exists\_TRP tydefs
|- !P. (?v. P v[]) ==> (?t. TRP P t)
\ENDTHEOREM
-\THEOREM TRP tydefs
-|- !P v tl. TRP P(Node v tl) = P v tl /\ ALL_EL(TRP P)tl
-\ENDTHEOREM
\THEOREM TRP\_DEF tydefs
|- !P. TRP P = (@trp. !v tl. trp(Node v tl) = P v tl /\ ALL_EL trp tl)
\ENDTHEOREM
-\THEOREM TYPE\_DEFINITION bool
-|- !P rep.
- TYPE_DEFINITION P rep =
- (!x' x''. (rep x' = rep x'') ==> (x' = x'')) /\
- (!x. P x = (?x'. x = rep x'))
+\THEOREM TRP tydefs
+|- !P v tl. TRP P(Node v tl) = P v tl /\ ALL_EL(TRP P)tl
\ENDTHEOREM
\THEOREM TY\_DEF\_THM tydefs
|- !REP ABS P.
@@ -2456,3 +2435,9 @@
P v(MAP REP tl) ==>
(fn(ABS(Node v(MAP REP tl))) = f(MAP fn tl)v tl))
\ENDTHEOREM
+\THEOREM TYPE\_DEFINITION bool
+|- !P rep.
+ TYPE_DEFINITION P rep =
+ (!x' x''. (rep x' = rep x'') ==> (x' = x'')) /\
+ (!x. P x = (?x'. x = rep x'))
+\ENDTHEOREM
--- hol88-2.02.19940316.orig/Manual/Reference/reference.tex
+++ hol88-2.02.19940316/Manual/Reference/reference.tex
@@ -32,7 +32,7 @@
\include{title} % reference title page
\include{preface} % preface to reference manual
- \include{../LaTeX/ack} % global acknowledgements
+ \include{ack} % global acknowledgements
\include{contents} % table of contents
% ---------------------------------------------------------------------
--- hol88-2.02.19940316.orig/Manual/Reference/index.tex
+++ hol88-2.02.19940316/Manual/Reference/index.tex
@@ -1,1625 +1 @@
-\begin{theindex}
-
- \item {\ptt *}, 1
- \item {\ptt +}, 2
- \item {\ptt -}, 2
- \item {\ptt /}, 3
- \item {\ptt <}, 4
- \item {\ptt <<}, 4
- \item {\ptt =}, 4
- \item {\ptt >}, 6
- \item {\ptt \#}, 1
- \item {\ptt \char '056}, 2
- \item {\ptt \char '100}, 7
- \item {\ptt \char '136}, 3
-
- \indexspace
-
- \item {\ptt ABS}, 7
- \item {\ptt ABS\_CONV}, 8
- \item {\ptt abs\_goals}, 9
- \item {\ptt ABS\_REP\_THM}, 661
- \item {\ptt ABS\_SIMP}, 614
- \item {\ptt AC\_CONV}, 11
- \item {\ptt ACCEPT\_TAC}, 9
- \item {\ptt achieve\_first}, 10
- \item {\ptt achieves}, 10
- \item {\ptt aconv}, 10
- \item {\ptt activate\_binders}, 11
- \item {\ptt ADD}, 619
- \item {\ptt ADD1}, 619
- \item {\ptt ADD\_0}, 619
- \item {\ptt ADD\_ASSOC}, 619
- \item {\ptt ADD\_ASSUM}, 12
- \item {\ptt ADD\_CLAUSES}, 619
- \item {\ptt ADD\_CONV}, 13
- \item {\ptt ADD\_EQ\_0}, 619
- \item {\ptt ADD\_EQ\_SUB}, 619
- \item {\ptt ADD\_INV\_0}, 619
- \item {\ptt ADD\_INV\_0\_EQ}, 619
- \item {\ptt ADD\_MONO\_LESS\_EQ}, 619
- \item {\ptt ADD\_SUB}, 619
- \item {\ptt ADD\_SUC}, 619
- \item {\ptt ADD\_SYM}, 619
- \item {\ptt ALL\_CONV}, 15
- \item {\ptt ALL\_EL}, 634
- \item {\ptt ALL\_EL\_APPEND}, 634
- \item {\ptt ALL\_EL\_BUTFIRSTN}, 634
- \item {\ptt ALL\_EL\_BUTLASTN}, 634
- \item {\ptt ALL\_EL\_CONJ}, 634
- \item {\ptt ALL\_EL\_CONV}, 15
- \item {\ptt ALL\_EL\_FIRSTN}, 634
- \item {\ptt ALL\_EL\_FOLDL}, 634
- \item {\ptt ALL\_EL\_FOLDL\_MAP}, 634
- \item {\ptt ALL\_EL\_FOLDR}, 634
- \item {\ptt ALL\_EL\_FOLDR\_MAP}, 634
- \item {\ptt ALL\_EL\_LASTN}, 634
- \item {\ptt ALL\_EL\_MAP}, 634
- \item {\ptt ALL\_EL\_REPLICATE}, 634
- \item {\ptt ALL\_EL\_REVERSE}, 634
- \item {\ptt ALL\_EL\_SEG}, 635
- \item {\ptt ALL\_EL\_SNOC}, 635
- \item {\ptt ALL\_TAC}, 16
- \item {\ptt ALL\_THEN}, 17
- \item {\ptt allowed\_constant}, 14
- \item {\ptt ALPHA}, 17
- \item {\ptt ALPHA\_CONV}, 18
- \item {\ptt ancestors}, 19
- \item {\ptt ancestry}, 19
- \item {\ptt AND1\_THM}, 611
- \item {\ptt AND2\_THM}, 611
- \item {\ptt AND\_CLAUSES}, 611
- \item {\ptt AND\_DEF}, 609
- \item {\ptt AND\_EL\_DEF}, 635
- \item {\ptt AND\_EL\_FOLDL}, 635
- \item {\ptt AND\_EL\_FOLDR}, 635
- \item {\ptt AND\_EXISTS\_CONV}, 20
- \item {\ptt AND\_FORALL\_CONV}, 20
- \item {\ptt AND\_IMP\_INTRO}, 611
- \item {\ptt AND\_INTRO\_THM}, 611
- \item {\ptt ANTE\_CONJ\_CONV}, 21
- \item {\ptt ANTE\_RES\_THEN}, 21
- \item {\ptt AP}, 635, 659
- \item {\ptt AP\_TERM}, 25
- \item {\ptt AP\_TERM\_TAC}, 25
- \item {\ptt AP\_THM}, 26
- \item {\ptt AP\_THM\_TAC}, 26
- \item {\ptt APPEND}, 635
- \item {\ptt append}, 22
- \item {\ptt APPEND\_ASSOC}, 635
- \item {\ptt APPEND\_BUTLAST\_LAST}, 635
- \item {\ptt APPEND\_BUTLASTN\_BUTFIRSTN}, 635
- \item {\ptt APPEND\_BUTLASTN\_LASTN}, 635
- \item {\ptt APPEND\_CONV}, 23
- \item {\ptt APPEND\_FIRSTN\_BUTFIRSTN}, 635
- \item {\ptt APPEND\_FIRSTN\_LASTN}, 635
- \item {\ptt APPEND\_FOLDL}, 635
- \item {\ptt APPEND\_FOLDR}, 636
- \item {\ptt APPEND\_LENGTH\_EQ}, 636
- \item {\ptt APPEND\_NIL}, 636
- \item {\ptt append\_openw}, 23
- \item {\ptt APPEND\_SNOC}, 636
- \item {\ptt apply\_proof}, 24
- \item {\ptt ARB}, 610
- \item {\ptt arb\_term}, 27
- \item {\ptt ARB\_THM}, 610
- \item {\ptt arity}, 27
- \item {\ptt ascii}, 28
- \item {\ptt ascii\_code}, 28
- \item {\ptt ASM\_CASES\_TAC}, 29
- \item {\ptt ASM\_REWRITE\_RULE}, 29
- \item {\ptt ASM\_REWRITE\_TAC}, 30
- \item {\ptt assert}, 31
- \item {\ptt assignable\_print\_term}, 32
- \item {\ptt assoc}, 34
- \item {\ptt ASSOC\_ADD}, 619
- \item {\ptt ASSOC\_APPEND}, 636
- \item {\ptt ASSOC\_CONJ}, 614
- \item {\ptt ASSOC\_DEF}, 614
- \item {\ptt ASSOC\_DISJ}, 614
- \item {\ptt ASSOC\_FOLDL\_FLAT}, 636
- \item {\ptt ASSOC\_FOLDR\_FLAT}, 636
- \item {\ptt ASSOC\_MULT}, 620
- \item {\ptt associate\_restriction}, 34
- \item {\ptt ASSUM\_LIST}, 38
- \item {\ptt ASSUME}, 36
- \item {\ptt ASSUME\_TAC}, 37
- \item {\ptt attempt\_first}, 39
- \item {\ptt autoload}, 39
- \item {\ptt autoload\_theory}, 41
- \item {\ptt axiom}, 41
- \item {\ptt axiom\_lfn}, 43
- \item {\ptt axiom\_msg\_lfn}, 44
- \item {\ptt axioms}, 42
-
- \indexspace
-
- \item {\ptt B}, 44
- \item {\ptt b}, 45
- \item {\ptt backup}, 45
- \item {\ptt backup\_limit}, 47
- \item {\ptt backup\_list}, 50
- \item {\ptt basic\_rewrites}, 50
- \item {\ptt BETA\_CONV}, 52
- \item {\ptt BETA\_RULE}, 52
- \item {\ptt BETA\_TAC}, 53
- \item {\ptt bht}, 659
- \item {\ptt binders}, 54
- \item {\ptt bndvar}, 55
- \item {\ptt body}, 55
- \item {\ptt BODY\_CONJUNCTS}, 55
- \item {\ptt BOOL\_CASES\_AX}, 610
- \item {\ptt BOOL\_CASES\_TAC}, 56
- \item {\ptt bool\_EQ\_CONV}, 57
- \item {\ptt BOOL\_EQ\_DISTINCT}, 611
- \item {\ptt bool\_ty}, 58
- \item {\ptt BUTFIRSTN}, 636
- \item {\ptt BUTFIRSTN\_APPEND1}, 636
- \item {\ptt BUTFIRSTN\_APPEND2}, 636
- \item {\ptt BUTFIRSTN\_BUTFIRSTN}, 637
- \item {\ptt BUTFIRSTN\_CONV}, 58
- \item {\ptt BUTFIRSTN\_LASTN}, 637
- \item {\ptt BUTFIRSTN\_LENGTH\_APPEND}, 637
- \item {\ptt BUTFIRSTN\_LENGTH\_NIL}, 637
- \item {\ptt BUTFIRSTN\_REVERSE}, 637
- \item {\ptt BUTFIRSTN\_SEG}, 637
- \item {\ptt BUTFIRSTN\_SNOC}, 637
- \item {\ptt BUTLAST}, 637
- \item {\ptt butlast}, 59
- \item {\ptt BUTLAST\_CONV}, 60
- \item {\ptt BUTLAST\_DEF}, 639
- \item {\ptt BUTLASTN}, 637
- \item {\ptt BUTLASTN\_1}, 637
- \item {\ptt BUTLASTN\_APPEND1}, 637
- \item {\ptt BUTLASTN\_APPEND2}, 637
- \item {\ptt BUTLASTN\_BUTLAST}, 638
- \item {\ptt BUTLASTN\_BUTLASTN}, 638
- \item {\ptt BUTLASTN\_CONS}, 638
- \item {\ptt BUTLASTN\_CONV}, 59
- \item {\ptt BUTLASTN\_FIRSTN}, 638
- \item {\ptt BUTLASTN\_LASTN}, 638
- \item {\ptt BUTLASTN\_LASTN\_NIL}, 638
- \item {\ptt BUTLASTN\_LENGTH\_APPEND}, 638
- \item {\ptt BUTLASTN\_LENGTH\_CONS}, 638
- \item {\ptt BUTLASTN\_LENGTH\_NIL}, 638
- \item {\ptt BUTLASTN\_MAP}, 638
- \item {\ptt BUTLASTN\_REVERSE}, 638
- \item {\ptt BUTLASTN\_SEG}, 638
- \item {\ptt BUTLASTN\_SUC\_BUTLAST}, 638
-
- \indexspace
-
- \item {\ptt C}, 60
- \item {\ptt cached\_theories}, 61
- \item {\ptt can}, 61
- \item {\ptt CANCEL\_SUB}, 620
- \item {\ptt CASES\_THENL}, 62
- \item {\ptt CB}, 63
- \item {\ptt CCONTR}, 63
- \item {\ptt change\_state}, 65
- \item {\ptt CHANGED\_CONV}, 64
- \item {\ptt CHANGED\_TAC}, 65
- \item {\ptt CHECK\_ASSUME\_TAC}, 65
- \item {\ptt check\_lhs}, 66
- \item {\ptt check\_specification}, 66
- \item {\ptt check\_valid}, 67
- \item {\ptt check\_varstruct}, 67
- \item {\ptt chktac}, 67
- \item {\ptt CHOOSE}, 68
- \item {\ptt CHOOSE\_TAC}, 69
- \item {\ptt CHOOSE\_THEN}, 70
- \item {\ptt chop\_list}, 71
- \item {\ptt close}, 72
- \item {\ptt close\_theory}, 72
- \item {\ptt Co}, 73
- \item {\ptt com}, 73
- \item {\ptt combine}, 74
- \item {\ptt COMM\_ASSOC\_FOLDL\_REVERSE}, 639
- \item {\ptt COMM\_ASSOC\_FOLDR\_REVERSE}, 639
- \item {\ptt COMM\_DEF}, 615
- \item {\ptt COMM\_MONOID\_FOLDL}, 639
- \item {\ptt COMM\_MONOID\_FOLDR}, 639
- \item {\ptt COMMA\_DEF}, 617
- \item {\ptt compile}, 74
- \item {\ptt compilef}, 76
- \item {\ptt compilet}, 77
- \item {\ptt compiling}, 77
- \item {\ptt compiling\_stack}, 78
- \item {\ptt concat}, 79
- \item {\ptt concatl}, 79
- \item {\ptt concl}, 80
- \item {\ptt COND\_ABS}, 611
- \item {\ptt COND\_CASES\_TAC}, 80
- \item {\ptt COND\_CLAUSES}, 611
- \item {\ptt COND\_CONV}, 82
- \item {\ptt COND\_DEF}, 610
- \item {\ptt COND\_EXPAND}, 611
- \item {\ptt COND\_ID}, 611
- \item {\ptt COND\_RAND}, 611
- \item {\ptt COND\_RATOR}, 611
- \item {\ptt CONJ}, 82
- \item {\ptt CONJ\_ASSOC}, 611
- \item {\ptt CONJ\_DISCH}, 88
- \item {\ptt CONJ\_DISCHL}, 89
- \item {\ptt CONJ\_LIST}, 90
- \item {\ptt CONJ\_PAIR}, 91
- \item {\ptt CONJ\_SET\_CONV}, 92
- \item {\ptt CONJ\_SYM}, 612
- \item {\ptt CONJ\_TAC}, 92
- \item {\ptt CONJUNCT1}, 83
- \item {\ptt CONJUNCT2}, 83
- \item {\ptt CONJUNCTS}, 84
- \item {\ptt conjuncts}, 84
- \item {\ptt CONJUNCTS\_CONV}, 85
- \item {\ptt CONJUNCTS\_THEN}, 86
- \item {\ptt CONJUNCTS\_THEN2}, 87
- \item {\ptt CONS}, 639
- \item {\ptt CONS\_11}, 639
- \item {\ptt CONS\_APPEND}, 639
- \item {\ptt CONS\_DEF}, 639
- \item {\ptt constants}, 93
- \item {\ptt CONTR}, 94
- \item {\ptt CONTR\_TAC}, 95
- \item {\ptt CONTRAPOS}, 94
- \item {\ptt CONTRAPOS\_CONV}, 95
- \item {\ptt CONV\_RULE}, 96
- \item {\ptt CONV\_TAC}, 96
- \item {\ptt current\_theory}, 97
- \item {\ptt curry}, 98
- \item {\ptt CURRY\_DEF}, 617
-
- \indexspace
-
- \item {\ptt DA}, 620
- \item {\ptt DE\_MORGAN\_THM}, 612
- \item {\ptt DEF\_EXISTS\_RULE}, 108
- \item {\ptt define\_finite\_set\_syntax}, 99
- \item {\ptt define\_load\_lib\_function}, 100
- \item {\ptt define\_new\_type\_bijections}, 101
- \item {\ptt define\_set\_abstraction\_syntax}, 102
- \item {\ptt define\_type}, 103
- \item {\ptt definition}, 105
- \item {\ptt definition\_lfn}, 107
- \item {\ptt definition\_msg\_lfn}, 108
- \item {\ptt definitions}, 106
- \item {\ptt delete\_cache}, 109
- \item {\ptt delete\_thm}, 110
- \item {\ptt DEPTH\_CONV}, 111
- \item {\ptt dest\_abs}, 112
- \item {\ptt dest\_comb}, 113
- \item {\ptt dest\_cond}, 113
- \item {\ptt dest\_conj}, 114
- \item {\ptt dest\_cons}, 114
- \item {\ptt dest\_const}, 115
- \item {\ptt dest\_definition}, 115
- \item {\ptt dest\_disj}, 115
- \item {\ptt dest\_eq}, 116
- \item {\ptt dest\_exists}, 116
- \item {\ptt dest\_forall}, 117
- \item {\ptt dest\_form}, 117
- \item {\ptt dest\_imp}, 118
- \item {\ptt dest\_let}, 118
- \item {\ptt dest\_list}, 119
- \item {\ptt dest\_neg}, 119
- \item {\ptt dest\_neg\_imp}, 120
- \item {\ptt dest\_node}, 659
- \item {\ptt dest\_pabs}, 121
- \item {\ptt dest\_pair}, 121
- \item {\ptt dest\_pred}, 122
- \item {\ptt dest\_select}, 122
- \item {\ptt dest\_thm}, 123
- \item {\ptt dest\_type}, 123
- \item {\ptt dest\_var}, 124
- \item {\ptt dest\_vartype}, 124
- \item {\ptt DISCARD\_TAC}, 125
- \item {\ptt DISCH}, 126
- \item {\ptt disch}, 126
- \item {\ptt DISCH\_ALL}, 127
- \item {\ptt DISCH\_TAC}, 127
- \item {\ptt DISCH\_THEN}, 128
- \item {\ptt DISJ1}, 129
- \item {\ptt DISJ1\_TAC}, 130
- \item {\ptt DISJ2}, 131
- \item {\ptt DISJ2\_TAC}, 131
- \item {\ptt DISJ\_ASSOC}, 612
- \item {\ptt DISJ\_CASES}, 133
- \item {\ptt DISJ\_CASES\_TAC}, 134
- \item {\ptt DISJ\_CASES\_THEN}, 135
- \item {\ptt DISJ\_CASES\_THEN2}, 136
- \item {\ptt DISJ\_CASES\_THENL}, 138
- \item {\ptt DISJ\_CASES\_UNION}, 139
- \item {\ptt DISJ\_IMP}, 139
- \item {\ptt DISJ\_SYM}, 612
- \item {\ptt disjuncts}, 132
- \item {\ptt distinct}, 140
- \item {\ptt DIV\_LESS\_EQ}, 620
- \item {\ptt DIV\_MULT}, 620
- \item {\ptt DIV\_UNIQUE}, 620
- \item {\ptt DIVISION}, 620
- \item {\ptt do}, 141
- \item {\ptt draft\_mode}, 142
- \item {\ptt dropout}, 142
-
- \indexspace
-
- \item {\ptt e}, 143
- \item {\ptt EL}, 639
- \item {\ptt el}, 144
- \item {\ptt EL\_APPEND1}, 641
- \item {\ptt EL\_APPEND2}, 641
- \item {\ptt EL\_CONS}, 641
- \item {\ptt EL\_CONV}, 145
- \item {\ptt EL\_ELL}, 641
- \item {\ptt EL\_IS\_EL}, 641
- \item {\ptt EL\_LENGTH\_APPEND}, 641
- \item {\ptt EL\_LENGTH\_SNOC}, 641
- \item {\ptt EL\_MAP}, 641
- \item {\ptt EL\_PRE\_LENGTH}, 641
- \item {\ptt EL\_REVERSE}, 641
- \item {\ptt EL\_REVERSE\_ELL}, 641
- \item {\ptt EL\_SEG}, 641
- \item {\ptt EL\_SNOC}, 641
- \item {\ptt ELL}, 639
- \item {\ptt ELL\_0\_SNOC}, 639
- \item {\ptt ELL\_APPEND1}, 639
- \item {\ptt ELL\_APPEND2}, 640
- \item {\ptt ELL\_CONS}, 640
- \item {\ptt ELL\_CONV}, 145
- \item {\ptt ELL\_EL}, 640
- \item {\ptt ELL\_IS\_EL}, 640
- \item {\ptt ELL\_LAST}, 640
- \item {\ptt ELL\_LENGTH\_APPEND}, 640
- \item {\ptt ELL\_LENGTH\_CONS}, 640
- \item {\ptt ELL\_LENGTH\_SNOC}, 640
- \item {\ptt ELL\_MAP}, 640
- \item {\ptt ELL\_PRE\_LENGTH}, 640
- \item {\ptt ELL\_REVERSE}, 640
- \item {\ptt ELL\_REVERSE\_EL}, 640
- \item {\ptt ELL\_SEG}, 640
- \item {\ptt ELL\_SNOC}, 640
- \item {\ptt ELL\_SUC\_SNOC}, 640
- \item {\ptt end\_itlist}, 146
- \item {\ptt enter\_form\_rep}, 147
- \item {\ptt enter\_term}, 147
- \item {\ptt enter\_term\_rep}, 147
- \item {\ptt EQ\_CLAUSES}, 612
- \item {\ptt EQ\_EXPAND}, 612
- \item {\ptt EQ\_EXT}, 615
- \item {\ptt EQ\_IMP\_RULE}, 149
- \item {\ptt EQ\_IMP\_THM}, 612
- \item {\ptt EQ\_LENGTH\_INDUCT\_TAC}, 150
- \item {\ptt EQ\_LENGTH\_SNOC\_INDUCT\_TAC}, 151
- \item {\ptt EQ\_LESS}, 620
- \item {\ptt EQ\_LESS\_EQ}, 620
- \item {\ptt EQ\_LIST}, 641
- \item {\ptt EQ\_MONO\_ADD\_EQ}, 620
- \item {\ptt EQ\_MP}, 152
- \item {\ptt EQ\_REFL}, 612
- \item {\ptt EQ\_SYM}, 612
- \item {\ptt EQ\_SYM\_EQ}, 612
- \item {\ptt EQ\_TAC}, 152
- \item {\ptt EQ\_TRANS}, 612
- \item {\ptt EQF\_ELIM}, 147
- \item {\ptt EQF\_INTRO}, 148
- \item {\ptt EQT\_ELIM}, 148
- \item {\ptt EQT\_INTRO}, 149
- \item {\ptt ETA\_AX}, 610
- \item {\ptt ETA\_CONV}, 153
- \item {\ptt EVEN}, 620
- \item {\ptt EVEN\_ADD}, 620
- \item {\ptt EVEN\_AND\_ODD}, 620
- \item {\ptt EVEN\_DOUBLE}, 620
- \item {\ptt EVEN\_EXISTS}, 620
- \item {\ptt EVEN\_MULT}, 621
- \item {\ptt EVEN\_ODD}, 621
- \item {\ptt EVEN\_ODD\_EXISTS}, 621
- \item {\ptt EVEN\_OR\_ODD}, 621
- \item {\ptt EVERY}, 153
- \item {\ptt EVERY\_ASSUM}, 154
- \item {\ptt EVERY\_CONV}, 155
- \item {\ptt EVERY\_TCL}, 155
- \item {\ptt EXCLUDED\_MIDDLE}, 612
- \item {\ptt EXISTENCE}, 156
- \item {\ptt EXISTS}, 157
- \item {\ptt exists}, 157
- \item {\ptt EXISTS\_AND\_CONV}, 158
- \item {\ptt EXISTS\_DEF}, 609
- \item {\ptt EXISTS\_EQ}, 159
- \item {\ptt EXISTS\_GREATEST\_CONV}, 159
- \item {\ptt EXISTS\_IMP}, 160
- \item {\ptt EXISTS\_IMP\_CONV}, 160
- \item {\ptt EXISTS\_LEAST\_CONV}, 161
- \item {\ptt EXISTS\_NOT\_CONV}, 162
- \item {\ptt EXISTS\_OR\_CONV}, 162
- \item {\ptt EXISTS\_SIMP}, 612
- \item {\ptt EXISTS\_TAC}, 163
- \item {\ptt exists\_TRP}, 661
- \item {\ptt EXISTS\_UNIQUE\_CONV}, 164
- \item {\ptt EXISTS\_UNIQUE\_DEF}, 609
- \item {\ptt EXP}, 621
- \item {\ptt EXP\_ADD}, 621
- \item {\ptt expand}, 164
- \item {\ptt expandf}, 167
- \item {\ptt explode}, 169
- \item {\ptt EXT}, 169
- \item {\ptt extend\_theory}, 170
-
- \indexspace
-
- \item {\ptt F\_DEF}, 609
- \item {\ptt F\_IMP}, 613
- \item {\ptt FACT}, 621
- \item {\ptt FACT\_LESS}, 621
- \item {\ptt FAIL\_TAC}, 171
- \item {\ptt FALSITY}, 612
- \item {\ptt falsity}, 172
- \item {\ptt fast\_arith}, 172
- \item {\ptt FCOMM\_ASSOC}, 615
- \item {\ptt FCOMM\_DEF}, 615
- \item {\ptt FCOMM\_FOLDL\_APPEND}, 642
- \item {\ptt FCOMM\_FOLDL\_FLAT}, 642
- \item {\ptt FCOMM\_FOLDR\_APPEND}, 642
- \item {\ptt FCOMM\_FOLDR\_FLAT}, 642
- \item {\ptt FILTER}, 642
- \item {\ptt filter}, 173
- \item {\ptt FILTER\_APPEND}, 642
- \item {\ptt FILTER\_ASM\_REWRITE\_RULE}, 174
- \item {\ptt FILTER\_ASM\_REWRITE\_TAC}, 174
- \item {\ptt FILTER\_COMM}, 642
- \item {\ptt FILTER\_CONV}, 175
- \item {\ptt FILTER\_DISCH\_TAC}, 176
- \item {\ptt FILTER\_DISCH\_THEN}, 177
- \item {\ptt FILTER\_FILTER}, 642
- \item {\ptt FILTER\_FLAT}, 642
- \item {\ptt FILTER\_FOLDL}, 642
- \item {\ptt FILTER\_FOLDR}, 643
- \item {\ptt FILTER\_GEN\_TAC}, 178
- \item {\ptt FILTER\_IDEM}, 643
- \item {\ptt FILTER\_MAP}, 643
- \item {\ptt FILTER\_ONCE\_ASM\_REWRITE\_RULE}, 179
- \item {\ptt FILTER\_ONCE\_ASM\_REWRITE\_TAC}, 180
- \item {\ptt FILTER\_PURE\_ASM\_REWRITE\_RULE}, 180
- \item {\ptt FILTER\_PURE\_ASM\_REWRITE\_TAC}, 181
- \item {\ptt FILTER\_PURE\_ONCE\_ASM\_REWRITE\_RULE}, 182
- \item {\ptt FILTER\_PURE\_ONCE\_ASM\_REWRITE\_TAC}, 183
- \item {\ptt FILTER\_REVERSE}, 643
- \item {\ptt FILTER\_SNOC}, 643
- \item {\ptt FILTER\_STRIP\_TAC}, 183
- \item {\ptt FILTER\_STRIP\_THEN}, 185
- \item {\ptt find}, 186
- \item {\ptt find\_file}, 187
- \item {\ptt find\_match}, 187
- \item {\ptt find\_ml\_file}, 188
- \item {\ptt find\_term}, 189
- \item {\ptt find\_terms}, 190
- \item {\ptt find\_theory}, 190
- \item {\ptt FIRST}, 191
- \item {\ptt FIRST\_ASSUM}, 192
- \item {\ptt FIRST\_CONV}, 193
- \item {\ptt FIRST\_TCL}, 193
- \item {\ptt FIRSTN}, 643
- \item {\ptt FIRSTN\_APPEND1}, 643
- \item {\ptt FIRSTN\_APPEND2}, 643
- \item {\ptt FIRSTN\_BUTLASTN}, 643
- \item {\ptt FIRSTN\_CONV}, 191
- \item {\ptt FIRSTN\_FIRSTN}, 643
- \item {\ptt FIRSTN\_LENGTH\_APPEND}, 643
- \item {\ptt FIRSTN\_LENGTH\_ID}, 643
- \item {\ptt FIRSTN\_REVERSE}, 643
- \item {\ptt FIRSTN\_SEG}, 643
- \item {\ptt FIRSTN\_SNOC}, 644
- \item {\ptt flags}, 194
- \item {\ptt FLAT}, 644
- \item {\ptt flat}, 194
- \item {\ptt FLAT\_APPEND}, 644
- \item {\ptt FLAT\_CONV}, 195
- \item {\ptt FLAT\_FLAT}, 644
- \item {\ptt FLAT\_FOLDL}, 644
- \item {\ptt FLAT\_FOLDR}, 644
- \item {\ptt FLAT\_REVERSE}, 644
- \item {\ptt FLAT\_SNOC}, 644
- \item {\ptt FOLDL}, 644
- \item {\ptt FOLDL\_APPEND}, 644
- \item {\ptt FOLDL\_CONV}, 196
- \item {\ptt FOLDL\_FILTER}, 644
- \item {\ptt FOLDL\_FOLDR\_REVERSE}, 644
- \item {\ptt FOLDL\_MAP}, 644
- \item {\ptt FOLDL\_REVERSE}, 644
- \item {\ptt FOLDL\_SINGLE}, 644
- \item {\ptt FOLDL\_SNOC}, 645
- \item {\ptt FOLDL\_SNOC\_NIL}, 645
- \item {\ptt FOLDR}, 645
- \item {\ptt FOLDR\_APPEND}, 645
- \item {\ptt FOLDR\_CONS\_NIL}, 645
- \item {\ptt FOLDR\_CONV}, 197
- \item {\ptt FOLDR\_FILTER}, 645
- \item {\ptt FOLDR\_FILTER\_REVERSE}, 645
- \item {\ptt FOLDR\_FOLDL}, 645
- \item {\ptt FOLDR\_FOLDL\_REVERSE}, 645
- \item {\ptt FOLDR\_MAP}, 645
- \item {\ptt FOLDR\_MAP\_REVERSE}, 645
- \item {\ptt FOLDR\_REVERSE}, 645
- \item {\ptt FOLDR\_SINGLE}, 645
- \item {\ptt FOLDR\_SNOC}, 645
- \item {\ptt forall}, 198
- \item {\ptt FORALL\_AND\_CONV}, 199
- \item {\ptt FORALL\_DEF}, 609
- \item {\ptt FORALL\_EQ}, 199
- \item {\ptt FORALL\_IMP\_CONV}, 200
- \item {\ptt FORALL\_NOT\_CONV}, 201
- \item {\ptt FORALL\_OR\_CONV}, 201
- \item {\ptt FORALL\_SIMP}, 612
- \item {\ptt free\_in}, 205
- \item {\ptt frees}, 202
- \item {\ptt freesl}, 203
- \item {\ptt FREEZE\_THEN}, 203
- \item {\ptt FRONT\_CONJ\_CONV}, 205
- \item {\ptt FST}, 617
- \item {\ptt fst}, 206
- \item {\ptt FST\_DEF}, 617
- \item {\ptt FUN\_EQ\_CONV}, 207
- \item {\ptt FUN\_EQ\_LEMMA}, 615, 621
- \item {\ptt funpow}, 206
-
- \indexspace
-
- \item {\ptt g}, 208
- \item {\ptt GEN}, 209
- \item {\ptt GEN\_ALL}, 211
- \item {\ptt GEN\_ALPHA\_CONV}, 212
- \item {\ptt GEN\_BETA\_CONV}, 213
- \item {\ptt GEN\_REWRITE\_CONV}, 214
- \item {\ptt GEN\_REWRITE\_RULE}, 215
- \item {\ptt GEN\_REWRITE\_TAC}, 217
- \item {\ptt GEN\_TAC}, 219
- \item {\ptt GENL}, 210
- \item {\ptt GENLIST}, 646
- \item {\ptt genvar}, 210
- \item {\ptt get\_const\_type}, 220
- \item {\ptt get\_flag\_value}, 221
- \item {\ptt get\_state}, 221
- \item {\ptt get\_steps}, 222
- \item {\ptt get\_type}, 224
- \item {\ptt getenv}, 219
- \item {\ptt goals}, 224
- \item {\ptt GREATER}, 621
- \item {\ptt GREATER\_EQ}, 621
- \item {\ptt GREATER\_OR\_EQ}, 621
- \item {\ptt GSPEC}, 224
- \item {\ptt GSUBST\_TAC}, 225
- \item {\ptt GSYM}, 226
-
- \indexspace
-
- \item {\ptt HALF\_MK\_ABS}, 227
- \item {\ptt HD}, 646
- \item {\ptt hd}, 227
- \item {\ptt help}, 228
- \item {\ptt help\_search\_path}, 228
- \item {\ptt hide\_constant}, 229
- \item {\ptt hol\_pathname}, 229
- \item {\ptt host\_name}, 230
- \item {\ptt HT}, 659
- \item {\ptt hyp}, 231
- \item {\ptt hyp\_union}, 231
-
- \indexspace
-
- \item {\ptt I}, 232
- \item {\ptt I\_DEF}, 616
- \item {\ptt I\_o\_ID}, 616
- \item {\ptt I\_THM}, 616
- \item {\ptt IMP\_ANTISYM\_AX}, 610
- \item {\ptt IMP\_ANTISYM\_RULE}, 233
- \item {\ptt IMP\_CANON}, 234
- \item {\ptt IMP\_CLAUSES}, 613
- \item {\ptt IMP\_CONJ}, 234
- \item {\ptt IMP\_DISJ\_THM}, 613
- \item {\ptt IMP\_ELIM}, 235
- \item {\ptt IMP\_F}, 613
- \item {\ptt IMP\_F\_EQ\_F}, 613
- \item {\ptt IMP\_RES\_TAC}, 236
- \item {\ptt IMP\_RES\_THEN}, 237
- \item {\ptt IMP\_TRANS}, 238
- \item {\ptt implode}, 232
- \item {\ptt INDUCT}, 239
- \item {\ptt INDUCT\_TAC}, 240
- \item {\ptt INDUCT\_THEN}, 240
- \item {\ptt INDUCTION}, 621
- \item {\ptt INFINITY\_AX}, 610
- \item {\ptt infix\_variable}, 243
- \item {\ptt infixes}, 242
- \item {\ptt inject\_input}, 244
- \item {\ptt INL}, 618
- \item {\ptt inl}, 245
- \item {\ptt INL\_DEF}, 618
- \item {\ptt INR}, 618
- \item {\ptt inr}, 245
- \item {\ptt INR\_DEF}, 618
- \item {\ptt INST}, 246
- \item {\ptt inst}, 247
- \item {\ptt inst\_check}, 248
- \item {\ptt inst\_rename\_list}, 249
- \item {\ptt INST\_TY\_TERM}, 252
- \item {\ptt INST\_TYPE}, 250
- \item {\ptt inst\_type}, 251
- \item {\ptt install}, 248
- \item {\ptt int\_of\_string}, 254
- \item {\ptt int\_of\_term}, 254
- \item {\ptt interface\_map}, 252
- \item {\ptt intersect}, 253
- \item {\ptt INV\_PRE\_EQ}, 621
- \item {\ptt INV\_PRE\_LESS}, 621
- \item {\ptt INV\_PRE\_LESS\_EQ}, 621
- \item {\ptt INV\_SUC}, 622
- \item {\ptt INV\_SUC\_EQ}, 622
- \item {\ptt is\_abs}, 256
- \item {\ptt is\_alphanum}, 257
- \item {\ptt IS\_ASSUMPTION\_OF}, 613
- \item {\ptt is\_axiom}, 257
- \item {\ptt is\_binder}, 258
- \item {\ptt is\_binder\_type}, 259
- \item {\ptt is\_comb}, 259
- \item {\ptt is\_cond}, 260
- \item {\ptt is\_conj}, 260
- \item {\ptt is\_cons}, 261
- \item {\ptt is\_const}, 261
- \item {\ptt is\_constant}, 262
- \item {\ptt is\_definition}, 262
- \item {\ptt is\_disj}, 263
- \item {\ptt IS\_EL}, 646
- \item {\ptt IS\_EL\_APPEND}, 646
- \item {\ptt IS\_EL\_BUTFIRSTN}, 646
- \item {\ptt IS\_EL\_BUTLASTN}, 646
- \item {\ptt IS\_EL\_CONV}, 263
- \item {\ptt IS\_EL\_DEF}, 646
- \item {\ptt IS\_EL\_FILTER}, 646
- \item {\ptt IS\_EL\_FIRSTN}, 646
- \item {\ptt IS\_EL\_FOLDL}, 646
- \item {\ptt IS\_EL\_FOLDL\_MAP}, 646
- \item {\ptt IS\_EL\_FOLDR}, 646
- \item {\ptt IS\_EL\_FOLDR\_MAP}, 646
- \item {\ptt IS\_EL\_LASTN}, 646
- \item {\ptt IS\_EL\_REPLICATE}, 646
- \item {\ptt IS\_EL\_REVERSE}, 647
- \item {\ptt IS\_EL\_SEG}, 647
- \item {\ptt IS\_EL\_SNOC}, 647
- \item {\ptt IS\_EL\_SOME\_EL}, 647
- \item {\ptt is\_eq}, 264
- \item {\ptt is\_exists}, 264
- \item {\ptt is\_forall}, 265
- \item {\ptt is\_hidden}, 265
- \item {\ptt is\_imp}, 266
- \item {\ptt is\_infix}, 267
- \item {\ptt is\_infix\_type}, 267
- \item {\ptt is\_let}, 268
- \item {\ptt is\_letter}, 269
- \item {\ptt is\_list}, 269
- \item {\ptt IS\_list\_REP}, 647
- \item {\ptt Is\_ltree}, 659
- \item {\ptt is\_ml\_curried\_infix}, 270
- \item {\ptt is\_ml\_infix}, 270
- \item {\ptt is\_ml\_paired\_infix}, 271
- \item {\ptt is\_neg}, 271
- \item {\ptt is\_neg\_imp}, 272
- \item {\ptt IS\_NUM\_REP}, 622
- \item {\ptt is\_pabs}, 272
- \item {\ptt is\_pair}, 273
- \item {\ptt IS\_PAIR\_DEF}, 617
- \item {\ptt is\_pred}, 273
- \item {\ptt IS\_PREFIX}, 647
- \item {\ptt IS\_PREFIX\_APPEND}, 647
- \item {\ptt IS\_PREFIX\_IS\_SUBLIST}, 647
- \item {\ptt IS\_PREFIX\_PREFIX}, 647
- \item {\ptt IS\_PREFIX\_REVERSE}, 647
- \item {\ptt is\_recording\_proof}, 274
- \item {\ptt is\_select}, 274
- \item {\ptt IS\_SUBLIST}, 647
- \item {\ptt IS\_SUBLIST\_APPEND}, 647
- \item {\ptt IS\_SUBLIST\_REVERSE}, 647
- \item {\ptt IS\_SUFFIX}, 648
- \item {\ptt IS\_SUFFIX\_APPEND}, 648
- \item {\ptt IS\_SUFFIX\_IS\_SUBLIST}, 648
- \item {\ptt IS\_SUFFIX\_REVERSE}, 648
- \item {\ptt IS\_SUM\_REP}, 618
- \item {\ptt Is\_tree\_REP}, 659
- \item {\ptt is\_type}, 275
- \item {\ptt is\_var}, 275
- \item {\ptt is\_vartype}, 276
- \item {\ptt ISL}, 618
- \item {\ptt isl}, 255
- \item {\ptt ISL\_OR\_ISR}, 618
- \item {\ptt ISPEC}, 255
- \item {\ptt ISPECL}, 256
- \item {\ptt ISR}, 618
- \item {\ptt it}, 276
- \item {\ptt itlist}, 277
- \item {\ptt itlist2}, 278
-
- \indexspace
-
- \item {\ptt K}, 278
- \item {\ptt K\_DEF}, 616
- \item {\ptt K\_THM}, 616
- \item {\ptt KI}, 279
-
- \indexspace
-
- \item {\ptt LAST}, 648
- \item {\ptt last}, 279
- \item {\ptt LAST\_CONV}, 280
- \item {\ptt LAST\_DEF}, 649
- \item {\ptt LAST\_LASTN\_LAST}, 649
- \item {\ptt LASTN}, 648
- \item {\ptt LASTN\_1}, 648
- \item {\ptt LASTN\_APPEND1}, 648
- \item {\ptt LASTN\_APPEND2}, 648
- \item {\ptt LASTN\_BUTFIRSTN}, 648
- \item {\ptt LASTN\_BUTLASTN}, 648
- \item {\ptt LASTN\_CONS}, 648
- \item {\ptt LASTN\_CONV}, 280
- \item {\ptt LASTN\_LASTN}, 648
- \item {\ptt LASTN\_LENGTH\_APPEND}, 649
- \item {\ptt LASTN\_LENGTH\_ID}, 649
- \item {\ptt LASTN\_MAP}, 649
- \item {\ptt LASTN\_REVERSE}, 649
- \item {\ptt LASTN\_SEG}, 649
- \item {\ptt LEFT\_ADD\_DISTRIB}, 622
- \item {\ptt LEFT\_AND\_EXISTS\_CONV}, 281
- \item {\ptt LEFT\_AND\_FORALL\_CONV}, 281
- \item {\ptt LEFT\_AND\_OVER\_OR}, 613
- \item {\ptt LEFT\_ID\_ADD\_0}, 622
- \item {\ptt LEFT\_ID\_DEF}, 615
- \item {\ptt LEFT\_ID\_MULT\_1}, 622
- \item {\ptt LEFT\_IMP\_EXISTS\_CONV}, 282
- \item {\ptt LEFT\_IMP\_FORALL\_CONV}, 282
- \item {\ptt LEFT\_OR\_EXISTS\_CONV}, 283
- \item {\ptt LEFT\_OR\_FORALL\_CONV}, 283
- \item {\ptt LEFT\_OR\_OVER\_AND}, 613
- \item {\ptt LEFT\_SUB\_DISTRIB}, 622
- \item {\ptt LENGTH}, 649
- \item {\ptt length}, 284
- \item {\ptt LENGTH\_APPEND}, 649
- \item {\ptt LENGTH\_BUTFIRSTN}, 649
- \item {\ptt LENGTH\_BUTLAST}, 649
- \item {\ptt LENGTH\_BUTLASTN}, 649
- \item {\ptt LENGTH\_CONS}, 649
- \item {\ptt LENGTH\_CONV}, 284
- \item {\ptt LENGTH\_EQ}, 649
- \item {\ptt LENGTH\_EQ\_CONS}, 649
- \item {\ptt LENGTH\_EQ\_NIL}, 650
- \item {\ptt LENGTH\_FIRSTN}, 650
- \item {\ptt LENGTH\_FLAT}, 650
- \item {\ptt LENGTH\_FOLDL}, 650
- \item {\ptt LENGTH\_FOLDR}, 650
- \item {\ptt LENGTH\_GENLIST}, 650
- \item {\ptt LENGTH\_LASTN}, 650
- \item {\ptt LENGTH\_MAP}, 650
- \item {\ptt LENGTH\_MAP2}, 650
- \item {\ptt LENGTH\_NIL}, 650
- \item {\ptt LENGTH\_NOT\_NULL}, 650
- \item {\ptt LENGTH\_REPLICATE}, 650
- \item {\ptt LENGTH\_REVERSE}, 650
- \item {\ptt LENGTH\_SCANL}, 650
- \item {\ptt LENGTH\_SCANR}, 651
- \item {\ptt LENGTH\_SEG}, 651
- \item {\ptt LENGTH\_SNOC}, 651
- \item {\ptt LENGTH\_UNZIP\_FST}, 651
- \item {\ptt LENGTH\_UNZIP\_SND}, 651
- \item {\ptt LENGTH\_ZIP}, 651
- \item {\ptt LESS}, 622
- \item {\ptt LESS\_0}, 622
- \item {\ptt LESS\_0\_0}, 622
- \item {\ptt LESS\_0\_CASES}, 622
- \item {\ptt LESS\_ADD}, 622
- \item {\ptt LESS\_ADD\_1}, 622
- \item {\ptt LESS\_ADD\_NONZERO}, 622
- \item {\ptt LESS\_ADD\_SUC}, 622
- \item {\ptt LESS\_ANTISYM}, 623
- \item {\ptt LESS\_CASES}, 623
- \item {\ptt LESS\_CASES\_IMP}, 623
- \item {\ptt LESS\_EQ}, 623
- \item {\ptt LESS\_EQ\_0}, 623
- \item {\ptt LESS\_EQ\_ADD}, 623
- \item {\ptt LESS\_EQ\_ADD\_SUB}, 623
- \item {\ptt LESS\_EQ\_ANTISYM}, 623
- \item {\ptt LESS\_EQ\_CASES}, 623
- \item {\ptt LESS\_EQ\_EXISTS}, 623
- \item {\ptt LESS\_EQ\_IMP\_LESS\_SUC}, 623
- \item {\ptt LESS\_EQ\_LESS\_EQ\_MONO}, 623
- \item {\ptt LESS\_EQ\_LESS\_TRANS}, 623
- \item {\ptt LESS\_EQ\_MONO}, 623
- \item {\ptt LESS\_EQ\_MONO\_ADD\_EQ}, 624
- \item {\ptt LESS\_EQ\_REFL}, 624
- \item {\ptt LESS\_EQ\_SUB\_LESS}, 624
- \item {\ptt LESS\_EQ\_SUC\_REFL}, 624
- \item {\ptt LESS\_EQ\_TRANS}, 624
- \item {\ptt LESS\_EQUAL\_ADD}, 623
- \item {\ptt LESS\_EQUAL\_ANTISYM}, 623
- \item {\ptt LESS\_EXP\_SUC\_MONO}, 624
- \item {\ptt LESS\_IMP\_LESS\_ADD}, 624
- \item {\ptt LESS\_IMP\_LESS\_OR\_EQ}, 624
- \item {\ptt LESS\_LEMMA1}, 624
- \item {\ptt LESS\_LEMMA2}, 624
- \item {\ptt LESS\_LESS\_CASES}, 624
- \item {\ptt LESS\_LESS\_EQ\_TRANS}, 624
- \item {\ptt LESS\_LESS\_SUC}, 624
- \item {\ptt LESS\_MOD}, 624
- \item {\ptt LESS\_MONO}, 624
- \item {\ptt LESS\_MONO\_ADD}, 624
- \item {\ptt LESS\_MONO\_ADD\_EQ}, 625
- \item {\ptt LESS\_MONO\_ADD\_INV}, 625
- \item {\ptt LESS\_MONO\_EQ}, 625
- \item {\ptt LESS\_MONO\_MULT}, 625
- \item {\ptt LESS\_MONO\_REV}, 625
- \item {\ptt LESS\_MULT2}, 625
- \item {\ptt LESS\_MULT\_MONO}, 625
- \item {\ptt LESS\_NOT\_EQ}, 625
- \item {\ptt LESS\_NOT\_SUC}, 625
- \item {\ptt LESS\_OR}, 625
- \item {\ptt LESS\_OR\_EQ}, 625
- \item {\ptt LESS\_OR\_EQ\_ADD}, 625
- \item {\ptt LESS\_REFL}, 625
- \item {\ptt LESS\_SUB\_ADD\_LESS}, 625
- \item {\ptt LESS\_SUC}, 625
- \item {\ptt LESS\_SUC\_EQ\_COR}, 625
- \item {\ptt LESS\_SUC\_IMP}, 626
- \item {\ptt LESS\_SUC\_NOT}, 626
- \item {\ptt LESS\_SUC\_REFL}, 626
- \item {\ptt LESS\_SUC\_SUC}, 626
- \item {\ptt LESS\_THM}, 626
- \item {\ptt LESS\_TRANS}, 626
- \item {\ptt let\_after}, 285
- \item {\ptt let\_before}, 286
- \item {\ptt let\_CONV}, 287
- \item {\ptt LET\_DEF}, 610
- \item {\ptt lhs}, 289
- \item {\ptt libraries}, 290
- \item {\ptt library\_loader}, 290
- \item {\ptt library\_pathname}, 292
- \item {\ptt library\_search\_path}, 293
- \item {\ptt link}, 294
- \item {\ptt lisp}, 294
- \item {\ptt lisp\_dir\_pathname}, 295
- \item {\ptt list\_Axiom}, 651
- \item {\ptt LIST\_BETA\_CONV}, 296
- \item {\ptt list\_CASES}, 651
- \item {\ptt LIST\_CONJ}, 297
- \item {\ptt list\_EQ\_CONV}, 297
- \item {\ptt list\_FOLD\_CONV}, 298
- \item {\ptt LIST\_INDUCT}, 299
- \item {\ptt list\_INDUCT}, 651
- \item {\ptt LIST\_INDUCT\_TAC}, 300
- \item {\ptt list\_ISO\_DEF}, 651
- \item {\ptt list\_mk\_abs}, 301
- \item {\ptt list\_mk\_comb}, 301
- \item {\ptt list\_mk\_conj}, 302
- \item {\ptt list\_mk\_disj}, 303
- \item {\ptt LIST\_MK\_EXISTS}, 304
- \item {\ptt list\_mk\_exists}, 304
- \item {\ptt list\_mk\_forall}, 305
- \item {\ptt list\_mk\_imp}, 305
- \item {\ptt list\_mk\_pair}, 306
- \item {\ptt LIST\_MP}, 307
- \item {\ptt LIST\_NOT\_EQ}, 651
- \item {\ptt list\_of\_binders}, 307
- \item {\ptt list\_TY\_DEF}, 651
- \item {\ptt load}, 308
- \item {\ptt load\_axiom}, 310
- \item {\ptt load\_axioms}, 311
- \item {\ptt load\_definition}, 312
- \item {\ptt load\_definitions}, 313
- \item {\ptt load\_library}, 314
- \item {\ptt load\_theorem}, 315
- \item {\ptt load\_theorems}, 316
- \item {\ptt load\_theory}, 317
- \item {\ptt loadf}, 308
- \item {\ptt loadt}, 309
- \item {\ptt lookup\_form\_rep}, 318
- \item {\ptt lookup\_term}, 318
- \item {\ptt lookup\_term\_rep}, 318
- \item {\ptt lsp}, 319
- \item {\ptt ltree\_Axiom}, 659
- \item {\ptt ltree\_Induct}, 659
- \item {\ptt ltree\_ISO\_DEF}, 659
- \item {\ptt ltree\_TY\_DEF}, 660
-
- \indexspace
-
- \item {\ptt MAP}, 651
- \item {\ptt map}, 320
- \item {\ptt MAP2}, 651
- \item {\ptt map2}, 320
- \item {\ptt MAP2\_CONV}, 321
- \item {\ptt MAP2\_ZIP}, 652
- \item {\ptt MAP\_APPEND}, 652
- \item {\ptt MAP\_CONV}, 323
- \item {\ptt MAP\_EVERY}, 324
- \item {\ptt MAP\_FILTER}, 652
- \item {\ptt MAP\_FIRST}, 325
- \item {\ptt MAP\_FLAT}, 652
- \item {\ptt MAP\_FOLDL}, 652
- \item {\ptt MAP\_FOLDR}, 652
- \item {\ptt MAP\_MAP\_o}, 652
- \item {\ptt MAP\_o}, 652
- \item {\ptt MAP\_REVERSE}, 652
- \item {\ptt MAP\_SNOC}, 652
- \item {\ptt mapfilter}, 322
- \item {\ptt maptok}, 322
- \item {\ptt match}, 326
- \item {\ptt MATCH\_ACCEPT\_TAC}, 327
- \item {\ptt MATCH\_MP}, 328
- \item {\ptt MATCH\_MP\_TAC}, 329
- \item {\ptt max\_print\_depth}, 330
- \item {\ptt mem}, 331
- \item {\ptt merge\_nets\_rep}, 331
- \item {\ptt merge\_term\_nets}, 332
- \item {\ptt message}, 332
- \item {\ptt MK\_ABS}, 333
- \item {\ptt mk\_abs}, 333
- \item {\ptt MK\_COMB}, 334
- \item {\ptt mk\_comb}, 334
- \item {\ptt mk\_cond}, 335
- \item {\ptt mk\_conj}, 335
- \item {\ptt mk\_cons}, 336
- \item {\ptt mk\_const}, 336
- \item {\ptt mk\_conv\_net}, 337
- \item {\ptt mk\_definition}, 337
- \item {\ptt mk\_disj}, 337
- \item {\ptt mk\_eq}, 338
- \item {\ptt MK\_EXISTS}, 338
- \item {\ptt mk\_exists}, 339
- \item {\ptt mk\_forall}, 339
- \item {\ptt mk\_form}, 340
- \item {\ptt mk\_imp}, 340
- \item {\ptt mk\_let}, 340
- \item {\ptt mk\_list}, 341
- \item {\ptt mk\_neg}, 342
- \item {\ptt mk\_pabs}, 342
- \item {\ptt mk\_pair}, 342
- \item {\ptt mk\_pp\_thm}, 343
- \item {\ptt mk\_pred}, 343
- \item {\ptt mk\_primed\_var}, 344
- \item {\ptt mk\_select}, 345
- \item {\ptt mk\_thm}, 345
- \item {\ptt mk\_type}, 346
- \item {\ptt mk\_var}, 347
- \item {\ptt mk\_vartype}, 347
- \item {\ptt ml\_curried\_infix}, 348
- \item {\ptt ml\_dir\_pathname}, 349
- \item {\ptt ML\_eval}, 349
- \item {\ptt ml\_paired\_infix}, 350
- \item {\ptt MOD\_EQ\_0}, 626
- \item {\ptt MOD\_MOD}, 626
- \item {\ptt MOD\_MULT}, 626
- \item {\ptt MOD\_ONE}, 626
- \item {\ptt MOD\_PLUS}, 626
- \item {\ptt MOD\_TIMES}, 626
- \item {\ptt MOD\_UNIQUE}, 626
- \item {\ptt MONOID\_ADD\_0}, 626
- \item {\ptt MONOID\_APPEND\_NIL}, 652
- \item {\ptt MONOID\_CONJ\_T}, 615
- \item {\ptt MONOID\_DEF}, 615
- \item {\ptt MONOID\_DISJ\_F}, 615
- \item {\ptt MONOID\_MULT\_1}, 626
- \item {\ptt MP}, 351
- \item {\ptt MP\_TAC}, 351
- \item {\ptt MULT}, 626
- \item {\ptt MULT\_0}, 627
- \item {\ptt MULT\_ASSOC}, 627
- \item {\ptt MULT\_CLAUSES}, 627
- \item {\ptt MULT\_EQ\_0}, 627
- \item {\ptt MULT\_EXP\_MONO}, 627
- \item {\ptt MULT\_LEFT\_1}, 627
- \item {\ptt MULT\_LESS\_EQ\_SUC}, 627
- \item {\ptt MULT\_MONO\_EQ}, 627
- \item {\ptt MULT\_RIGHT\_1}, 627
- \item {\ptt MULT\_SUC}, 627
- \item {\ptt MULT\_SUC\_EQ}, 627
- \item {\ptt MULT\_SYM}, 627
-
- \indexspace
-
- \item {\ptt n\_strip\_quant}, 391
- \item {\ptt NEG\_DISCH}, 352
- \item {\ptt new\_alphanum}, 353
- \item {\ptt new\_axiom}, 354
- \item {\ptt new\_binder}, 355
- \item {\ptt new\_binder\_definition}, 355
- \item {\ptt new\_constant}, 357
- \item {\ptt new\_definition}, 358
- \item {\ptt new\_flag}, 359
- \item {\ptt new\_gen\_definition}, 360
- \item {\ptt new\_infix}, 361
- \item {\ptt new\_infix\_definition}, 362
- \item {\ptt new\_infix\_list\_rec\_definition}, 363
- \item {\ptt new\_infix\_prim\_rec\_definition}, 365
- \item {\ptt new\_letter}, 367
- \item {\ptt new\_list\_rec\_definition}, 367
- \item {\ptt new\_open\_axiom}, 369
- \item {\ptt new\_parent}, 369
- \item {\ptt new\_predicate}, 370
- \item {\ptt new\_prim\_rec\_definition}, 371
- \item {\ptt new\_recursive\_definition}, 372
- \item {\ptt new\_special\_symbol}, 375
- \item {\ptt new\_specification}, 376
- \item {\ptt new\_stack}, 377
- \item {\ptt new\_syntax\_block}, 378
- \item {\ptt new\_theory}, 379
- \item {\ptt new\_type}, 380
- \item {\ptt new\_type\_abbrev}, 381
- \item {\ptt new\_type\_definition}, 382
- \item {\ptt NIL\_DEF}, 652
- \item {\ptt nil\_term\_net}, 383
- \item {\ptt NO\_CONV}, 388
- \item {\ptt NO\_TAC}, 388
- \item {\ptt NO\_THEN}, 388
- \item {\ptt Node}, 660
- \item {\ptt node}, 660
- \item {\ptt Node\_11}, 660
- \item {\ptt node\_11}, 660
- \item {\ptt Node\_onto}, 660
- \item {\ptt node\_REP}, 660
- \item {\ptt not}, 384
- \item {\ptt NOT\_ALL\_EL\_SOME\_EL}, 652
- \item {\ptt NOT\_AND}, 613
- \item {\ptt NOT\_CLAUSES}, 613
- \item {\ptt NOT\_CONS\_NIL}, 652
- \item {\ptt NOT\_DEF}, 609
- \item {\ptt NOT\_ELIM}, 384
- \item {\ptt NOT\_EQ\_LIST}, 652
- \item {\ptt NOT\_EQ\_SYM}, 385
- \item {\ptt NOT\_EXISTS\_CONV}, 385
- \item {\ptt NOT\_EXP\_0}, 627
- \item {\ptt NOT\_F}, 613
- \item {\ptt NOT\_FORALL\_CONV}, 386
- \item {\ptt NOT\_GREATER}, 627
- \item {\ptt NOT\_GREATER\_EQ}, 628
- \item {\ptt NOT\_IMP}, 613
- \item {\ptt NOT\_INTRO}, 386
- \item {\ptt NOT\_LEQ}, 628
- \item {\ptt NOT\_LESS}, 628
- \item {\ptt NOT\_LESS\_0}, 628
- \item {\ptt NOT\_LESS\_EQ}, 628
- \item {\ptt NOT\_LESS\_EQUAL}, 628
- \item {\ptt NOT\_MP}, 387
- \item {\ptt NOT\_NIL\_CONS}, 653
- \item {\ptt NOT\_NIL\_SNOC}, 653
- \item {\ptt NOT\_NUM\_EQ}, 628
- \item {\ptt NOT\_ODD\_EQ\_EVEN}, 628
- \item {\ptt NOT\_SNOC\_NIL}, 653
- \item {\ptt NOT\_SOME\_EL\_ALL\_EL}, 653
- \item {\ptt NOT\_SUC}, 628
- \item {\ptt NOT\_SUC\_ADD\_LESS\_EQ}, 628
- \item {\ptt NOT\_SUC\_LESS\_EQ}, 628
- \item {\ptt NOT\_SUC\_LESS\_EQ\_0}, 628
- \item {\ptt NULL}, 653
- \item {\ptt null}, 389
- \item {\ptt NULL\_DEF}, 653
- \item {\ptt NULL\_EQ\_NIL}, 653
- \item {\ptt NULL\_FOLDL}, 653
- \item {\ptt NULL\_FOLDR}, 653
- \item {\ptt num\_Axiom}, 628
- \item {\ptt num\_CASES}, 628
- \item {\ptt num\_CONV}, 389
- \item {\ptt num\_EQ\_CONV}, 390
- \item {\ptt num\_ISO\_DEF}, 628
- \item {\ptt num\_TY\_DEF}, 629
-
- \indexspace
-
- \item {\ptt o}, 391
- \item {\ptt o\_ASSOC}, 616
- \item {\ptt o\_DEF}, 616
- \item {\ptt o\_THM}, 616
- \item {\ptt ODD}, 629
- \item {\ptt ODD\_ADD}, 629
- \item {\ptt ODD\_DOUBLE}, 629
- \item {\ptt ODD\_EVEN}, 629
- \item {\ptt ODD\_EXISTS}, 629
- \item {\ptt ODD\_MULT}, 629
- \item {\ptt ODD\_OR\_EVEN}, 629
- \item {\ptt ONCE\_ASM\_REWRITE\_RULE}, 392
- \item {\ptt ONCE\_ASM\_REWRITE\_TAC}, 392
- \item {\ptt ONCE\_DEPTH\_CONV}, 393
- \item {\ptt ONCE\_REW\_DEPTH\_CONV}, 397
- \item {\ptt ONCE\_REWRITE\_CONV}, 395
- \item {\ptt ONCE\_REWRITE\_RULE}, 395
- \item {\ptt ONCE\_REWRITE\_TAC}, 396
- \item {\ptt one}, 615
- \item {\ptt one\_Axiom}, 615
- \item {\ptt one\_axiom}, 616
- \item {\ptt one\_DEF}, 616
- \item {\ptt ONE\_ONE\_DEF}, 615
- \item {\ptt one\_TY\_DEF}, 616
- \item {\ptt ONTO\_DEF}, 615
- \item {\ptt oo}, 399
- \item {\ptt openi}, 399
- \item {\ptt openw}, 399
- \item {\ptt OR\_CLAUSES}, 613
- \item {\ptt OR\_DEF}, 609
- \item {\ptt OR\_EL\_DEF}, 653
- \item {\ptt OR\_EL\_FOLDL}, 653
- \item {\ptt OR\_EL\_FOLDR}, 653
- \item {\ptt OR\_ELIM\_THM}, 614
- \item {\ptt OR\_EXISTS\_CONV}, 402
- \item {\ptt OR\_FORALL\_CONV}, 402
- \item {\ptt OR\_IMP\_THM}, 614
- \item {\ptt OR\_INTRO\_THM1}, 614
- \item {\ptt OR\_INTRO\_THM2}, 614
- \item {\ptt OR\_LESS}, 629
- \item {\ptt ORELSE}, 400
- \item {\ptt ORELSE\_TCL}, 401
- \item {\ptt ORELSEC}, 401
- \item {\ptt OUTL}, 618
- \item {\ptt outl}, 403
- \item {\ptt OUTR}, 618
- \item {\ptt outr}, 403
-
- \indexspace
-
- \item {\ptt p}, 404
- \item {\ptt PAIR}, 617
- \item {\ptt pair}, 405
- \item {\ptt PAIR\_EQ}, 617
- \item {\ptt PAIR\_EXISTS}, 617
- \item {\ptt PAIRED\_BETA\_CONV}, 405
- \item {\ptt paired\_delete\_thm}, 407
- \item {\ptt PAIRED\_ETA\_CONV}, 407
- \item {\ptt paired\_new\_type}, 408
- \item {\ptt paired\_theorem}, 408
- \item {\ptt parents}, 409
- \item {\ptt parse\_as\_binder}, 410
- \item {\ptt PART}, 653, 660
- \item {\ptt PART\_MATCH}, 412
- \item {\ptt partition}, 411
- \item {\ptt POP\_ASSUM}, 413
- \item {\ptt POP\_ASSUM\_LIST}, 414
- \item {\ptt pop\_proofs}, 415
- \item {\ptt pop\_proofs\_print}, 416
- \item {\ptt pp\_axiom}, 416
- \item {\ptt PRE}, 629
- \item {\ptt PRE\_DEF}, 629
- \item {\ptt PRE\_SUB}, 629
- \item {\ptt PRE\_SUB1}, 629
- \item {\ptt PRE\_SUC\_EQ}, 629
- \item {\ptt PREFIX}, 653
- \item {\ptt PREFIX\_DEF}, 653
- \item {\ptt PREFIX\_FOLDR}, 654
- \item {\ptt preterm\_abs}, 416
- \item {\ptt preterm\_antiquot}, 417
- \item {\ptt preterm\_comb}, 418
- \item {\ptt preterm\_const}, 419
- \item {\ptt preterm\_to\_term}, 419
- \item {\ptt preterm\_typed}, 420
- \item {\ptt preterm\_var}, 421
- \item {\ptt PRIM\_REC}, 629
- \item {\ptt PRIM\_REC\_EQN}, 630
- \item {\ptt PRIM\_REC\_FUN}, 630
- \item {\ptt PRIM\_REC\_THM}, 630
- \item {\ptt print\_all\_thm}, 422
- \item {\ptt print\_begin}, 423
- \item {\ptt print\_bool}, 425
- \item {\ptt print\_break}, 425
- \item {\ptt print\_defined\_types}, 427
- \item {\ptt print\_end}, 427
- \item {\ptt print\_goal}, 428
- \item {\ptt print\_hyps}, 429
- \item {\ptt print\_ibegin}, 429
- \item {\ptt print\_int}, 430
- \item {\ptt print\_list}, 431
- \item {\ptt print\_newline}, 432
- \item {\ptt print\_stack}, 433
- \item {\ptt print\_state}, 433
- \item {\ptt print\_string}, 435
- \item {\ptt print\_subgoals}, 435
- \item {\ptt print\_term}, 435
- \item {\ptt print\_theory}, 436
- \item {\ptt print\_thm}, 437
- \item {\ptt print\_tok}, 437
- \item {\ptt print\_type}, 438
- \item {\ptt print\_unquoted\_term}, 439
- \item {\ptt print\_unquoted\_type}, 439
- \item {\ptt print\_void}, 440
- \item {\ptt prod\_TY\_DEF}, 617
- \item {\ptt prompt}, 441
- \item {\ptt PROVE}, 441
- \item {\ptt prove}, 442
- \item {\ptt prove\_abs\_fn\_one\_one}, 442
- \item {\ptt prove\_abs\_fn\_onto}, 443
- \item {\ptt prove\_cases\_thm}, 443
- \item {\ptt prove\_constructors\_distinct}, 444
- \item {\ptt prove\_constructors\_one\_one}, 445
- \item {\ptt PROVE\_HYP}, 446
- \item {\ptt prove\_induction\_thm}, 447
- \item {\ptt prove\_rec\_fn\_exists}, 448
- \item {\ptt prove\_rep\_fn\_one\_one}, 449
- \item {\ptt prove\_rep\_fn\_onto}, 449
- \item {\ptt prove\_thm}, 450
- \item {\ptt PURE\_ASM\_REWRITE\_RULE}, 451
- \item {\ptt PURE\_ASM\_REWRITE\_TAC}, 451
- \item {\ptt PURE\_ONCE\_ASM\_REWRITE\_RULE}, 452
- \item {\ptt PURE\_ONCE\_ASM\_REWRITE\_TAC}, 452
- \item {\ptt PURE\_ONCE\_REWRITE\_CONV}, 453
- \item {\ptt PURE\_ONCE\_REWRITE\_RULE}, 454
- \item {\ptt PURE\_ONCE\_REWRITE\_TAC}, 454
- \item {\ptt PURE\_REWRITE\_CONV}, 455
- \item {\ptt PURE\_REWRITE\_RULE}, 455
- \item {\ptt PURE\_REWRITE\_TAC}, 456
- \item {\ptt push\_fsubgoals}, 457
- \item {\ptt push\_print}, 457
- \item {\ptt push\_subgoals}, 458
-
- \indexspace
-
- \item {\ptt quit}, 458
-
- \indexspace
-
- \item {\ptt r}, 458
- \item {\ptt rand}, 459
- \item {\ptt RAND\_CONV}, 459
- \item {\ptt rator}, 460
- \item {\ptt RATOR\_CONV}, 460
- \item {\ptt read}, 461
- \item {\ptt record\_proof}, 463
- \item {\ptt RecordStep}, 462
- \item {\ptt REDEPTH\_CONV}, 464
- \item {\ptt REFL}, 466
- \item {\ptt REFL\_CLAUSE}, 614
- \item {\ptt REFL\_TAC}, 466
- \item {\ptt remove}, 467
- \item {\ptt remove\_sticky\_type}, 467
- \item {\ptt rep\_goals}, 470
- \item {\ptt REP\_prod}, 617
- \item {\ptt REPEAT}, 468
- \item {\ptt REPEAT\_GTCL}, 469
- \item {\ptt REPEAT\_TCL}, 469
- \item {\ptt REPEATC}, 468
- \item {\ptt REPLICATE}, 654
- \item {\ptt replicate}, 470
- \item {\ptt RES\_ABSTRACT}, 610
- \item {\ptt RES\_CANON}, 471
- \item {\ptt RES\_EXISTS}, 610
- \item {\ptt RES\_FORALL}, 610
- \item {\ptt RES\_SELECT}, 610
- \item {\ptt RES\_TAC}, 474
- \item {\ptt RES\_THEN}, 475
- \item {\ptt resume\_recording}, 471
- \item {\ptt rev}, 477
- \item {\ptt rev\_assoc}, 478
- \item {\ptt rev\_itlist}, 478
- \item {\ptt REVERSE}, 654
- \item {\ptt REVERSE\_APPEND}, 654
- \item {\ptt REVERSE\_CONV}, 477
- \item {\ptt REVERSE\_EQ\_NIL}, 654
- \item {\ptt REVERSE\_FLAT}, 654
- \item {\ptt REVERSE\_FOLDL}, 654
- \item {\ptt REVERSE\_FOLDR}, 654
- \item {\ptt REVERSE\_REVERSE}, 654
- \item {\ptt REVERSE\_SNOC}, 654
- \item {\ptt REW\_DEPTH\_CONV}, 485
- \item {\ptt REWR\_CONV}, 482
- \item {\ptt REWRITE\_CONV}, 479
- \item {\ptt REWRITE\_RULE}, 480
- \item {\ptt REWRITE\_TAC}, 481
- \item {\ptt rhs}, 487
- \item {\ptt RIGHT\_ADD\_DISTRIB}, 630
- \item {\ptt RIGHT\_AND\_EXISTS\_CONV}, 487
- \item {\ptt RIGHT\_AND\_FORALL\_CONV}, 488
- \item {\ptt RIGHT\_AND\_OVER\_OR}, 614
- \item {\ptt RIGHT\_BETA}, 488
- \item {\ptt RIGHT\_CONV\_RULE}, 489
- \item {\ptt RIGHT\_ID\_ADD\_0}, 630
- \item {\ptt RIGHT\_ID\_DEF}, 615
- \item {\ptt RIGHT\_ID\_MULT\_1}, 630
- \item {\ptt RIGHT\_IMP\_EXISTS\_CONV}, 490
- \item {\ptt RIGHT\_IMP\_FORALL\_CONV}, 490
- \item {\ptt RIGHT\_LIST\_BETA}, 491
- \item {\ptt RIGHT\_OR\_EXISTS\_CONV}, 491
- \item {\ptt RIGHT\_OR\_FORALL\_CONV}, 492
- \item {\ptt RIGHT\_OR\_OVER\_AND}, 614
- \item {\ptt RIGHT\_SUB\_DISTRIB}, 630
- \item {\ptt root\_goal}, 492
- \item {\ptt rotate}, 493
- \item {\ptt rotate\_goals}, 494
- \item {\ptt rotate\_top}, 495
- \item {\ptt RULE\_ASSUM\_TAC}, 495
-
- \indexspace
-
- \item {\ptt S}, 496
- \item {\ptt S\_DEF}, 616
- \item {\ptt S\_THM}, 616
- \item {\ptt save}, 496
- \item {\ptt save\_thm}, 497
- \item {\ptt save\_top\_thm}, 498
- \item {\ptt SCANL}, 654
- \item {\ptt SCANL\_CONV}, 499
- \item {\ptt SCANR}, 654
- \item {\ptt SCANR\_CONV}, 500
- \item {\ptt search\_path}, 501
- \item {\ptt SEG}, 654
- \item {\ptt SEG\_0\_SNOC}, 654
- \item {\ptt SEG\_APPEND}, 655
- \item {\ptt SEG\_APPEND1}, 655
- \item {\ptt SEG\_APPEND2}, 655
- \item {\ptt SEG\_CONV}, 502
- \item {\ptt SEG\_FIRSTN\_BUTFISTN}, 655
- \item {\ptt SEG\_LASTN\_BUTLASTN}, 655
- \item {\ptt SEG\_LENGTH\_ID}, 655
- \item {\ptt SEG\_LENGTH\_SNOC}, 655
- \item {\ptt SEG\_REVERSE}, 655
- \item {\ptt SEG\_SEG}, 655
- \item {\ptt SEG\_SNOC}, 655
- \item {\ptt SEG\_SUC\_CONS}, 655
- \item {\ptt SELECT\_AX}, 610
- \item {\ptt SELECT\_CONV}, 503
- \item {\ptt SELECT\_ELIM}, 504
- \item {\ptt SELECT\_EQ}, 505
- \item {\ptt SELECT\_INTRO}, 506
- \item {\ptt SELECT\_REFL}, 614
- \item {\ptt SELECT\_RULE}, 507
- \item {\ptt SELECT\_UNIQUE}, 614
- \item {\ptt set\_equal}, 509
- \item {\ptt set\_fail}, 509
- \item {\ptt set\_fail\_prefix}, 510
- \item {\ptt set\_flag}, 511
- \item {\ptt set\_goal}, 512
- \item {\ptt set\_help}, 513
- \item {\ptt set\_help\_search\_path}, 514
- \item {\ptt set\_interface\_map}, 514
- \item {\ptt set\_lambda}, 515
- \item {\ptt set\_library\_search\_path}, 516
- \item {\ptt set\_margin}, 517
- \item {\ptt set\_pretty\_mode}, 517
- \item {\ptt set\_prompt}, 518
- \item {\ptt set\_search\_path}, 519
- \item {\ptt set\_state}, 520
- \item {\ptt set\_sticky\_type}, 521
- \item {\ptt set\_string\_escape}, 522
- \item {\ptt set\_thm\_count}, 523
- \item {\ptt set\_turnstile}, 523
- \item {\ptt setify}, 508
- \item {\ptt show\_types}, 524
- \item {\ptt SIMP\_REC}, 630
- \item {\ptt SIMP\_REC\_EXISTS}, 630
- \item {\ptt SIMP\_REC\_FUN}, 630
- \item {\ptt SIMP\_REC\_FUN\_LEMMA}, 630
- \item {\ptt SIMP\_REC\_REL}, 630
- \item {\ptt SIMP\_REC\_THM}, 631
- \item {\ptt Size}, 660
- \item {\ptt SKOLEM\_CONV}, 525
- \item {\ptt SND}, 617
- \item {\ptt snd}, 526
- \item {\ptt SND\_DEF}, 617
- \item {\ptt SNOC}, 656
- \item {\ptt SNOC\_11}, 656
- \item {\ptt SNOC\_APPEND}, 656
- \item {\ptt SNOC\_Axiom}, 656
- \item {\ptt SNOC\_CASES}, 656
- \item {\ptt SNOC\_CONV}, 526
- \item {\ptt SNOC\_EQ\_LENGTH\_EQ}, 656
- \item {\ptt SNOC\_FOLDR}, 656
- \item {\ptt SNOC\_INDUCT}, 656
- \item {\ptt SNOC\_INDUCT\_TAC}, 527
- \item {\ptt SNOC\_REVERSE\_CONS}, 656
- \item {\ptt SOME\_EL}, 656
- \item {\ptt SOME\_EL\_APPEND}, 656
- \item {\ptt SOME\_EL\_BUTFIRSTN}, 656
- \item {\ptt SOME\_EL\_BUTLASTN}, 656
- \item {\ptt SOME\_EL\_CONV}, 528
- \item {\ptt SOME\_EL\_DISJ}, 656
- \item {\ptt SOME\_EL\_FIRSTN}, 657
- \item {\ptt SOME\_EL\_FOLDL}, 657
- \item {\ptt SOME\_EL\_FOLDL\_MAP}, 657
- \item {\ptt SOME\_EL\_FOLDR}, 657
- \item {\ptt SOME\_EL\_FOLDR\_MAP}, 657
- \item {\ptt SOME\_EL\_LASTN}, 657
- \item {\ptt SOME\_EL\_MAP}, 657
- \item {\ptt SOME\_EL\_REVERSE}, 657
- \item {\ptt SOME\_EL\_SEG}, 657
- \item {\ptt SOME\_EL\_SNOC}, 657
- \item {\ptt sort}, 529
- \item {\ptt SPEC}, 530
- \item {\ptt SPEC\_ALL}, 532
- \item {\ptt SPEC\_TAC}, 533
- \item {\ptt SPEC\_VAR}, 534
- \item {\ptt special\_symbols}, 531
- \item {\ptt SPECL}, 531
- \item {\ptt SPLIT}, 657, 660
- \item {\ptt split}, 534
- \item {\ptt SPLITP}, 657
- \item {\ptt splitp}, 535
- \item {\ptt sticky\_list}, 535
- \item {\ptt store\_binders}, 536
- \item {\ptt store\_definition}, 536
- \item {\ptt string\_of\_int}, 536
- \item {\ptt strip\_abs}, 537
- \item {\ptt STRIP\_ASSUME\_TAC}, 537
- \item {\ptt strip\_comb}, 539
- \item {\ptt strip\_exists}, 540
- \item {\ptt strip\_forall}, 540
- \item {\ptt STRIP\_GOAL\_THEN}, 541
- \item {\ptt strip\_imp}, 543
- \item {\ptt strip\_pair}, 543
- \item {\ptt STRIP\_TAC}, 544
- \item {\ptt STRIP\_THM\_THEN}, 545
- \item {\ptt STRUCT\_CASES\_TAC}, 547
- \item {\ptt SUB}, 631
- \item {\ptt SUB\_0}, 631
- \item {\ptt SUB\_ADD}, 631
- \item {\ptt SUB\_CANCEL}, 631
- \item {\ptt SUB\_CONV}, 563
- \item {\ptt SUB\_EQ\_0}, 631
- \item {\ptt SUB\_EQ\_EQ\_0}, 631
- \item {\ptt SUB\_EQUAL\_0}, 631
- \item {\ptt SUB\_LEFT\_ADD}, 631
- \item {\ptt SUB\_LEFT\_EQ}, 631
- \item {\ptt SUB\_LEFT\_GREATER}, 631
- \item {\ptt SUB\_LEFT\_GREATER\_EQ}, 631
- \item {\ptt SUB\_LEFT\_LESS}, 631
- \item {\ptt SUB\_LEFT\_LESS\_EQ}, 631
- \item {\ptt SUB\_LEFT\_SUB}, 631
- \item {\ptt SUB\_LEFT\_SUC}, 632
- \item {\ptt SUB\_LESS\_0}, 632
- \item {\ptt SUB\_LESS\_EQ}, 632
- \item {\ptt SUB\_LESS\_EQ\_ADD}, 632
- \item {\ptt SUB\_LESS\_OR}, 632
- \item {\ptt SUB\_MONO\_EQ}, 632
- \item {\ptt SUB\_PLUS}, 632
- \item {\ptt SUB\_RIGHT\_ADD}, 632
- \item {\ptt SUB\_RIGHT\_EQ}, 632
- \item {\ptt SUB\_RIGHT\_GREATER}, 632
- \item {\ptt SUB\_RIGHT\_GREATER\_EQ}, 632
- \item {\ptt SUB\_RIGHT\_LESS}, 632
- \item {\ptt SUB\_RIGHT\_LESS\_EQ}, 632
- \item {\ptt SUB\_RIGHT\_SUB}, 632
- \item {\ptt SUB\_SUB}, 632
- \item {\ptt SUBGOAL\_THEN}, 548
- \item {\ptt SUBS}, 549
- \item {\ptt SUBS\_OCCS}, 561
- \item {\ptt SUBST}, 551
- \item {\ptt subst}, 552
- \item {\ptt SUBST1\_TAC}, 553
- \item {\ptt SUBST\_ALL\_TAC}, 554
- \item {\ptt SUBST\_CONV}, 555
- \item {\ptt SUBST\_MATCH}, 557
- \item {\ptt subst\_occs}, 558
- \item {\ptt SUBST\_OCCS\_TAC}, 559
- \item {\ptt SUBST\_TAC}, 560
- \item {\ptt subtract}, 562
- \item {\ptt SUC\_ADD\_SYM}, 632
- \item {\ptt SUC\_DEF}, 633
- \item {\ptt SUC\_ID}, 633
- \item {\ptt SUC\_LESS}, 633
- \item {\ptt SUC\_NOT}, 633
- \item {\ptt SUC\_ONE\_ADD}, 633
- \item {\ptt SUC\_REP\_DEF}, 633
- \item {\ptt SUC\_SUB1}, 633
- \item {\ptt SUFFIX\_DEF}, 657
- \item {\ptt SUM}, 658
- \item {\ptt SUM\_APPEND}, 658
- \item {\ptt sum\_Axiom}, 618
- \item {\ptt sum\_axiom}, 618
- \item {\ptt SUM\_FLAT}, 658
- \item {\ptt SUM\_FOLDL}, 658
- \item {\ptt SUM\_FOLDR}, 658
- \item {\ptt sum\_ISO\_DEF}, 618
- \item {\ptt SUM\_REVERSE}, 658
- \item {\ptt SUM\_SNOC}, 658
- \item {\ptt sum\_TY\_DEF}, 618
- \item {\ptt suspend\_recording}, 564
- \item {\ptt SWAP\_EXISTS\_CONV}, 565
- \item {\ptt SYM}, 565
- \item {\ptt SYM\_CONV}, 566
- \item {\ptt syserror}, 566
- \item {\ptt system}, 567
-
- \indexspace
-
- \item {\ptt T\_DEF}, 609
- \item {\ptt TAC\_PROOF}, 567
- \item {\ptt term\_of\_int}, 568
- \item {\ptt THEN}, 568
- \item {\ptt THEN\_TCL}, 570
- \item {\ptt THENC}, 569
- \item {\ptt THENL}, 570
- \item {\ptt theorem}, 571
- \item {\ptt theorem\_lfn}, 573
- \item {\ptt theorem\_msg\_lfn}, 573
- \item {\ptt theorems}, 572
- \item {\ptt thm\_count}, 574
- \item {\ptt thm\_frees}, 575
- \item {\ptt timer}, 575
- \item {\ptt TIMES2}, 633
- \item {\ptt TL}, 658
- \item {\ptt tl}, 576
- \item {\ptt TL\_SNOC}, 658
- \item {\ptt TOP\_DEPTH\_CONV}, 577
- \item {\ptt top\_goal}, 578
- \item {\ptt top\_print}, 578
- \item {\ptt top\_proof}, 579
- \item {\ptt top\_thm}, 580
- \item {\ptt TRANS}, 580
- \item {\ptt tree\_Axiom}, 660
- \item {\ptt tree\_Induct}, 660
- \item {\ptt tree\_ISO\_DEF}, 661
- \item {\ptt tree\_TY\_DEF}, 661
- \item {\ptt trf}, 661
- \item {\ptt TRP}, 661
- \item {\ptt TRP\_DEF}, 661
- \item {\ptt TRUTH}, 614
- \item {\ptt TRY}, 581
- \item {\ptt TRY\_CONV}, 582
- \item {\ptt tryfind}, 582
- \item {\ptt tty\_read}, 583
- \item {\ptt tty\_write}, 583
- \item {\ptt TY\_DEF\_THM}, 661
- \item {\ptt type\_abbrevs}, 585
- \item {\ptt TYPE\_DEFINITION}, 661
- \item {\ptt type\_in}, 586
- \item {\ptt type\_in\_type}, 587
- \item {\ptt type\_of}, 587
- \item {\ptt type\_tyvars}, 588
- \item {\ptt types}, 584
- \item {\ptt tyvars}, 588
- \item {\ptt tyvarsl}, 589
-
- \indexspace
-
- \item {\ptt uncurry}, 590
- \item {\ptt UNCURRY\_DEF}, 617
- \item {\ptt UNDISCH}, 590
- \item {\ptt UNDISCH\_ALL}, 591
- \item {\ptt UNDISCH\_TAC}, 592
- \item {\ptt undo\_autoload}, 592
- \item {\ptt unhide\_constant}, 593
- \item {\ptt union}, 593
- \item {\ptt unlink}, 594
- \item {\ptt UNZIP}, 658
- \item {\ptt UNZIP\_FST\_DEF}, 658
- \item {\ptt UNZIP\_SND\_DEF}, 658
- \item {\ptt UNZIP\_SNOC}, 658
- \item {\ptt UNZIP\_ZIP}, 658
-
- \indexspace
-
- \item {\ptt VALID}, 594
- \item {\ptt variant}, 595
- \item {\ptt vars}, 596
- \item {\ptt varsl}, 597
- \item {\ptt version}, 598
-
- \indexspace
-
- \item {\ptt W}, 598
- \item {\ptt WOP}, 633
- \item {\ptt word\_separators}, 600
- \item {\ptt words}, 598
- \item {\ptt words2}, 599
- \item {\ptt write}, 600
-
- \indexspace
-
- \item {\ptt X\_CASES\_THEN}, 601
- \item {\ptt X\_CASES\_THENL}, 603
- \item {\ptt X\_CHOOSE\_TAC}, 604
- \item {\ptt X\_CHOOSE\_THEN}, 605
- \item {\ptt X\_FUN\_EQ\_CONV}, 607
- \item {\ptt X\_GEN\_TAC}, 607
- \item {\ptt X\_SKOLEM\_CONV}, 608
-
- \indexspace
-
- \item {\ptt ZERO\_DEF}, 633
- \item {\ptt ZERO\_DIV}, 633
- \item {\ptt ZERO\_LESS\_EQ}, 633
- \item {\ptt ZERO\_LESS\_EXP}, 633
- \item {\ptt ZERO\_MOD}, 633
- \item {\ptt ZERO\_REP\_DEF}, 633
- \item {\ptt ZIP}, 659
- \item {\ptt ZIP\_SNOC}, 659
- \item {\ptt ZIP\_UNZIP}, 659
-
-\end{theindex}
+\begin{theindex}\mbox{}\end{theindex}
\ No newline at end of file
--- hol88-2.02.19940316.orig/Manual/Reference/Makefile
+++ hol88-2.02.19940316/Manual/Reference/Makefile
@@ -19,46 +19,46 @@ default:
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids theorems
@echo "TeX files made"
ids:
- @echo "\chapter{Pre-defined ML Identifiers}" > entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{Pre-defined ML Identifiers}' > entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/ENTRIES entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{Definitions of Basic Logical Constants}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{Definitions of Basic Logical Constants}'>>theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/basic-logic theorems.tex
- @echo "\section{Constants for syntactic abbreviations}" >> theorems.tex
+ @printf '\\section{Constants for syntactic abbreviations}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/syntax theorems.tex
- @echo "\section{Axioms}" >> theorems.tex
+ @printf '\\section{Axioms}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/axioms theorems.tex
- @echo "\section{Logical tautologies}" >> theorems.tex
+ @printf '\\section{Logical tautologies}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/logic theorems.tex
- @echo "\section{Theorems about functions}" >> theorems.tex
+ @printf '\\section{Theorems about functions}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/functions theorems.tex
- @echo "\section{Theorems about the type {\tt one}}" >> theorems.tex
+ @printf '\\section{Theorems about the type {\\tt one}}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/one theorems.tex
- @echo "\section{Theorems about combinators}" >> theorems.tex
+ @printf '\\section{Theorems about combinators}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/combin theorems.tex
- @echo "\section{Theorems about pairs}" >> theorems.tex
+ @printf '\\section{Theorems about pairs}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/pairs theorems.tex
- @echo "\section{Theorems about disjoint sums}" >> theorems.tex
+ @printf '\\section{Theorems about disjoint sums}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/sum theorems.tex
- @echo "\section{Theorems about arithmetic}" >> theorems.tex
+ @printf '\\section{Theorems about arithmetic}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/arith theorems.tex
- @echo "\section{Theorems about lists}" >> theorems.tex
+ @printf '\\section{Theorems about lists}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/list theorems.tex
- @echo "\section{Theorems about trees}" >> theorems.tex
+ @printf '\\section{Theorems about trees}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/tree theorems.tex
- @echo "\section{Theorems used to define types}" >> theorems.tex
+ @printf '\\section{Theorems used to define types}' >> theorems.tex
/bin/sh bin/doc-to-tex ${D2TSED} ${Helpd}/THEOREMS/tydefs theorems.tex
reference:
--- hol88-2.02.19940316.orig/Manual/Reference/entries.tex
+++ hol88-2.02.19940316/Manual/Reference/entries.tex
@@ -1,1114 +1,882 @@
-\chapter{Pre-defined ML Identifiers}
-\input{entries-intro}
-\DOC{\#}
+\chapter{Pre-defined ML Identifiers}\input{entries-intro}\DOC{ABS\_CONV}
-\TYPE {\small\verb%$# : (((* -> **) # (*** -> ****)) -> (* # ***) -> (** # ****))%}\egroup
+\TYPE {\small\verb%ABS_CONV : (conv -> conv)%}\egroup
\SYNOPSIS
-Applies two functions to a pair: {\small\verb%(f # g) (x,y)%} = {\small\verb%(f x, g y)%}.
+Applies a conversion to the body of an abstraction.
+
+\DESCRIBE
+If {\small\verb%c%} is a conversion that maps a term {\small\verb%"t"%} to the theorem {\small\verb%|- t = t'%}, then
+the conversion {\small\verb%ABS_CONV c%} maps abstractions of the form {\small\verb%"\x.t"%} to theorems
+of the form:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- (\x.t) = (\x.t')
+\end{verbatim}
+}
+\noindent That is, {\small\verb%ABS_CONV c "\x.t"%} applies {\small\verb%c%} to the body of the
+abstraction {\small\verb%"\x.t"%}.
\FAILURE
-Never fails.
+{\small\verb%ABS_CONV c tm%} fails if {\small\verb%tm%} is not an abstraction or if {\small\verb%tm%} has the form
+{\small\verb%"\x.t"%} but the conversion {\small\verb%c%} fails when applied to the term {\small\verb%t%}. The
+function returned by {\small\verb%ABS_CONV c%} may also fail if the ML function
+{\small\verb%c:term->thm%} is not, in fact, a conversion (i.e. a function that maps a term
+{\small\verb%t%} to a theorem {\small\verb%|- t = t'%}).
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#ABS_CONV SYM_CONV "\x. 1 = x";;
+|- (\x. 1 = x) = (\x. x = 1)
+\end{verbatim}
+}
\SEEALSO
-B, C, CB, Co, I, K, KI, o, oo, S, W.
+RAND_CONV, RATOR_CONV, SUB_CONV.
\ENDDOC
-\DOC{*}
+\DOC{ABS}
-\TYPE {\small\verb%$* : ((int # int) -> int)%}\egroup
+\TYPE {\small\verb%ABS : (term -> thm -> thm)%}\egroup
\SYNOPSIS
-Performs multiplication on ML integers.
+Abstracts both sides of an equation.
+\DESCRIBE
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t1 = t2
+ ------------------------ ABS "x" [Where x is not free in A]
+ A |- (\x.t1) = (\x.t2)
+\end{verbatim}
+}
\FAILURE
-Never fails.
+If the theorem is not an equation, or if the variable {\small\verb%x%} is free in the
+assumptions {\small\verb%A%}.
-\ENDDOC
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#ABS "m:num" (REFL "m:num");;
+|- (\m. m) = (\m. m)
+\end{verbatim}
+}
+\SEEALSO
+ETA_CONV, EXT, MK_ABS.
-\DOC{+}
+\ENDDOC
+\DOC{abs\_goals}
-\TYPE {\small\verb%$+ : ((int # int) -> int)%}\egroup
+\TYPE {\small\verb%abs_goals : (subgoals list -> goalstack)%}\egroup
\SYNOPSIS
-Performs addition on ML integers.
-
-\FAILURE
-Never fails.
+This function is for internal use only and is to be deleted from a future
+version of the system. It should not be used.
\ENDDOC
-\DOC{-}
+\DOC{ACCEPT\_TAC}
-\TYPE {\small\verb%$- : ((int # int) -> int)%}\egroup
+\TYPE {\small\verb%ACCEPT_TAC : thm_tactic%}\egroup
\SYNOPSIS
-Performs subtraction on ML integers.
+Solves a goal if supplied with the desired theorem (up to alpha-conversion).
+
+\DESCRIBE
+{\small\verb%ACCEPT_TAC%} maps a given theorem {\small\verb%th%} to a tactic that solves any goal whose
+conclusion is alpha-convertible to the conclusion of {\small\verb%th%}.
\FAILURE
-Never fails.
+{\small\verb%ACCEPT_TAC th (A,g)%} fails if the term {\small\verb%g%} is not alpha-convertible to the
+conclusion of the supplied theorem {\small\verb%th%}.
-\COMMENTS
-Unary {\small\verb%-%} exists as an internal parser object, but not as a function. So,
-whilst typing in {\small\verb%-1;;%} will work, {\small\verb%-;;%} will return a parse error.
+\EXAMPLE
+{\small\verb%ACCEPT_TAC%} applied to the axiom
+{\par\samepage\setseps\small
+\begin{verbatim}
+ BOOL_CASES_AX = |- !t. (t = T) \/ (t = F)
+\end{verbatim}
+}
+\noindent will solve the goal
+{\par\samepage\setseps\small
+\begin{verbatim}
+ ?- !x. (x = T) \/ (x = F)
+\end{verbatim}
+}
+\noindent but will fail on the goal
+{\par\samepage\setseps\small
+\begin{verbatim}
+ ?- !x. (x = F) \/ (x = T)
+\end{verbatim}
+}
+\USES
+Used for completing proofs by supplying an existing theorem, such as an axiom,
+or a lemma already proved.
+
+\SEEALSO
+MATCH_ACCEPT_TAC.
\ENDDOC
-\DOC{\char'056}
+\DOC{AC\_CONV}
-\TYPE {\small\verb%$. : ((* # * list) -> * list)%}\egroup
+\TYPE {\small\verb%AC_CONV : ((thm # thm) -> conv)%}\egroup
\SYNOPSIS
-Adds single element to the head of a list.
+Proves equality of terms using associative and commutative laws.
\DESCRIBE
-The {\small\verb%.%} operator is an infixed primitive list constructor, analogous to {\small\verb%CONS%}
-in LISP. Its effect is {\small\verb%x . [x1;....;xn]%} = {\small\verb%[x;x1;...;xn]%}.
+Suppose {\small\verb%_%} is a function, which is assumed to be infix in the following syntax,
+and {\small\verb%ath%} and {\small\verb%cth%} are theorems expressing its associativity and
+commutativity; they must be of the following form, except that any free
+variables may have arbitrary names and may be universally quantified:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ ath = |- m _ (n _ p) = (m _ n) _ p
+ cth = |- m _ n = n _ m
+\end{verbatim}
+}
+\noindent Then the conversion {\small\verb%AC_CONV(ath,cth)%} will prove equations whose
+left and right sides can be made identical using these associative and
+commutative laws.
\FAILURE
-Never fails.
+Fails if the associative or commutative law has an invalid form, or if the
+term is not an equation between AC-equivalent terms.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #AC_CONV(ADD_ASSOC,ADD_SYM)
+ # "x + (SUC t) + ((3 + y) + z) = 3 + (SUC t) + x + y + z";;
+ |- (x + ((SUC t) + ((3 + y) + z)) = 3 + ((SUC t) + (x + (y + z)))) = T
+\end{verbatim}
+}
+
+\COMMENTS
+Note that the preproved associative and commutative laws for the operators {\small\verb%+%},
+{\small\verb%*%}, {\small\verb%/\%} and {\small\verb%\/%} are already in the right form to give to {\small\verb%AC_CONV%}.
+
+\SEEALSO
+SYM_CONV.
\ENDDOC
-\DOC{/}
+\DOC{achieve\_first}
-\TYPE {\small\verb%$/ : ((int # int) -> int)%}\egroup
+\TYPE {\small\verb%achieve_first : (subgoals -> thm -> subgoals)%}\egroup
\SYNOPSIS
-Performs division on ML integers.
+This function is for internal use only and is to be deleted from a future
+version of the system. It should not be used.
-\FAILURE
-Fails on division by zero.
+\ENDDOC
+\DOC{achieves}
+
+\TYPE {\small\verb%achieves : (thm -> goal -> bool)%}\egroup
+
+\SYNOPSIS
+This function is for internal use only and is to be deleted from a future
+version of the system. It should not be used.
\ENDDOC
-\DOC{\char'136}
+\DOC{aconv}
-\TYPE {\small\verb%$^ : (string -> string -> string)%}\egroup
+\TYPE {\small\verb%aconv : (term -> term -> bool)%}\egroup
\SYNOPSIS
-Concatenates two ML strings.
+Tests for alpha-convertibility of terms.
\DESCRIBE
-The {\small\verb%^%} is the ML infix string concatenation operator.
-If {\small\verb%s1%} and {\small\verb%s2%} are strings, then {\small\verb%s1^s2%} gives a string which is their
-concatenation.
+When applied to two terms, {\small\verb%aconv%} returns {\small\verb%true%} if they are
+alpha-convertible, and {\small\verb%false%} otherwise.
\FAILURE
Never fails.
\EXAMPLE
+A simple case of alpha-convertibility is the renaming of a single quantified
+variable:
{\par\samepage\setseps\small
\begin{verbatim}
-#`Hello `^`world`;;
-`Hello world` : string
+ #aconv "?x. x=T" "?y. y=T";;
+ true : bool
\end{verbatim}
}
-\COMMENTS
-The ML role of the {\small\verb%^%} operator should not be confused with its use in
-quoted terms to introduce antiquotation (see DESCRIPTION for details).
-
\SEEALSO
-concat, concatl.
+ALPHA, ALPHA_CONV.
\ENDDOC
-\DOC{<}
+\DOC{activate\_binders}
-\TYPE {\small\verb%$< : ((int # int) -> bool)%}\egroup
+\TYPE {\small\verb%activate_binders : (string -> string list)%}\egroup
\SYNOPSIS
-Performs a less-than test on ML integers.
+Makes the quotation parser treat all binders in the current theory segment as
+such.
+
+\DESCRIBE
+The call
+{\par\samepage\setseps\small
+\begin{verbatim}
+ activate_binders `thy`
+\end{verbatim}
+}
+\noindent where {\small\verb%thy%} is an ancestor theory ({\small\verb%`-`%} stands for the current
+theory), will return a list of all binders on that theory, and make the parser
+treat them all as binders, that is, for each binder {\small\verb%b%}, will allow the
+syntactic sugaring {\small\verb%"b x. y"%} as a shorthand for {\small\verb%"b (\x. y)"%}. The special
+syntactic status may be suppressed by preceding {\small\verb%b%} with a dollar sign. The
+function returns a list of all the binders dealt with.
\FAILURE
Never fails.
+\COMMENTS
+This function is mainly intended for internal use. All binders declared by
+{\small\verb%new_binder%} or {\small\verb%new_binder_definition%} are always parsed as such anyway.
+
+\SEEALSO
+activate_all_binders, binders, new_binder, parse_as_binder.
+
\ENDDOC
-\DOC{<<}
+\DOC{ADD\_ASSUM}
-\TYPE {\small\verb%$<< : ((* # **) -> bool)%}\egroup
+\TYPE {\small\verb%ADD_ASSUM : (term -> thm -> thm)%}\egroup
\SYNOPSIS
-Performs a lexical comparison of values.
+Adds an assumption to a theorem.
\DESCRIBE
-{\small\verb%$<<%} performs a fast ordering on values. It is substitutive with
-respect to equality in ML (i.e. if {\small\verb%x << y%} and {\small\verb%x = x'%} and {\small\verb%y = y'%}
-then {\small\verb%x' << y'%}).
+When applied to a boolean term {\small\verb%s%} and a theorem {\small\verb%A |- t%}, the inference
+rule {\small\verb%ADD_ASSUM%} returns the theorem {\small\verb%A u {s} |- t%}.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t
+ -------------- ADD_ASSUM "s"
+ A u {s} |- t
+\end{verbatim}
+}
+\noindent {\small\verb%ADD_ASSUM%} performs straightforward set union with the new
+assumption; it checks for identical assumptions, but not for alpha-equivalent
+ones. The position at which the new assumption is inserted into the assumption
+list should not be relied on.
\FAILURE
-Never fails.
-
-\USES
-It is often useful, for example in normalizing terms in some way, to be able to
-impose some arbitrary (but definite) ordering on ML values.
+Fails unless the given term has type {\small\verb%bool%}.
\SEEALSO
-=.
+ASSUME, UNDISCH.
\ENDDOC
-\DOC{=}
+\DOC{ADD\_CONV}
-\TYPE {\small\verb%$= : ((* # *) -> bool)%}\egroup
+\TYPE {\small\verb%ADD_CONV : conv%}\egroup
\SYNOPSIS
-Performs an equality test on two ML values.
+Computes the sum of two natural number constants.
\DESCRIBE
-{\small\verb%$=%} works as expected on non-function types. It may give unexpected results
-when applied to function types (or types containing them, such as a pair of
-functions), and should be considered unreliable in those situations.
+If {\small\verb%n%} and {\small\verb%m%} are numeral constants (e.g. {\small\verb%0%}, {\small\verb%1%}, {\small\verb%2%}, {\small\verb%3%},...), then
+{\small\verb%ADD_CONV "n + m"%} returns the theorem:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- n + m = s
+\end{verbatim}
+}
+\noindent where {\small\verb%s%} is the numeral that denotes the sum of the natural
+numbers denoted by {\small\verb%n%} and {\small\verb%m%}.
\FAILURE
-Never fails.
+{\small\verb%ADD_CONV tm%} fails if {\small\verb%tm%} is not of the form {\small\verb%"n + m"%}, where {\small\verb%n%} and
+{\small\verb%m%} are numerals.
\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
-#1 = 2;;
-false : bool
-
-#1 = 1;;
-true : bool
-
-#let f x = x + 1 and g x = x + 2;;
-f = - : (int -> int)
-g = - : (int -> int)
-
-#let f' = f and h x = f x and h' x = x + 1;;
-f' = - : (int -> int)
-h = - : (int -> int)
-h' = - : (int -> int)
-
-#f=f;;
-true : bool
-
-#f = f';;
-true : bool
-
-#f = g;;
-false : bool
-
-#f =h;;
-false : bool
-
-#f=h';;
-false : bool
-
-#h = h';;
-false : bool
+#ADD_CONV "75 + 25";;
+|- 75 + 25 = 100
\end{verbatim}
}
\ENDDOC
-\DOC{>}
-
-\TYPE {\small\verb%$> : ((int # int) -> bool)%}\egroup
-
-\SYNOPSIS
-Performs a greater-than test on ML integers.
-
-\FAILURE
-Never fails.
-
-\ENDDOC
-\DOC{\char'100}
+\DOC{ALL\_CONV}
-\TYPE {\small\verb%$@ : ((* list # * list) -> * list)%}\egroup
+\TYPE {\small\verb%ALL_CONV : conv%}\egroup
\SYNOPSIS
-Concatenates two lists.
+Conversion that always succeeds and leaves a term unchanged.
\DESCRIBE
-{\small\verb%@%} is an infix operator which concatenates two lists.
+When applied to a term {\small\verb%"t"%}, the conversion {\small\verb%ALL_CONV%} returns the
+theorem {\small\verb%|- t = t%}.
\FAILURE
Never fails.
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#[1;2;3] @ [4;5;6];;
-[1; 2; 3; 4; 5; 6] : int list
-\end{verbatim}
-}
+\USES
+Identity element for {\small\verb%THENC%}.
+
\SEEALSO
-append.
+NO_CONV, REFL.
\ENDDOC
-\DOC{ABS}
+\DOC{ALL\_EL\_CONV}
-\TYPE {\small\verb%ABS : (term -> thm -> thm)%}\egroup
+\TYPE {\small\verb%ALL_EL_CONV : conv -> conv%}\egroup
\SYNOPSIS
-Abstracts both sides of an equation.
+Computes by inference the result of applying a predicate to elements of a list.
\DESCRIBE
+{\small\verb%ALL_EL_CONV%} takes a conversion {\small\verb%conv%} and a term {\small\verb%tm%} in the following form:
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t1 = t2
- ------------------------ ABS "x" [Where x is not free in A]
- A |- (\x.t1) = (\x.t2)
-\end{verbatim}
-}
-\FAILURE
-If the theorem is not an equation, or if the variable {\small\verb%x%} is free in the
-assumptions {\small\verb%A%}.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#ABS "m:num" (REFL "m:num");;
-|- (\m. m) = (\m. m)
+ ALL_EL P [x0;...xn]
\end{verbatim}
}
-\SEEALSO
-ETA_CONV, EXT, MK_ABS.
-
-\ENDDOC
-\DOC{ABS\_CONV}
-
-\TYPE {\small\verb%ABS_CONV : (conv -> conv)%}\egroup
-
-\SYNOPSIS
-Applies a conversion to the body of an abstraction.
-
-\DESCRIBE
-If {\small\verb%c%} is a conversion that maps a term {\small\verb%"t"%} to the theorem {\small\verb%|- t = t'%}, then
-the conversion {\small\verb%ABS_CONV c%} maps abstractions of the form {\small\verb%"\x.t"%} to theorems
-of the form:
+\noindent It returns the theorem
{\par\samepage\setseps\small
\begin{verbatim}
- |- (\x.t) = (\x.t')
+ |- ALL_EL P [x0;...xn] = T
\end{verbatim}
}
-\noindent That is, {\small\verb%ABS_CONV c "\x.t"%} applies {\small\verb%c%} to the body of the
-abstraction {\small\verb%"\x.t"%}.
-
-\FAILURE
-{\small\verb%ABS_CONV c tm%} fails if {\small\verb%tm%} is not an abstraction or if {\small\verb%tm%} has the form
-{\small\verb%"\x.t"%} but the conversion {\small\verb%c%} fails when applied to the term {\small\verb%t%}. The
-function returned by {\small\verb%ABS_CONV c%} may also fail if the ML function
-{\small\verb%c:term->thm%} is not, in fact, a conversion (i.e. a function that maps a term
-{\small\verb%t%} to a theorem {\small\verb%|- t = t'%}).
-
-\EXAMPLE
+\noindent if for every {\small\verb%xi%} occurred in the list, {\small\verb%conv "P xi"%} returns a theorem {\small\verb%|- P xi = T%}, otherwise, if for at least one {\small\verb%xi%}, evaluating
+{\small\verb%conv "P xi"%} returns the theorem {\small\verb%|- P xi = F%}, then it returns the theorem
{\par\samepage\setseps\small
\begin{verbatim}
-#ABS_CONV SYM_CONV "\x. 1 = x";;
-|- (\x. 1 = x) = (\x. x = 1)
+ |- ALL_EL P [x0;...xn] = F
\end{verbatim}
}
-\SEEALSO
-RAND_CONV, RATOR_CONV, SUB_CONV.
-
-\ENDDOC
-\DOC{abs\_goals}
-
-\TYPE {\small\verb%abs_goals : (subgoals list -> goalstack)%}\egroup
-
-\SYNOPSIS
-This function is for internal use only and is to be deleted from a future
-version of the system. It should not be used.
-
-\ENDDOC
-\DOC{ACCEPT\_TAC}
-
-\TYPE {\small\verb%ACCEPT_TAC : thm_tactic%}\egroup
-
-\SYNOPSIS
-Solves a goal if supplied with the desired theorem (up to alpha-conversion).
-
-\DESCRIBE
-{\small\verb%ACCEPT_TAC%} maps a given theorem {\small\verb%th%} to a tactic that solves any goal whose
-conclusion is alpha-convertible to the conclusion of {\small\verb%th%}.
\FAILURE
-{\small\verb%ACCEPT_TAC th (A,g)%} fails if the term {\small\verb%g%} is not alpha-convertible to the
-conclusion of the supplied theorem {\small\verb%th%}.
+{\small\verb%ALL_EL_CONV conv tm%} fails if {\small\verb%tm%} is not of the form described above, or
+failure occurs when evaluating {\small\verb%conv "P xi"%} for some {\small\verb%xi%}.
\EXAMPLE
-{\small\verb%ACCEPT_TAC%} applied to the axiom
+Evaluating
{\par\samepage\setseps\small
\begin{verbatim}
- BOOL_CASES_AX = |- !t. (t = T) \/ (t = F)
+ ALL_EL_CONV bool_EQ_CONV "ALL_EL ($= T) [T;F;T]";;
\end{verbatim}
}
-\noindent will solve the goal
+\noindent returns the following theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- ?- !x. (x = T) \/ (x = F)
+ |- ALL_EL($= T)[T;F;T] = F
\end{verbatim}
}
-\noindent but will fail on the goal
+\noindent In general, if the predicate {\small\verb%P%} is an explicit lambda abstraction
+{\small\verb%(\x. P x)%}, the conversion should be in the form
{\par\samepage\setseps\small
\begin{verbatim}
- ?- !x. (x = F) \/ (x = T)
+ (BETA_CONV THENC conv')
\end{verbatim}
}
-\USES
-Used for completing proofs by supplying an existing theorem, such as an axiom,
-or a lemma already proved.
\SEEALSO
-MATCH_ACCEPT_TAC.
-
-\ENDDOC
-\DOC{achieves}
-
-\TYPE {\small\verb%achieves : (thm -> goal -> bool)%}\egroup
-
-\SYNOPSIS
-This function is for internal use only and is to be deleted from a future
-version of the system. It should not be used.
+SOME_EL_CONV, IS_EL_CONV, FOLDL_CONV, FOLDR_CONV, list_FOLD_CONV.
\ENDDOC
-\DOC{achieve\_first}
-
-\TYPE {\small\verb%achieve_first : (subgoals -> thm -> subgoals)%}\egroup
-\SYNOPSIS
-This function is for internal use only and is to be deleted from a future
-version of the system. It should not be used.
-
-\ENDDOC
-\DOC{aconv}
+\DOC{allowed\_constant}
-\TYPE {\small\verb%aconv : (term -> term -> bool)%}\egroup
+\TYPE {\small\verb%allowed_constant : (string -> bool)%}\egroup
\SYNOPSIS
-Tests for alpha-convertibility of terms.
+Tests if a string has a permissible name for a constant.
\DESCRIBE
-When applied to two terms, {\small\verb%aconv%} returns {\small\verb%true%} if they are
-alpha-convertible, and {\small\verb%false%} otherwise.
+When applied to a string, {\small\verb%allowed_constant%} returns {\small\verb%true%} if the string is a
+permissible constant name, that is, if it is an identifier (see the DESCRIPTION
+for more details), and {\small\verb%false%} otherwise.
\FAILURE
Never fails.
\EXAMPLE
-A simple case of alpha-convertibility is the renaming of a single quantified
-variable:
+The following shows how the lexical rules can be altered:
{\par\samepage\setseps\small
\begin{verbatim}
- #aconv "?x. x=T" "?y. y=T";;
- true : bool
+ #map allowed_constant [`pi`; `@`; `a name`; `+++++`; `*`];;
+ [true; true; false; false; true] : bool list
+
+ #new_special_symbol `+++++`;;
+ () : void
+
+ #map allowed_constant [`pi`; `@`; `a name`; `+++++`; `*`];;
+ [true; true; false; true; true] : bool list
\end{verbatim}
}
+\COMMENTS
+Note that this function only performs a lexical test; it does not check whether
+there is already a constant of that name in the current theory.
+
\SEEALSO
-ALPHA, ALPHA_CONV.
+constants, is_constant, new_alphanum, new_special_symbol, special_symbols.
\ENDDOC
-\DOC{activate\_binders}
+\DOC{ALL\_TAC}
-\TYPE {\small\verb%activate_binders : (string -> string list)%}\egroup
+\TYPE {\small\verb%ALL_TAC : tactic%}\egroup
\SYNOPSIS
-Makes the quotation parser treat all binders in the current theory segment as
-such.
+Passes on a goal unchanged.
\DESCRIBE
-The call
-{\par\samepage\setseps\small
-\begin{verbatim}
- activate_binders `thy`
-\end{verbatim}
-}
-\noindent where {\small\verb%thy%} is an ancestor theory ({\small\verb%`-`%} stands for the current
-theory), will return a list of all binders on that theory, and make the parser
-treat them all as binders, that is, for each binder {\small\verb%b%}, will allow the
-syntactic sugaring {\small\verb%"b x. y"%} as a shorthand for {\small\verb%"b (\x. y)"%}. The special
-syntactic status may be suppressed by preceding {\small\verb%b%} with a dollar sign. The
-function returns a list of all the binders dealt with.
+{\small\verb%ALL_TAC%} applied to a goal {\small\verb%g%} simply produces the subgoal list {\small\verb%[g]%}. It is
+the identity for the {\small\verb%THEN%} tactical.
\FAILURE
Never fails.
-\COMMENTS
-This function is mainly intended for internal use. All binders declared by
-{\small\verb%new_binder%} or {\small\verb%new_binder_definition%} are always parsed as such anyway.
+\EXAMPLE
+The tactic {\small\verb%INDUCT_TAC THENL [ALL_TAC;tac]%}, applied to a goal {\small\verb%g%}, applies
+{\small\verb%INDUCT_TAC%} to {\small\verb%g%} to give a basis and step subgoal; it then returns the
+basis unchanged, along with the subgoals produced by applying {\small\verb%tac%} to the
+step.
+
+\USES
+Used to write tacticals such as {\small\verb%REPEAT%}.
+Often used as a place-holder in building compound tactics using tacticals
+such as {\small\verb%THENL%}.
\SEEALSO
-activate_all_binders, binders, new_binder, parse_as_binder.
+NO_TAC, REPEAT, THENL.
\ENDDOC
-\DOC{AC\_CONV}
+\DOC{ALL\_THEN}
-\TYPE {\small\verb%AC_CONV : ((thm # thm) -> conv)%}\egroup
+\TYPE {\small\verb%ALL_THEN : thm_tactical%}\egroup
\SYNOPSIS
-Proves equality of terms using associative and commutative laws.
+Passes a theorem unchanged to a theorem-tactic.
\DESCRIBE
-Suppose {\small\verb%_%} is a function, which is assumed to be infix in the following syntax,
-and {\small\verb%ath%} and {\small\verb%cth%} are theorems expressing its associativity and
-commutativity; they must be of the following form, except that any free
-variables may have arbitrary names and may be universally quantified:
-{\par\samepage\setseps\small
-\begin{verbatim}
- ath = |- m _ (n _ p) = (m _ n) _ p
- cth = |- m _ n = n _ m
-\end{verbatim}
-}
-\noindent Then the conversion {\small\verb%AC_CONV(ath,cth)%} will prove equations whose
-left and right sides can be made identical using these associative and
-commutative laws.
+For any theorem-tactic {\small\verb%ttac%} and theorem {\small\verb%th%}, the application {\small\verb%ALL_THEN ttac
+th%} results simply in {\small\verb%ttac th%}, that is, the theorem is passed unchanged to
+the theorem-tactic. {\small\verb%ALL_THEN%} is the identity theorem-tactical.
\FAILURE
-Fails if the associative or commutative law has an invalid form, or if the
-term is not an equation between AC-equivalent terms.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
- #AC_CONV(ADD_ASSOC,ADD_SYM)
- # "x + (SUC t) + ((3 + y) + z) = 3 + (SUC t) + x + y + z";;
- |- (x + ((SUC t) + ((3 + y) + z)) = 3 + ((SUC t) + (x + (y + z)))) = T
-\end{verbatim}
-}
+The application of {\small\verb%ALL_THEN%} to a theorem-tactic never fails. The resulting
+theorem-tactic fails under exactly the same conditions as the original one
-\COMMENTS
-Note that the preproved associative and commutative laws for the operators {\small\verb%+%},
-{\small\verb%*%}, {\small\verb%/\%} and {\small\verb%\/%} are already in the right form to give to {\small\verb%AC_CONV%}.
+\USES
+Writing compound tactics or tacticals, e.g. terminating list iterations
+of theorem-tacticals.
\SEEALSO
-SYM_CONV.
+ALL_TAC, FAIL_TAC, NO_TAC, NO_THEN, THEN_TCL, ORELSE_TCL.
\ENDDOC
-\DOC{ADD\_ASSUM}
+\DOC{ALPHA\_CONV}
-\TYPE {\small\verb%ADD_ASSUM : (term -> thm -> thm)%}\egroup
+\TYPE {\small\verb%ALPHA_CONV : (term -> conv)%}\egroup
\SYNOPSIS
-Adds an assumption to a theorem.
+Renames the bound variable of a lambda-abstraction.
\DESCRIBE
-When applied to a boolean term {\small\verb%s%} and a theorem {\small\verb%A |- t%}, the inference
-rule {\small\verb%ADD_ASSUM%} returns the theorem {\small\verb%A u {s} |- t%}.
+If {\small\verb%"x"%} is a variable of type {\small\verb%ty%} and {\small\verb%"\y.t"%} is an abstraction in which
+the bound variable {\small\verb%y%} also has type {\small\verb%ty%}, then {\small\verb%ALPHA_CONV "x" "\y.t"%}
+returns the theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t
- -------------- ADD_ASSUM "s"
- A u {s} |- t
+ |- (\y.t) = (\x'. t[x'/y])
\end{verbatim}
}
-\noindent {\small\verb%ADD_ASSUM%} performs straightforward set union with the new
-assumption; it checks for identical assumptions, but not for alpha-equivalent
-ones. The position at which the new assumption is inserted into the assumption
-list should not be relied on.
+\noindent where the variable {\small\verb%x':ty%} is a primed variant of {\small\verb%x%} chosen so
+as not to be free in {\small\verb%"\y.t"%}.
\FAILURE
-Fails unless the given term has type {\small\verb%bool%}.
+{\small\verb%ALPHA_CONV "x" "tm"%} fails if {\small\verb%x%} is not a variable, if {\small\verb%tm%} is not an
+abstraction, or if {\small\verb%x%} is a variable {\small\verb%v%} and {\small\verb%tm%} is a lambda abstraction
+{\small\verb%\y.t%} but the types of {\small\verb%v%} and {\small\verb%y%} differ.
\SEEALSO
-ASSUME, UNDISCH.
+ALPHA, GEN_ALPHA_CONV.
\ENDDOC
-\DOC{ADD\_CONV}
+\DOC{ALPHA}
-\TYPE {\small\verb%ADD_CONV : conv%}\egroup
+\TYPE {\small\verb%ALPHA : (term -> term -> thm)%}\egroup
\SYNOPSIS
-Computes the sum of two natural number constants.
+Proves equality of alpha-equivalent terms.
\DESCRIBE
-If {\small\verb%n%} and {\small\verb%m%} are numeral constants (e.g. {\small\verb%0%}, {\small\verb%1%}, {\small\verb%2%}, {\small\verb%3%},...), then
-{\small\verb%ADD_CONV "n + m"%} returns the theorem:
+When applied to a pair of terms {\small\verb%t1%} and {\small\verb%t1'%} which are
+alpha-equivalent, {\small\verb%ALPHA%} returns the theorem {\small\verb%|- t1 = t1'%}.
{\par\samepage\setseps\small
\begin{verbatim}
- |- n + m = s
+
+ ------------- ALPHA "t1" "t1'"
+ |- t1 = t1'
\end{verbatim}
}
-\noindent where {\small\verb%s%} is the numeral that denotes the sum of the natural
-numbers denoted by {\small\verb%n%} and {\small\verb%m%}.
-
\FAILURE
-{\small\verb%ADD_CONV tm%} fails if {\small\verb%tm%} is not of the form {\small\verb%"n + m"%}, where {\small\verb%n%} and
-{\small\verb%m%} are numerals.
+Fails unless the terms provided are alpha-equivalent.
\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
-#ADD_CONV "75 + 25";;
-|- 75 + 25 = 100
+#ALPHA "!x:num. x = x" "!y:num. y = y";;
+|- (!x. x = x) = (!y. y = y)
\end{verbatim}
}
+\COMMENTS
+The system shows the type of {\small\verb%ALPHA%} as {\small\verb%term -> conv%}.
+
+\SEEALSO
+aconv, ALPHA_CONV, GEN_ALPHA_CONV.
+
\ENDDOC
-\DOC{allowed\_constant}
+\DOC{ancestors}
-\TYPE {\small\verb%allowed_constant : (string -> bool)%}\egroup
+\TYPE {\small\verb%ancestors : (string -> string list)%}\egroup
\SYNOPSIS
-Tests if a string has a permissible name for a constant.
+Gets a list of the (proper) ancestors of a theory.
\DESCRIBE
-When applied to a string, {\small\verb%allowed_constant%} returns {\small\verb%true%} if the string is a
-permissible constant name, that is, if it is an identifier (see the DESCRIPTION
-for more details), and {\small\verb%false%} otherwise.
+A call to {\small\verb%ancestors `th`%} returns a list of all the proper ancestors (i.e.
+parents, parents of parents, etc.) of the theory {\small\verb%th%}.
\FAILURE
-Never fails.
-
-\EXAMPLE
-The following shows how the lexical rules can be altered:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #map allowed_constant [`pi`; `@`; `a name`; `+++++`; `*`];;
- [true; true; false; false; true] : bool list
-
- #new_special_symbol `+++++`;;
- () : void
-
- #map allowed_constant [`pi`; `@`; `a name`; `+++++`; `*`];;
- [true; true; false; true; true] : bool list
-\end{verbatim}
-}
-\COMMENTS
-Note that this function only performs a lexical test; it does not check whether
-there is already a constant of that name in the current theory.
+Fails if `th` is not an ancestor of the current theory.
\SEEALSO
-constants, is_constant, new_alphanum, new_special_symbol, special_symbols.
+ancestry, parents.
\ENDDOC
-\DOC{ALL\_CONV}
+\DOC{ancestry}
-\TYPE {\small\verb%ALL_CONV : conv%}\egroup
+\TYPE {\small\verb%ancestry : (void -> string list)%}\egroup
\SYNOPSIS
-Conversion that always succeeds and leaves a term unchanged.
+Gets a list of the ancestors of the current theory.
\DESCRIBE
-When applied to a term {\small\verb%"t"%}, the conversion {\small\verb%ALL_CONV%} returns the
-theorem {\small\verb%|- t = t%}.
+A call {\small\verb%ancestry()%} returns a list of all the ancestors of the current theory,
+i.e. the current theory itself, its parents, parents of parents, etc.
\FAILURE
Never fails.
-\USES
-Identity element for {\small\verb%THENC%}.
+\COMMENTS
+The call {\small\verb%ancestry()%} is considerably more efficient than {\small\verb%ancestors `-`%}.
\SEEALSO
-NO_CONV, REFL.
+ancestors, parents.
\ENDDOC
-\DOC{ALL\_EL\_CONV}
+\DOC{AND\_EXISTS\_CONV}
-\TYPE {\small\verb%ALL_EL_CONV : conv -> conv%}\egroup
+\TYPE {\small\verb%AND_EXISTS_CONV : conv%}\egroup
\SYNOPSIS
-Computes by inference the result of applying a predicate to elements of a list.
+Moves an existential quantification outwards through a conjunction.
\DESCRIBE
-{\small\verb%ALL_EL_CONV%} takes a conversion {\small\verb%conv%} and a term {\small\verb%tm%} in the following form:
+When applied to a term of the form {\small\verb%(?x.P) /\ (?x.Q)%}, where {\small\verb%x%} is free
+in neither {\small\verb%P%} nor {\small\verb%Q%}, {\small\verb%AND_EXISTS_CONV%} returns the theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- ALL_EL P [x0;...xn]
+ |- (?x. P) /\ (?x. Q) = (?x. P /\ Q)
\end{verbatim}
}
-\noindent It returns the theorem
+\FAILURE
+{\small\verb%AND_EXISTS_CONV%} fails if it is applied to a term not of the form
+{\small\verb%(?x.P) /\ (?x.Q)%}, or if it is applied to a term {\small\verb%(?x.P) /\ (?x.Q)%}
+in which the variable {\small\verb%x%} is free in either {\small\verb%P%} or {\small\verb%Q%}.
+
+\SEEALSO
+EXISTS_AND_CONV, LEFT_AND_EXISTS_CONV, RIGHT_AND_EXISTS_CONV.
+
+\ENDDOC
+\DOC{AND\_FORALL\_CONV}
+
+\TYPE {\small\verb%AND_FORALL_CONV : conv%}\egroup
+
+\SYNOPSIS
+Moves a universal quantification outwards through a conjunction.
+
+\DESCRIBE
+When applied to a term of the form {\small\verb%(!x.P) /\ (!x.Q)%}, the conversion
+{\small\verb%AND_FORALL_CONV%} returns the theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- |- ALL_EL P [x0;...xn] = T
+ |- (!x.P) /\ (!x.Q) = (!x. P /\ Q)
\end{verbatim}
}
-\noindent if for every {\small\verb%xi%} occurred in the list, {\small\verb%conv "P xi"%} returns a theorem {\small\verb%|- P xi = T%}, otherwise, if for at least one {\small\verb%xi%}, evaluating
-{\small\verb%conv "P xi"%} returns the theorem {\small\verb%|- P xi = F%}, then it returns the theorem
+\FAILURE
+Fails if applied to a term not of the form {\small\verb%(!x.P) /\ (!x.Q)%}.
+
+\SEEALSO
+FORALL_AND_CONV, LEFT_AND_FORALL_CONV, RIGHT_AND_FORALL_CONV.
+
+\ENDDOC
+\DOC{ANTE\_CONJ\_CONV}
+
+\TYPE {\small\verb%ANTE_CONJ_CONV : conv%}\egroup
+
+\SYNOPSIS
+Eliminates a conjunctive antecedent in favour of implication.
+
+\DESCRIBE
+When applied to a term of the form {\small\verb%"(t1 /\ t2) ==> t"%}, the conversion
+{\small\verb%ANTE_CONJ_CONV%} returns the theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- |- ALL_EL P [x0;...xn] = F
+ |- (t1 /\ t2 ==> t) = (t1 ==> t2 ==> t)
\end{verbatim}
}
-
\FAILURE
-{\small\verb%ALL_EL_CONV conv tm%} fails if {\small\verb%tm%} is not of the form described above, or
-failure occurs when evaluating {\small\verb%conv "P xi"%} for some {\small\verb%xi%}.
+Fails if applied to a term not of the form {\small\verb%"(t1 /\ t2) ==> t"%}.
-\EXAMPLE
-Evaluating
+\USES
+Somewhat ad-hoc, but can be used (with {\small\verb%CONV_TAC%}) to transform a goal of the
+form {\small\verb%?- (P /\ Q) ==> R%} into the subgoal {\small\verb%?- P ==> (Q ==> R)%}, so that only
+the antecedent {\small\verb%P%} is moved into the assumptions by {\small\verb%DISCH_TAC%}.
+
+\ENDDOC
+\DOC{ANTE\_RES\_THEN}
+
+\TYPE {\small\verb%ANTE_RES_THEN : thm_tactical%}\egroup
+
+\SYNOPSIS
+Resolves implicative assumptions with an antecedent.
+
+\DESCRIBE
+Given a theorem-tactic {\small\verb%ttac%} and a theorem {\small\verb%A |- t%}, the function
+{\small\verb%ANTE_RES_THEN%} produces a tactic that attempts to match {\small\verb%t%} to the antecedent
+of each implication
{\par\samepage\setseps\small
\begin{verbatim}
- ALL_EL_CONV bool_EQ_CONV "ALL_EL ($= T) [T;F;T]";;
+ Ai |- !x1...xn. ui ==> vi
\end{verbatim}
}
-\noindent returns the following theorem:
+\noindent (where {\small\verb%Ai%} is just {\small\verb%!x1...xn. ui ==> vi%}) that occurs among the
+assumptions of a goal. If the antecedent {\small\verb%ui%} of any implication matches {\small\verb%t%},
+then an instance of {\small\verb%Ai u A |- vi%} is obtained by specialization of the
+variables {\small\verb%x1%}, ..., {\small\verb%xn%} and type instantiation, followed by an application of
+modus ponens. Because all implicative assumptions are tried, this may result
+in several modus-ponens consequences of the supplied theorem and the
+assumptions. Tactics are produced using {\small\verb%ttac%} from all these theorems, and
+these tactics are applied in sequence to the goal. That is,
{\par\samepage\setseps\small
\begin{verbatim}
- |- ALL_EL($= T)[T;F;T] = F
+ ANTE_RES_THEN ttac (A |- t) g
\end{verbatim}
}
-\noindent In general, if the predicate {\small\verb%P%} is an explicit lambda abstraction
-{\small\verb%(\x. P x)%}, the conversion should be in the form
+\noindent has the effect of:
{\par\samepage\setseps\small
\begin{verbatim}
- (BETA_CONV THENC conv')
+ MAP_EVERY ttac [A1 u A |- v1; ...; Am u A |- vm] g
\end{verbatim}
}
-
-\SEEALSO
-SOME_EL_CONV, IS_EL_CONV, FOLDL_CONV, FOLDR_CONV, list_FOLD_CONV.
-
-\ENDDOC
-
-\DOC{ALL\_TAC}
-
-\TYPE {\small\verb%ALL_TAC : tactic%}\egroup
-
-\SYNOPSIS
-Passes on a goal unchanged.
-
-\DESCRIBE
-{\small\verb%ALL_TAC%} applied to a goal {\small\verb%g%} simply produces the subgoal list {\small\verb%[g]%}. It is
-the identity for the {\small\verb%THEN%} tactical.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-The tactic {\small\verb%INDUCT_TAC THENL [ALL_TAC;tac]%}, applied to a goal {\small\verb%g%}, applies
-{\small\verb%INDUCT_TAC%} to {\small\verb%g%} to give a basis and step subgoal; it then returns the
-basis unchanged, along with the subgoals produced by applying {\small\verb%tac%} to the
-step.
-
-\USES
-Used to write tacticals such as {\small\verb%REPEAT%}.
-Often used as a place-holder in building compound tactics using tacticals
-such as {\small\verb%THENL%}.
-
-\SEEALSO
-NO_TAC, REPEAT, THENL.
-
-\ENDDOC
-\DOC{ALL\_THEN}
-
-\TYPE {\small\verb%ALL_THEN : thm_tactical%}\egroup
-
-\SYNOPSIS
-Passes a theorem unchanged to a theorem-tactic.
-
-\DESCRIBE
-For any theorem-tactic {\small\verb%ttac%} and theorem {\small\verb%th%}, the application {\small\verb%ALL_THEN ttac
-th%} results simply in {\small\verb%ttac th%}, that is, the theorem is passed unchanged to
-the theorem-tactic. {\small\verb%ALL_THEN%} is the identity theorem-tactical.
+\noindent where the theorems {\small\verb%Ai u A |- vi%} are all the consequences that can
+be drawn by a (single) matching modus-ponens inference from the implications
+that occur among the assumptions of the goal {\small\verb%g%} and the supplied theorem
+{\small\verb%A |- t%}. Any negation {\small\verb%~v%} that appears among the assumptions of the goal is
+treated as an implication {\small\verb%v ==> F%}. The sequence in which the theorems
+{\small\verb%Ai u A |- vi%} are generated and the corresponding tactics applied is
+unspecified.
\FAILURE
-The application of {\small\verb%ALL_THEN%} to a theorem-tactic never fails. The resulting
-theorem-tactic fails under exactly the same conditions as the original one
-
-\USES
-Writing compound tactics or tacticals, e.g. terminating list iterations
-of theorem-tacticals.
+{\small\verb%ANTE_RES_THEN ttac (A |- t)%} fails when applied to a goal {\small\verb%g%} if any of the
+tactics produced by {\small\verb%ttac (Ai u A |- vi)%}, where {\small\verb%Ai u A |- vi%} is the {\small\verb%i%}th
+resolvent obtained from the theorem {\small\verb%A |- t%} and the assumptions of {\small\verb%g%}, fails
+when applied in sequence to {\small\verb%g%}.
\SEEALSO
-ALL_TAC, FAIL_TAC, NO_TAC, NO_THEN, THEN_TCL, ORELSE_TCL.
+IMP_RES_TAC, IMP_RES_THEN, MATCH_MP, RES_TAC, RES_THEN.
\ENDDOC
-\DOC{ALPHA}
+\DOC{APPEND\_CONV}
-\TYPE {\small\verb%ALPHA : (term -> term -> thm)%}\egroup
+\TYPE {\small\verb%APPEND_CONV : conv%}\egroup
\SYNOPSIS
-Proves equality of alpha-equivalent terms.
+Computes by inference the result of appending two object-language lists.
\DESCRIBE
-When applied to a pair of terms {\small\verb%t1%} and {\small\verb%t1'%} which are
-alpha-equivalent, {\small\verb%ALPHA%} returns the theorem {\small\verb%|- t1 = t1'%}.
+For any pair of object language lists of the form {\small\verb%"[x1;...;xn]"%} and
+{\small\verb%"[y1;...;ym]"%}, the result of evaluating
{\par\samepage\setseps\small
\begin{verbatim}
-
- ------------- ALPHA "t1" "t1'"
- |- t1 = t1'
+ APPEND_CONV "APPEND [x1;...;xn] [y1;...;ym]"
\end{verbatim}
}
-\FAILURE
-Fails unless the terms provided are alpha-equivalent.
-
-\EXAMPLE
+\noindent is the theorem
{\par\samepage\setseps\small
\begin{verbatim}
-#ALPHA "!x:num. x = x" "!y:num. y = y";;
-|- (!x. x = x) = (!y. y = y)
+ |- APPEND [x1;...;xn] [y1;...;ym] = [x1;...;xn;y1;...;ym]
\end{verbatim}
}
-\COMMENTS
-The system shows the type of {\small\verb%ALPHA%} as {\small\verb%term -> conv%}.
+\noindent The length of either list (or both) may be 0.
-\SEEALSO
-aconv, ALPHA_CONV, GEN_ALPHA_CONV.
+\FAILURE
+{\small\verb%APPEND_CONV tm%} fails if {\small\verb%tm%} is not of the form {\small\verb%"APPEND l1 l2"%}, where
+{\small\verb%l1%} and {\small\verb%l2%} are (possibly empty) object-language lists of the forms
+{\small\verb%"[x1;...;xn]"%} and {\small\verb%"[y1;...;ym]"%}.
\ENDDOC
-\DOC{ALPHA\_CONV}
-\TYPE {\small\verb%ALPHA_CONV : (term -> conv)%}\egroup
+\DOC{append}
+
+\TYPE {\small\verb%append : (* list -> * list -> * list)%}\egroup
\SYNOPSIS
-Renames the bound variable of a lambda-abstraction.
+Concatenates two lists.
\DESCRIBE
-If {\small\verb%"x"%} is a variable of type {\small\verb%ty%} and {\small\verb%"\y.t"%} is an abstraction in which
-the bound variable {\small\verb%y%} also has type {\small\verb%ty%}, then {\small\verb%ALPHA_CONV "x" "\y.t"%}
-returns the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- (\y.t) = (\x'. t[x'/y])
-\end{verbatim}
-}
-\noindent where the variable {\small\verb%x':ty%} is a primed variant of {\small\verb%x%} chosen so
-as not to be free in {\small\verb%"\y.t"%}.
+{\small\verb%append [x1;...;xn] [y1;...;ym]%} returns {\small\verb%[x1;...;xn;y1;...;ym]%}.
\FAILURE
-{\small\verb%ALPHA_CONV "x" "tm"%} fails if {\small\verb%x%} is not a variable, if {\small\verb%tm%} is not an
-abstraction, or if {\small\verb%x%} is a variable {\small\verb%v%} and {\small\verb%tm%} is a lambda abstraction
-{\small\verb%\y.t%} but the types of {\small\verb%v%} and {\small\verb%y%} differ.
+Never fails.
-\SEEALSO
-ALPHA, GEN_ALPHA_CONV.
+\COMMENTS
+Performs the same operation as {\small\verb%$@%}.
\ENDDOC
-\DOC{ancestors}
+\DOC{append\_openw}
-\TYPE {\small\verb%ancestors : (string -> string list)%}\egroup
+\TYPE {\small\verb%append_openw : (string -> string)%}\egroup
\SYNOPSIS
-Gets a list of the (proper) ancestors of a theory.
+Opens a port for appending to a named file.
\DESCRIBE
-A call to {\small\verb%ancestors `th`%} returns a list of all the proper ancestors (i.e.
-parents, parents of parents, etc.) of the theory {\small\verb%th%}.
-
-\FAILURE
-Fails if `th` is not an ancestor of the current theory.
+When applied to a filename {\small\verb%`name`%}, the function {\small\verb%append_openw%} opens the file
+{\small\verb%name%} for writing, such that existing contents are appended to rather than
+overwritten. It returns a port descriptor string, which can be used by {\small\verb%write%}
+to append to the file, and by {\small\verb%close%} to close it.
-\SEEALSO
-ancestry, parents.
+\EXAMPLE
+The following example assumes that HOL is being run under Unix. It will
+overwrite an existing file {\small\verb%test-file%} in the current directory.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #system `echo -n 'Hello ' >test-file`;;
+ 0 : int
-\ENDDOC
-\DOC{ancestry}
+ #let port = append_openw `test-file`;;
+ port = `%test-file` : string
-\TYPE {\small\verb%ancestry : (void -> string list)%}\egroup
+ #write(port,`world`);;
+ () : void
-\SYNOPSIS
-Gets a list of the ancestors of the current theory.
+ #close port;;
+ () : void
-\DESCRIBE
-A call {\small\verb%ancestry()%} returns a list of all the ancestors of the current theory,
-i.e. the current theory itself, its parents, parents of parents, etc.
+ #system `cat test-file`;;
+ Hello world0 : int
+\end{verbatim}
+}
+\SEEALSO
+close, openi, openw, read, write.
-\FAILURE
-Never fails.
+\ENDDOC
+\DOC{apply\_proof}
-\COMMENTS
-The call {\small\verb%ancestry()%} is considerably more efficient than {\small\verb%ancestors `-`%}.
+\TYPE {\small\verb%apply_proof : (subgoals -> thm)%}\egroup
-\SEEALSO
-ancestors, parents.
+\SYNOPSIS
+This function is for internal use only and is to be deleted from a future
+version of the system. It should not be used.
\ENDDOC
-\DOC{AND\_EXISTS\_CONV}
+\DOC{AP\_TERM}
-\TYPE {\small\verb%AND_EXISTS_CONV : conv%}\egroup
+\TYPE {\small\verb%AP_TERM : (term -> thm -> thm)%}\egroup
\SYNOPSIS
-Moves an existential quantification outwards through a conjunction.
+Applies a function to both sides of an equational theorem.
\DESCRIBE
-When applied to a term of the form {\small\verb%(?x.P) /\ (?x.Q)%}, where {\small\verb%x%} is free
-in neither {\small\verb%P%} nor {\small\verb%Q%}, {\small\verb%AND_EXISTS_CONV%} returns the theorem:
+When applied to a term {\small\verb%f%} and a theorem {\small\verb%A |- x = y%}, the
+inference rule {\small\verb%AP_TERM%} returns the theorem {\small\verb%A |- f x = f y%}.
{\par\samepage\setseps\small
\begin{verbatim}
- |- (?x. P) /\ (?x. Q) = (?x. P /\ Q)
+ A |- x = y
+ ---------------- AP_TERM "f"
+ A |- f x = f y
\end{verbatim}
}
\FAILURE
-{\small\verb%AND_EXISTS_CONV%} fails if it is applied to a term not of the form
-{\small\verb%(?x.P) /\ (?x.Q)%}, or if it is applied to a term {\small\verb%(?x.P) /\ (?x.Q)%}
-in which the variable {\small\verb%x%} is free in either {\small\verb%P%} or {\small\verb%Q%}.
+Fails unless the theorem is equational and the supplied term is a function
+whose domain type is the same as the type of both sides of the equation.
\SEEALSO
-EXISTS_AND_CONV, LEFT_AND_EXISTS_CONV, RIGHT_AND_EXISTS_CONV.
+AP_THM, MK_COMB.
\ENDDOC
-\DOC{AND\_FORALL\_CONV}
+\DOC{AP\_TERM\_TAC}
-\TYPE {\small\verb%AND_FORALL_CONV : conv%}\egroup
+\TYPE {\small\verb%AP_TERM_TAC : tactic%}\egroup
\SYNOPSIS
-Moves a universal quantification outwards through a conjunction.
+Strips a function application from both sides of an equational goal.
\DESCRIBE
-When applied to a term of the form {\small\verb%(!x.P) /\ (!x.Q)%}, the conversion
-{\small\verb%AND_FORALL_CONV%} returns the theorem:
+{\small\verb%AP_TERM_TAC%} reduces a goal of the form {\small\verb%A ?- f x = f y%} by stripping away
+the function applications, giving the new goal {\small\verb%A ?- x = y%}.
{\par\samepage\setseps\small
\begin{verbatim}
- |- (!x.P) /\ (!x.Q) = (!x. P /\ Q)
+ A ?- f x = f y
+ ================ AP_TERM_TAC
+ A ?- x = y
\end{verbatim}
}
\FAILURE
-Fails if applied to a term not of the form {\small\verb%(!x.P) /\ (!x.Q)%}.
+Fails unless the goal is equational, with both sides being applications
+of the same function.
\SEEALSO
-FORALL_AND_CONV, LEFT_AND_FORALL_CONV, RIGHT_AND_FORALL_CONV.
+AP_TERM, AP_THM.
\ENDDOC
-\DOC{ANTE\_CONJ\_CONV}
+\DOC{AP\_THM}
-\TYPE {\small\verb%ANTE_CONJ_CONV : conv%}\egroup
+\TYPE {\small\verb%AP_THM : (thm -> term -> thm)%}\egroup
\SYNOPSIS
-Eliminates a conjunctive antecedent in favour of implication.
+Proves equality of equal functions applied to a term.
\DESCRIBE
-When applied to a term of the form {\small\verb%"(t1 /\ t2) ==> t"%}, the conversion
-{\small\verb%ANTE_CONJ_CONV%} returns the theorem:
+When applied to a theorem {\small\verb%A |- f = g%} and a term {\small\verb%x%}, the inference
+rule {\small\verb%AP_THM%} returns the theorem {\small\verb%A |- f x = g x%}.
{\par\samepage\setseps\small
\begin{verbatim}
- |- (t1 /\ t2 ==> t) = (t1 ==> t2 ==> t)
+ A |- f = g
+ ---------------- AP_THM (A |- f = g) "x"
+ A |- f x = g x
\end{verbatim}
}
\FAILURE
-Fails if applied to a term not of the form {\small\verb%"(t1 /\ t2) ==> t"%}.
+Fails unless the conclusion of the theorem is an equation, both sides
+of which are functions whose domain type is the same as that of the
+supplied term.
-\USES
-Somewhat ad-hoc, but can be used (with {\small\verb%CONV_TAC%}) to transform a goal of the
-form {\small\verb%?- (P /\ Q) ==> R%} into the subgoal {\small\verb%?- P ==> (Q ==> R)%}, so that only
-the antecedent {\small\verb%P%} is moved into the assumptions by {\small\verb%DISCH_TAC%}.
+\COMMENTS
+The type of {\small\verb%AP_THM%} is shown by the system as {\small\verb%thm -> conv%}.
+
+\SEEALSO
+AP_TERM, ETA_CONV, EXT, MK_COMB.
\ENDDOC
-\DOC{ANTE\_RES\_THEN}
+\DOC{AP\_THM\_TAC}
-\TYPE {\small\verb%ANTE_RES_THEN : thm_tactical%}\egroup
+\TYPE {\small\verb%AP_THM_TAC : tactic%}\egroup
\SYNOPSIS
-Resolves implicative assumptions with an antecedent.
+Strips identical operands from functions on both sides of an equation.
\DESCRIBE
-Given a theorem-tactic {\small\verb%ttac%} and a theorem {\small\verb%A |- t%}, the function
-{\small\verb%ANTE_RES_THEN%} produces a tactic that attempts to match {\small\verb%t%} to the antecedent
-of each implication
+When applied to a goal of the form {\small\verb%A ?- f x = g x%}, the tactic {\small\verb%AP_THM_TAC%}
+strips away the operands of the function application:
{\par\samepage\setseps\small
\begin{verbatim}
- Ai |- !x1...xn. ui ==> vi
-\end{verbatim}
-}
-\noindent (where {\small\verb%Ai%} is just {\small\verb%!x1...xn. ui ==> vi%}) that occurs among the
-assumptions of a goal. If the antecedent {\small\verb%ui%} of any implication matches {\small\verb%t%},
-then an instance of {\small\verb%Ai u A |- vi%} is obtained by specialization of the
-variables {\small\verb%x1%}, ..., {\small\verb%xn%} and type instantiation, followed by an application of
-modus ponens. Because all implicative assumptions are tried, this may result
-in several modus-ponens consequences of the supplied theorem and the
-assumptions. Tactics are produced using {\small\verb%ttac%} from all these theorems, and
-these tactics are applied in sequence to the goal. That is,
-{\par\samepage\setseps\small
-\begin{verbatim}
- ANTE_RES_THEN ttac (A |- t) g
-\end{verbatim}
-}
-\noindent has the effect of:
-{\par\samepage\setseps\small
-\begin{verbatim}
- MAP_EVERY ttac [A1 u A |- v1; ...; Am u A |- vm] g
-\end{verbatim}
-}
-\noindent where the theorems {\small\verb%Ai u A |- vi%} are all the consequences that can
-be drawn by a (single) matching modus-ponens inference from the implications
-that occur among the assumptions of the goal {\small\verb%g%} and the supplied theorem
-{\small\verb%A |- t%}. Any negation {\small\verb%~v%} that appears among the assumptions of the goal is
-treated as an implication {\small\verb%v ==> F%}. The sequence in which the theorems
-{\small\verb%Ai u A |- vi%} are generated and the corresponding tactics applied is
-unspecified.
-
-\FAILURE
-{\small\verb%ANTE_RES_THEN ttac (A |- t)%} fails when applied to a goal {\small\verb%g%} if any of the
-tactics produced by {\small\verb%ttac (Ai u A |- vi)%}, where {\small\verb%Ai u A |- vi%} is the {\small\verb%i%}th
-resolvent obtained from the theorem {\small\verb%A |- t%} and the assumptions of {\small\verb%g%}, fails
-when applied in sequence to {\small\verb%g%}.
-
-\SEEALSO
-IMP_RES_TAC, IMP_RES_THEN, MATCH_MP, RES_TAC, RES_THEN.
-
-\ENDDOC
-\DOC{append}
-
-\TYPE {\small\verb%append : (* list -> * list -> * list)%}\egroup
-
-\SYNOPSIS
-Concatenates two lists.
-
-\DESCRIBE
-{\small\verb%append [x1;...;xn] [y1;...;ym]%} returns {\small\verb%[x1;...;xn;y1;...;ym]%}.
-
-\FAILURE
-Never fails.
-
-\COMMENTS
-Performs the same operation as {\small\verb%$@%}.
-
-\ENDDOC
-\DOC{APPEND\_CONV}
-
-\TYPE {\small\verb%APPEND_CONV : conv%}\egroup
-
-\SYNOPSIS
-Computes by inference the result of appending two object-language lists.
-
-\DESCRIBE
-For any pair of object language lists of the form {\small\verb%"[x1;...;xn]"%} and
-{\small\verb%"[y1;...;ym]"%}, the result of evaluating
-{\par\samepage\setseps\small
-\begin{verbatim}
- APPEND_CONV "APPEND [x1;...;xn] [y1;...;ym]"
-\end{verbatim}
-}
-\noindent is the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- APPEND [x1;...;xn] [y1;...;ym] = [x1;...;xn;y1;...;ym]
-\end{verbatim}
-}
-\noindent The length of either list (or both) may be 0.
-
-\FAILURE
-{\small\verb%APPEND_CONV tm%} fails if {\small\verb%tm%} is not of the form {\small\verb%"APPEND l1 l2"%}, where
-{\small\verb%l1%} and {\small\verb%l2%} are (possibly empty) object-language lists of the forms
-{\small\verb%"[x1;...;xn]"%} and {\small\verb%"[y1;...;ym]"%}.
-
-\ENDDOC
-
-\DOC{append\_openw}
-
-\TYPE {\small\verb%append_openw : (string -> string)%}\egroup
-
-\SYNOPSIS
-Opens a port for appending to a named file.
-
-\DESCRIBE
-When applied to a filename {\small\verb%`name`%}, the function {\small\verb%append_openw%} opens the file
-{\small\verb%name%} for writing, such that existing contents are appended to rather than
-overwritten. It returns a port descriptor string, which can be used by {\small\verb%write%}
-to append to the file, and by {\small\verb%close%} to close it.
-
-\EXAMPLE
-The following example assumes that HOL is being run under Unix. It will
-overwrite an existing file {\small\verb%test-file%} in the current directory.
-{\par\samepage\setseps\small
-\begin{verbatim}
- #system `echo -n 'Hello ' >test-file`;;
- 0 : int
-
- #let port = append_openw `test-file`;;
- port = `%test-file` : string
-
- #write(port,`world`);;
- () : void
-
- #close port;;
- () : void
-
- #system `cat test-file`;;
- Hello world0 : int
-\end{verbatim}
-}
-\SEEALSO
-close, openi, openw, read, write.
-
-\ENDDOC
-\DOC{apply\_proof}
-
-\TYPE {\small\verb%apply_proof : (subgoals -> thm)%}\egroup
-
-\SYNOPSIS
-This function is for internal use only and is to be deleted from a future
-version of the system. It should not be used.
-
-\ENDDOC
-\DOC{AP\_TERM}
-
-\TYPE {\small\verb%AP_TERM : (term -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Applies a function to both sides of an equational theorem.
-
-\DESCRIBE
-When applied to a term {\small\verb%f%} and a theorem {\small\verb%A |- x = y%}, the
-inference rule {\small\verb%AP_TERM%} returns the theorem {\small\verb%A |- f x = f y%}.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- x = y
- ---------------- AP_TERM "f"
- A |- f x = f y
-\end{verbatim}
-}
-\FAILURE
-Fails unless the theorem is equational and the supplied term is a function
-whose domain type is the same as the type of both sides of the equation.
-
-\SEEALSO
-AP_THM, MK_COMB.
-
-\ENDDOC
-\DOC{AP\_TERM\_TAC}
-
-\TYPE {\small\verb%AP_TERM_TAC : tactic%}\egroup
-
-\SYNOPSIS
-Strips a function application from both sides of an equational goal.
-
-\DESCRIBE
-{\small\verb%AP_TERM_TAC%} reduces a goal of the form {\small\verb%A ?- f x = f y%} by stripping away
-the function applications, giving the new goal {\small\verb%A ?- x = y%}.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A ?- f x = f y
- ================ AP_TERM_TAC
- A ?- x = y
-\end{verbatim}
-}
-\FAILURE
-Fails unless the goal is equational, with both sides being applications
-of the same function.
-
-\SEEALSO
-AP_TERM, AP_THM.
-
-\ENDDOC
-\DOC{AP\_THM}
-
-\TYPE {\small\verb%AP_THM : (thm -> term -> thm)%}\egroup
-
-\SYNOPSIS
-Proves equality of equal functions applied to a term.
-
-\DESCRIBE
-When applied to a theorem {\small\verb%A |- f = g%} and a term {\small\verb%x%}, the inference
-rule {\small\verb%AP_THM%} returns the theorem {\small\verb%A |- f x = g x%}.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- f = g
- ---------------- AP_THM (A |- f = g) "x"
- A |- f x = g x
-\end{verbatim}
-}
-\FAILURE
-Fails unless the conclusion of the theorem is an equation, both sides
-of which are functions whose domain type is the same as that of the
-supplied term.
-
-\COMMENTS
-The type of {\small\verb%AP_THM%} is shown by the system as {\small\verb%thm -> conv%}.
-
-\SEEALSO
-AP_TERM, ETA_CONV, EXT, MK_COMB.
-
-\ENDDOC
-\DOC{AP\_THM\_TAC}
-
-\TYPE {\small\verb%AP_THM_TAC : tactic%}\egroup
-
-\SYNOPSIS
-Strips identical operands from functions on both sides of an equation.
-
-\DESCRIBE
-When applied to a goal of the form {\small\verb%A ?- f x = g x%}, the tactic {\small\verb%AP_THM_TAC%}
-strips away the operands of the function application:
-{\par\samepage\setseps\small
-\begin{verbatim}
- A ?- f x = g x
- ================ AP_THM_TAC
- A ?- f = g
+ A ?- f x = g x
+ ================ AP_THM_TAC
+ A ?- f = g
\end{verbatim}
}
\FAILURE
@@ -1149,41 +917,41 @@ can be 0), and otherwise fails.
is_type.
\ENDDOC
-\DOC{ascii}
+\DOC{ascii\_code}
-\TYPE {\small\verb%ascii : (int -> string)%}\egroup
+\TYPE {\small\verb%ascii_code : (string -> int)%}\egroup
\SYNOPSIS
-Maps an integer to the corresponding ASCII character.
+Maps a character to corresponding ASCII numeric code.
\DESCRIBE
-When given an integer, {\small\verb%ascii%} returns a string consisting of
-the single character corresponding to that integer under the ASCII
-encoding.
+When given a string, {\small\verb%ascii_code%} returns the numeric encoding in the
+ASCII character set of the first character of that string.
\FAILURE
-Fails unless the integer supplied is in the range {\small\verb%0 <= x < 128%}.
+Fails if the string is empty ({\small\verb%``%}).
\SEEALSO
-ascii_code, int_of_string, is_alphanum, is_letter, string_of_int.
+ascii, int_of_string, is_alphanum, is_letter, string_of_int.
\ENDDOC
-\DOC{ascii\_code}
+\DOC{ascii}
-\TYPE {\small\verb%ascii_code : (string -> int)%}\egroup
+\TYPE {\small\verb%ascii : (int -> string)%}\egroup
\SYNOPSIS
-Maps a character to corresponding ASCII numeric code.
+Maps an integer to the corresponding ASCII character.
\DESCRIBE
-When given a string, {\small\verb%ascii_code%} returns the numeric encoding in the
-ASCII character set of the first character of that string.
+When given an integer, {\small\verb%ascii%} returns a string consisting of
+the single character corresponding to that integer under the ASCII
+encoding.
\FAILURE
-Fails if the string is empty ({\small\verb%``%}).
+Fails unless the integer supplied is in the range {\small\verb%0 <= x < 128%}.
\SEEALSO
-ascii, int_of_string, is_alphanum, is_letter, string_of_int.
+ascii_code, int_of_string, is_alphanum, is_letter, string_of_int.
\ENDDOC
\DOC{ASM\_CASES\_TAC}
@@ -1813,41 +1581,6 @@ of the current theory. It will fail if t
axioms, definition, load_axiom, load_axioms, new_axiom, print_theory, theorem.
\ENDDOC
-\DOC{axioms}
-
-\TYPE {\small\verb%axioms : (string -> (string # thm) list)%}\egroup
-
-\SYNOPSIS
-Returns the axioms of a given theory segment of the current theory.
-
-\DESCRIBE
-A call {\small\verb%axioms `thy`%} returns the axioms of the theory segment {\small\verb%thy%} together
-with their names. The theory segment {\small\verb%thy%} must be part of the current theory.
-The names are those given to the axioms by the user when they were originally
-added to the theory segment (by a call to {\small\verb%new_axiom%}). The name of the current
-theory segment can be abbreviated by {\small\verb%`-`%}.
-
-\FAILURE
-The call {\small\verb%axioms `thy`%} will fail if the theory segment {\small\verb%thy%} is not
-part of the current theory.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#axioms `bool`;;
-[(`SELECT_AX`, |- !P x. P x ==> P($@ P));
- (`ETA_AX`, |- !t. (\x. t x) = t);
- (`IMP_ANTISYM_AX`,
- |- !t1 t2. (t1 ==> t2) ==> (t2 ==> t1) ==> (t1 = t2));
- (`BOOL_CASES_AX`, |- !t. (t = T) \/ (t = F));
- (`ARB_THM`, |- $= = $=)]
-: (string # thm) list
-\end{verbatim}
-}
-\SEEALSO
-axiom, definitions, load_axiom, load_axioms, new_axiom, print_theory, theorems.
-
-\ENDDOC
\DOC{axiom\_lfn}
\TYPE {\small\verb%axiom_lfn : (string list -> thm)%}\egroup
@@ -1922,41 +1655,39 @@ autoload, autoload_theory, axiom, axioms
undo_autoload.
\ENDDOC
-\DOC{B}
-
-\TYPE {\small\verb%B : ((* -> **) -> (*** -> *) -> *** -> **)%}\egroup
-
-\SYNOPSIS
-Performs curried function-composition: {\small\verb%B f g x%} = {\small\verb%f (g x)%}.
-
-\FAILURE
-Never fails.
-
-\SEEALSO
-\#, C, CB, Co, I, K, KI, o, oo, S, W.
-
-\ENDDOC
-\DOC{b}
+\DOC{axioms}
-\TYPE {\small\verb%b : (void -> void)%}\egroup
+\TYPE {\small\verb%axioms : (string -> (string # thm) list)%}\egroup
\SYNOPSIS
-Restores the proof state undoing the effects of a previous expansion.
+Returns the axioms of a given theory segment of the current theory.
\DESCRIBE
-The function {\small\verb%b%} is part of the subgoal package. It is an abbreviation for the
-function {\small\verb%backup%}. For a description of the subgoal package, see
-{\small\verb%set_goal%}.
+A call {\small\verb%axioms `thy`%} returns the axioms of the theory segment {\small\verb%thy%} together
+with their names. The theory segment {\small\verb%thy%} must be part of the current theory.
+The names are those given to the axioms by the user when they were originally
+added to the theory segment (by a call to {\small\verb%new_axiom%}). The name of the current
+theory segment can be abbreviated by {\small\verb%`-`%}.
\FAILURE
-As for {\small\verb%backup%}.
-
-\USES
-Back tracking in a goal-directed proof to undo errors or try different tactics.
+The call {\small\verb%axioms `thy`%} will fail if the theory segment {\small\verb%thy%} is not
+part of the current theory.
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#axioms `bool`;;
+[(`SELECT_AX`, |- !P x. P x ==> P($@ P));
+ (`ETA_AX`, |- !t. (\x. t x) = t);
+ (`IMP_ANTISYM_AX`,
+ |- !t1 t2. (t1 ==> t2) ==> (t2 ==> t1) ==> (t1 = t2));
+ (`BOOL_CASES_AX`, |- !t. (t = T) \/ (t = F));
+ (`ARB_THM`, |- $= = $=)]
+: (string # thm) list
+\end{verbatim}
+}
\SEEALSO
-backup, backup_limit, e, expand, expandf, g, get_state, p, print_state, r,
-rotate, save_top_thm, set_goal, set_state, top_goal, top_thm.
+axiom, definitions, load_axiom, load_axioms, new_axiom, print_theory, theorems.
\ENDDOC
\DOC{backup}
@@ -2183,6 +1914,43 @@ NOT_CLAUSES, OR_CLAUSES, PAIR, REFL_CLAU
SND.
\ENDDOC
+\DOC{b}
+
+\TYPE {\small\verb%b : (void -> void)%}\egroup
+
+\SYNOPSIS
+Restores the proof state undoing the effects of a previous expansion.
+
+\DESCRIBE
+The function {\small\verb%b%} is part of the subgoal package. It is an abbreviation for the
+function {\small\verb%backup%}. For a description of the subgoal package, see
+{\small\verb%set_goal%}.
+
+\FAILURE
+As for {\small\verb%backup%}.
+
+\USES
+Back tracking in a goal-directed proof to undo errors or try different tactics.
+
+\SEEALSO
+backup, backup_limit, e, expand, expandf, g, get_state, p, print_state, r,
+rotate, save_top_thm, set_goal, set_state, top_goal, top_thm.
+
+\ENDDOC
+\DOC{B}
+
+\TYPE {\small\verb%B : ((* -> **) -> (*** -> *) -> *** -> **)%}\egroup
+
+\SYNOPSIS
+Performs curried function-composition: {\small\verb%B f g x%} = {\small\verb%f (g x)%}.
+
+\FAILURE
+Never fails.
+
+\SEEALSO
+\#, C, CB, Co, I, K, KI, o, oo, S, W.
+
+\ENDDOC
\DOC{BETA\_CONV}
\TYPE {\small\verb%BETA_CONV : conv%}\egroup
@@ -2339,23 +2107,6 @@ Fails unless the term is an abstraction.
body, dest_abs.
\ENDDOC
-\DOC{body}
-
-\TYPE {\small\verb%body : (term -> term)%}\egroup
-
-\SYNOPSIS
-Returns the body of an abstraction.
-
-\DESCRIBE
-{\small\verb%body "\var. t"%} returns {\small\verb%"t"%}.
-
-\FAILURE
-Fails unless the term is an abstraction.
-
-\SEEALSO
-bndvar, dest_abs.
-
-\ENDDOC
\DOC{BODY\_CONJUNCTS}
\TYPE {\small\verb%BODY_CONJUNCTS : (thm -> thm list)%}\egroup
@@ -2393,6 +2144,23 @@ The following illustrates how a typical
CONJ, CONJUNCT1, CONJUNCT2, CONJUNCTS, CONJ_TAC.
\ENDDOC
+\DOC{body}
+
+\TYPE {\small\verb%body : (term -> term)%}\egroup
+
+\SYNOPSIS
+Returns the body of an abstraction.
+
+\DESCRIBE
+{\small\verb%body "\var. t"%} returns {\small\verb%"t"%}.
+
+\FAILURE
+Fails unless the term is an abstraction.
+
+\SEEALSO
+bndvar, dest_abs.
+
+\ENDDOC
\DOC{BOOL\_CASES\_TAC}
\TYPE {\small\verb%BOOL_CASES_TAC : (term -> tactic)%}\egroup
@@ -2523,6 +2291,34 @@ or {\small\verb%k%} is greater than the
\ENDDOC
+\DOC{BUTLAST\_CONV}
+
+\TYPE {\small\verb%BUTLAST_CONV : conv%}\egroup
+
+\SYNOPSIS
+Computes by inference the result of stripping the last element of a list.
+
+\DESCRIBE
+For any object language list of the form {\small\verb%"[x0;...x(n-1)]"%} ,
+the result of evaluating
+{\par\samepage\setseps\small
+\begin{verbatim}
+ BUTLAST_CONV "BUTLAST [x0;...;x(n-1)]"
+\end{verbatim}
+}
+\noindent is the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- BUTLAST [x0;...;x(n-1)] = [x0;...; x(n-2)]
+\end{verbatim}
+}
+
+
+\FAILURE
+{\small\verb%BUTLAST_CONV tm%} fails if {\small\verb%tm%} is an empty list.
+
+\ENDDOC
+
\DOC{butlast}
\TYPE {\small\verb%butlast : (* list -> * list)%}\egroup
@@ -2569,48 +2365,6 @@ or {\small\verb%k%} is greater than the
\ENDDOC
-\DOC{BUTLAST\_CONV}
-
-\TYPE {\small\verb%BUTLAST_CONV : conv%}\egroup
-
-\SYNOPSIS
-Computes by inference the result of stripping the last element of a list.
-
-\DESCRIBE
-For any object language list of the form {\small\verb%"[x0;...x(n-1)]"%} ,
-the result of evaluating
-{\par\samepage\setseps\small
-\begin{verbatim}
- BUTLAST_CONV "BUTLAST [x0;...;x(n-1)]"
-\end{verbatim}
-}
-\noindent is the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- BUTLAST [x0;...;x(n-1)] = [x0;...; x(n-2)]
-\end{verbatim}
-}
-
-
-\FAILURE
-{\small\verb%BUTLAST_CONV tm%} fails if {\small\verb%tm%} is an empty list.
-
-\ENDDOC
-
-\DOC{C}
-
-\TYPE {\small\verb%C : ((* -> ** -> ***) -> ** -> * -> ***)%}\egroup
-
-\SYNOPSIS
-Permutes first two arguments to curried function: {\small\verb%C f x y%} = {\small\verb%f y x%}.
-
-\FAILURE
-Never fails.
-
-\SEEALSO
-\#, B, CB, Co, I, K, KI, o, oo, S, W.
-
-\ENDDOC
\DOC{cached\_theories}
\TYPE {\small\verb%cached_theories : (void -> (string # bool) list)%}\egroup
@@ -2756,6 +2510,20 @@ a contradiction, then {\small\verb%t%} m
CONTR, CONTRAPOS, CONTR_TAC, NOT_ELIM.
\ENDDOC
+\DOC{C}
+
+\TYPE {\small\verb%C : ((* -> ** -> ***) -> ** -> * -> ***)%}\egroup
+
+\SYNOPSIS
+Permutes first two arguments to curried function: {\small\verb%C f x y%} = {\small\verb%f y x%}.
+
+\FAILURE
+Never fails.
+
+\SEEALSO
+\#, B, CB, Co, I, K, KI, o, oo, S, W.
+
+\ENDDOC
\DOC{CHANGED\_CONV}
\TYPE {\small\verb%CHANGED_CONV : (conv -> conv)%}\egroup
@@ -3180,44 +2948,44 @@ Never fails.
\#, B, C, CB, I, K, KI, o, oo, S, W.
\ENDDOC
-\DOC{com}
+\DOC{combine}
-\TYPE {\small\verb%$com : ((* list # ** list) -> (* # **) list)%}\egroup
+\TYPE {\small\verb%combine : ((* list # ** list) -> (* # **) list)%}\egroup
\SYNOPSIS
-Converts a pair of lists into a list of pairs (infix version).
+Converts a pair of lists into a list of pairs.
\DESCRIBE
-{\small\verb%[x1;...;xn] com [y1;...;yn]%} returns {\small\verb%[(x1,y1);...;(xn,yn)]%}.
+{\small\verb%combine ([x1;...;xn],[y1;...;yn])%} returns {\small\verb%[(x1,y1);...;(xn,yn)]%}.
\FAILURE
Fails if the two lists are of different lengths.
\COMMENTS
-Has the same effect as {\small\verb%combine%}.
+Has the same effect as {\small\verb%com%}.
\SEEALSO
-combine, split.
+com, split.
\ENDDOC
-\DOC{combine}
+\DOC{com}
-\TYPE {\small\verb%combine : ((* list # ** list) -> (* # **) list)%}\egroup
+\TYPE {\small\verb%$com : ((* list # ** list) -> (* # **) list)%}\egroup
\SYNOPSIS
-Converts a pair of lists into a list of pairs.
+Converts a pair of lists into a list of pairs (infix version).
\DESCRIBE
-{\small\verb%combine ([x1;...;xn],[y1;...;yn])%} returns {\small\verb%[(x1,y1);...;(xn,yn)]%}.
+{\small\verb%[x1;...;xn] com [y1;...;yn]%} returns {\small\verb%[(x1,y1);...;(xn,yn)]%}.
\FAILURE
Fails if the two lists are of different lengths.
\COMMENTS
-Has the same effect as {\small\verb%com%}.
+Has the same effect as {\small\verb%combine%}.
\SEEALSO
-com, split.
+combine, split.
\ENDDOC
\DOC{compile}
@@ -3585,6 +3353,60 @@ The theorems returned in these three cas
{\small\verb%c%} is {\small\verb%T%} or {\small\verb%F%}, or {\small\verb%u%} and {\small\verb%v%} are alpha-equivalent.
\ENDDOC
+\DOC{CONJ\_DISCH}
+
+\TYPE {\small\verb%CONJ_DISCH : (term -> thm -> thm)%}\egroup
+
+\SYNOPSIS
+Discharges an assumption and conjoins it to both sides of an equation.
+
+\DESCRIBE
+Given an term {\small\verb%t%} and a theorem {\small\verb%A |- t1 = t2%}, which is an equation between
+boolean terms, {\small\verb%CONJ_DISCH%} returns {\small\verb%A - {t} |- (t /\ t1) = (t /\ t2)%}, i.e.
+conjoins {\small\verb%t%} to both sides of the equation, removing {\small\verb%t%} from the assumptions
+if it was there.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t1 = t2
+ ------------------------------ CONJ_DISCH "t"
+ A - {t} |- t /\ t1 = t /\ t2
+\end{verbatim}
+}
+\FAILURE
+Fails unless the theorem is an equation, both sides of which, and the term
+provided are of type {\small\verb%bool%}.
+
+\SEEALSO
+CONJ_DISCHL.
+
+\ENDDOC
+\DOC{CONJ\_DISCHL}
+
+\TYPE {\small\verb%CONJ_DISCHL : (term list -> thm -> thm)%}\egroup
+
+\SYNOPSIS
+Conjoins multiple assumptions to both sides of an equation.
+
+\DESCRIBE
+Given a term list {\small\verb%[t1;...;tn]%} and a theorem whose conclusion is an equation
+between boolean terms, {\small\verb%CONJ_DISCHL%} conjoins all the terms
+in the list to both sides of the equation, and removes any of the terms which
+were in the assumption list.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- s = t
+ -------------------------------------------------------- CONJ_DISCHL
+ A - {t1,...,tn} |- (t1/\.../\tn/\s) = (t1/\.../\tn/\t) ["t1";...;"tn"]
+\end{verbatim}
+}
+\FAILURE
+Fails unless the theorem is an equation, both sides of which, and all the terms
+provided, are of type {\small\verb%bool%}.
+
+\SEEALSO
+CONJ_DISCH.
+
+\ENDDOC
\DOC{CONJ}
\TYPE {\small\verb%CONJ : (thm -> thm -> thm)%}\egroup
@@ -3607,6 +3429,148 @@ Never fails.
BODY_CONJUNCTS, CONJUNCT1, CONJUNCT2, CONJ_PAIR, LIST_CONJ, CONJ_LIST, CONJUNCTS.
\ENDDOC
+\DOC{CONJ\_LIST}
+
+\TYPE {\small\verb%CONJ_LIST : (int -> thm -> thm list)%}\egroup
+
+\SYNOPSIS
+Extracts a list of conjuncts from a theorem (non-flattening version).
+
+\DESCRIBE
+{\small\verb%CONJ_LIST%} is the proper inverse of {\small\verb%LIST_CONJ%}. Unlike {\small\verb%CONJUNCTS%} which
+recursively splits as many conjunctions as possible both to the left and to
+the right, {\small\verb%CONJ_LIST%} splits the top-level conjunction and then splits
+(recursively) only the right conjunct. The integer argument is required
+because the term {\small\verb%tn%} may itself be a conjunction. A list of {\small\verb%n%} theorems is
+returned.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t1 /\ (t2 /\ ( ... /\ tn)...)
+ ------------------------------------ CONJ_LIST n (A |- t1 /\ ... /\ tn)
+ A |- t1 A |- t2 ... A |- tn
+\end{verbatim}
+}
+\FAILURE
+Fails if the integer argument ({\small\verb%n%}) is less than one, or if the input theorem
+has less than {\small\verb%n%} conjuncts.
+
+\EXAMPLE
+Suppose the identifier {\small\verb%th%} is bound to the theorem:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- (x /\ y) /\ z /\ w
+\end{verbatim}
+}
+\noindent Here are some applications of {\small\verb%CONJ_LIST%} to {\small\verb%th%}:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #CONJ_LIST 0 th;;
+ evaluation failed CONJ_LIST
+
+ #CONJ_LIST 1 th;;
+ [A |- (x /\ y) /\ z /\ w] : thm list
+
+ #CONJ_LIST 2 th;;
+ [A |- x /\ y; A |- z /\ w] : thm list
+
+ #CONJ_LIST 3 th;;
+ [A |- x /\ y; A |- z; A |- w] : thm list
+
+ #CONJ_LIST 4 th;;
+ evaluation failed CONJ_LIST
+\end{verbatim}
+}
+\SEEALSO
+BODY_CONJUNCTS, LIST_CONJ, CONJUNCTS, CONJ, CONJUNCT1, CONJUNCT2, CONJ_PAIR.
+
+\ENDDOC
+\DOC{CONJ\_PAIR}
+
+\TYPE {\small\verb%CONJ_PAIR : (thm -> (thm # thm))%}\egroup
+
+\SYNOPSIS
+Extracts both conjuncts of a conjunction.
+
+\DESCRIBE
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t1 /\ t2
+ ---------------------- CONJ_PAIR
+ A |- t1 A |- t2
+\end{verbatim}
+}
+\noindent The two resultant theorems are returned as a pair.
+
+\FAILURE
+Fails if the input theorem is not a conjunction.
+
+\SEEALSO
+BODY_CONJUNCTS, CONJUNCT1, CONJUNCT2, CONJ, LIST_CONJ, CONJ_LIST, CONJUNCTS.
+
+\ENDDOC
+\DOC{CONJ\_SET\_CONV}
+
+\TYPE {\small\verb%CONJ_SET_CONV : (term list -> term list -> thm)%}\egroup
+
+\SYNOPSIS
+Proves the equivalence of the conjunctions of two equal sets of terms.
+
+\DESCRIBE
+The arguments to {\small\verb%CONJ_SET_CONV%} are two lists of terms {\small\verb%[t1;...;tn]%} and
+{\small\verb%[u1;...;um]%}. If these are equal when considered as sets, that is if the sets
+{\par\samepage\setseps\small
+\begin{verbatim}
+ {t1,...,tn} and {u1,...,um}
+\end{verbatim}
+}
+\noindent are equal, then {\small\verb%CONJ_SET_CONV%} returns the theorem:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- (t1 /\ ... /\ tn) = (u1 /\ ... /\ um)
+\end{verbatim}
+}
+\noindent Otherwise {\small\verb%CONJ_SET_CONV%} fails.
+
+\FAILURE
+{\small\verb%CONJ_SET_CONV [t1;...;tn] [u1;...;um]%} fails if {\small\verb%[t1,...,tn]%} and
+{\small\verb%[u1,...,um]%}, regarded as sets of terms, are not equal. Also fails
+if any {\small\verb%ti%} or {\small\verb%ui%} does not have type {\small\verb%bool%}.
+
+\USES
+Used to order conjuncts. First sort a list of conjuncts {\small\verb%l1%} into the
+desired order to get a new list {\small\verb%l2%}, then call {\small\verb%CONJ_SET_CONV l1 l2%}.
+
+\COMMENTS
+This is not a true conversion, so perhaps it ought to be called something else.
+
+\SEEALSO
+CONJUNCTS_CONV.
+
+\ENDDOC
+\DOC{CONJ\_TAC}
+
+\TYPE {\small\verb%CONJ_TAC : tactic%}\egroup
+
+\SYNOPSIS
+Reduces a conjunctive goal to two separate subgoals.
+
+\DESCRIBE
+When applied to a goal {\small\verb%A ?- t1 /\ t2%}, the tactic {\small\verb%CONJ_TAC%} reduces it to the
+two subgoals corresponding to each conjunct separately.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A ?- t1 /\ t2
+ ====================== CONJ_TAC
+ A ?- t1 A ?- t2
+\end{verbatim}
+}
+\FAILURE
+Fails unless the conclusion of the goal is a conjunction.
+
+\SEEALSO
+STRIP_TAC.
+
+\ENDDOC
\DOC{CONJUNCT1}
\TYPE {\small\verb%CONJUNCT1 : (thm -> thm)%}\egroup
@@ -3651,42 +3615,40 @@ Fails unless the input theorem is a conj
BODY_CONJUNCTS, CONJUNCT1, CONJ_PAIR, CONJ, LIST_CONJ, CONJ_LIST, CONJUNCTS.
\ENDDOC
-\DOC{CONJUNCTS}
+\DOC{CONJUNCTS\_CONV}
-\TYPE {\small\verb%CONJUNCTS : (thm -> thm list)%}\egroup
+\TYPE {\small\verb%CONJUNCTS_CONV : ((term # term) -> thm)%}\egroup
\SYNOPSIS
-Recursively splits conjunctions into a list of conjuncts.
+Prove equivalence under idempotence, symmetry and associativity of conjunction.
\DESCRIBE
-Flattens out all conjuncts, regardless of grouping. Returns a singleton list
-if the input theorem is not a conjunction.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- t1 /\ t2 /\ ... /\ tn
- ----------------------------------- CONJUNCTS
- A |- t1 A |- t2 ... A |- tn
-\end{verbatim}
-}
+{\small\verb%CONJUNCTS_CONV%} takes a pair of terms {\small\verb%"t1"%} and {\small\verb%"t2"%}, and proves
+{\small\verb%|- t1 = t2%} if {\small\verb%t1%} and {\small\verb%t2%} are equivalent up to idempotence, symmetry and
+associativity of conjunction. That is, if {\small\verb%t1%} and {\small\verb%t2%} are two (different)
+arbitrarily-nested conjunctions of the same set of terms, then {\small\verb%CONJUNCTS_CONV
+(t1,t2)%} returns {\small\verb%|- t1 = t2%}. Otherwise, it fails.
+
\FAILURE
-Never fails.
+Fails if {\small\verb%t1%} and {\small\verb%t2%} are not equivalent, as described above.
\EXAMPLE
-Suppose the identifier {\small\verb%th%} is bound to the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- (x /\ y) /\ z /\ w
-\end{verbatim}
-}
-\noindent Application of {\small\verb%CONJUNCTS%} to {\small\verb%th%} returns the following list of
-theorems:
{\par\samepage\setseps\small
\begin{verbatim}
- [A |- x; A |- y; A |- z; A |- w] : thm list
+#CONJUNCTS_CONV ("(P /\ Q) /\ R", "R /\ (Q /\ R) /\ P");;
+|- (P /\ Q) /\ R = R /\ (Q /\ R) /\ P
\end{verbatim}
}
+\USES
+Used to reorder a conjunction. First sort the conjuncts in a term {\small\verb%t1%} into
+the desired order (e.g. lexicographic order, for normalization) to get a new
+term {\small\verb%t2%}, then call {\small\verb%CONJUNCTS_CONV(t1,t2)%}.
+
+\COMMENTS
+This is not a true conversion, so perhaps it ought to be called something else.
+
\SEEALSO
-BODY_CONJUNCTS, CONJ_LIST, LIST_CONJ, CONJ, CONJUNCT1, CONJUNCT2, CONJ_PAIR.
+CONJ_SET_CONV.
\ENDDOC
\DOC{conjuncts}
@@ -3739,40 +3701,90 @@ introduce {\small\verb%list_dest_conj%}
list_mk_conj, dest_conj.
\ENDDOC
-\DOC{CONJUNCTS\_CONV}
+\DOC{CONJUNCTS}
-\TYPE {\small\verb%CONJUNCTS_CONV : ((term # term) -> thm)%}\egroup
+\TYPE {\small\verb%CONJUNCTS : (thm -> thm list)%}\egroup
\SYNOPSIS
-Prove equivalence under idempotence, symmetry and associativity of conjunction.
+Recursively splits conjunctions into a list of conjuncts.
\DESCRIBE
-{\small\verb%CONJUNCTS_CONV%} takes a pair of terms {\small\verb%"t1"%} and {\small\verb%"t2"%}, and proves
-{\small\verb%|- t1 = t2%} if {\small\verb%t1%} and {\small\verb%t2%} are equivalent up to idempotence, symmetry and
-associativity of conjunction. That is, if {\small\verb%t1%} and {\small\verb%t2%} are two (different)
-arbitrarily-nested conjunctions of the same set of terms, then {\small\verb%CONJUNCTS_CONV
-(t1,t2)%} returns {\small\verb%|- t1 = t2%}. Otherwise, it fails.
-
+Flattens out all conjuncts, regardless of grouping. Returns a singleton list
+if the input theorem is not a conjunction.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t1 /\ t2 /\ ... /\ tn
+ ----------------------------------- CONJUNCTS
+ A |- t1 A |- t2 ... A |- tn
+\end{verbatim}
+}
\FAILURE
-Fails if {\small\verb%t1%} and {\small\verb%t2%} are not equivalent, as described above.
+Never fails.
\EXAMPLE
+Suppose the identifier {\small\verb%th%} is bound to the theorem:
{\par\samepage\setseps\small
\begin{verbatim}
-#CONJUNCTS_CONV ("(P /\ Q) /\ R", "R /\ (Q /\ R) /\ P");;
-|- (P /\ Q) /\ R = R /\ (Q /\ R) /\ P
+ A |- (x /\ y) /\ z /\ w
\end{verbatim}
}
-\USES
-Used to reorder a conjunction. First sort the conjuncts in a term {\small\verb%t1%} into
-the desired order (e.g. lexicographic order, for normalization) to get a new
-term {\small\verb%t2%}, then call {\small\verb%CONJUNCTS_CONV(t1,t2)%}.
+\noindent Application of {\small\verb%CONJUNCTS%} to {\small\verb%th%} returns the following list of
+theorems:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ [A |- x; A |- y; A |- z; A |- w] : thm list
+\end{verbatim}
+}
+\SEEALSO
+BODY_CONJUNCTS, CONJ_LIST, LIST_CONJ, CONJ, CONJUNCT1, CONJUNCT2, CONJ_PAIR.
+
+\ENDDOC
+\DOC{CONJUNCTS\_THEN2}
+
+\TYPE {\small\verb%CONJUNCTS_THEN2 : (thm_tactic -> thm_tactic -> thm_tactic)%}\egroup
+
+\SYNOPSIS
+Applies two theorem-tactics to the corresponding conjuncts of a theorem.
+
+\DESCRIBE
+{\small\verb%CONJUNCTS_THEN2%} takes two theorem-tactics, {\small\verb%f1%} and {\small\verb%f2%}, and a theorem {\small\verb%t%}
+whose conclusion must be a conjunction. {\small\verb%CONJUNCTS_THEN2%} breaks {\small\verb%t%} into two
+new theorems, {\small\verb%t1%} and {\small\verb%t2%} which are {\small\verb%CONJUNCT1%} and {\small\verb%CONJUNCT2%} of {\small\verb%t%}
+respectively, and then returns the tactic {\small\verb%f1 t1 THEN f2 t2%}. Thus
+{\par\samepage\setseps\small
+\begin{verbatim}
+ CONJUNCTS_THEN2 f1 f2 (A |- l /\ r) = f1 (A |- l) THEN f2 (A |- r)
+\end{verbatim}
+}
+\noindent so if
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A1 ?- t1 A2 ?- t2
+ ========== f1 (A |- l) ========== f2 (A |- r)
+ A2 ?- t2 A3 ?- t3
+\end{verbatim}
+}
+\noindent then
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A1 ?- t1
+ ========== CONJUNCTS_THEN2 f1 f2 (A |- l /\ r)
+ A3 ?- t3
+\end{verbatim}
+}
+\FAILURE
+{\small\verb%CONJUNCTS_THEN f%} will fail if applied to a theorem whose conclusion is not a
+conjunction.
\COMMENTS
-This is not a true conversion, so perhaps it ought to be called something else.
+The system shows the type as {\small\verb%(thm_tactic -> thm_tactical)%}.
+
+\USES
+The construction of complex {\small\verb%tactical%}s like {\small\verb%CONJUNCTS_THEN%}.
\SEEALSO
-CONJ_SET_CONV.
+CONJUNCT1, CONJUNCT2, CONJUNCTS, CONJUNCTS_TAC, CONJUNCTS_THEN2,
+STRIP_THM_THEN.
\ENDDOC
\DOC{CONJUNCTS\_THEN}
@@ -3839,390 +3851,146 @@ CONJUNCT1, CONJUNCT2, CONJUNCTS, CONJUNC
STRIP_THM_THEN.
\ENDDOC
-\DOC{CONJUNCTS\_THEN2}
+\DOC{constants}
-\TYPE {\small\verb%CONJUNCTS_THEN2 : (thm_tactic -> thm_tactic -> thm_tactic)%}\egroup
+\TYPE {\small\verb%constants : (string -> term list)%}\egroup
\SYNOPSIS
-Applies two theorem-tactics to the corresponding conjuncts of a theorem.
+Returns a list of the constants defined in a named theory.
\DESCRIBE
-{\small\verb%CONJUNCTS_THEN2%} takes two theorem-tactics, {\small\verb%f1%} and {\small\verb%f2%}, and a theorem {\small\verb%t%}
-whose conclusion must be a conjunction. {\small\verb%CONJUNCTS_THEN2%} breaks {\small\verb%t%} into two
-new theorems, {\small\verb%t1%} and {\small\verb%t2%} which are {\small\verb%CONJUNCT1%} and {\small\verb%CONJUNCT2%} of {\small\verb%t%}
-respectively, and then returns the tactic {\small\verb%f1 t1 THEN f2 t2%}. Thus
-{\par\samepage\setseps\small
-\begin{verbatim}
- CONJUNCTS_THEN2 f1 f2 (A |- l /\ r) = f1 (A |- l) THEN f2 (A |- r)
-\end{verbatim}
-}
-\noindent so if
+The call
{\par\samepage\setseps\small
\begin{verbatim}
- A1 ?- t1 A2 ?- t2
- ========== f1 (A |- l) ========== f2 (A |- r)
- A2 ?- t2 A3 ?- t3
+ constants `thy`
\end{verbatim}
}
-\noindent then
+\noindent where {\small\verb%thy%} is an ancestor theory (the special string {\small\verb%`-`%} means the
+current theory), returns a list of all the constants in that theory.
+
+\FAILURE
+Fails if the named theory does not exist, or is not an ancestor of the
+current theory.
+
+\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
- A1 ?- t1
- ========== CONJUNCTS_THEN2 f1 f2 (A |- l /\ r)
- A3 ?- t3
+#constants `combin`;;
+["I"; "S"; "K"; "$o"] : term list
\end{verbatim}
}
-\FAILURE
-{\small\verb%CONJUNCTS_THEN f%} will fail if applied to a theorem whose conclusion is not a
-conjunction.
-
-\COMMENTS
-The system shows the type as {\small\verb%(thm_tactic -> thm_tactical)%}.
-
-\USES
-The construction of complex {\small\verb%tactical%}s like {\small\verb%CONJUNCTS_THEN%}.
-
\SEEALSO
-CONJUNCT1, CONJUNCT2, CONJUNCTS, CONJUNCTS_TAC, CONJUNCTS_THEN2,
-STRIP_THM_THEN.
+axioms, binders, definitions, infixes, theorems
\ENDDOC
-\DOC{CONJ\_DISCH}
+\DOC{CONTRAPOS\_CONV}
-\TYPE {\small\verb%CONJ_DISCH : (term -> thm -> thm)%}\egroup
+\TYPE {\small\verb%CONTRAPOS_CONV : conv%}\egroup
\SYNOPSIS
-Discharges an assumption and conjoins it to both sides of an equation.
+Proves the equivalence of an implication and its contrapositive.
\DESCRIBE
-Given an term {\small\verb%t%} and a theorem {\small\verb%A |- t1 = t2%}, which is an equation between
-boolean terms, {\small\verb%CONJ_DISCH%} returns {\small\verb%A - {t} |- (t /\ t1) = (t /\ t2)%}, i.e.
-conjoins {\small\verb%t%} to both sides of the equation, removing {\small\verb%t%} from the assumptions
-if it was there.
+When applied to an implication {\small\verb%P ==> Q%}, the conversion {\small\verb%CONTRAPOS_CONV%}
+returns the theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t1 = t2
- ------------------------------ CONJ_DISCH "t"
- A - {t} |- t /\ t1 = t /\ t2
+ |- (P ==> Q) = (~Q ==> ~P)
\end{verbatim}
}
\FAILURE
-Fails unless the theorem is an equation, both sides of which, and the term
-provided are of type {\small\verb%bool%}.
+Fails if applied to a term that is not an implication.
\SEEALSO
-CONJ_DISCHL.
+CONTRAPOS.
\ENDDOC
-\DOC{CONJ\_DISCHL}
+\DOC{CONTRAPOS}
-\TYPE {\small\verb%CONJ_DISCHL : (term list -> thm -> thm)%}\egroup
+\TYPE {\small\verb%CONTRAPOS : (thm -> thm)%}\egroup
\SYNOPSIS
-Conjoins multiple assumptions to both sides of an equation.
+Deduces the contrapositive of an implication.
\DESCRIBE
-Given a term list {\small\verb%[t1;...;tn]%} and a theorem whose conclusion is an equation
-between boolean terms, {\small\verb%CONJ_DISCHL%} conjoins all the terms
-in the list to both sides of the equation, and removes any of the terms which
-were in the assumption list.
+When applied to a theorem {\small\verb%A |- s ==> t%}, the inference rule {\small\verb%CONTRAPOS%}
+returns its contrapositive, {\small\verb%A |- ~t ==> ~s%}.
{\par\samepage\setseps\small
\begin{verbatim}
- A |- s = t
- -------------------------------------------------------- CONJ_DISCHL
- A - {t1,...,tn} |- (t1/\.../\tn/\s) = (t1/\.../\tn/\t) ["t1";...;"tn"]
+ A |- s ==> t
+ ---------------- CONTRAPOS
+ A |- ~t ==> ~s
\end{verbatim}
}
\FAILURE
-Fails unless the theorem is an equation, both sides of which, and all the terms
-provided, are of type {\small\verb%bool%}.
+Fails unless the theorem is an implication.
\SEEALSO
-CONJ_DISCH.
+CCONTR, CONTR, CONTRAPOS_CONV, NOT_ELIM.
\ENDDOC
-\DOC{CONJ\_LIST}
+\DOC{CONTR}
-\TYPE {\small\verb%CONJ_LIST : (int -> thm -> thm list)%}\egroup
+\TYPE {\small\verb%CONTR : (term -> thm -> thm)%}\egroup
\SYNOPSIS
-Extracts a list of conjuncts from a theorem (non-flattening version).
+Implements the intuitionistic contradiction rule.
\DESCRIBE
-{\small\verb%CONJ_LIST%} is the proper inverse of {\small\verb%LIST_CONJ%}. Unlike {\small\verb%CONJUNCTS%} which
-recursively splits as many conjunctions as possible both to the left and to
-the right, {\small\verb%CONJ_LIST%} splits the top-level conjunction and then splits
-(recursively) only the right conjunct. The integer argument is required
-because the term {\small\verb%tn%} may itself be a conjunction. A list of {\small\verb%n%} theorems is
-returned.
+When applied to a term {\small\verb%t%} and a theorem {\small\verb%A |- F%}, the inference rule {\small\verb%CONTR%}
+returns the theorem {\small\verb%A |- t%}.
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t1 /\ (t2 /\ ( ... /\ tn)...)
- ------------------------------------ CONJ_LIST n (A |- t1 /\ ... /\ tn)
- A |- t1 A |- t2 ... A |- tn
+ A |- F
+ -------- CONTR "t"
+ A |- t
\end{verbatim}
}
\FAILURE
-Fails if the integer argument ({\small\verb%n%}) is less than one, or if the input theorem
-has less than {\small\verb%n%} conjuncts.
-
-\EXAMPLE
-Suppose the identifier {\small\verb%th%} is bound to the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- (x /\ y) /\ z /\ w
-\end{verbatim}
-}
-\noindent Here are some applications of {\small\verb%CONJ_LIST%} to {\small\verb%th%}:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #CONJ_LIST 0 th;;
- evaluation failed CONJ_LIST
-
- #CONJ_LIST 1 th;;
- [A |- (x /\ y) /\ z /\ w] : thm list
-
- #CONJ_LIST 2 th;;
- [A |- x /\ y; A |- z /\ w] : thm list
-
- #CONJ_LIST 3 th;;
- [A |- x /\ y; A |- z; A |- w] : thm list
+Fails unless the term has type {\small\verb%bool%} and the theorem has {\small\verb%F%} as its
+conclusion.
- #CONJ_LIST 4 th;;
- evaluation failed CONJ_LIST
-\end{verbatim}
-}
\SEEALSO
-BODY_CONJUNCTS, LIST_CONJ, CONJUNCTS, CONJ, CONJUNCT1, CONJUNCT2, CONJ_PAIR.
+CCONTR, CONTRAPOS, CONTR_TAC, NOT_ELIM.
\ENDDOC
-\DOC{CONJ\_PAIR}
+\DOC{CONTR\_TAC}
-\TYPE {\small\verb%CONJ_PAIR : (thm -> (thm # thm))%}\egroup
+\TYPE {\small\verb%CONTR_TAC : thm_tactic%}\egroup
\SYNOPSIS
-Extracts both conjuncts of a conjunction.
+Solves any goal from contradictory theorem.
\DESCRIBE
+When applied to a contradictory theorem {\small\verb%A' |- F%}, and a goal {\small\verb%A ?- t%},
+the tactic {\small\verb%CONTR_TAC%} completely solves the goal. This is an invalid
+tactic unless {\small\verb%A'%} is a subset of {\small\verb%A%}.
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t1 /\ t2
- ---------------------- CONJ_PAIR
- A |- t1 A |- t2
+ A ?- t
+ ======== CONTR_TAC (A' |- F)
+
\end{verbatim}
}
-\noindent The two resultant theorems are returned as a pair.
-
\FAILURE
-Fails if the input theorem is not a conjunction.
+Fails unless the theorem is contradictory, i.e. has {\small\verb%F%} as its conclusion.
\SEEALSO
-BODY_CONJUNCTS, CONJUNCT1, CONJUNCT2, CONJ, LIST_CONJ, CONJ_LIST, CONJUNCTS.
+CHECK_ASSUME_TAC, CONTR, CCONTR, CONTRAPOS, NOT_ELIM.
\ENDDOC
-\DOC{CONJ\_SET\_CONV}
+\DOC{CONV\_RULE}
-\TYPE {\small\verb%CONJ_SET_CONV : (term list -> term list -> thm)%}\egroup
+\TYPE {\small\verb%CONV_RULE : (conv -> thm -> thm)%}\egroup
\SYNOPSIS
-Proves the equivalence of the conjunctions of two equal sets of terms.
+Makes an inference rule from a conversion.
\DESCRIBE
-The arguments to {\small\verb%CONJ_SET_CONV%} are two lists of terms {\small\verb%[t1;...;tn]%} and
-{\small\verb%[u1;...;um]%}. If these are equal when considered as sets, that is if the sets
-{\par\samepage\setseps\small
-\begin{verbatim}
- {t1,...,tn} and {u1,...,um}
-\end{verbatim}
-}
-\noindent are equal, then {\small\verb%CONJ_SET_CONV%} returns the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- (t1 /\ ... /\ tn) = (u1 /\ ... /\ um)
-\end{verbatim}
-}
-\noindent Otherwise {\small\verb%CONJ_SET_CONV%} fails.
-
-\FAILURE
-{\small\verb%CONJ_SET_CONV [t1;...;tn] [u1;...;um]%} fails if {\small\verb%[t1,...,tn]%} and
-{\small\verb%[u1,...,um]%}, regarded as sets of terms, are not equal. Also fails
-if any {\small\verb%ti%} or {\small\verb%ui%} does not have type {\small\verb%bool%}.
-
-\USES
-Used to order conjuncts. First sort a list of conjuncts {\small\verb%l1%} into the
-desired order to get a new list {\small\verb%l2%}, then call {\small\verb%CONJ_SET_CONV l1 l2%}.
-
-\COMMENTS
-This is not a true conversion, so perhaps it ought to be called something else.
-
-\SEEALSO
-CONJUNCTS_CONV.
-
-\ENDDOC
-\DOC{CONJ\_TAC}
-
-\TYPE {\small\verb%CONJ_TAC : tactic%}\egroup
-
-\SYNOPSIS
-Reduces a conjunctive goal to two separate subgoals.
-
-\DESCRIBE
-When applied to a goal {\small\verb%A ?- t1 /\ t2%}, the tactic {\small\verb%CONJ_TAC%} reduces it to the
-two subgoals corresponding to each conjunct separately.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A ?- t1 /\ t2
- ====================== CONJ_TAC
- A ?- t1 A ?- t2
-\end{verbatim}
-}
-\FAILURE
-Fails unless the conclusion of the goal is a conjunction.
-
-\SEEALSO
-STRIP_TAC.
-
-\ENDDOC
-\DOC{constants}
-
-\TYPE {\small\verb%constants : (string -> term list)%}\egroup
-
-\SYNOPSIS
-Returns a list of the constants defined in a named theory.
-
-\DESCRIBE
-The call
-{\par\samepage\setseps\small
-\begin{verbatim}
- constants `thy`
-\end{verbatim}
-}
-\noindent where {\small\verb%thy%} is an ancestor theory (the special string {\small\verb%`-`%} means the
-current theory), returns a list of all the constants in that theory.
-
-\FAILURE
-Fails if the named theory does not exist, or is not an ancestor of the
-current theory.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#constants `combin`;;
-["I"; "S"; "K"; "$o"] : term list
-\end{verbatim}
-}
-\SEEALSO
-axioms, binders, definitions, infixes, theorems
-
-\ENDDOC
-\DOC{CONTR}
-
-\TYPE {\small\verb%CONTR : (term -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Implements the intuitionistic contradiction rule.
-
-\DESCRIBE
-When applied to a term {\small\verb%t%} and a theorem {\small\verb%A |- F%}, the inference rule {\small\verb%CONTR%}
-returns the theorem {\small\verb%A |- t%}.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- F
- -------- CONTR "t"
- A |- t
-\end{verbatim}
-}
-\FAILURE
-Fails unless the term has type {\small\verb%bool%} and the theorem has {\small\verb%F%} as its
-conclusion.
-
-\SEEALSO
-CCONTR, CONTRAPOS, CONTR_TAC, NOT_ELIM.
-
-\ENDDOC
-\DOC{CONTRAPOS}
-
-\TYPE {\small\verb%CONTRAPOS : (thm -> thm)%}\egroup
-
-\SYNOPSIS
-Deduces the contrapositive of an implication.
-
-\DESCRIBE
-When applied to a theorem {\small\verb%A |- s ==> t%}, the inference rule {\small\verb%CONTRAPOS%}
-returns its contrapositive, {\small\verb%A |- ~t ==> ~s%}.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- s ==> t
- ---------------- CONTRAPOS
- A |- ~t ==> ~s
-\end{verbatim}
-}
-\FAILURE
-Fails unless the theorem is an implication.
-
-\SEEALSO
-CCONTR, CONTR, CONTRAPOS_CONV, NOT_ELIM.
-
-\ENDDOC
-\DOC{CONTRAPOS\_CONV}
-
-\TYPE {\small\verb%CONTRAPOS_CONV : conv%}\egroup
-
-\SYNOPSIS
-Proves the equivalence of an implication and its contrapositive.
-
-\DESCRIBE
-When applied to an implication {\small\verb%P ==> Q%}, the conversion {\small\verb%CONTRAPOS_CONV%}
-returns the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- (P ==> Q) = (~Q ==> ~P)
-\end{verbatim}
-}
-\FAILURE
-Fails if applied to a term that is not an implication.
-
-\SEEALSO
-CONTRAPOS.
-
-\ENDDOC
-\DOC{CONTR\_TAC}
-
-\TYPE {\small\verb%CONTR_TAC : thm_tactic%}\egroup
-
-\SYNOPSIS
-Solves any goal from contradictory theorem.
-
-\DESCRIBE
-When applied to a contradictory theorem {\small\verb%A' |- F%}, and a goal {\small\verb%A ?- t%},
-the tactic {\small\verb%CONTR_TAC%} completely solves the goal. This is an invalid
-tactic unless {\small\verb%A'%} is a subset of {\small\verb%A%}.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A ?- t
- ======== CONTR_TAC (A' |- F)
-
-\end{verbatim}
-}
-\FAILURE
-Fails unless the theorem is contradictory, i.e. has {\small\verb%F%} as its conclusion.
-
-\SEEALSO
-CHECK_ASSUME_TAC, CONTR, CCONTR, CONTRAPOS, NOT_ELIM.
-
-\ENDDOC
-\DOC{CONV\_RULE}
-
-\TYPE {\small\verb%CONV_RULE : (conv -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Makes an inference rule from a conversion.
-
-\DESCRIBE
-If {\small\verb%c%} is a conversion, then {\small\verb%CONV_RULE c%} is an inference rule that applies
-{\small\verb%c%} to the conclusion of a theorem. That is, if {\small\verb%c%} maps a term {\small\verb%"t"%} to the
-theorem {\small\verb%|- t = t'%}, then the rule {\small\verb%CONV_RULE c%} infers {\small\verb%|- t'%} from the
-theorem {\small\verb%|- t%}. More precisely, if {\small\verb%c "t"%} returns {\small\verb%A' |- t = t'%}, then:
+If {\small\verb%c%} is a conversion, then {\small\verb%CONV_RULE c%} is an inference rule that applies
+{\small\verb%c%} to the conclusion of a theorem. That is, if {\small\verb%c%} maps a term {\small\verb%"t"%} to the
+theorem {\small\verb%|- t = t'%}, then the rule {\small\verb%CONV_RULE c%} infers {\small\verb%|- t'%} from the
+theorem {\small\verb%|- t%}. More precisely, if {\small\verb%c "t"%} returns {\small\verb%A' |- t = t'%}, then:
{\par\samepage\setseps\small
\begin{verbatim}
A |- t
@@ -4353,6 +4121,41 @@ increment = - : (int -> int)
uncurry.
\ENDDOC
+\DOC{DEF\_EXISTS\_RULE}
+
+\TYPE {\small\verb%DEF_EXISTS_RULE : (term -> thm)%}\egroup
+
+\SYNOPSIS
+Proves that a function defined by a definitional equation exists.
+
+\DESCRIBE
+This rule accepts a term of the form {\small\verb%"c = ..."%} or {\small\verb%"f x1 ... xn = ..."%}, the
+variables of which may be universally quantified, and returns an existential
+theorem. The resulting theorem is typically used for generating HOL
+specifications.
+
+\FAILURE
+{\small\verb%DEF_EXISTS_RULE%} fails if the definition is not an equation, if there
+is any variable in the right-hand side which does not occur in the
+left-hand side, if the definition is recursive, if there is a free type
+variable, or if the name being defined by the function is not allowed.
+
+\EXAMPLE
+The effect of this rule can be understood more clearly through an
+example:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #DEF_EXISTS_RULE "max a b = ((a < b) => b | a)" ;;
+ |- ?max. !a b. max a b = (a < b => b | a)
+\end{verbatim}
+}
+\COMMENTS
+In later versions of HOL this function may be made internal.
+
+\SEEALSO
+new_definition, new_gen_definition, new_specification.
+
+\ENDDOC
\DOC{define\_finite\_set\_syntax}
\TYPE {\small\verb%define_finite_set_syntax : ((string # string) -> void)%}\egroup
@@ -4712,62 +4515,26 @@ definition of name {\small\verb%def%} in
axiom, definitions, load_definition, load_definitions, new_definition, print_theory, theorem.
\ENDDOC
-\DOC{definitions}
+\DOC{definition\_lfn}
-\TYPE {\small\verb%definitions : (string -> (string # thm) list)%}\egroup
+\TYPE {\small\verb%definition_lfn : (string list -> thm)%}\egroup
\SYNOPSIS
-Returns the constant definitions, type definitions and constant specifications
-of a given theory segment of the current theory.
+Loads a given definition from a given theory.
\DESCRIBE
-A call of {\small\verb%definitions `thy`%} returns the definitions of the theory segment
-{\small\verb%thy%} together with their names. Constant definitions, type definitions and
-constant specifications are all retrieved by the function {\small\verb%definitions%}. The
-theory segment {\small\verb%thy%} must be part of the current theory. The names are those
-given to the definitions by the user when they were originally added to the
-theory segment (by a call, for example, to {\small\verb%new_definition%}). The name of the
-current theory segment can be abbreviated by {\small\verb%`-`%}.
+If {\small\verb%thy%} is an ancestor theory, and {\small\verb%def%} one of its definitions, then the
+call
+{\par\samepage\setseps\small
+\begin{verbatim}
+ definition_lfn [`thy`;`def`]
+\end{verbatim}
+}
+\noindent will return that definition.
\FAILURE
-The call {\small\verb%definitions `thy`%} will fail if the theory segment {\small\verb%thy%} is not
-part of the current theory.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#definitions `combin`;;
-[(`I_DEF`, |- I = S K K);
- (`S_DEF`, |- S = (\f g x. f x(g x)));
- (`K_DEF`, |- K = (\x y. x));
- (`o_DEF`, |- !f g. f o g = (\x. f(g x)))]
-: (string # thm) list
-\end{verbatim}
-}
-\SEEALSO
-axioms, definition, load_definition, load_definitions, new_definition, print_theory, theorems.
-
-\ENDDOC
-\DOC{definition\_lfn}
-
-\TYPE {\small\verb%definition_lfn : (string list -> thm)%}\egroup
-
-\SYNOPSIS
-Loads a given definition from a given theory.
-
-\DESCRIBE
-If {\small\verb%thy%} is an ancestor theory, and {\small\verb%def%} one of its definitions, then the
-call
-{\par\samepage\setseps\small
-\begin{verbatim}
- definition_lfn [`thy`;`def`]
-\end{verbatim}
-}
-\noindent will return that definition.
-
-\FAILURE
-Fails if {\small\verb%thy%} is not an ancestor theory, or if {\small\verb%def%} is not one of its
-definitions.
+Fails if {\small\verb%thy%} is not an ancestor theory, or if {\small\verb%def%} is not one of its
+definitions.
\EXAMPLE
{\par\samepage\setseps\small
@@ -4824,39 +4591,40 @@ autoload, autoload_theory, definition, d
load_definition, load_definitions, undo_autoload.
\ENDDOC
-\DOC{DEF\_EXISTS\_RULE}
+\DOC{definitions}
-\TYPE {\small\verb%DEF_EXISTS_RULE : (term -> thm)%}\egroup
+\TYPE {\small\verb%definitions : (string -> (string # thm) list)%}\egroup
\SYNOPSIS
-Proves that a function defined by a definitional equation exists.
+Returns the constant definitions, type definitions and constant specifications
+of a given theory segment of the current theory.
\DESCRIBE
-This rule accepts a term of the form {\small\verb%"c = ..."%} or {\small\verb%"f x1 ... xn = ..."%}, the
-variables of which may be universally quantified, and returns an existential
-theorem. The resulting theorem is typically used for generating HOL
-specifications.
+A call of {\small\verb%definitions `thy`%} returns the definitions of the theory segment
+{\small\verb%thy%} together with their names. Constant definitions, type definitions and
+constant specifications are all retrieved by the function {\small\verb%definitions%}. The
+theory segment {\small\verb%thy%} must be part of the current theory. The names are those
+given to the definitions by the user when they were originally added to the
+theory segment (by a call, for example, to {\small\verb%new_definition%}). The name of the
+current theory segment can be abbreviated by {\small\verb%`-`%}.
\FAILURE
-{\small\verb%DEF_EXISTS_RULE%} fails if the definition is not an equation, if there
-is any variable in the right-hand side which does not occur in the
-left-hand side, if the definition is recursive, if there is a free type
-variable, or if the name being defined by the function is not allowed.
+The call {\small\verb%definitions `thy`%} will fail if the theory segment {\small\verb%thy%} is not
+part of the current theory.
\EXAMPLE
-The effect of this rule can be understood more clearly through an
-example:
{\par\samepage\setseps\small
\begin{verbatim}
- #DEF_EXISTS_RULE "max a b = ((a < b) => b | a)" ;;
- |- ?max. !a b. max a b = (a < b => b | a)
+#definitions `combin`;;
+[(`I_DEF`, |- I = S K K);
+ (`S_DEF`, |- S = (\f g x. f x(g x)));
+ (`K_DEF`, |- K = (\x y. x));
+ (`o_DEF`, |- !f g. f o g = (\x. f(g x)))]
+: (string # thm) list
\end{verbatim}
}
-\COMMENTS
-In later versions of HOL this function may be made internal.
-
\SEEALSO
-new_definition, new_gen_definition, new_specification.
+axioms, definition, load_definition, load_definitions, new_definition, print_theory, theorems.
\ENDDOC
\DOC{delete\_cache}
@@ -5582,31 +5350,34 @@ is not {\small\verb%T%} or already in th
POP_ASSUM, POP_ASSUM_LIST.
\ENDDOC
-\DOC{DISCH}
+\DOC{DISCH\_ALL}
-\TYPE {\small\verb%DISCH : (term -> thm -> thm)%}\egroup
+\TYPE {\small\verb%DISCH_ALL : (thm -> thm)%}\egroup
\SYNOPSIS
-Discharges an assumption.
+Discharges all hypotheses of a theorem.
\DESCRIBE
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t
--------------------- DISCH "u"
- A - {u} |- u ==> t
+ A1, ..., An |- t
+ ---------------------------- DISCH_ALL
+ |- A1 ==> ... ==> An ==> t
\end{verbatim}
}
\FAILURE
-{\small\verb%DISCH%} will fail if {\small\verb%"u"%} is not boolean.
+{\small\verb%DISCH_ALL%} will not fail if there are no hypotheses to discharge, it will
+simply return the theorem unchanged.
\COMMENTS
-The term {\small\verb%"u"%} need not be a hypothesis. Discharging {\small\verb%"u"%} will remove all
-identical and alpha-equivalent hypotheses.
+Users should not rely on the hypotheses being discharged in any particular
+order. Two or more alpha-convertible hypotheses will be discharged by a
+single implication; users should not rely on which hypothesis appears in the
+implication.
\SEEALSO
-DISCH_ALL, DISCH_TAC, DISCH_THEN, FILTER_DISCH_TAC, FILTER_DISCH_THEN,
-NEG_DISCH, STRIP_TAC, UNDISCH, UNDISCH_ALL, UNDISCH_TAC.
+DISCH, DISCH_TAC, DISCH_THEN, NEG_DISCH, FILTER_DISCH_TAC, FILTER_DISCH_THEN,
+STRIP_TAC, UNDISCH, UNDISCH_ALL, UNDISCH_TAC.
\ENDDOC
\DOC{disch}
@@ -5632,34 +5403,31 @@ disch ("\x:bool.T",["A = T";"B = 3";"\y:
filter.
\ENDDOC
-\DOC{DISCH\_ALL}
+\DOC{DISCH}
-\TYPE {\small\verb%DISCH_ALL : (thm -> thm)%}\egroup
+\TYPE {\small\verb%DISCH : (term -> thm -> thm)%}\egroup
\SYNOPSIS
-Discharges all hypotheses of a theorem.
+Discharges an assumption.
\DESCRIBE
{\par\samepage\setseps\small
\begin{verbatim}
- A1, ..., An |- t
- ---------------------------- DISCH_ALL
- |- A1 ==> ... ==> An ==> t
+ A |- t
+-------------------- DISCH "u"
+ A - {u} |- u ==> t
\end{verbatim}
}
\FAILURE
-{\small\verb%DISCH_ALL%} will not fail if there are no hypotheses to discharge, it will
-simply return the theorem unchanged.
+{\small\verb%DISCH%} will fail if {\small\verb%"u"%} is not boolean.
\COMMENTS
-Users should not rely on the hypotheses being discharged in any particular
-order. Two or more alpha-convertible hypotheses will be discharged by a
-single implication; users should not rely on which hypothesis appears in the
-implication.
+The term {\small\verb%"u"%} need not be a hypothesis. Discharging {\small\verb%"u"%} will remove all
+identical and alpha-equivalent hypotheses.
\SEEALSO
-DISCH, DISCH_TAC, DISCH_THEN, NEG_DISCH, FILTER_DISCH_TAC, FILTER_DISCH_THEN,
-STRIP_TAC, UNDISCH, UNDISCH_ALL, UNDISCH_TAC.
+DISCH_ALL, DISCH_TAC, DISCH_THEN, FILTER_DISCH_TAC, FILTER_DISCH_THEN,
+NEG_DISCH, STRIP_TAC, UNDISCH, UNDISCH_ALL, UNDISCH_TAC.
\ENDDOC
\DOC{DISCH\_TAC}
@@ -5861,55 +5629,6 @@ Fails if the goal is not a disjunction.
DISJ1, DISJ1_TAC, DISJ2.
\ENDDOC
-\DOC{disjuncts}
-
-\TYPE {\small\verb%disjuncts : (term -> term list)%}\egroup
-
-\SYNOPSIS
-Iteratively breaks apart a disjunction.
-
-\DESCRIBE
-{\small\verb%disjuncts "t1 \/ ... \/ tn"%} returns {\small\verb%["t1";...;"tn"]%}.
-The argument term may be any tree of disjunctions;
-it need not have the form {\small\verb%"t1 \/ (t2 \/ ( ... \/ tn)...)"%}.
-A term that is not a disjunction is simply returned as the sole element of a
-list. Note that
-{\par\samepage\setseps\small
-\begin{verbatim}
- disjuncts(list_mk_disj(["t1";...;"tn"]))
-\end{verbatim}
-}
-\noindent will not return {\small\verb%["t1";...;"tn"]%} if any of {\small\verb%t1%},...,{\small\verb%tn%} are
-disjunctions.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#list_mk_disj ["a \/ b";"c \/ d";"e \/ f"];;
-"(a \/ b) \/ (c \/ d) \/ e \/ f" : term
-
-#disjuncts it;;
-["a"; "b"; "c"; "d"; "e"; "f"] : term list
-
-#list_mk_disj it;;
-"a \/ b \/ c \/ d \/ e \/ f" : term
-
-#disjuncts "1";;
-["1"] : term list
-\end{verbatim}
-}
-\COMMENTS
-Because {\small\verb%disjuncts%} splits both the left and right sides of a disjunction,
-this operation is not the inverse of {\small\verb%list_mk_disj%}. It may be useful to
-introduce {\small\verb%list_dest_disj%} for splitting only the right tails of a disjunction.
-
-\SEEALSO
-list_mk_disj, dest_disj.
-
-\ENDDOC
\DOC{DISJ\_CASES}
\TYPE {\small\verb%DISJ_CASES : (thm -> thm -> thm -> thm)%}\egroup
@@ -6003,77 +5722,6 @@ Performing a case analysis according to
ASSUME_TAC, ASM_CASES_TAC, COND_CASES_TAC, DISJ_CASES_THEN, STRUCT_CASES_TAC.
\ENDDOC
-\DOC{DISJ\_CASES\_THEN}
-
-\TYPE {\small\verb%DISJ_CASES_THEN : thm_tactical%}\egroup
-
-\SYNOPSIS
-Applies a theorem-tactic to each disjunct of a disjunctive theorem.
-
-\DESCRIBE
-If the theorem-tactic {\small\verb%f:thm->tactic%} applied to either
-{\small\verb%ASSUME%}d disjunct produces results as follows when applied to a goal
-{\small\verb%(A ?- t)%}:
-{\par\samepage\setseps\small
-\begin{verbatim}
- A ?- t A ?- t
- ========= f (u |- u) and ========= f (v |- v)
- A ?- t1 A ?- t2
-\end{verbatim}
-}
-\noindent then applying {\small\verb%DISJ_CASES_THEN f (|- u \/ v)%}
-to the goal {\small\verb%(A ?- t)%} produces two subgoals.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A ?- t
- ====================== DISJ_CASES_THEN f (|- u \/ v)
- A ?- t1 A ?- t2
-\end{verbatim}
-}
-\FAILURE
-Fails if the theorem is not a disjunction. An invalid tactic is
-produced if the theorem has any hypothesis which is not
-alpha-convertible to an assumption of the goal.
-
-\EXAMPLE
-Given the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- th = |- (m = 0) \/ (?n. m = SUC n)
-\end{verbatim}
-}
-\noindent and a goal of the form {\small\verb%?- (PRE m = m) = (m = 0)%},
-applying the tactic
-{\par\samepage\setseps\small
-\begin{verbatim}
- DISJ_CASES_THEN ASSUME_TAC th
-\end{verbatim}
-}
-\noindent produces two subgoals, each with one disjunct as an added
-assumption:
-{\par\samepage\setseps\small
-\begin{verbatim}
- ?n. m = SUC n ?- (PRE m = m) = (m = 0)
-
- m = 0 ?- (PRE m = m) = (m = 0)
-\end{verbatim}
-}
-\USES
-Building cases tactics. For example, {\small\verb%DISJ_CASES_TAC%} could be defined by:
-{\par\samepage\setseps\small
-\begin{verbatim}
- let DISJ_CASES_TAC = DISJ_CASES_THEN ASSUME_TAC
-\end{verbatim}
-}
-\COMMENTS
-Use {\small\verb%DISJ_CASES_THEN2%} to apply different tactic generating functions
-to each case.
-
-\SEEALSO
-STRIP_THM_THEN, CHOOSE_THEN, CONJUNCTS_THEN, CONJUNCTS_THEN2,
-DISJ_CASES_TAC, DISJ_CASES_THEN2, DISJ_CASES_THENL.
-
-\ENDDOC
\DOC{DISJ\_CASES\_THEN2}
\TYPE {\small\verb%DISJ_CASES_THEN2 : (thm_tactic -> thm_tactical)%}\egroup
@@ -6156,21 +5804,92 @@ STRIP_THM_THEN, CHOOSE_THEN, CONJUNCTS_T
DISJ_CASES_THEN, DISJ_CASES_THENL.
\ENDDOC
-\DOC{DISJ\_CASES\_THENL}
+\DOC{DISJ\_CASES\_THEN}
-\TYPE {\small\verb%DISJ_CASES_THENL : (thm_tactic list -> thm_tactic)%}\egroup
+\TYPE {\small\verb%DISJ_CASES_THEN : thm_tactical%}\egroup
\SYNOPSIS
-Applies theorem-tactics in a list to the corresponding disjuncts in a theorem.
+Applies a theorem-tactic to each disjunct of a disjunctive theorem.
\DESCRIBE
-If the theorem-tactics {\small\verb%f1...fn%} applied to the {\small\verb%ASSUME%}d disjuncts of a
-theorem
+If the theorem-tactic {\small\verb%f:thm->tactic%} applied to either
+{\small\verb%ASSUME%}d disjunct produces results as follows when applied to a goal
+{\small\verb%(A ?- t)%}:
{\par\samepage\setseps\small
\begin{verbatim}
- |- d1 \/ d2 \/...\/ dn
-\end{verbatim}
-}
+ A ?- t A ?- t
+ ========= f (u |- u) and ========= f (v |- v)
+ A ?- t1 A ?- t2
+\end{verbatim}
+}
+\noindent then applying {\small\verb%DISJ_CASES_THEN f (|- u \/ v)%}
+to the goal {\small\verb%(A ?- t)%} produces two subgoals.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A ?- t
+ ====================== DISJ_CASES_THEN f (|- u \/ v)
+ A ?- t1 A ?- t2
+\end{verbatim}
+}
+\FAILURE
+Fails if the theorem is not a disjunction. An invalid tactic is
+produced if the theorem has any hypothesis which is not
+alpha-convertible to an assumption of the goal.
+
+\EXAMPLE
+Given the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ th = |- (m = 0) \/ (?n. m = SUC n)
+\end{verbatim}
+}
+\noindent and a goal of the form {\small\verb%?- (PRE m = m) = (m = 0)%},
+applying the tactic
+{\par\samepage\setseps\small
+\begin{verbatim}
+ DISJ_CASES_THEN ASSUME_TAC th
+\end{verbatim}
+}
+\noindent produces two subgoals, each with one disjunct as an added
+assumption:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ ?n. m = SUC n ?- (PRE m = m) = (m = 0)
+
+ m = 0 ?- (PRE m = m) = (m = 0)
+\end{verbatim}
+}
+\USES
+Building cases tactics. For example, {\small\verb%DISJ_CASES_TAC%} could be defined by:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ let DISJ_CASES_TAC = DISJ_CASES_THEN ASSUME_TAC
+\end{verbatim}
+}
+\COMMENTS
+Use {\small\verb%DISJ_CASES_THEN2%} to apply different tactic generating functions
+to each case.
+
+\SEEALSO
+STRIP_THM_THEN, CHOOSE_THEN, CONJUNCTS_THEN, CONJUNCTS_THEN2,
+DISJ_CASES_TAC, DISJ_CASES_THEN2, DISJ_CASES_THENL.
+
+\ENDDOC
+\DOC{DISJ\_CASES\_THENL}
+
+\TYPE {\small\verb%DISJ_CASES_THENL : (thm_tactic list -> thm_tactic)%}\egroup
+
+\SYNOPSIS
+Applies theorem-tactics in a list to the corresponding disjuncts in a theorem.
+
+\DESCRIBE
+If the theorem-tactics {\small\verb%f1...fn%} applied to the {\small\verb%ASSUME%}d disjuncts of a
+theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- d1 \/ d2 \/...\/ dn
+\end{verbatim}
+}
\noindent produce results as follows when applied to a goal {\small\verb%(A ?- t)%}:
{\par\samepage\setseps\small
\begin{verbatim}
@@ -6211,103 +5930,352 @@ DISJ_CASES_THEN, DISJ_CASES_THEN2, STRIP
\TYPE {\small\verb%DISJ_CASES_UNION : (thm -> thm -> thm -> thm)%}\egroup
\SYNOPSIS
-Makes an inference for each arm of a disjunct.
+Makes an inference for each arm of a disjunct.
+
+\DESCRIBE
+Given a disjunctive theorem, and two additional theorems each having one
+disjunct as a hypothesis, a new theorem with a conclusion that is the
+disjunction of the conclusions of the last two theorems is produced. The
+hypotheses include the union of hypotheses of all three theorems less the two
+disjuncts.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t1 \/ t2 A1 u {t1} |- t3 A2 u {t2} |- t4
+ ------------------------------------------------------ DISJ_CASES_UNION
+ A u A1 u A2 |- t3 \/ t4
+\end{verbatim}
+}
+\FAILURE
+Fails if the first theorem is not a disjunction.
+
+\EXAMPLE
+The built-in theorem {\small\verb%LESS_CASES%} can be specialized to:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ th1 = |- m < n \/ n <= m
+\end{verbatim}
+}
+\noindent and used with two additional theorems:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ th2 = (m < n |- (m MOD n = m))
+ th3 = ({0 < n, n <= m} |- (m MOD n) = ((m - n) MOD n))
+\end{verbatim}
+}
+\noindent to derive a new theorem:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #DISJ_CASES_UNION th1 th2 th3;;
+ ["0 < n"] |- (m MOD n = m) \/ (m MOD n = (m - n) MOD n)
+\end{verbatim}
+}
+\SEEALSO
+DISJ_CASES, DISJ_CASES_TAC, DISJ1, DISJ2.
+
+\ENDDOC
+\DOC{DISJ\_IMP}
+
+\TYPE {\small\verb%DISJ_IMP : (thm -> thm)%}\egroup
+
+\SYNOPSIS
+Converts a disjunctive theorem to an equivalent implicative theorem.
+
+\DESCRIBE
+The left disjunct of a disjunctive theorem becomes the negated
+antecedent of the newly generated theorem.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t1 \/ t2
+ ----------------- DISJ_IMP
+ A |- ~t1 ==> t2
+\end{verbatim}
+}
+\FAILURE
+Fails if the theorem is not a disjunction.
+
+\EXAMPLE
+Specializing the built-in theorem {\small\verb%LESS_CASES%} gives the theorem:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ th = |- m < n \/ n <= m
+\end{verbatim}
+}
+\noindent to which {\small\verb%DISJ_IMP%} may be applied:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #DISJ_IMP th;;
+ |- ~m < n ==> n <= m
+\end{verbatim}
+}
+\SEEALSO
+DISJ_CASES.
+
+\ENDDOC
+\DOC{disjuncts}
+
+\TYPE {\small\verb%disjuncts : (term -> term list)%}\egroup
+
+\SYNOPSIS
+Iteratively breaks apart a disjunction.
+
+\DESCRIBE
+{\small\verb%disjuncts "t1 \/ ... \/ tn"%} returns {\small\verb%["t1";...;"tn"]%}.
+The argument term may be any tree of disjunctions;
+it need not have the form {\small\verb%"t1 \/ (t2 \/ ( ... \/ tn)...)"%}.
+A term that is not a disjunction is simply returned as the sole element of a
+list. Note that
+{\par\samepage\setseps\small
+\begin{verbatim}
+ disjuncts(list_mk_disj(["t1";...;"tn"]))
+\end{verbatim}
+}
+\noindent will not return {\small\verb%["t1";...;"tn"]%} if any of {\small\verb%t1%},...,{\small\verb%tn%} are
+disjunctions.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#list_mk_disj ["a \/ b";"c \/ d";"e \/ f"];;
+"(a \/ b) \/ (c \/ d) \/ e \/ f" : term
+
+#disjuncts it;;
+["a"; "b"; "c"; "d"; "e"; "f"] : term list
+
+#list_mk_disj it;;
+"a \/ b \/ c \/ d \/ e \/ f" : term
+
+#disjuncts "1";;
+["1"] : term list
+\end{verbatim}
+}
+\COMMENTS
+Because {\small\verb%disjuncts%} splits both the left and right sides of a disjunction,
+this operation is not the inverse of {\small\verb%list_mk_disj%}. It may be useful to
+introduce {\small\verb%list_dest_disj%} for splitting only the right tails of a disjunction.
+
+\SEEALSO
+list_mk_disj, dest_disj.
+
+\ENDDOC
+\DOC{distinct}
+
+\TYPE {\small\verb%distinct : (* list -> bool)%}\egroup
+
+\SYNOPSIS
+Checks whether the elements of a list are all distinct.
+
+\DESCRIBE
+If all the elements in a list are distinct, returns {\small\verb%true%}, otherwise returns
+{\small\verb%false%}.
+
+\FAILURE
+Never fails.
+
+\SEEALSO
+setify.
+
+\ENDDOC
+\DOC{/}
+
+\TYPE {\small\verb%$/ : ((int # int) -> int)%}\egroup
+
+\SYNOPSIS
+Performs division on ML integers.
+
+\FAILURE
+Fails on division by zero.
+
+\ENDDOC
+\DOC{<<}
+
+\TYPE {\small\verb%$<< : ((* # **) -> bool)%}\egroup
+
+\SYNOPSIS
+Performs a lexical comparison of values.
+
+\DESCRIBE
+{\small\verb%$<<%} performs a fast ordering on values. It is substitutive with
+respect to equality in ML (i.e. if {\small\verb%x << y%} and {\small\verb%x = x'%} and {\small\verb%y = y'%}
+then {\small\verb%x' << y'%}).
+
+\FAILURE
+Never fails.
+
+\USES
+It is often useful, for example in normalizing terms in some way, to be able to
+impose some arbitrary (but definite) ordering on ML values.
+
+\SEEALSO
+=.
+
+\ENDDOC
+\DOC{<}
+
+\TYPE {\small\verb%$< : ((int # int) -> bool)%}\egroup
+
+\SYNOPSIS
+Performs a less-than test on ML integers.
+
+\FAILURE
+Never fails.
+
+\ENDDOC
+\DOC{=}
+
+\TYPE {\small\verb%$= : ((* # *) -> bool)%}\egroup
+
+\SYNOPSIS
+Performs an equality test on two ML values.
+
+\DESCRIBE
+{\small\verb%$=%} works as expected on non-function types. It may give unexpected results
+when applied to function types (or types containing them, such as a pair of
+functions), and should be considered unreliable in those situations.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#1 = 2;;
+false : bool
+
+#1 = 1;;
+true : bool
+
+#let f x = x + 1 and g x = x + 2;;
+f = - : (int -> int)
+g = - : (int -> int)
+
+#let f' = f and h x = f x and h' x = x + 1;;
+f' = - : (int -> int)
+h = - : (int -> int)
+h' = - : (int -> int)
+
+#f=f;;
+true : bool
+
+#f = f';;
+true : bool
+
+#f = g;;
+false : bool
+
+#f =h;;
+false : bool
+
+#f=h';;
+false : bool
+
+#h = h';;
+false : bool
+\end{verbatim}
+}
+\ENDDOC
+\DOC{>}
+
+\TYPE {\small\verb%$> : ((int # int) -> bool)%}\egroup
+
+\SYNOPSIS
+Performs a greater-than test on ML integers.
+
+\FAILURE
+Never fails.
+
+\ENDDOC
+\DOC{-}
+
+\TYPE {\small\verb%$- : ((int # int) -> int)%}\egroup
+
+\SYNOPSIS
+Performs subtraction on ML integers.
+
+\FAILURE
+Never fails.
+
+\COMMENTS
+Unary {\small\verb%-%} exists as an internal parser object, but not as a function. So,
+whilst typing in {\small\verb%-1;;%} will work, {\small\verb%-;;%} will return a parse error.
+
+\ENDDOC
+\DOC{\char'056}
+
+\TYPE {\small\verb%$. : ((* # * list) -> * list)%}\egroup
+
+\SYNOPSIS
+Adds single element to the head of a list.
+
+\DESCRIBE
+The {\small\verb%.%} operator is an infixed primitive list constructor, analogous to {\small\verb%CONS%}
+in LISP. Its effect is {\small\verb%x . [x1;....;xn]%} = {\small\verb%[x;x1;...;xn]%}.
+
+\FAILURE
+Never fails.
+
+\ENDDOC
+\DOC{\char'100}
+
+\TYPE {\small\verb%$@ : ((* list # * list) -> * list)%}\egroup
+
+\SYNOPSIS
+Concatenates two lists.
\DESCRIBE
-Given a disjunctive theorem, and two additional theorems each having one
-disjunct as a hypothesis, a new theorem with a conclusion that is the
-disjunction of the conclusions of the last two theorems is produced. The
-hypotheses include the union of hypotheses of all three theorems less the two
-disjuncts.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- t1 \/ t2 A1 u {t1} |- t3 A2 u {t2} |- t4
- ------------------------------------------------------ DISJ_CASES_UNION
- A u A1 u A2 |- t3 \/ t4
-\end{verbatim}
-}
+{\small\verb%@%} is an infix operator which concatenates two lists.
+
\FAILURE
-Fails if the first theorem is not a disjunction.
+Never fails.
\EXAMPLE
-The built-in theorem {\small\verb%LESS_CASES%} can be specialized to:
-{\par\samepage\setseps\small
-\begin{verbatim}
- th1 = |- m < n \/ n <= m
-\end{verbatim}
-}
-\noindent and used with two additional theorems:
-{\par\samepage\setseps\small
-\begin{verbatim}
- th2 = (m < n |- (m MOD n = m))
- th3 = ({0 < n, n <= m} |- (m MOD n) = ((m - n) MOD n))
-\end{verbatim}
-}
-\noindent to derive a new theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- #DISJ_CASES_UNION th1 th2 th3;;
- ["0 < n"] |- (m MOD n = m) \/ (m MOD n = (m - n) MOD n)
+#[1;2;3] @ [4;5;6];;
+[1; 2; 3; 4; 5; 6] : int list
\end{verbatim}
}
\SEEALSO
-DISJ_CASES, DISJ_CASES_TAC, DISJ1, DISJ2.
+append.
\ENDDOC
-\DOC{DISJ\_IMP}
+\DOC{*}
-\TYPE {\small\verb%DISJ_IMP : (thm -> thm)%}\egroup
+\TYPE {\small\verb%$* : ((int # int) -> int)%}\egroup
\SYNOPSIS
-Converts a disjunctive theorem to an equivalent implicative theorem.
+Performs multiplication on ML integers.
-\DESCRIBE
-The left disjunct of a disjunctive theorem becomes the negated
-antecedent of the newly generated theorem.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- t1 \/ t2
- ----------------- DISJ_IMP
- A |- ~t1 ==> t2
-\end{verbatim}
-}
\FAILURE
-Fails if the theorem is not a disjunction.
-
-\EXAMPLE
-Specializing the built-in theorem {\small\verb%LESS_CASES%} gives the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- th = |- m < n \/ n <= m
-\end{verbatim}
-}
-\noindent to which {\small\verb%DISJ_IMP%} may be applied:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #DISJ_IMP th;;
- |- ~m < n ==> n <= m
-\end{verbatim}
-}
-\SEEALSO
-DISJ_CASES.
+Never fails.
\ENDDOC
-\DOC{distinct}
-\TYPE {\small\verb%distinct : (* list -> bool)%}\egroup
+\DOC{\#}
-\SYNOPSIS
-Checks whether the elements of a list are all distinct.
+\TYPE {\small\verb%$# : (((* -> **) # (*** -> ****)) -> (* # ***) -> (** # ****))%}\egroup
-\DESCRIBE
-If all the elements in a list are distinct, returns {\small\verb%true%}, otherwise returns
-{\small\verb%false%}.
+\SYNOPSIS
+Applies two functions to a pair: {\small\verb%(f # g) (x,y)%} = {\small\verb%(f x, g y)%}.
\FAILURE
Never fails.
\SEEALSO
-setify.
+B, C, CB, Co, I, K, KI, o, oo, S, W.
+
+\ENDDOC
+\DOC{+}
+
+\TYPE {\small\verb%$+ : ((int # int) -> int)%}\egroup
+
+\SYNOPSIS
+Performs addition on ML integers.
+
+\FAILURE
+Never fails.
\ENDDOC
\DOC{do}
@@ -6468,6 +6436,38 @@ b, backup, backup_limit, expand, expandf
rotate, save_top_thm, set_goal, set_state, top_goal, top_thm, VALID.
\ENDDOC
+\DOC{EL\_CONV}
+
+\TYPE {\small\verb%EL_CONV : conv%}\egroup
+
+\SYNOPSIS
+Computes by inference the result of indexing an element from a list.
+
+\DESCRIBE
+For any object language list of the form {\small\verb%"[x0;...xk;...;xn]"%} ,
+the result of evaluating
+{\par\samepage\setseps\small
+\begin{verbatim}
+ EL_CONV "EL k [x0;...xk;...;xn]"
+\end{verbatim}
+}
+\noindent is the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- EL k [x0;...;xk;...;xn] = xk
+\end{verbatim}
+}
+
+
+\FAILURE
+{\small\verb%EL_CONV tm%} fails if {\small\verb%tm%} is not of the form described above,
+or {\small\verb%k%} is not less than the length of the list.
+
+\SEEALSO
+ELL_CONV
+
+\ENDDOC
+
\DOC{el}
\TYPE {\small\verb%el : (int -> * list -> *)%}\egroup
@@ -6527,38 +6527,6 @@ EL_CONV
\ENDDOC
-\DOC{EL\_CONV}
-
-\TYPE {\small\verb%EL_CONV : conv%}\egroup
-
-\SYNOPSIS
-Computes by inference the result of indexing an element from a list.
-
-\DESCRIBE
-For any object language list of the form {\small\verb%"[x0;...xk;...;xn]"%} ,
-the result of evaluating
-{\par\samepage\setseps\small
-\begin{verbatim}
- EL_CONV "EL k [x0;...xk;...;xn]"
-\end{verbatim}
-}
-\noindent is the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- EL k [x0;...;xk;...;xn] = xk
-\end{verbatim}
-}
-
-
-\FAILURE
-{\small\verb%EL_CONV tm%} fails if {\small\verb%tm%} is not of the form described above,
-or {\small\verb%k%} is not less than the length of the list.
-
-\SEEALSO
-ELL_CONV
-
-\ENDDOC
-
\DOC{end\_itlist}
\TYPE {\small\verb%end_itlist : ((* -> * -> *) -> * list -> *)%}\egroup
@@ -6656,51 +6624,6 @@ Fails if the argument theorem is not a n
EQF_ELIM, EQT_ELIM, EQT_INTRO.
\ENDDOC
-\DOC{EQT\_ELIM}
-
-\TYPE {\small\verb%EQT_ELIM : (thm -> thm)%}\egroup
-
-\SYNOPSIS
-Eliminates equality with {\small\verb%T%}.
-
-\DESCRIBE
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- tm = T
- ------------- EQT_ELIM
- A |- tm
-\end{verbatim}
-}
-\FAILURE
-Fails if the argument theorem is not of the form {\small\verb%A |- tm = T%}.
-
-\SEEALSO
-EQT_INTRO, EQF_ELIM, EQF_INTRO.
-
-\ENDDOC
-\DOC{EQT\_INTRO}
-
-\TYPE {\small\verb%EQT_INTRO : (thm -> thm)%}\egroup
-
-\SYNOPSIS
-Introduces equality with {\small\verb%T%}.
-
-\DESCRIBE
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- tm
- ------------- EQF_INTRO
- A |- tm = T
-\end{verbatim}
-}
-
-\FAILURE
-Never fails.
-
-\SEEALSO
-EQT_ELIM, EQF_ELIM, EQF_INTRO.
-
-\ENDDOC
\DOC{EQ\_IMP\_RULE}
\TYPE {\small\verb%EQ_IMP_RULE : (thm -> (thm # thm))%}\egroup
@@ -6840,37 +6763,82 @@ rule {\small\verb%EQ_MP%} returns the th
\end{verbatim}
}
\FAILURE
-Fails unless the first theorem is equational and its left side
-is the same as the conclusion of the second theorem (and is therefore
-of type {\small\verb%bool%}), up to alpha-conversion.
+Fails unless the first theorem is equational and its left side
+is the same as the conclusion of the second theorem (and is therefore
+of type {\small\verb%bool%}), up to alpha-conversion.
+
+\SEEALSO
+EQ_IMP_RULE, IMP_ANTISYM_RULE, MP.
+
+\ENDDOC
+\DOC{EQ\_TAC}
+
+\TYPE {\small\verb%EQ_TAC : tactic%}\egroup
+
+\SYNOPSIS
+Reduces goal of equality of boolean terms to forward and backward implication.
+
+\DESCRIBE
+When applied to a goal {\small\verb%A ?- t1 = t2%}, where {\small\verb%t1%} and {\small\verb%t2%} have type {\small\verb%bool%},
+the tactic {\small\verb%EQ_TAC%} returns the subgoals {\small\verb%A ?- t1 ==> t2%} and
+{\small\verb%A ?- t2 ==> t1%}.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A ?- t1 = t2
+ ================================= EQ_TAC
+ A ?- t1 ==> t2 A ?- t2 ==> t1
+\end{verbatim}
+}
+\FAILURE
+Fails unless the conclusion of the goal is an equation between boolean terms.
+
+\SEEALSO
+EQ_IMP_RULE, IMP_ANTISYM_RULE.
+
+\ENDDOC
+\DOC{EQT\_ELIM}
+
+\TYPE {\small\verb%EQT_ELIM : (thm -> thm)%}\egroup
+
+\SYNOPSIS
+Eliminates equality with {\small\verb%T%}.
+
+\DESCRIBE
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- tm = T
+ ------------- EQT_ELIM
+ A |- tm
+\end{verbatim}
+}
+\FAILURE
+Fails if the argument theorem is not of the form {\small\verb%A |- tm = T%}.
\SEEALSO
-EQ_IMP_RULE, IMP_ANTISYM_RULE, MP.
+EQT_INTRO, EQF_ELIM, EQF_INTRO.
\ENDDOC
-\DOC{EQ\_TAC}
+\DOC{EQT\_INTRO}
-\TYPE {\small\verb%EQ_TAC : tactic%}\egroup
+\TYPE {\small\verb%EQT_INTRO : (thm -> thm)%}\egroup
\SYNOPSIS
-Reduces goal of equality of boolean terms to forward and backward implication.
+Introduces equality with {\small\verb%T%}.
\DESCRIBE
-When applied to a goal {\small\verb%A ?- t1 = t2%}, where {\small\verb%t1%} and {\small\verb%t2%} have type {\small\verb%bool%},
-the tactic {\small\verb%EQ_TAC%} returns the subgoals {\small\verb%A ?- t1 ==> t2%} and
-{\small\verb%A ?- t2 ==> t1%}.
{\par\samepage\setseps\small
\begin{verbatim}
- A ?- t1 = t2
- ================================= EQ_TAC
- A ?- t1 ==> t2 A ?- t2 ==> t1
+ A |- tm
+ ------------- EQF_INTRO
+ A |- tm = T
\end{verbatim}
}
+
\FAILURE
-Fails unless the conclusion of the goal is an equation between boolean terms.
+Never fails.
\SEEALSO
-EQ_IMP_RULE, IMP_ANTISYM_RULE.
+EQT_ELIM, EQF_ELIM, EQF_INTRO.
\ENDDOC
\DOC{ETA\_CONV}
@@ -6888,37 +6856,6 @@ to the theorem {\small\verb%|- (\x. t x)
Fails if the input term is not an eta-redex.
\ENDDOC
-\DOC{EVERY}
-
-\TYPE {\small\verb%EVERY : (tactic list -> tactic)%}\egroup
-
-\SYNOPSIS
-Sequentially applies all the tactics in a given list of tactics.
-
-\DESCRIBE
-When applied to a list of tactics {\small\verb%[T1; ... ;Tn]%}, and a goal {\small\verb%g%}, the tactical
-{\small\verb%EVERY%} applies each tactic in sequence to every
-subgoal generated by the previous one. This can be represented as:
-{\par\samepage\setseps\small
-\begin{verbatim}
- EVERY [T1;...;Tn] = T1 THEN ... THEN Tn
-\end{verbatim}
-}
-\noindent If the tactic list is empty, the resulting tactic has no effect.
-
-\FAILURE
-The application of {\small\verb%EVERY%} to a tactic list never fails. The resulting
-tactic fails iff any of the component tactics do.
-
-\COMMENTS
-It is possible to use {\small\verb%EVERY%} instead of {\small\verb%THEN%}, but probably
-stylistically inferior. {\small\verb%EVERY%} is more useful when applied to a list of
-tactics generated by a function.
-
-\SEEALSO
-FIRST, MAP_EVERY, THEN.
-
-\ENDDOC
\DOC{EVERY\_ASSUM}
\TYPE {\small\verb%EVERY_ASSUM : (thm_tactic -> tactic)%}\egroup
@@ -6973,6 +6910,37 @@ is, {\small\verb%EVERY_CONV [] "t"%} ret
THENC.
\ENDDOC
+\DOC{EVERY}
+
+\TYPE {\small\verb%EVERY : (tactic list -> tactic)%}\egroup
+
+\SYNOPSIS
+Sequentially applies all the tactics in a given list of tactics.
+
+\DESCRIBE
+When applied to a list of tactics {\small\verb%[T1; ... ;Tn]%}, and a goal {\small\verb%g%}, the tactical
+{\small\verb%EVERY%} applies each tactic in sequence to every
+subgoal generated by the previous one. This can be represented as:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ EVERY [T1;...;Tn] = T1 THEN ... THEN Tn
+\end{verbatim}
+}
+\noindent If the tactic list is empty, the resulting tactic has no effect.
+
+\FAILURE
+The application of {\small\verb%EVERY%} to a tactic list never fails. The resulting
+tactic fails iff any of the component tactics do.
+
+\COMMENTS
+It is possible to use {\small\verb%EVERY%} instead of {\small\verb%THEN%}, but probably
+stylistically inferior. {\small\verb%EVERY%} is more useful when applied to a list of
+tactics generated by a function.
+
+\SEEALSO
+FIRST, MAP_EVERY, THEN.
+
+\ENDDOC
\DOC{EVERY\_TCL}
\TYPE {\small\verb%EVERY_TCL : (thm_tactical list -> thm_tactical)%}\egroup
@@ -7035,43 +7003,43 @@ Fails unless the conclusion of the theor
EXISTS_UNIQUE_CONV.
\ENDDOC
-\DOC{EXISTS}
+\DOC{EXISTS\_AND\_CONV}
-\TYPE {\small\verb%EXISTS : ((term # term) -> thm -> thm)%}\egroup
+\TYPE {\small\verb%EXISTS_AND_CONV : conv%}\egroup
\SYNOPSIS
-Introduces existential quantification given a particular witness.
+Moves an existential quantification inwards through a conjunction.
\DESCRIBE
-When applied to a pair of terms and a theorem, the first term an existentially
-quantified pattern indicating the desired form of the result, and the second a
-witness whose substitution for the quantified variable gives a term which is
-the same as the conclusion of the theorem, {\small\verb%EXISTS%} gives the desired theorem.
+When applied to a term of the form {\small\verb%?x. P /\ Q%}, where {\small\verb%x%} is not free in both
+{\small\verb%P%} and {\small\verb%Q%}, {\small\verb%EXISTS_AND_CONV%} returns a theorem of one of three forms,
+depending on occurrences of the variable {\small\verb%x%} in {\small\verb%P%} and {\small\verb%Q%}. If {\small\verb%x%} is free
+in {\small\verb%P%} but not in {\small\verb%Q%}, then the theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- A |- p[u/x]
- ------------- EXISTS ("?x. p","u")
- A |- ?x. p
+ |- (?x. P /\ Q) = (?x.P) /\ Q
\end{verbatim}
}
-\FAILURE
-Fails unless the substituted pattern is the same as the conclusion of the
-theorem.
-
-\EXAMPLE
-The following examples illustrate how it is possible to deduce different
-things from the same theorem:
+\noindent is returned. If {\small\verb%x%} is free in {\small\verb%Q%} but not in {\small\verb%P%}, then the
+result is:
{\par\samepage\setseps\small
\begin{verbatim}
- #EXISTS ("?x. x=T","T") (REFL "T");;
- |- ?x. x = T
-
- #EXISTS ("?x:bool. x=x","T") (REFL "T");;
- |- ?x. x = x
+ |- (?x. P /\ Q) = P /\ (?x.Q)
+\end{verbatim}
+}
+\noindent And if {\small\verb%x%} is free in neither {\small\verb%P%} nor {\small\verb%Q%}, then the result is:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- (?x. P /\ Q) = (?x.P) /\ (?x.Q)
\end{verbatim}
}
+\FAILURE
+{\small\verb%EXISTS_AND_CONV%} fails if it is applied to a term not of the form
+{\small\verb%?x. P /\ Q%}, or if it is applied to a term {\small\verb%?x. P /\ Q%} in which the
+variable {\small\verb%x%} is free in both {\small\verb%P%} and {\small\verb%Q%}.
+
\SEEALSO
-CHOOSE, EXISTS_TAC.
+AND_EXISTS_CONV, LEFT_AND_EXISTS_CONV, RIGHT_AND_EXISTS_CONV.
\ENDDOC
\DOC{exists}
@@ -7093,43 +7061,43 @@ Never fails.
forall, find, tryfind, mem, assoc, rev_assoc.
\ENDDOC
-\DOC{EXISTS\_AND\_CONV}
+\DOC{EXISTS}
-\TYPE {\small\verb%EXISTS_AND_CONV : conv%}\egroup
+\TYPE {\small\verb%EXISTS : ((term # term) -> thm -> thm)%}\egroup
\SYNOPSIS
-Moves an existential quantification inwards through a conjunction.
+Introduces existential quantification given a particular witness.
\DESCRIBE
-When applied to a term of the form {\small\verb%?x. P /\ Q%}, where {\small\verb%x%} is not free in both
-{\small\verb%P%} and {\small\verb%Q%}, {\small\verb%EXISTS_AND_CONV%} returns a theorem of one of three forms,
-depending on occurrences of the variable {\small\verb%x%} in {\small\verb%P%} and {\small\verb%Q%}. If {\small\verb%x%} is free
-in {\small\verb%P%} but not in {\small\verb%Q%}, then the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- (?x. P /\ Q) = (?x.P) /\ Q
-\end{verbatim}
-}
-\noindent is returned. If {\small\verb%x%} is free in {\small\verb%Q%} but not in {\small\verb%P%}, then the
-result is:
+When applied to a pair of terms and a theorem, the first term an existentially
+quantified pattern indicating the desired form of the result, and the second a
+witness whose substitution for the quantified variable gives a term which is
+the same as the conclusion of the theorem, {\small\verb%EXISTS%} gives the desired theorem.
{\par\samepage\setseps\small
\begin{verbatim}
- |- (?x. P /\ Q) = P /\ (?x.Q)
+ A |- p[u/x]
+ ------------- EXISTS ("?x. p","u")
+ A |- ?x. p
\end{verbatim}
}
-\noindent And if {\small\verb%x%} is free in neither {\small\verb%P%} nor {\small\verb%Q%}, then the result is:
+\FAILURE
+Fails unless the substituted pattern is the same as the conclusion of the
+theorem.
+
+\EXAMPLE
+The following examples illustrate how it is possible to deduce different
+things from the same theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- |- (?x. P /\ Q) = (?x.P) /\ (?x.Q)
+ #EXISTS ("?x. x=T","T") (REFL "T");;
+ |- ?x. x = T
+
+ #EXISTS ("?x:bool. x=x","T") (REFL "T");;
+ |- ?x. x = x
\end{verbatim}
}
-\FAILURE
-{\small\verb%EXISTS_AND_CONV%} fails if it is applied to a term not of the form
-{\small\verb%?x. P /\ Q%}, or if it is applied to a term {\small\verb%?x. P /\ Q%} in which the
-variable {\small\verb%x%} is free in both {\small\verb%P%} and {\small\verb%Q%}.
-
\SEEALSO
-AND_EXISTS_CONV, LEFT_AND_EXISTS_CONV, RIGHT_AND_EXISTS_CONV.
+CHOOSE, EXISTS_TAC.
\ENDDOC
\DOC{EXISTS\_EQ}
@@ -7191,32 +7159,6 @@ true' and `there is a greatest number su
EXISTS_LEAST_CONV.
\ENDDOC
-\DOC{EXISTS\_IMP}
-
-\TYPE {\small\verb%EXISTS_IMP : (term -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Existentially quantifies both the antecedent and consequent of an implication.
-
-\DESCRIBE
-When applied to a variable {\small\verb%x%} and a theorem {\small\verb%A |- t1 ==> t2%}, the
-inference rule {\small\verb%EXISTS_IMP%} returns the theorem {\small\verb%A |- (?x. t1) ==> (?x. t2)%},
-provided {\small\verb%x%} is not free in the assumptions.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- t1 ==> t2
- -------------------------- EXISTS_IMP "x" [where x is not free in A]
- A |- (?x.t1) ==> (?x.t2)
-\end{verbatim}
-}
-\FAILURE
-Fails if the theorem is not implicative, or if the term is not a variable, or
-if the term is a variable but is free in the assumption list.
-
-\SEEALSO
-EXISTS_EQ.
-
-\ENDDOC
\DOC{EXISTS\_IMP\_CONV}
\TYPE {\small\verb%EXISTS_IMP_CONV : conv%}\egroup
@@ -7256,6 +7198,32 @@ variable {\small\verb%x%} is free in bot
LEFT_IMP_FORALL_CONV, RIGHT_IMP_EXISTS_CONV.
\ENDDOC
+\DOC{EXISTS\_IMP}
+
+\TYPE {\small\verb%EXISTS_IMP : (term -> thm -> thm)%}\egroup
+
+\SYNOPSIS
+Existentially quantifies both the antecedent and consequent of an implication.
+
+\DESCRIBE
+When applied to a variable {\small\verb%x%} and a theorem {\small\verb%A |- t1 ==> t2%}, the
+inference rule {\small\verb%EXISTS_IMP%} returns the theorem {\small\verb%A |- (?x. t1) ==> (?x. t2)%},
+provided {\small\verb%x%} is not free in the assumptions.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t1 ==> t2
+ -------------------------- EXISTS_IMP "x" [where x is not free in A]
+ A |- (?x.t1) ==> (?x.t2)
+\end{verbatim}
+}
+\FAILURE
+Fails if the theorem is not implicative, or if the term is not a variable, or
+if the term is a variable but is free in the assumption list.
+
+\SEEALSO
+EXISTS_EQ.
+
+\ENDDOC
\DOC{EXISTS\_LEAST\_CONV}
\TYPE {\small\verb%EXISTS_LEAST_CONV : conv%}\egroup
@@ -7779,30 +7747,12 @@ pow2 = - : (int -> int)
\end{verbatim}
}
\COMMENTS
-This function is extremely dependent on the version of Lisp used, and its
-behaviour should not be relied upon; it may not work at all in Lisps other than
-Franz. It is questionable whether it is ever worthwhile to use it anyway,
-because although it cannot compromise the consistency of the logic, it can
-lead to confusing failures if one is manipulating numbers larger than the word
-size of the machine.
-
-\ENDDOC
-\DOC{filter}
-
-\TYPE {\small\verb%filter : ((* -> bool) -> * list -> * list)%}\egroup
-
-\SYNOPSIS
-Filters a list to the sublist of elements satisfying a predicate.
-
-\DESCRIBE
-{\small\verb%filter p l%} applies {\small\verb%p%} to every element of {\small\verb%l%}, returning a list of those
-that satisfy {\small\verb%p%}, in the order they appeared in the original list.
-
-\FAILURE
-Never fails.
-
-\SEEALSO
-mapfilter, partition, remove.
+This function is extremely dependent on the version of Lisp used, and its
+behaviour should not be relied upon; it may not work at all in Lisps other than
+Franz. It is questionable whether it is ever worthwhile to use it anyway,
+because although it cannot compromise the consistency of the logic, it can
+lead to confusing failures if one is manipulating numbers larger than the word
+size of the machine.
\ENDDOC
\DOC{FILTER\_ASM\_REWRITE\_RULE}
@@ -8018,6 +7968,24 @@ DISCH, DISCH_ALL, DISCH_TAC, DISCH_THEN,
STRIP_TAC, UNDISCH, UNDISCH_ALL, UNDISCH_TAC.
\ENDDOC
+\DOC{filter}
+
+\TYPE {\small\verb%filter : ((* -> bool) -> * list -> * list)%}\egroup
+
+\SYNOPSIS
+Filters a list to the sublist of elements satisfying a predicate.
+
+\DESCRIBE
+{\small\verb%filter p l%} applies {\small\verb%p%} to every element of {\small\verb%l%}, returning a list of those
+that satisfy {\small\verb%p%}, in the order they appeared in the original list.
+
+\FAILURE
+Never fails.
+
+\SEEALSO
+mapfilter, partition, remove.
+
+\ENDDOC
\DOC{FILTER\_GEN\_TAC}
\TYPE {\small\verb%FILTER_GEN_TAC : (term -> tactic)%}\egroup
@@ -8587,61 +8555,6 @@ Fails if the named theory file cannot be
find_file, find_ml_file, search_path, set_search_path.
\ENDDOC
-\DOC{FIRST}
-
-\TYPE {\small\verb%FIRST : (tactic list -> tactic)%}\egroup
-
-\SYNOPSIS
-Applies the first tactic in a tactic list which succeeds.
-
-\DESCRIBE
-When applied to a list of tactics {\small\verb%[T1;...;Tn]%}, and a goal {\small\verb%g%}, the tactical
-{\small\verb%FIRST%} tries applying the tactics to the goal until one succeeds. If the
-first tactic which succeeds is {\small\verb%Tm%}, then the effect is the same as just {\small\verb%Tm%}.
-Thus {\small\verb%FIRST%} effectively behaves as follows:
-{\par\samepage\setseps\small
-\begin{verbatim}
- FIRST [T1;...;Tn] = T1 ORELSE ... ORELSE Tn
-\end{verbatim}
-}
-\FAILURE
-The application of {\small\verb%FIRST%} to a tactic list never fails. The resulting
-tactic fails iff all the component tactics do when applied to the goal,
-or if the tactic list is empty.
-
-\SEEALSO
-EVERY, ORELSE.
-
-\ENDDOC
-\DOC{FIRSTN\_CONV}
-
-\TYPE {\small\verb%FIRSTN_CONV : conv%}\egroup
-
-\SYNOPSIS
-Computes by inference the result of taking the initial n elements of a list.
-
-\DESCRIBE
-For any object language list of the form {\small\verb%"[x0;...x(n-k);...;x(n-1)]"%} ,
-the result of evaluating
-{\par\samepage\setseps\small
-\begin{verbatim}
- FIRSTN_CONV "FIRSTN k [x0;...x(n-k);...;x(n-1)]"
-\end{verbatim}
-}
-\noindent is the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- FIRSTN k [x0;...;x(n-k);...;x(n-1)] = [x0;...;x(n-k)]
-\end{verbatim}
-}
-
-
-\FAILURE
-{\small\verb%FIRSTN_CONV tm%} fails if {\small\verb%tm%} is not of the form described above,
-or {\small\verb%k%} is greater than the length of the list.
-
-\ENDDOC
-
\DOC{FIRST\_ASSUM}
\TYPE {\small\verb%FIRST_ASSUM : (thm_tactic -> tactic)%}\egroup
@@ -8709,6 +8622,61 @@ empty list.
ORELSEC.
\ENDDOC
+\DOC{FIRST}
+
+\TYPE {\small\verb%FIRST : (tactic list -> tactic)%}\egroup
+
+\SYNOPSIS
+Applies the first tactic in a tactic list which succeeds.
+
+\DESCRIBE
+When applied to a list of tactics {\small\verb%[T1;...;Tn]%}, and a goal {\small\verb%g%}, the tactical
+{\small\verb%FIRST%} tries applying the tactics to the goal until one succeeds. If the
+first tactic which succeeds is {\small\verb%Tm%}, then the effect is the same as just {\small\verb%Tm%}.
+Thus {\small\verb%FIRST%} effectively behaves as follows:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ FIRST [T1;...;Tn] = T1 ORELSE ... ORELSE Tn
+\end{verbatim}
+}
+\FAILURE
+The application of {\small\verb%FIRST%} to a tactic list never fails. The resulting
+tactic fails iff all the component tactics do when applied to the goal,
+or if the tactic list is empty.
+
+\SEEALSO
+EVERY, ORELSE.
+
+\ENDDOC
+\DOC{FIRSTN\_CONV}
+
+\TYPE {\small\verb%FIRSTN_CONV : conv%}\egroup
+
+\SYNOPSIS
+Computes by inference the result of taking the initial n elements of a list.
+
+\DESCRIBE
+For any object language list of the form {\small\verb%"[x0;...x(n-k);...;x(n-1)]"%} ,
+the result of evaluating
+{\par\samepage\setseps\small
+\begin{verbatim}
+ FIRSTN_CONV "FIRSTN k [x0;...x(n-k);...;x(n-1)]"
+\end{verbatim}
+}
+\noindent is the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- FIRSTN k [x0;...;x(n-k);...;x(n-1)] = [x0;...;x(n-k)]
+\end{verbatim}
+}
+
+
+\FAILURE
+{\small\verb%FIRSTN_CONV tm%} fails if {\small\verb%tm%} is not of the form described above,
+or {\small\verb%k%} is greater than the length of the list.
+
+\ENDDOC
+
\DOC{FIRST\_TCL}
\TYPE {\small\verb%FIRST_TCL : (thm_tactical list -> thm_tactical)%}\egroup
@@ -8752,28 +8720,6 @@ A full explanation of the standard flags
set_flag.
\ENDDOC
-\DOC{flat}
-
-\TYPE {\small\verb%flat : (* list list -> * list)%}\egroup
-
-\SYNOPSIS
-Flattens a list of lists into one long list.
-
-\DESCRIBE
-{\small\verb%flat [l1;...;ln]%} returns {\small\verb%(l1 @ ... @ ln)%} where each li is a list and {\small\verb%@%}
-is list concatenation.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#flat [[1;2];[3;4;5];[6]];;
-[1; 2; 3; 4; 5; 6] : int list
-\end{verbatim}
-}
-\ENDDOC
\DOC{FLAT\_CONV}
\TYPE {\small\verb%FLAT_CONV : conv%}\egroup
@@ -8819,6 +8765,28 @@ FOLDL_CONV, FOLDR_CONV, list_FOLD_CONV.
\ENDDOC
+\DOC{flat}
+
+\TYPE {\small\verb%flat : (* list list -> * list)%}\egroup
+
+\SYNOPSIS
+Flattens a list of lists into one long list.
+
+\DESCRIBE
+{\small\verb%flat [l1;...;ln]%} returns {\small\verb%(l1 @ ... @ ln)%} where each li is a list and {\small\verb%@%}
+is list concatenation.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#flat [[1;2];[3;4;5];[6]];;
+[1; 2; 3; 4; 5; 6] : int list
+\end{verbatim}
+}
+\ENDDOC
\DOC{FOLDL\_CONV}
\TYPE {\small\verb%FOLDL_CONV : conv -> conv%}\egroup
@@ -8953,25 +8921,6 @@ FOLDL_CONV, list_FOLD_CONV.
\ENDDOC
-\DOC{forall}
-
-\TYPE {\small\verb%forall : ((* -> bool) -> * list -> bool)%}\egroup
-
-\SYNOPSIS
-Tests a list to see if all its elements satisfy a predicate.
-
-\DESCRIBE
-{\small\verb%forall p [x1;...;xn]%} returns {\small\verb%true%} if {\small\verb%(p xi)%} is true for all {\small\verb%xi%} in the
-list. Otherwise it returns {\small\verb%false%}. If the list is empty, this function always
-returns true.
-
-\FAILURE
-Never fails.
-
-\SEEALSO
-exists, find, tryfind, mem, assoc, rev_assoc.
-
-\ENDDOC
\DOC{FORALL\_AND\_CONV}
\TYPE {\small\verb%FORALL_AND_CONV : conv%}\egroup
@@ -8994,6 +8943,25 @@ Fails if applied to a term not of the fo
AND_FORALL_CONV, LEFT_AND_FORALL_CONV, RIGHT_AND_FORALL_CONV.
\ENDDOC
+\DOC{forall}
+
+\TYPE {\small\verb%forall : ((* -> bool) -> * list -> bool)%}\egroup
+
+\SYNOPSIS
+Tests a list to see if all its elements satisfy a predicate.
+
+\DESCRIBE
+{\small\verb%forall p [x1;...;xn]%} returns {\small\verb%true%} if {\small\verb%(p xi)%} is true for all {\small\verb%xi%} in the
+list. Otherwise it returns {\small\verb%false%}. If the list is empty, this function always
+returns true.
+
+\FAILURE
+Never fails.
+
+\SEEALSO
+exists, find, tryfind, mem, assoc, rev_assoc.
+
+\ENDDOC
\DOC{FORALL\_EQ}
\TYPE {\small\verb%FORALL_EQ : (term -> thm -> thm)%}\egroup
@@ -9113,13 +9081,49 @@ result is:
|- (!x. P \/ Q) = (!x.P) \/ (!x.Q)
\end{verbatim}
}
-\FAILURE
-{\small\verb%FORALL_OR_CONV%} fails if it is applied to a term not of the form
-{\small\verb%!x. P \/ Q%}, or if it is applied to a term {\small\verb%!x. P \/ Q%} in which the
-variable {\small\verb%x%} is free in both {\small\verb%P%} and {\small\verb%Q%}.
-
+\FAILURE
+{\small\verb%FORALL_OR_CONV%} fails if it is applied to a term not of the form
+{\small\verb%!x. P \/ Q%}, or if it is applied to a term {\small\verb%!x. P \/ Q%} in which the
+variable {\small\verb%x%} is free in both {\small\verb%P%} and {\small\verb%Q%}.
+
+\SEEALSO
+OR_FORALL_CONV, LEFT_OR_FORALL_CONV, RIGHT_OR_FORALL_CONV.
+
+\ENDDOC
+\DOC{free\_in}
+
+\TYPE {\small\verb%free_in : (term -> term -> bool)%}\egroup
+
+\SYNOPSIS
+Tests if one term is free in another.
+
+\DESCRIBE
+When applied to two terms {\small\verb%t1%} and {\small\verb%t2%}, the function {\small\verb%free_in%} returns
+{\small\verb%true%} if {\small\verb%t1%} is free in {\small\verb%t2%}, and {\small\verb%false%} otherwise. It is not necessary
+that {\small\verb%t1%} be simply a variable.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+In the following example {\small\verb%free_in%} returns {\small\verb%false%} because the {\small\verb%x%} in {\small\verb%SUC x%}
+in the second term is bound:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #free_in "SUC x" "!x. SUC x = x + 1";;
+ false : bool
+\end{verbatim}
+}
+\noindent whereas the following call returns {\small\verb%true%} because the first instance
+of {\small\verb%x%} in the second term is free, even though there is also a bound instance:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #free_in "x:bool" "x /\ (?x. x=T)";;
+ true : bool
+\end{verbatim}
+}
\SEEALSO
-OR_FORALL_CONV, LEFT_OR_FORALL_CONV, RIGHT_OR_FORALL_CONV.
+frees, freesl, thm_frees.
\ENDDOC
\DOC{frees}
@@ -9250,42 +9254,6 @@ resolution and rewriting.
ASSUME, IMP_RES_TAC, PROVE_HYP, RES_TAC, REWR_CONV.
\ENDDOC
-\DOC{free\_in}
-
-\TYPE {\small\verb%free_in : (term -> term -> bool)%}\egroup
-
-\SYNOPSIS
-Tests if one term is free in another.
-
-\DESCRIBE
-When applied to two terms {\small\verb%t1%} and {\small\verb%t2%}, the function {\small\verb%free_in%} returns
-{\small\verb%true%} if {\small\verb%t1%} is free in {\small\verb%t2%}, and {\small\verb%false%} otherwise. It is not necessary
-that {\small\verb%t1%} be simply a variable.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-In the following example {\small\verb%free_in%} returns {\small\verb%false%} because the {\small\verb%x%} in {\small\verb%SUC x%}
-in the second term is bound:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #free_in "SUC x" "!x. SUC x = x + 1";;
- false : bool
-\end{verbatim}
-}
-\noindent whereas the following call returns {\small\verb%true%} because the first instance
-of {\small\verb%x%} in the second term is free, even though there is also a bound instance:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #free_in "x:bool" "x /\ (?x. x=T)";;
- true : bool
-\end{verbatim}
-}
-\SEEALSO
-frees, freesl, thm_frees.
-
-\ENDDOC
\DOC{FRONT\_CONJ\_CONV}
\TYPE {\small\verb%FRONT_CONJ_CONV: (term list -> term -> thm)%}\egroup
@@ -9330,6 +9298,36 @@ Never fails.
snd, pair.
\ENDDOC
+\DOC{FUN\_EQ\_CONV}
+
+\TYPE {\small\verb%FUN_EQ_CONV : conv%}\egroup
+
+\SYNOPSIS
+Equates normal and extensional equality for two functions.
+
+\DESCRIBE
+The conversion {\small\verb%FUN_EQ_CONV%} embodies the fact that two functions are equal
+precisely when they give the same results for all values to which they can be
+applied. When supplied with a term argument of the form {\small\verb%f = g%}, where {\small\verb%f%} and
+{\small\verb%g%} are functions of type {\small\verb%ty1->ty2%}, {\small\verb%FUN_EQ_CONV%} returns the theorem:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- (f = g) = (!x. f x = g x)
+\end{verbatim}
+}
+\noindent where {\small\verb%x%} is a variable of type {\small\verb%ty1%} chosen by the conversion.
+
+\FAILURE
+{\small\verb%FUN_EQ_CONV tm%} fails if {\small\verb%tm%} is not an equation {\small\verb%f = g%}, where {\small\verb%f%} and {\small\verb%g%}
+are functions.
+
+\USES
+Used for proving equality of functions.
+
+\SEEALSO
+EXT, X_FUN_EQ_CONV.
+
+\ENDDOC
\DOC{funpow}
\TYPE {\small\verb%funpow : (int -> (* -> *) -> * -> *)%}\egroup
@@ -9384,36 +9382,6 @@ number of times, the application of {\sm
\end{verbatim}
}
\ENDDOC
-\DOC{FUN\_EQ\_CONV}
-
-\TYPE {\small\verb%FUN_EQ_CONV : conv%}\egroup
-
-\SYNOPSIS
-Equates normal and extensional equality for two functions.
-
-\DESCRIBE
-The conversion {\small\verb%FUN_EQ_CONV%} embodies the fact that two functions are equal
-precisely when they give the same results for all values to which they can be
-applied. When supplied with a term argument of the form {\small\verb%f = g%}, where {\small\verb%f%} and
-{\small\verb%g%} are functions of type {\small\verb%ty1->ty2%}, {\small\verb%FUN_EQ_CONV%} returns the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- (f = g) = (!x. f x = g x)
-\end{verbatim}
-}
-\noindent where {\small\verb%x%} is a variable of type {\small\verb%ty1%} chosen by the conversion.
-
-\FAILURE
-{\small\verb%FUN_EQ_CONV tm%} fails if {\small\verb%tm%} is not an equation {\small\verb%f = g%}, where {\small\verb%f%} and {\small\verb%g%}
-are functions.
-
-\USES
-Used for proving equality of functions.
-
-\SEEALSO
-EXT, X_FUN_EQ_CONV.
-
-\ENDDOC
\DOC{g}
\TYPE {\small\verb%g : (term -> void)%}\egroup
@@ -9454,120 +9422,6 @@ b, backup, backup_limit, e, expand, expa
rotate, save_top_thm, set_goal, set_state, top_goal, top_thm.
\ENDDOC
-\DOC{GEN}
-
-\TYPE {\small\verb%GEN : (term -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Generalizes the conclusion of a theorem.
-
-\DESCRIBE
-When applied to a term {\small\verb%x%} and a theorem {\small\verb%A |- t%}, the inference rule
-{\small\verb%GEN%} returns the theorem {\small\verb%A |- !x. t%}, provided {\small\verb%x%} is a variable not
-free in any of the assumptions. There is no compulsion that {\small\verb%x%} should
-be free in {\small\verb%t%}.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- t
- ------------ GEN "x" [where x is not free in A]
- A |- !x. t
-\end{verbatim}
-}
-\FAILURE
-Fails if {\small\verb%x%} is not a variable, or if it is free in any of the assumptions.
-
-\EXAMPLE
-The following example shows how the above side-condition prevents
-the derivation of the theorem {\small\verb%x=T |- !x. x=T%}, which is clearly invalid.
-{\par\samepage\setseps\small
-\begin{verbatim}
- #top_print print_all_thm;;
- - : (thm -> void)
-
- #let t = ASSUME "x=T";;
- t = x = T |- x = T
-
- #GEN "x:bool" t;;
- evaluation failed GEN
-\end{verbatim}
-}
-\SEEALSO
-GENL, GEN_ALL, GEN_TAC, SPEC, SPECL, SPEC_ALL, SPEC_TAC.
-
-\ENDDOC
-\DOC{GENL}
-
-\TYPE {\small\verb%GENL : (term list -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Generalizes zero or more variables in the conclusion of a theorem.
-
-\DESCRIBE
-When applied to a term list {\small\verb%[x1;...;xn]%} and a theorem {\small\verb%A |- t%}, the inference
-rule {\small\verb%GENL%} returns the theorem {\small\verb%A |- !x1...xn. t%}, provided none of the
-variables {\small\verb%xi%} are free in any of the assumptions. It is not necessary that
-any or all of the {\small\verb%xi%} should be free in {\small\verb%t%}.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- t
- ------------------ GENL "[x1;...;xn]" [where no xi is free in A]
- A |- !x1...xn. t
-\end{verbatim}
-}
-\FAILURE
-Fails unless all the terms in the list are variables, none of which are
-free in the assumption list.
-
-\SEEALSO
-GEN, GEN_ALL, GEN_TAC, SPEC, SPECL, SPEC_ALL, SPEC_TAC.
-
-\ENDDOC
-\DOC{genvar}
-
-\TYPE {\small\verb%genvar : (type -> term)%}\egroup
-
-\SYNOPSIS
-Returns a variable whose name has not been used previously.
-
-\DESCRIBE
-When given a type, {\small\verb%genvar%} returns a variable of that type whose name has
-not been used for a variable or constant in the HOL session so far.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-The following indicates the typical stylized form of the names (this should
-not be relied on, of course):
-{\par\samepage\setseps\small
-\begin{verbatim}
- #genvar ":bool";;
- "GEN%VAR%357" : term
-
- #genvar ":num";;
- "GEN%VAR%358" : term
-\end{verbatim}
-}
-\noindent Trying to anticipate {\small\verb%genvar%} doesn't work:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #let v = mk_var(`GEN%VAR%359`,":bool");;
- v = "GEN%VAR%359" : term
-
- #genvar ":bool";;
- "GEN%VAR%360" : term
-\end{verbatim}
-}
-\USES
-The unique variables are useful in writing derived rules, for specializing
-terms without having to worry about such things as free variable capture.
-If the names are to be visible to a typical user, the function {\small\verb%variant%} can
-provide rather more meaningful names.
-
-\SEEALSO
-GSPEC, variant.
-
-\ENDDOC
\DOC{GEN\_ALL}
\TYPE {\small\verb%GEN_ALL : (thm -> thm)%}\egroup
@@ -9670,21 +9524,89 @@ the following, it acts in the same way a
pair, so {\small\verb%FST%} and {\small\verb%SND%} are introduced:
{\par\samepage\setseps\small
\begin{verbatim}
- #GEN_BETA_CONV "(\(x,y). x + y) numpair";;
- |- (\(x,y). x + y)numpair = (FST numpair) + (SND numpair)
+ #GEN_BETA_CONV "(\(x,y). x + y) numpair";;
+ |- (\(x,y). x + y)numpair = (FST numpair) + (SND numpair)
+\end{verbatim}
+}
+\noindent The introduction of {\small\verb%FST%} and {\small\verb%SND%} will be done more than once as
+necessary:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #GEN_BETA_CONV "(\(w,x,y,z). w + x + y + z) (1,triple)";;
+ |- (\(w,x,y,z). w + (x + (y + z)))(1,triple) =
+ 1 + ((FST triple) + ((FST(SND triple)) + (SND(SND triple))))
+\end{verbatim}
+}
+\SEEALSO
+BETA_CONV, PAIRED_BETA_CONV.
+
+\ENDDOC
+\DOC{GEN}
+
+\TYPE {\small\verb%GEN : (term -> thm -> thm)%}\egroup
+
+\SYNOPSIS
+Generalizes the conclusion of a theorem.
+
+\DESCRIBE
+When applied to a term {\small\verb%x%} and a theorem {\small\verb%A |- t%}, the inference rule
+{\small\verb%GEN%} returns the theorem {\small\verb%A |- !x. t%}, provided {\small\verb%x%} is a variable not
+free in any of the assumptions. There is no compulsion that {\small\verb%x%} should
+be free in {\small\verb%t%}.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t
+ ------------ GEN "x" [where x is not free in A]
+ A |- !x. t
+\end{verbatim}
+}
+\FAILURE
+Fails if {\small\verb%x%} is not a variable, or if it is free in any of the assumptions.
+
+\EXAMPLE
+The following example shows how the above side-condition prevents
+the derivation of the theorem {\small\verb%x=T |- !x. x=T%}, which is clearly invalid.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #top_print print_all_thm;;
+ - : (thm -> void)
+
+ #let t = ASSUME "x=T";;
+ t = x = T |- x = T
+
+ #GEN "x:bool" t;;
+ evaluation failed GEN
\end{verbatim}
}
-\noindent The introduction of {\small\verb%FST%} and {\small\verb%SND%} will be done more than once as
-necessary:
+\SEEALSO
+GENL, GEN_ALL, GEN_TAC, SPEC, SPECL, SPEC_ALL, SPEC_TAC.
+
+\ENDDOC
+\DOC{GENL}
+
+\TYPE {\small\verb%GENL : (term list -> thm -> thm)%}\egroup
+
+\SYNOPSIS
+Generalizes zero or more variables in the conclusion of a theorem.
+
+\DESCRIBE
+When applied to a term list {\small\verb%[x1;...;xn]%} and a theorem {\small\verb%A |- t%}, the inference
+rule {\small\verb%GENL%} returns the theorem {\small\verb%A |- !x1...xn. t%}, provided none of the
+variables {\small\verb%xi%} are free in any of the assumptions. It is not necessary that
+any or all of the {\small\verb%xi%} should be free in {\small\verb%t%}.
{\par\samepage\setseps\small
\begin{verbatim}
- #GEN_BETA_CONV "(\(w,x,y,z). w + x + y + z) (1,triple)";;
- |- (\(w,x,y,z). w + (x + (y + z)))(1,triple) =
- 1 + ((FST triple) + ((FST(SND triple)) + (SND(SND triple))))
+ A |- t
+ ------------------ GENL "[x1;...;xn]" [where no xi is free in A]
+ A |- !x1...xn. t
\end{verbatim}
}
+\FAILURE
+Fails unless all the terms in the list are variables, none of which are
+free in the assumption list.
+
\SEEALSO
-BETA_CONV, PAIRED_BETA_CONV.
+GEN, GEN_ALL, GEN_TAC, SPEC, SPECL, SPEC_ALL, SPEC_TAC.
\ENDDOC
\DOC{GEN\_REWRITE\_CONV}
@@ -9976,28 +9898,51 @@ FILTER_GEN_TAC, GEN, GENL, GEN_ALL, SPEC
X_GEN_TAC.
\ENDDOC
-\DOC{getenv}
+\DOC{genvar}
-\TYPE {\small\verb%getenv : (string -> string)%}\egroup
+\TYPE {\small\verb%genvar : (type -> term)%}\egroup
\SYNOPSIS
-Returns the value of a Unix environment variable.
+Returns a variable whose name has not been used previously.
\DESCRIBE
-{\small\verb%getenv x%} returns the value of {\small\verb%x%} from the current environment list; this
-will include shell environment variables set before {\small\verb%HOL%} is run.
+When given a type, {\small\verb%genvar%} returns a variable of that type whose name has
+not been used for a variable or constant in the HOL session so far.
\FAILURE
-If in a Unix environment, fails with {\small\verb%getenv%} if the variable is undefined,
-or has an empty value. In other environments, it will normally fail anyway.
+Never fails.
\EXAMPLE
+The following indicates the typical stylized form of the names (this should
+not be relied on, of course):
{\par\samepage\setseps\small
\begin{verbatim}
-#getenv `SHELL`;;
-`/bin/csh` : string
+ #genvar ":bool";;
+ "GEN%VAR%357" : term
+
+ #genvar ":num";;
+ "GEN%VAR%358" : term
+\end{verbatim}
+}
+\noindent Trying to anticipate {\small\verb%genvar%} doesn't work:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #let v = mk_var(`GEN%VAR%359`,":bool");;
+ v = "GEN%VAR%359" : term
+
+ #genvar ":bool";;
+ "GEN%VAR%360" : term
\end{verbatim}
}
+\USES
+The unique variables are useful in writing derived rules, for specializing
+terms without having to worry about such things as free variable capture.
+If the names are to be visible to a typical user, the function {\small\verb%variant%} can
+provide rather more meaningful names.
+
+\SEEALSO
+GSPEC, variant.
+
\ENDDOC
\DOC{get\_const\_type}
@@ -10023,6 +9968,29 @@ Gets the generic type of a constant from
dest_const, is_constant.
\ENDDOC
+\DOC{getenv}
+
+\TYPE {\small\verb%getenv : (string -> string)%}\egroup
+
+\SYNOPSIS
+Returns the value of a Unix environment variable.
+
+\DESCRIBE
+{\small\verb%getenv x%} returns the value of {\small\verb%x%} from the current environment list; this
+will include shell environment variables set before {\small\verb%HOL%} is run.
+
+\FAILURE
+If in a Unix environment, fails with {\small\verb%getenv%} if the variable is undefined,
+or has an empty value. In other environments, it will normally fail anyway.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#getenv `SHELL`;;
+`/bin/csh` : string
+\end{verbatim}
+}
+\ENDDOC
\DOC{get\_flag\_value}
\TYPE {\small\verb%get_flag_value : (string -> bool)%}\egroup
@@ -10330,6 +10298,36 @@ variable is free in that function.
ETA_CONV, MK_ABS, MK_COMB, MK_EXISTS.
\ENDDOC
+\DOC{\char'136}
+
+\TYPE {\small\verb%$^ : (string -> string -> string)%}\egroup
+
+\SYNOPSIS
+Concatenates two ML strings.
+
+\DESCRIBE
+The {\small\verb%^%} is the ML infix string concatenation operator.
+If {\small\verb%s1%} and {\small\verb%s2%} are strings, then {\small\verb%s1^s2%} gives a string which is their
+concatenation.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#`Hello `^`world`;;
+`Hello world` : string
+\end{verbatim}
+}
+\COMMENTS
+The ML role of the {\small\verb%^%} operator should not be confused with its use in
+quoted terms to introduce antiquotation (see DESCRIPTION for details).
+
+\SEEALSO
+concat, concatl.
+
+\ENDDOC
\DOC{hd}
\TYPE {\small\verb%hd : (* list -> *)%}\egroup
@@ -10544,36 +10542,6 @@ Never fails.
\#, B, C, CB, Co, K, KI, o, oo, S, W.
\ENDDOC
-\DOC{implode}
-
-\TYPE {\small\verb%implode : (string list -> string)%}\egroup
-
-\SYNOPSIS
-Converts a list of single-character strings into one string.
-
-\DESCRIBE
-{\small\verb%implode [s1;...;sn]%} returns the string formed by concatenating the
-single-character strings {\small\verb%s1 ... sn%}. If {\small\verb%n%} is zero (the list is empty),
-then the empty string is returned.
-
-\FAILURE
-Fails if any of the strings in the argument list are null or longer than one
-character.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#implode [`e`;`x`;`a`;`m`;`p`;`l`;`e`];;
-`example` : string
-
-#implode [`ex`;`a`;`mpl`;``;`e`];;
-evaluation failed implode
-\end{verbatim}
-}
-\SEEALSO
-explode, concat, concatl.
-
-\ENDDOC
\DOC{IMP\_ANTISYM\_RULE}
\TYPE {\small\verb%IMP_ANTISYM_RULE : (thm -> thm -> thm)%}\egroup
@@ -10680,6 +10648,36 @@ Fails unless the theorem is implicative.
NOT_INTRO, NOT_ELIM.
\ENDDOC
+\DOC{implode}
+
+\TYPE {\small\verb%implode : (string list -> string)%}\egroup
+
+\SYNOPSIS
+Converts a list of single-character strings into one string.
+
+\DESCRIBE
+{\small\verb%implode [s1;...;sn]%} returns the string formed by concatenating the
+single-character strings {\small\verb%s1 ... sn%}. If {\small\verb%n%} is zero (the list is empty),
+then the empty string is returned.
+
+\FAILURE
+Fails if any of the strings in the argument list are null or longer than one
+character.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#implode [`e`;`x`;`a`;`m`;`p`;`l`;`e`];;
+`example` : string
+
+#implode [`ex`;`a`;`mpl`;``;`e`];;
+evaluation failed implode
+\end{verbatim}
+}
+\SEEALSO
+explode, concat, concatl.
+
+\ENDDOC
\DOC{IMP\_RES\_TAC}
\TYPE {\small\verb%IMP_RES_TAC : thm_tactic%}\egroup
@@ -11193,43 +11191,73 @@ y = inr 12 : (string + int)
inl, isl, outl, outr.
\ENDDOC
-\DOC{INST}
+\DOC{install}
-\TYPE {\small\verb%INST : ((term # term) list -> thm -> thm)%}\egroup
+\TYPE {\small\verb%install : (string -> void)%}\egroup
\SYNOPSIS
-Instantiates free variables in a theorem.
+Informs HOL of the absolute pathname to the hol distribution directory.
\DESCRIBE
-{\small\verb%INST%} is a rule for substituting arbitrary terms for free variables
-in a theorem:
+{\small\verb%install%} reconfigures a running HOL system to a new root directory. The
+string argument to {\small\verb%install%} should be the absolute path name to the
+directory in which the HOL system is located. Executing
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t
- ----------------------------- INST [(t1,x1);...;(tn,xn)]
- A |- t[t1,...,tn/x1,...,xn]
+ install `/dir1/dir2/dir3/.../hol`;;
\end{verbatim}
}
-\noindent where the variables {\small\verb%x1, ..., xn%} are not free in the
-assumptions {\small\verb%A%}.
+\noindent sets the internal HOL search path to:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ [``; `~/`; `/dir1/dir2/dir3/.../hol/theories/`]
+\end{verbatim}
+}
+\noindent In addition, {\small\verb%install%} sets the internal search path used by HOL to
+find the standard online help files and the internal search path used by HOL to
+find libraries.
\FAILURE
-{\small\verb%INST%} fails if a variable being instantiated is free in the
-assumptions.
+Never fails.
-\EXAMPLE
-In the following example a theorem is instantiated for a specific term:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #CONJUNCT1 ADD_CLAUSES ;;
- |- 0 + m = m
+\COMMENTS
+The effect persists only for the current HOL session. To change the image
+permanently, use the {\small\verb%save%} function after installation.
- #INST [("2 * x","m:num")] (CONJUNCT1 ADD_CLAUSES) ;;
- |- 0 + (2 * x) = 2 * x
+\SEEALSO
+help_search_path, library_pathname, library_search_path, search_path,
+set_help_search_path, set_library_search_path, set_search_path.
+
+\ENDDOC
+\DOC{inst\_check}
+
+\TYPE {\small\verb%inst_check : (((type # type) list # term list) -> term list)%}\egroup
+
+\SYNOPSIS
+Checks the validity of type instantiations.
+
+\DESCRIBE
+If the {\small\verb%t1...tn%} are types (monomorphic or polymorphic), the {\small\verb%v1...vn%} type
+variables (e.g. {\small\verb%":*"%}), and {\small\verb%tm1...tmn%} terms, the call
+{\par\samepage\setseps\small
+\begin{verbatim}
+ inst_check ([(t1,v1);...;(tn,vn)],[tm1;...;tmn])
\end{verbatim}
}
+\noindent will return a list of the variables free in the {\small\verb%tm1...tmn%}, provided
+none of the type variables {\small\verb%v1...vn%} are free in {\small\verb%tm1...tmn%}. If this condition
+is not met, or any of the {\small\verb%v%}'s are not simply type variables, the call fails.
+
+\FAILURE
+Fails if any of the {\small\verb%v%}'s are not simple type variables, or if any of them are
+free in the terms {\small\verb%v1...vn%}.
+
+\USES
+Checking the validity of type instantiations (for example, if the terms are the
+hypotheses of a theorem).
+
\SEEALSO
-INST_TY_TERM, INST_TYPE, ISPEC, ISPECL, SPEC; SPECL, SUBS, subst, SUBST.
+inst, inst_rename_list, inst_type, INST_TYPE.
\ENDDOC
\DOC{inst}
@@ -11281,73 +11309,43 @@ Performing internal functions connected
inst_check, inst_rename_list, inst_type, INST_TYPE.
\ENDDOC
-\DOC{install}
+\DOC{INST}
-\TYPE {\small\verb%install : (string -> void)%}\egroup
+\TYPE {\small\verb%INST : ((term # term) list -> thm -> thm)%}\egroup
\SYNOPSIS
-Informs HOL of the absolute pathname to the hol distribution directory.
+Instantiates free variables in a theorem.
\DESCRIBE
-{\small\verb%install%} reconfigures a running HOL system to a new root directory. The
-string argument to {\small\verb%install%} should be the absolute path name to the
-directory in which the HOL system is located. Executing
-{\par\samepage\setseps\small
-\begin{verbatim}
- install `/dir1/dir2/dir3/.../hol`;;
-\end{verbatim}
-}
-\noindent sets the internal HOL search path to:
+{\small\verb%INST%} is a rule for substituting arbitrary terms for free variables
+in a theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- [``; `~/`; `/dir1/dir2/dir3/.../hol/theories/`]
+ A |- t
+ ----------------------------- INST [(t1,x1);...;(tn,xn)]
+ A |- t[t1,...,tn/x1,...,xn]
\end{verbatim}
}
-\noindent In addition, {\small\verb%install%} sets the internal search path used by HOL to
-find the standard online help files and the internal search path used by HOL to
-find libraries.
+\noindent where the variables {\small\verb%x1, ..., xn%} are not free in the
+assumptions {\small\verb%A%}.
\FAILURE
-Never fails.
-
-\COMMENTS
-The effect persists only for the current HOL session. To change the image
-permanently, use the {\small\verb%save%} function after installation.
-
-\SEEALSO
-help_search_path, library_pathname, library_search_path, search_path,
-set_help_search_path, set_library_search_path, set_search_path.
-
-\ENDDOC
-\DOC{inst\_check}
-
-\TYPE {\small\verb%inst_check : (((type # type) list # term list) -> term list)%}\egroup
-
-\SYNOPSIS
-Checks the validity of type instantiations.
+{\small\verb%INST%} fails if a variable being instantiated is free in the
+assumptions.
-\DESCRIBE
-If the {\small\verb%t1...tn%} are types (monomorphic or polymorphic), the {\small\verb%v1...vn%} type
-variables (e.g. {\small\verb%":*"%}), and {\small\verb%tm1...tmn%} terms, the call
+\EXAMPLE
+In the following example a theorem is instantiated for a specific term:
{\par\samepage\setseps\small
\begin{verbatim}
- inst_check ([(t1,v1);...;(tn,vn)],[tm1;...;tmn])
+ #CONJUNCT1 ADD_CLAUSES ;;
+ |- 0 + m = m
+
+ #INST [("2 * x","m:num")] (CONJUNCT1 ADD_CLAUSES) ;;
+ |- 0 + (2 * x) = 2 * x
\end{verbatim}
}
-\noindent will return a list of the variables free in the {\small\verb%tm1...tmn%}, provided
-none of the type variables {\small\verb%v1...vn%} are free in {\small\verb%tm1...tmn%}. If this condition
-is not met, or any of the {\small\verb%v%}'s are not simply type variables, the call fails.
-
-\FAILURE
-Fails if any of the {\small\verb%v%}'s are not simple type variables, or if any of them are
-free in the terms {\small\verb%v1...vn%}.
-
-\USES
-Checking the validity of type instantiations (for example, if the terms are the
-hypotheses of a theorem).
-
\SEEALSO
-inst, inst_rename_list, inst_type, INST_TYPE.
+INST_TY_TERM, INST_TYPE, ISPEC, ISPECL, SPEC; SPECL, SUBS, subst, SUBST.
\ENDDOC
\DOC{inst\_rename\_list}
@@ -11395,6 +11393,51 @@ Checking the validity of type instantiat
inst, inst_check, inst_type, INST_TYPE.
\ENDDOC
+\DOC{inst\_type}
+
+\TYPE {\small\verb%inst_type : ((type # type) list -> type -> type)%}\egroup
+
+\SYNOPSIS
+Instantiates types in a type.
+
+\DESCRIBE
+If {\small\verb%[(t1',t1);...;(tn',tn)]%} is a list of type instantiations, where {\small\verb%t1...tn%}
+are the initial types, and {\small\verb%t1'...tn'%} the desired instantiations, and {\small\verb%ty%} is
+a type to instantiate, the call
+{\par\samepage\setseps\small
+\begin{verbatim}
+ inst_type [(t1',t1);...;(tn',tn)] ty
+\end{verbatim}
+}
+\noindent will appropriately instantiate the type {\small\verb%ty%}. The instantiations will
+be performed in parallel. If several of the type instantiations are applicable,
+the choice is undefined. In normal use the {\small\verb%t1...tn%} are type variables,
+although this is not essential. Neither is it necessary that any or all of the
+types {\small\verb%t1...tn%} should in fact appear in {\small\verb%ty%}.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#inst_type [(":bool",":*")] ":* # **";;
+":bool # **" : type
+
+#inst_type [(":num",":* # **"); (":bool",":*")] ":* # **";;
+":num" : type
+
+#inst_type [(":bool",":*"); (":num",":* # **")] ":* # **";;
+":num" : type
+
+#inst_type [(":bool",":num"); (":num",":bool")] ":(bool)list";;
+":(num)list" : type
+\end{verbatim}
+}
+\SEEALSO
+inst, inst_check, inst_type, INST_TYPE.
+
+\ENDDOC
\DOC{INST\_TYPE}
\TYPE {\small\verb%INST_TYPE : ((type # type) list -> thm -> thm)%}\egroup
@@ -11446,51 +11489,6 @@ The desired specialization can be obtain
INST, INST_TY_TERM.
\ENDDOC
-\DOC{inst\_type}
-
-\TYPE {\small\verb%inst_type : ((type # type) list -> type -> type)%}\egroup
-
-\SYNOPSIS
-Instantiates types in a type.
-
-\DESCRIBE
-If {\small\verb%[(t1',t1);...;(tn',tn)]%} is a list of type instantiations, where {\small\verb%t1...tn%}
-are the initial types, and {\small\verb%t1'...tn'%} the desired instantiations, and {\small\verb%ty%} is
-a type to instantiate, the call
-{\par\samepage\setseps\small
-\begin{verbatim}
- inst_type [(t1',t1);...;(tn',tn)] ty
-\end{verbatim}
-}
-\noindent will appropriately instantiate the type {\small\verb%ty%}. The instantiations will
-be performed in parallel. If several of the type instantiations are applicable,
-the choice is undefined. In normal use the {\small\verb%t1...tn%} are type variables,
-although this is not essential. Neither is it necessary that any or all of the
-types {\small\verb%t1...tn%} should in fact appear in {\small\verb%ty%}.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#inst_type [(":bool",":*")] ":* # **";;
-":bool # **" : type
-
-#inst_type [(":num",":* # **"); (":bool",":*")] ":* # **";;
-":num" : type
-
-#inst_type [(":bool",":*"); (":num",":* # **")] ":* # **";;
-":num" : type
-
-#inst_type [(":bool",":num"); (":num",":bool")] ":(bool)list";;
-":(num)list" : type
-\end{verbatim}
-}
-\SEEALSO
-inst, inst_check, inst_type, INST_TYPE.
-
-\ENDDOC
\DOC{INST\_TY\_TERM}
\TYPE {\small\verb%INST_TY_TERM : (((term # term) list # (type # type) list) -> thm -> thm)%}\egroup
@@ -11583,105 +11581,25 @@ ascii, ascii_code, string_of_int.
\TYPE {\small\verb%int_of_term : (term -> int)%}\egroup
\SYNOPSIS
-Maps a numeric term to the corresponding ML integer.
-
-\DESCRIBE
-Given a term representing a natural number, i.e., of type {\small\verb%:num%}
-{\small\verb%int_of_term%} returns the corresponding ML integer constant.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
- #int_of_term "2";;
- 2 : int
-\end{verbatim}
-}
-
-\SEEALSO
-term_of_int, string_of_int, int_of_string.
-
-\ENDDOC
-\DOC{isl}
-
-\TYPE {\small\verb%isl : ((* + **) -> bool)%}\egroup
-
-\SYNOPSIS
-Tests for membership of left summand.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#let x = inl 1 and y = inr 2;;
-
-#isl x;;
-true : bool
-
-#isl y;;
-false : bool
-\end{verbatim}
-}
-\SEEALSO
-inl, inr
-
-\ENDDOC
-\DOC{ISPEC}
-
-\TYPE {\small\verb%ISPEC : (term -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Specializes a theorem, with type instantiation if necessary.
-
-\DESCRIBE
-This rule specializes a quantified variable as does {\small\verb%SPEC%}; it differs
-from it in also instantiating the type if needed:
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- !x:ty.tm
- ----------------------- ISPEC "t:ty'"
- A |- tm[t/x]
-\end{verbatim}
-}
-\noindent (where {\small\verb%t%} is free for {\small\verb%x%} in {\small\verb%tm%}, and {\small\verb%ty'%} is an instance
-of {\small\verb%ty%}).
-
-\FAILURE
-{\small\verb%ISPEC%} fails if the input theorem is not universally quantified, if
-the type of the given term is not an instance of the type of the
-quantified variable, or if the type variable is free in the
-assumptions.
-
-\SEEALSO
-INST_TY_TERM, INST_TYPE, ISPECL, SPEC, match.
-
-\ENDDOC
-\DOC{ISPECL}
-
-\TYPE {\small\verb%ISPECL : (term list -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Specializes a theorem zero or more times, with type instantiation if necessary.
+Maps a numeric term to the corresponding ML integer.
\DESCRIBE
-{\small\verb%ISPECL%} is an iterative version of {\small\verb%ISPEC%}
+Given a term representing a natural number, i.e., of type {\small\verb%:num%}
+{\small\verb%int_of_term%} returns the corresponding ML integer constant.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
- A |- !x1...xn.t
- ---------------------------- ISPECL ["t1",...,"tn"]
- A |- t[t1,...tn/x1,...,xn]
+ #int_of_term "2";;
+ 2 : int
\end{verbatim}
}
-\noindent (where {\small\verb%ti%} is free for {\small\verb%xi%} in {\small\verb%tm%}).
-
-\FAILURE
-{\small\verb%ISPECL%} fails if the list of terms is longer than the number of
-quantified variables in the term, if the type instantiation fails, or
-if the type variable being instantiated is free in the assumptions.
\SEEALSO
-INST_TYPE, INST_TY_TERM, ISPEC, MATCH, SPEC, SPECL.
+term_of_int, string_of_int, int_of_string.
\ENDDOC
\DOC{is\_abs}
@@ -11896,24 +11814,6 @@ Never fails.
mk_cons, dest_cons, mk_list, dest_list, is_list.
\ENDDOC
-\DOC{is\_const}
-
-\TYPE {\small\verb%is_const : (term -> bool)%}\egroup
-
-\SYNOPSIS
-Tests a term to see if it is a constant.
-
-\DESCRIBE
-{\small\verb%is_const "const:ty"%} returns {\small\verb%true%}. If the term is not a constant the
-result is {\small\verb%false%}.
-
-\FAILURE
-Never fails.
-
-\SEEALSO
-mk_const, dest_const, is_var, is_comb, is_abs.
-
-\ENDDOC
\DOC{is\_constant}
\TYPE {\small\verb%is_constant : (string -> bool)%}\egroup
@@ -11949,6 +11849,24 @@ false : bool
is_infix, is_binder
\ENDDOC
+\DOC{is\_const}
+
+\TYPE {\small\verb%is_const : (term -> bool)%}\egroup
+
+\SYNOPSIS
+Tests a term to see if it is a constant.
+
+\DESCRIBE
+{\small\verb%is_const "const:ty"%} returns {\small\verb%true%}. If the term is not a constant the
+result is {\small\verb%false%}.
+
+\FAILURE
+Never fails.
+
+\SEEALSO
+mk_const, dest_const, is_var, is_comb, is_abs.
+
+\ENDDOC
\DOC{is\_definition}
\TYPE {\small\verb%is_definition : (term -> bool)%}\egroup
@@ -12210,6 +12128,29 @@ false : bool
is_infix, is_type, is_binder_type
\ENDDOC
+\DOC{isl}
+
+\TYPE {\small\verb%isl : ((* + **) -> bool)%}\egroup
+
+\SYNOPSIS
+Tests for membership of left summand.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#let x = inl 1 and y = inr 2;;
+
+#isl x;;
+true : bool
+
+#isl y;;
+false : bool
+\end{verbatim}
+}
+\SEEALSO
+inl, inr
+
+\ENDDOC
\DOC{is\_let}
\TYPE {\small\verb%is_let : (term -> bool)%}\egroup
@@ -12407,6 +12348,63 @@ Never fails.
mk_pair, dest_pair.
\ENDDOC
+\DOC{ISPEC}
+
+\TYPE {\small\verb%ISPEC : (term -> thm -> thm)%}\egroup
+
+\SYNOPSIS
+Specializes a theorem, with type instantiation if necessary.
+
+\DESCRIBE
+This rule specializes a quantified variable as does {\small\verb%SPEC%}; it differs
+from it in also instantiating the type if needed:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- !x:ty.tm
+ ----------------------- ISPEC "t:ty'"
+ A |- tm[t/x]
+\end{verbatim}
+}
+\noindent (where {\small\verb%t%} is free for {\small\verb%x%} in {\small\verb%tm%}, and {\small\verb%ty'%} is an instance
+of {\small\verb%ty%}).
+
+\FAILURE
+{\small\verb%ISPEC%} fails if the input theorem is not universally quantified, if
+the type of the given term is not an instance of the type of the
+quantified variable, or if the type variable is free in the
+assumptions.
+
+\SEEALSO
+INST_TY_TERM, INST_TYPE, ISPECL, SPEC, match.
+
+\ENDDOC
+\DOC{ISPECL}
+
+\TYPE {\small\verb%ISPECL : (term list -> thm -> thm)%}\egroup
+
+\SYNOPSIS
+Specializes a theorem zero or more times, with type instantiation if necessary.
+
+\DESCRIBE
+{\small\verb%ISPECL%} is an iterative version of {\small\verb%ISPEC%}
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- !x1...xn.t
+ ---------------------------- ISPECL ["t1",...,"tn"]
+ A |- t[t1,...tn/x1,...,xn]
+\end{verbatim}
+}
+\noindent (where {\small\verb%ti%} is free for {\small\verb%xi%} in {\small\verb%tm%}).
+
+\FAILURE
+{\small\verb%ISPECL%} fails if the list of terms is longer than the number of
+quantified variables in the term, if the type instantiation fails, or
+if the type variable being instantiated is free in the assumptions.
+
+\SEEALSO
+INST_TYPE, INST_TY_TERM, ISPEC, MATCH, SPEC, SPECL.
+
+\ENDDOC
\DOC{is\_pred}
\TYPE {\small\verb%is_pred : (term -> bool)%}\egroup
@@ -12580,65 +12578,65 @@ Used in evaluating expressions that requ
expression.
\ENDDOC
-\DOC{itlist}
+\DOC{itlist2}
-\TYPE {\small\verb%itlist : ((* -> ** -> **) -> * list -> ** -> **)%}\egroup
+\TYPE {\small\verb%itlist2 : (((* # **) -> *** -> ***) -> (* list # ** list) -> *** -> ***)%}\egroup
\SYNOPSIS
-List iteration function. Applies a binary function between adjacent elements
-of a list.
+Applies a paired function between adjacent elements of 2 lists.
\DESCRIBE
-{\small\verb%itlist f [x1;...;xn] y%} returns
+{\small\verb%itlist2 f ([x1;...;xn],[y1;...;yn]) z%} returns
{\par\samepage\setseps\small
\begin{verbatim}
- f x1 (f x2 ... (f xn y)...)
+ f (x1,y1) (f (x2,y2) ... (f (xn,yn) z)...)
\end{verbatim}
}
-\noindent It returns {\small\verb%y%} if list is empty.
+\noindent It returns {\small\verb%z%} if both lists are empty.
\FAILURE
-Never fails.
+Fails with {\small\verb%itlist2%} if the two lists are of different lengths.
\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
-#itlist (\x y. x + y) [1;2;3;4] 0;;
-10 : int
+#itlist2 (\(x,y) z. (x * y) + z) ([1;2],[3;4]) 0;;
+11 : int
\end{verbatim}
}
\SEEALSO
-rev_itlist, end_itlist.
+itlist, rev_itlist, end_itlist, uncurry.
\ENDDOC
-\DOC{itlist2}
+\DOC{itlist}
-\TYPE {\small\verb%itlist2 : (((* # **) -> *** -> ***) -> (* list # ** list) -> *** -> ***)%}\egroup
+\TYPE {\small\verb%itlist : ((* -> ** -> **) -> * list -> ** -> **)%}\egroup
\SYNOPSIS
-Applies a paired function between adjacent elements of 2 lists.
+List iteration function. Applies a binary function between adjacent elements
+of a list.
\DESCRIBE
-{\small\verb%itlist2 f ([x1;...;xn],[y1;...;yn]) z%} returns
+{\small\verb%itlist f [x1;...;xn] y%} returns
{\par\samepage\setseps\small
\begin{verbatim}
- f (x1,y1) (f (x2,y2) ... (f (xn,yn) z)...)
+ f x1 (f x2 ... (f xn y)...)
\end{verbatim}
}
-\noindent It returns {\small\verb%z%} if both lists are empty.
+\noindent It returns {\small\verb%y%} if list is empty.
\FAILURE
-Fails with {\small\verb%itlist2%} if the two lists are of different lengths.
+Never fails.
\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
-#itlist2 (\(x,y) z. (x * y) + z) ([1;2],[3;4]) 0;;
-11 : int
+#itlist (\x y. x + y) [1;2;3;4] 0;;
+10 : int
\end{verbatim}
}
\SEEALSO
-itlist, rev_itlist, end_itlist, uncurry.
+rev_itlist, end_itlist.
\ENDDOC
\DOC{K}
@@ -12672,6 +12670,34 @@ Never fails.
\#, B, C, CB, Co, I, K, o, oo, S, W.
\ENDDOC
+\DOC{LAST\_CONV}
+
+\TYPE {\small\verb%LAST_CONV : conv%}\egroup
+
+\SYNOPSIS
+Computes by inference the result of taking the last element of a list.
+
+\DESCRIBE
+For any object language list of the form {\small\verb%"[x0;...x(n-1)]"%} ,
+the result of evaluating
+{\par\samepage\setseps\small
+\begin{verbatim}
+ LAST_CONV "LAST [x0;...;x(n-1)]"
+\end{verbatim}
+}
+\noindent is the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- LAST [x0;...;x(n-1)] = x(n-1)
+\end{verbatim}
+}
+
+
+\FAILURE
+{\small\verb%LAST_CONV tm%} fails if {\small\verb%tm%} is an empty list.
+
+\ENDDOC
+
\DOC{last}
\TYPE {\small\verb%last : (* list -> *)%}\egroup
@@ -12718,34 +12744,6 @@ or {\small\verb%k%} is greater than the
\ENDDOC
-\DOC{LAST\_CONV}
-
-\TYPE {\small\verb%LAST_CONV : conv%}\egroup
-
-\SYNOPSIS
-Computes by inference the result of taking the last element of a list.
-
-\DESCRIBE
-For any object language list of the form {\small\verb%"[x0;...x(n-1)]"%} ,
-the result of evaluating
-{\par\samepage\setseps\small
-\begin{verbatim}
- LAST_CONV "LAST [x0;...;x(n-1)]"
-\end{verbatim}
-}
-\noindent is the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- LAST [x0;...;x(n-1)] = x(n-1)
-\end{verbatim}
-}
-
-
-\FAILURE
-{\small\verb%LAST_CONV tm%} fails if {\small\verb%tm%} is an empty list.
-
-\ENDDOC
-
\DOC{LEFT\_AND\_EXISTS\_CONV}
\TYPE {\small\verb%LEFT_AND_EXISTS_CONV : conv%}\egroup
@@ -12902,17 +12900,6 @@ Fails if applied to a term not of the fo
OR_FORALL_CONV, FORALL_OR_CONV, RIGHT_OR_FORALL_CONV.
\ENDDOC
-\DOC{length}
-
-\TYPE {\small\verb%length : (* list -> int)%}\egroup
-
-\SYNOPSIS
-Computes the length of a list: {\small\verb%length [x1;...;xn]%} returns {\small\verb%n%}.
-
-\FAILURE
-Never fails.
-
-\ENDDOC
\DOC{LENGTH\_CONV}
\TYPE {\small\verb%LENGTH_CONV : conv%}\egroup
@@ -12938,8 +12925,19 @@ For any object language list of the form
list.
\FAILURE
-{\small\verb%LENGTH_CONV tm%} fails if {\small\verb%tm%} is not of the form {\small\verb%"LENGTH [x1;x2;...;xn]"%} or
-{\small\verb%"LENGTH []"%}.
+{\small\verb%LENGTH_CONV tm%} fails if {\small\verb%tm%} is not of the form {\small\verb%"LENGTH [x1;x2;...;xn]"%} or
+{\small\verb%"LENGTH []"%}.
+
+\ENDDOC
+\DOC{length}
+
+\TYPE {\small\verb%length : (* list -> int)%}\egroup
+
+\SYNOPSIS
+Computes the length of a list: {\small\verb%length [x1;...;xn]%} returns {\small\verb%n%}.
+
+\FAILURE
+Never fails.
\ENDDOC
\DOC{let\_after}
@@ -13418,6 +13416,25 @@ systems.
system, unlink.
\ENDDOC
+\DOC{lisp\_dir\_pathname}
+
+\TYPE {\small\verb%lisp_dir_pathname : string%}\egroup
+
+\SYNOPSIS
+Absolute pathname to the HOL lisp sources.
+
+\DESCRIBE
+For implementation reasons, the ML variable {\small\verb%lisp_dir_pathname%} is bound when
+the system if built to a string giving the absolute pathname of the directory
+containing the HOL lisp sources. This value is not for general use.
+
+\FAILURE
+Evaluating {\small\verb%lisp_dir_pathname%} never fails.
+
+\SEEALSO
+ml_dir_pathname.
+
+\ENDDOC
\DOC{lisp}
\TYPE {\small\verb%lisp : (string -> void)%}\egroup
@@ -13464,25 +13481,6 @@ using it.
dropout, lsp.
\ENDDOC
-\DOC{lisp\_dir\_pathname}
-
-\TYPE {\small\verb%lisp_dir_pathname : string%}\egroup
-
-\SYNOPSIS
-Absolute pathname to the HOL lisp sources.
-
-\DESCRIBE
-For implementation reasons, the ML variable {\small\verb%lisp_dir_pathname%} is bound when
-the system if built to a string giving the absolute pathname of the directory
-containing the HOL lisp sources. This value is not for general use.
-
-\FAILURE
-Evaluating {\small\verb%lisp_dir_pathname%} never fails.
-
-\SEEALSO
-ml_dir_pathname.
-
-\ENDDOC
\DOC{LIST\_BETA\_CONV}
\TYPE {\small\verb%LIST_BETA_CONV : conv%}\egroup
@@ -13855,6 +13853,28 @@ evaluation failed list_mk_disj
disjuncts, mk_disj.
\ENDDOC
+\DOC{list\_mk\_exists}
+
+\TYPE {\small\verb%list_mk_exists : ((term list # term) -> term)%}\egroup
+
+\SYNOPSIS
+Iteratively constructs existential quantifications.
+
+\DESCRIBE
+{\small\verb%list_mk_exists(["x1";...;"xn"],"t")%} returns {\small\verb%"?x1 ... xn. t"%}.
+
+\FAILURE
+Fails with {\small\verb%list_mk_exists%} if the terms in the list are not variables or if
+{\small\verb%t%} is not of type {\small\verb%":bool"%} and the list of terms is non-empty. If the list
+of terms is empty the type of {\small\verb%t%} can be anything.
+
+\COMMENTS
+The system shows the type as {\small\verb%(goal -> term)%}.
+
+\SEEALSO
+strip_exists, mk_exists.
+
+\ENDDOC
\DOC{LIST\_MK\_EXISTS}
\TYPE {\small\verb%LIST_MK_EXISTS : (term list -> thm -> thm)%}\egroup
@@ -13884,28 +13904,6 @@ list, or if the theorem is not equationa
EXISTS_EQ, MK_EXISTS.
\ENDDOC
-\DOC{list\_mk\_exists}
-
-\TYPE {\small\verb%list_mk_exists : ((term list # term) -> term)%}\egroup
-
-\SYNOPSIS
-Iteratively constructs existential quantifications.
-
-\DESCRIBE
-{\small\verb%list_mk_exists(["x1";...;"xn"],"t")%} returns {\small\verb%"?x1 ... xn. t"%}.
-
-\FAILURE
-Fails with {\small\verb%list_mk_exists%} if the terms in the list are not variables or if
-{\small\verb%t%} is not of type {\small\verb%":bool"%} and the list of terms is non-empty. If the list
-of terms is empty the type of {\small\verb%t%} can be anything.
-
-\COMMENTS
-The system shows the type as {\small\verb%(goal -> term)%}.
-
-\SEEALSO
-strip_exists, mk_exists.
-
-\ENDDOC
\DOC{list\_mk\_forall}
\TYPE {\small\verb%list_mk_forall : ((term list # term) -> term)%}\egroup
@@ -14035,115 +14033,6 @@ is not for general use, and users should
Evaluating the assignable variable {\small\verb%list_of_binders%} never fails.
\ENDDOC
-\DOC{load}
-
-\TYPE {\small\verb%load : ((string # bool) -> void)%}\egroup
-
-\SYNOPSIS
-Loads ML phrases from the named file.
-
-\DESCRIBE
-A call {\small\verb%load(`file`,flag)%} will load ML phrases from the file described by
-{\small\verb%file%}. If the boolean value {\small\verb%flag%} is true, then toplevel printing of the
-system responses will occur, otherwise just a dot is printed for each toplevel
-phrase. The name {\small\verb%file%} is expanded into a real filename using the same
-mechanism as {\small\verb%find_ml_file%}.
-
-\FAILURE
-Fails if the appropriate file cannot be found on the search path, or if an
-error occurs in the ML which is being loaded.
-
-\COMMENTS
-It is usual to use either {\small\verb%loadf%} or {\small\verb%loadt%} rather than this function, which
-perform the same action with one or the other setting of the flag.
-
-\SEEALSO
-find_ml_file, loadf, loadt, search_path, set_search_path.
-
-\ENDDOC
-\DOC{loadf}
-
-\TYPE {\small\verb%loadf : (string -> void)%}\egroup
-
-\SYNOPSIS
-Loads an ML file with the verbose flag set to {\small\verb%false%}.
-
-\DESCRIBE
-The function {\small\verb%loadf%} takes a string indicating the ML file name as
-argument and loads it in the same manner as {\small\verb%load%}, except that the
-verbose flag is always set to false.
-
-\FAILURE
-{\small\verb%loadf%} will fail if the file named by the argument does not exist in
-the search path. It will fail in the same manner if the file is not a
-valid ML file. Failure in the ML file will terminate loading.
-
-\EXAMPLE
-If we have a ML file called {\small\verb%foo.ml%} which contains the line
-{\par\samepage\setseps\small
-\begin{verbatim}
- let x=2+2;;
-\end{verbatim}
-}
-\noindent this can be loaded as follows:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #loadf `foo.ml`;;
-\end{verbatim}
-}
-\noindent and the system would respond with:
-{\par\samepage\setseps\small
-\begin{verbatim}
- .() : void
-\end{verbatim}
-}
-\SEEALSO
-load, loadf.
-
-\ENDDOC
-\DOC{loadt}
-
-\TYPE {\small\verb%loadt : (string -> void)%}\egroup
-
-\SYNOPSIS
-{\small\verb%loadt%} loads an ML file with the verbose flag set to {\small\verb%true%}.
-
-\DESCRIBE
-The function {\small\verb%loadt%} takes a string indicating the ML file name as
-argument and loads it in the same manner as {\small\verb%load%}, except that the
-verbose flag is always set to {\small\verb%true%}.
-
-\FAILURE
-{\small\verb%loadt%} will fail if the file named by the argument does not exist in
-the search path. It will fail in the same manner if the file is not a
-valid ML file. Failure in the ML file will also terminate loading.
-
-\EXAMPLE
-If we have an ML file called {\small\verb%foo.ml%} which contains the line
-{\par\samepage\setseps\small
-\begin{verbatim}
- let x=2+2;;
-\end{verbatim}
-}
-\noindent this can be loaded as follows:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #loadt `foo.ml`;;
-\end{verbatim}
-}
-\noindent and the system would respond with:
-{\par\samepage\setseps\small
-\begin{verbatim}
- x = 4 : int
-
- File foo.ml loaded
- () : void
-\end{verbatim}
-}
-\SEEALSO
-load, loadf.
-
-\ENDDOC
\DOC{load\_axiom}
\TYPE {\small\verb%load_axiom : (string -> string -> void)%}\egroup
@@ -14320,7 +14209,73 @@ o_DEF = |- !f g. f o g = (\x. f(g x))
\end{verbatim}
}
\SEEALSO
-definitions, let_after, let_before, load_definition.
+definitions, let_after, let_before, load_definition.
+
+\ENDDOC
+\DOC{load}
+
+\TYPE {\small\verb%load : ((string # bool) -> void)%}\egroup
+
+\SYNOPSIS
+Loads ML phrases from the named file.
+
+\DESCRIBE
+A call {\small\verb%load(`file`,flag)%} will load ML phrases from the file described by
+{\small\verb%file%}. If the boolean value {\small\verb%flag%} is true, then toplevel printing of the
+system responses will occur, otherwise just a dot is printed for each toplevel
+phrase. The name {\small\verb%file%} is expanded into a real filename using the same
+mechanism as {\small\verb%find_ml_file%}.
+
+\FAILURE
+Fails if the appropriate file cannot be found on the search path, or if an
+error occurs in the ML which is being loaded.
+
+\COMMENTS
+It is usual to use either {\small\verb%loadf%} or {\small\verb%loadt%} rather than this function, which
+perform the same action with one or the other setting of the flag.
+
+\SEEALSO
+find_ml_file, loadf, loadt, search_path, set_search_path.
+
+\ENDDOC
+\DOC{loadf}
+
+\TYPE {\small\verb%loadf : (string -> void)%}\egroup
+
+\SYNOPSIS
+Loads an ML file with the verbose flag set to {\small\verb%false%}.
+
+\DESCRIBE
+The function {\small\verb%loadf%} takes a string indicating the ML file name as
+argument and loads it in the same manner as {\small\verb%load%}, except that the
+verbose flag is always set to false.
+
+\FAILURE
+{\small\verb%loadf%} will fail if the file named by the argument does not exist in
+the search path. It will fail in the same manner if the file is not a
+valid ML file. Failure in the ML file will terminate loading.
+
+\EXAMPLE
+If we have a ML file called {\small\verb%foo.ml%} which contains the line
+{\par\samepage\setseps\small
+\begin{verbatim}
+ let x=2+2;;
+\end{verbatim}
+}
+\noindent this can be loaded as follows:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #loadf `foo.ml`;;
+\end{verbatim}
+}
+\noindent and the system would respond with:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ .() : void
+\end{verbatim}
+}
+\SEEALSO
+load, loadf.
\ENDDOC
\DOC{load\_library}
@@ -14395,6 +14350,49 @@ libraries currently in the standard HOL
libraries, library_pathname, library_search_path, set_library_search_path.
\ENDDOC
+\DOC{loadt}
+
+\TYPE {\small\verb%loadt : (string -> void)%}\egroup
+
+\SYNOPSIS
+{\small\verb%loadt%} loads an ML file with the verbose flag set to {\small\verb%true%}.
+
+\DESCRIBE
+The function {\small\verb%loadt%} takes a string indicating the ML file name as
+argument and loads it in the same manner as {\small\verb%load%}, except that the
+verbose flag is always set to {\small\verb%true%}.
+
+\FAILURE
+{\small\verb%loadt%} will fail if the file named by the argument does not exist in
+the search path. It will fail in the same manner if the file is not a
+valid ML file. Failure in the ML file will also terminate loading.
+
+\EXAMPLE
+If we have an ML file called {\small\verb%foo.ml%} which contains the line
+{\par\samepage\setseps\small
+\begin{verbatim}
+ let x=2+2;;
+\end{verbatim}
+}
+\noindent this can be loaded as follows:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #loadt `foo.ml`;;
+\end{verbatim}
+}
+\noindent and the system would respond with:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ x = 4 : int
+
+ File foo.ml loaded
+ () : void
+\end{verbatim}
+}
+\SEEALSO
+load, loadf.
+
+\ENDDOC
\DOC{load\_theorem}
\TYPE {\small\verb%load_theorem : (string -> string -> void)%}\egroup
@@ -14584,54 +14582,6 @@ using it.
dropout, lisp.
\ENDDOC
-\DOC{map}
-
-\TYPE {\small\verb%map : ((* -> **) -> * list -> ** list)%}\egroup
-
-\SYNOPSIS
-Applies a function to every element of a list.
-
-\DESCRIBE
-{\small\verb%map f [x1;...;xn]%} returns {\small\verb%[(f x1);...;(f xn)]%}.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#map (\x. x * 2) [];;
-[] : int list
-
-#map (\x. x * 2) [1;2;3];;
-[2; 4; 6] : int list
-\end{verbatim}
-}
-\ENDDOC
-\DOC{map2}
-
-\TYPE {\small\verb%map2 : (((* # **) -> ***) -> (* list # ** list) -> *** list)%}\egroup
-
-\SYNOPSIS
-Maps a binary function over two lists to create one new list.
-
-\DESCRIBE
-{\small\verb%map2 f ([x1;...;xn],[y1;...;yn])%} returns {\small\verb%[f(x1,y1);...;f(xn,yn)]%}.
-
-\FAILURE
-Fails with {\small\verb%map2%} if the two lists are of different lengths.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#map2 $+ ([1;2;3],[3;2;1]);;
-[4; 4; 4] : int list
-\end{verbatim}
-}
-\SEEALSO
-map, uncurry.
-
-\ENDDOC
\DOC{MAP2\_CONV}
\TYPE {\small\verb%MAP2_CONV : conv -> conv%}\egroup
@@ -14685,62 +14635,28 @@ MAP_CONV
\ENDDOC
-\DOC{mapfilter}
-
-\TYPE {\small\verb%mapfilter : ((* -> **) -> * list -> ** list)%}\egroup
-
-\SYNOPSIS
-Applies a function to every element of a list, returning a list of results
-for those elements for which application succeeds.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#mapfilter hd [[1;2;3];[4;5];[];[6;7;8];[]];;
-[1; 4; 6] : int list
-\end{verbatim}
-}
-\SEEALSO
-filter, map.
-
-\ENDDOC
-\DOC{maptok}
+\DOC{map2}
-\TYPE {\small\verb%maptok : ((string -> *) -> string -> * list)%}\egroup
+\TYPE {\small\verb%map2 : (((* # **) -> ***) -> (* list # ** list) -> *** list)%}\egroup
\SYNOPSIS
-Maps a function over the constituent words of a string.
+Maps a binary function over two lists to create one new list.
\DESCRIBE
-{\small\verb%maptok f s%} first splits the string {\small\verb%s%} into a list of substrings, and then
-maps the function {\small\verb%f%} over that list. Splitting of the string occurs at each
-sequence of blanks and carriage returns (white space). This white space does
-not appear in the list of substrings. Leading and trailing white space in the
-input string is also thrown away.
+{\small\verb%map2 f ([x1;...;xn],[y1;...;yn])%} returns {\small\verb%[f(x1,y1);...;f(xn,yn)]%}.
\FAILURE
-Fails if one of the applications of {\small\verb%f%} to a substring fails.
+Fails with {\small\verb%map2%} if the two lists are of different lengths.
\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
-#maptok explode ` the cat sat `;;
-[[`t`; `h`; `e`]; [`c`; `a`; `t`]; [`s`; `a`; `t`]] : string list list
-\end{verbatim}
-}
-\USES
-Useful when wanting to map a function over a list of constant strings.
-Instead of using {\small\verb%map f [`string1`;...;`stringn`]%} one can use:
-{\par\samepage\setseps\small
-\begin{verbatim}
- (maptok f `string1 ... stringn`)
+#map2 $+ ([1;2;3],[3;2;1]);;
+[4; 4; 4] : int list
\end{verbatim}
}
\SEEALSO
-words, word_separators, words2, map.
+map, uncurry.
\ENDDOC
\DOC{MAP\_CONV}
@@ -14819,6 +14735,30 @@ evaluating {\small\verb%conv "f ti"%} re
\ENDDOC
+\DOC{map}
+
+\TYPE {\small\verb%map : ((* -> **) -> * list -> ** list)%}\egroup
+
+\SYNOPSIS
+Applies a function to every element of a list.
+
+\DESCRIBE
+{\small\verb%map f [x1;...;xn]%} returns {\small\verb%[(f x1);...;(f xn)]%}.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#map (\x. x * 2) [];;
+[] : int list
+
+#map (\x. x * 2) [1;2;3];;
+[2; 4; 6] : int list
+\end{verbatim}
+}
+\ENDDOC
\DOC{MAP\_EVERY}
\TYPE {\small\verb%MAP_EVERY : ((* -> tactic) -> * list -> tactic)%}\egroup
@@ -14848,41 +14788,148 @@ resulting tactic fails iff any of the re
A convenient way of doing case analysis over several boolean variables is:
{\par\samepage\setseps\small
\begin{verbatim}
- MAP_EVERY BOOL_CASES_TAC ["var1:bool";...;"varn:bool"]
+ MAP_EVERY BOOL_CASES_TAC ["var1:bool";...;"varn:bool"]
+\end{verbatim}
+}
+\SEEALSO
+EVERY, FIRST, MAP_FIRST, THEN.
+
+\ENDDOC
+\DOC{mapfilter}
+
+\TYPE {\small\verb%mapfilter : ((* -> **) -> * list -> ** list)%}\egroup
+
+\SYNOPSIS
+Applies a function to every element of a list, returning a list of results
+for those elements for which application succeeds.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#mapfilter hd [[1;2;3];[4;5];[];[6;7;8];[]];;
+[1; 4; 6] : int list
+\end{verbatim}
+}
+\SEEALSO
+filter, map.
+
+\ENDDOC
+\DOC{MAP\_FIRST}
+
+\TYPE {\small\verb%MAP_FIRST : ((* -> tactic) -> * list -> tactic)%}\egroup
+
+\SYNOPSIS
+Applies first tactic that succeeds in a list given by mapping a function over a
+list.
+
+\DESCRIBE
+When applied to a tactic-producing function {\small\verb%f%} and an operand list
+{\small\verb%[x1;...;xn]%}, the elements of which have the same type as {\small\verb%f%}'s domain
+type, {\small\verb%MAP_FIRST%} maps the function {\small\verb%f%} over the list, producing a list of
+tactics, then tries applying these tactics to the goal till one succeeds.
+If {\small\verb%f(xm)%} is the first to succeed, then the overall effect is the same
+as applying {\small\verb%f(xm)%}. Thus:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ MAP_FIRST f [x1;...;xn] = (f x1) ORELSE ... ORELSE (f xn)
+\end{verbatim}
+}
+\FAILURE
+The application of {\small\verb%MAP_FIRST%} to a function and tactic list fails iff
+the function does when applied to any of the elements of the list. The
+resulting tactic fails iff all the resulting tactics fail when
+applied to the goal.
+
+\SEEALSO
+EVERY, FIRST, MAP_EVERY, ORELSE.
+
+\ENDDOC
+\DOC{maptok}
+
+\TYPE {\small\verb%maptok : ((string -> *) -> string -> * list)%}\egroup
+
+\SYNOPSIS
+Maps a function over the constituent words of a string.
+
+\DESCRIBE
+{\small\verb%maptok f s%} first splits the string {\small\verb%s%} into a list of substrings, and then
+maps the function {\small\verb%f%} over that list. Splitting of the string occurs at each
+sequence of blanks and carriage returns (white space). This white space does
+not appear in the list of substrings. Leading and trailing white space in the
+input string is also thrown away.
+
+\FAILURE
+Fails if one of the applications of {\small\verb%f%} to a substring fails.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#maptok explode ` the cat sat `;;
+[[`t`; `h`; `e`]; [`c`; `a`; `t`]; [`s`; `a`; `t`]] : string list list
+\end{verbatim}
+}
+\USES
+Useful when wanting to map a function over a list of constant strings.
+Instead of using {\small\verb%map f [`string1`;...;`stringn`]%} one can use:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ (maptok f `string1 ... stringn`)
\end{verbatim}
}
\SEEALSO
-EVERY, FIRST, MAP_FIRST, THEN.
+words, word_separators, words2, map.
\ENDDOC
-\DOC{MAP\_FIRST}
+\DOC{MATCH\_ACCEPT\_TAC}
-\TYPE {\small\verb%MAP_FIRST : ((* -> tactic) -> * list -> tactic)%}\egroup
+\TYPE {\small\verb%MATCH_ACCEPT_TAC : thm_tactic%}\egroup
\SYNOPSIS
-Applies first tactic that succeeds in a list given by mapping a function over a
-list.
+Solves a goal which is an instance of the supplied theorem.
\DESCRIBE
-When applied to a tactic-producing function {\small\verb%f%} and an operand list
-{\small\verb%[x1;...;xn]%}, the elements of which have the same type as {\small\verb%f%}'s domain
-type, {\small\verb%MAP_FIRST%} maps the function {\small\verb%f%} over the list, producing a list of
-tactics, then tries applying these tactics to the goal till one succeeds.
-If {\small\verb%f(xm)%} is the first to succeed, then the overall effect is the same
-as applying {\small\verb%f(xm)%}. Thus:
+When given a theorem {\small\verb%A' |- t%} and a goal {\small\verb%A ?- t'%} where {\small\verb%t%} can be matched
+to {\small\verb%t'%} by instantiating variables which are either free or
+universally quantified at the outer level, including appropriate type
+instantiation, {\small\verb%MATCH_ACCEPT_TAC%} completely solves the goal.
{\par\samepage\setseps\small
\begin{verbatim}
- MAP_FIRST f [x1;...;xn] = (f x1) ORELSE ... ORELSE (f xn)
+ A ?- t'
+ ========= MATCH_ACCEPT_TAC (A' |- t)
+
\end{verbatim}
}
+\noindent Unless {\small\verb%A'%} is a subset of {\small\verb%A%}, this is an invalid tactic.
+
\FAILURE
-The application of {\small\verb%MAP_FIRST%} to a function and tactic list fails iff
-the function does when applied to any of the elements of the list. The
-resulting tactic fails iff all the resulting tactics fail when
-applied to the goal.
+Fails unless the theorem has a conclusion which is instantiable to match that
+of the goal.
+\EXAMPLE
+The following example shows variable and type instantiation at work. We can use
+the polymorphic list theorem {\small\verb%HD%}:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ HD = |- !h t. HD(CONS h t) = h
+\end{verbatim}
+}
+\noindent to solve the goal:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ ?- HD [1;2] = 1
+\end{verbatim}
+}
+\noindent simply by:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ MATCH_ACCEPT_TAC HD
+\end{verbatim}
+}
\SEEALSO
-EVERY, FIRST, MAP_EVERY, ORELSE.
+ACCEPT_TAC.
\ENDDOC
\DOC{match}
@@ -14946,55 +14993,6 @@ type) which need to be instantiated may
INST_TY_TERM, PART_MATCH.
\ENDDOC
-\DOC{MATCH\_ACCEPT\_TAC}
-
-\TYPE {\small\verb%MATCH_ACCEPT_TAC : thm_tactic%}\egroup
-
-\SYNOPSIS
-Solves a goal which is an instance of the supplied theorem.
-
-\DESCRIBE
-When given a theorem {\small\verb%A' |- t%} and a goal {\small\verb%A ?- t'%} where {\small\verb%t%} can be matched
-to {\small\verb%t'%} by instantiating variables which are either free or
-universally quantified at the outer level, including appropriate type
-instantiation, {\small\verb%MATCH_ACCEPT_TAC%} completely solves the goal.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A ?- t'
- ========= MATCH_ACCEPT_TAC (A' |- t)
-
-\end{verbatim}
-}
-\noindent Unless {\small\verb%A'%} is a subset of {\small\verb%A%}, this is an invalid tactic.
-
-\FAILURE
-Fails unless the theorem has a conclusion which is instantiable to match that
-of the goal.
-
-\EXAMPLE
-The following example shows variable and type instantiation at work. We can use
-the polymorphic list theorem {\small\verb%HD%}:
-{\par\samepage\setseps\small
-\begin{verbatim}
- HD = |- !h t. HD(CONS h t) = h
-\end{verbatim}
-}
-\noindent to solve the goal:
-{\par\samepage\setseps\small
-\begin{verbatim}
- ?- HD [1;2] = 1
-\end{verbatim}
-}
-\noindent simply by:
-{\par\samepage\setseps\small
-\begin{verbatim}
- MATCH_ACCEPT_TAC HD
-\end{verbatim}
-}
-\SEEALSO
-ACCEPT_TAC.
-
-\ENDDOC
\DOC{MATCH\_MP}
\TYPE {\small\verb%MATCH_MP : (thm -> thm -> thm)%}\egroup
@@ -15188,6 +15186,23 @@ This is an example
print_string, print_tok, print_begin, print_end, print_newline.
\ENDDOC
+\DOC{mk\_abs}
+
+\TYPE {\small\verb%mk_abs : ((term # term) -> term)%}\egroup
+
+\SYNOPSIS
+Constructs an abstraction.
+
+\DESCRIBE
+{\small\verb%mk_abs "var","t"%} returns the abstraction {\small\verb%"\var. t"%}.
+
+\FAILURE
+Fails with {\small\verb%mk_abs%} if first term is not a variable.
+
+\SEEALSO
+dest_abs, is_abs, list_mk_abs, mk_var, mk_const, mk_comb.
+
+\ENDDOC
\DOC{MK\_ABS}
\TYPE {\small\verb%MK_ABS : (thm -> thm)%}\egroup
@@ -15213,21 +15228,31 @@ Fails unless the theorem is a (singly) u
ABS, HALF_MK_ABS, MK_COMB, MK_EXISTS.
\ENDDOC
-\DOC{mk\_abs}
+\DOC{mk\_comb}
-\TYPE {\small\verb%mk_abs : ((term # term) -> term)%}\egroup
+\TYPE {\small\verb%mk_comb : ((term # term) -> term)%}\egroup
\SYNOPSIS
-Constructs an abstraction.
+Constructs a combination (function application).
\DESCRIBE
-{\small\verb%mk_abs "var","t"%} returns the abstraction {\small\verb%"\var. t"%}.
+{\small\verb%mk_comb "t1","t2"%} returns the combination {\small\verb%"t1 t2"%}.
\FAILURE
-Fails with {\small\verb%mk_abs%} if first term is not a variable.
+Fails with {\small\verb%mk_comb%} unless {\small\verb%t1%} is a function with domain type {\small\verb%t2%}.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#mk_comb("$~","T");;
+"~T" : term
+#mk_comb("T","T");;
+evaluation failed mk_comb
+\end{verbatim}
+}
\SEEALSO
-dest_abs, is_abs, list_mk_abs, mk_var, mk_const, mk_comb.
+dest_comb, is_comb, list_mk_comb, mk_var, mk_const, mk_abs.
\ENDDOC
\DOC{MK\_COMB}
@@ -15257,33 +15282,6 @@ respectively.
AP_TERM, AP_THM.
\ENDDOC
-\DOC{mk\_comb}
-
-\TYPE {\small\verb%mk_comb : ((term # term) -> term)%}\egroup
-
-\SYNOPSIS
-Constructs a combination (function application).
-
-\DESCRIBE
-{\small\verb%mk_comb "t1","t2"%} returns the combination {\small\verb%"t1 t2"%}.
-
-\FAILURE
-Fails with {\small\verb%mk_comb%} unless {\small\verb%t1%} is a function with domain type {\small\verb%t2%}.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#mk_comb("$~","T");;
-"~T" : term
-
-#mk_comb("T","T");;
-evaluation failed mk_comb
-\end{verbatim}
-}
-\SEEALSO
-dest_comb, is_comb, list_mk_comb, mk_var, mk_const, mk_abs.
-
-\ENDDOC
\DOC{mk\_cond}
\TYPE {\small\verb%mk_cond : ((term # term # term) -> term)%}\egroup
@@ -15421,6 +15419,24 @@ Fails with {\small\verb%mk_eq%} if {\sma
dest_eq, is_eq.
\ENDDOC
+\DOC{mk\_exists}
+
+\TYPE {\small\verb%mk_exists : ((term # term) -> term)%}\egroup
+
+\SYNOPSIS
+Constructs an existential quantification.
+
+\DESCRIBE
+{\small\verb%mk_exists("var","t")%} returns {\small\verb%"?var. t"%}.
+
+\FAILURE
+Fails with {\small\verb%mk_exists%} if first term is not a variable or if {\small\verb%t%} is not of
+type {\small\verb%":bool"%}.
+
+\SEEALSO
+dest_exists, is_exists, list_mk_exists.
+
+\ENDDOC
\DOC{MK\_EXISTS}
\TYPE {\small\verb%MK_EXISTS : (thm -> thm)%}\egroup
@@ -15446,24 +15462,6 @@ Fails unless the theorem is a singly uni
AP_TERM, EXISTS_EQ, GEN, LIST_MK_EXISTS, MK_ABS.
\ENDDOC
-\DOC{mk\_exists}
-
-\TYPE {\small\verb%mk_exists : ((term # term) -> term)%}\egroup
-
-\SYNOPSIS
-Constructs an existential quantification.
-
-\DESCRIBE
-{\small\verb%mk_exists("var","t")%} returns {\small\verb%"?var. t"%}.
-
-\FAILURE
-Fails with {\small\verb%mk_exists%} if first term is not a variable or if {\small\verb%t%} is not of
-type {\small\verb%":bool"%}.
-
-\SEEALSO
-dest_exists, is_exists, list_mk_exists.
-
-\ENDDOC
\DOC{mk\_forall}
\TYPE {\small\verb%mk_forall : ((term # term) -> term)%}\egroup
@@ -16111,58 +16109,23 @@ of that name in the current theory, or i
\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
-#new_theory `gurk`;;
-() : void
-
-#new_axiom(`untrue`,"x = 1");;
-|- !x. x = 1
-\end{verbatim}
-}
-\COMMENTS
-For most purposes, it is unnecessary to declare new axioms: all of classical
-mathematics can be derived by definitional extension alone. Proceeding by
-definition is not only more elegant, but also guarantees the consistency of the
-deductions made. However, there are certain entities which cannot be modelled
-in simple type theory without further axioms, such as higher transfinite
-ordinals.
-
-\SEEALSO
-mk_thm, new_definition.
-
-\ENDDOC
-\DOC{new\_binder}
-
-\TYPE {\small\verb%new_binder : ((string # type) -> void)%}\egroup
-
-\SYNOPSIS
-Sets up a new binder in the current theory.
-
-\DESCRIBE
-A call {\small\verb%new_binder(`bnd`,":ty")%} declares a new binder {\small\verb%bnd%} in the current
-theory. The type must be of the form {\small\verb%(* -> **) -> ***%}, because being a binder,
-{\small\verb%bnd%} will apply to an abstraction; for example {\small\verb%"!x:bool. (x=T) \/ (x=F)"%} is
-actually a prettyprinting of {\small\verb%"$! (\x. (x=T) \/ (x=F))"%}.
-
-\FAILURE
-Fails if HOL is not in draft mode, or there is already a constant of some sort
-of that name in the current theory, or if the type does not correspond to the
-above pattern.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#new_theory `anorak`;;
-() : void
-
-#new_binder(`!!`,":(bool->bool)->bool");;
+#new_theory `gurk`;;
() : void
-#"!!x. T";;
-"!! x. T" : term
+#new_axiom(`untrue`,"x = 1");;
+|- !x. x = 1
\end{verbatim}
}
+\COMMENTS
+For most purposes, it is unnecessary to declare new axioms: all of classical
+mathematics can be derived by definitional extension alone. Proceeding by
+definition is not only more elegant, but also guarantees the consistency of the
+deductions made. However, there are certain entities which cannot be modelled
+in simple type theory without further axioms, such as higher transfinite
+ordinals.
+
\SEEALSO
-binders, is_binder.
+mk_thm, new_definition.
\ENDDOC
\DOC{new\_binder\_definition}
@@ -16244,6 +16207,41 @@ new_infix_list_rec_definition, new_prim_
new_list_rec_definition, new_prim_rec_definition.
\ENDDOC
+\DOC{new\_binder}
+
+\TYPE {\small\verb%new_binder : ((string # type) -> void)%}\egroup
+
+\SYNOPSIS
+Sets up a new binder in the current theory.
+
+\DESCRIBE
+A call {\small\verb%new_binder(`bnd`,":ty")%} declares a new binder {\small\verb%bnd%} in the current
+theory. The type must be of the form {\small\verb%(* -> **) -> ***%}, because being a binder,
+{\small\verb%bnd%} will apply to an abstraction; for example {\small\verb%"!x:bool. (x=T) \/ (x=F)"%} is
+actually a prettyprinting of {\small\verb%"$! (\x. (x=T) \/ (x=F))"%}.
+
+\FAILURE
+Fails if HOL is not in draft mode, or there is already a constant of some sort
+of that name in the current theory, or if the type does not correspond to the
+above pattern.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#new_theory `anorak`;;
+() : void
+
+#new_binder(`!!`,":(bool->bool)->bool");;
+() : void
+
+#"!!x. T";;
+"!! x. T" : term
+\end{verbatim}
+}
+\SEEALSO
+binders, is_binder.
+
+\ENDDOC
\DOC{new\_constant}
\TYPE {\small\verb%new_constant : ((string # type) -> void)%}\egroup
@@ -16415,46 +16413,6 @@ DEF_EXISTS_RULE, new_binder_definition,
new_specification.
\ENDDOC
-\DOC{new\_infix}
-
-\TYPE {\small\verb%new_infix : ((string # type) -> void)%}\egroup
-
-\SYNOPSIS
-Declares a new infix constant in the current theory.
-
-\DESCRIBE
-A call {\small\verb%new_infix(`i`,":ty")%} makes {\small\verb%i%} an infix
-constant in the current theory. Note that it does not specifiy its value.
-The constant may have a polymorphic type, which may be arbitrarily
-instantiated. Like any other infix or binder, its special parse status may be
-suppressed by preceding it with a dollar sign.
-
-\FAILURE
-Fails if HOL is not in draft mode, or if the name is not a valid constant
-name, or there is already a constant of that name in the current theory.
-
-\EXAMPLE
-The following shows the use of the curried form as well as the infix:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #new_theory `groke`;;
- () : void
-
- #new_infix(`orelse`,":bool->bool->bool");;
- () : void
-
- #"T orelse F";;
- "T orelse F" : term
-
- #"$orelse T F";;
- "T orelse F" : term
-\end{verbatim}
-}
-\SEEALSO
-constants, infixes, is_constant, is_infix, new_constant, new_definition,
-new_infix_definition.
-
-\ENDDOC
\DOC{new\_infix\_definition}
\TYPE {\small\verb%new_infix_definition : ((string # term) -> thm)%}\egroup
@@ -16530,6 +16488,46 @@ new_infix_list_rec_definition, new_prim_
new_prim_rec_definition.
\ENDDOC
+\DOC{new\_infix}
+
+\TYPE {\small\verb%new_infix : ((string # type) -> void)%}\egroup
+
+\SYNOPSIS
+Declares a new infix constant in the current theory.
+
+\DESCRIBE
+A call {\small\verb%new_infix(`i`,":ty")%} makes {\small\verb%i%} an infix
+constant in the current theory. Note that it does not specifiy its value.
+The constant may have a polymorphic type, which may be arbitrarily
+instantiated. Like any other infix or binder, its special parse status may be
+suppressed by preceding it with a dollar sign.
+
+\FAILURE
+Fails if HOL is not in draft mode, or if the name is not a valid constant
+name, or there is already a constant of that name in the current theory.
+
+\EXAMPLE
+The following shows the use of the curried form as well as the infix:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #new_theory `groke`;;
+ () : void
+
+ #new_infix(`orelse`,":bool->bool->bool");;
+ () : void
+
+ #"T orelse F";;
+ "T orelse F" : term
+
+ #"$orelse T F";;
+ "T orelse F" : term
+\end{verbatim}
+}
+\SEEALSO
+constants, infixes, is_constant, is_infix, new_constant, new_definition,
+new_infix_definition.
+
+\ENDDOC
\DOC{new\_infix\_list\_rec\_definition}
\TYPE {\small\verb%new_infix_list_rec_definition : ((string # term) -> thm)%}\egroup
@@ -17401,43 +17399,6 @@ new_binder, new_constant, new_definition
new_specification, new_type, print_theory, save_thm, search_path.
\ENDDOC
-\DOC{new\_type}
-
-\TYPE {\small\verb%new_type : (int -> string -> void)%}\egroup
-
-\SYNOPSIS
-Declares a new type or type constructor.
-
-\DESCRIBE
-A call {\small\verb%new_type n `t`%} declares a new {\small\verb%n%}-ary type constructor called {\small\verb%t%} in
-the current theory segment. If {\small\verb%n%} is zero, this is just a new base type.
-
-\FAILURE
-Fails if HOL is not in draft mode, or if the name is not a valid type
-name, or there is already a type operator of that name in the current theory.
-
-\EXAMPLE
-A version of ZF set theory might declare a new type {\small\verb%set%} and start using it as
-follows:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #new_theory `ZF`;;
- () : void
-
- #new_type 0 `set`;;
- () : void
-
- #new_infix(`mem`,":set->set->bool");;
- () : void
-
- #new_axiom(`ext`,"(!z. z mem x = z mem y) ==> (x = y)");;
- |- !x y. (!z. z mem x = z mem y) ==> (x = y)
-\end{verbatim}
-}
-\SEEALSO
-types, type_abbrevs, new_type_abbrev.
-
-\ENDDOC
\DOC{new\_type\_abbrev}
\TYPE {\small\verb%new_type_abbrev : ((string # type) -> void)%}\egroup
@@ -17545,6 +17506,43 @@ define_new_type_bijections, prove_abs_fn
prove_rep_fn_one_one, prove_rep_fn_onto.
\ENDDOC
+\DOC{new\_type}
+
+\TYPE {\small\verb%new_type : (int -> string -> void)%}\egroup
+
+\SYNOPSIS
+Declares a new type or type constructor.
+
+\DESCRIBE
+A call {\small\verb%new_type n `t`%} declares a new {\small\verb%n%}-ary type constructor called {\small\verb%t%} in
+the current theory segment. If {\small\verb%n%} is zero, this is just a new base type.
+
+\FAILURE
+Fails if HOL is not in draft mode, or if the name is not a valid type
+name, or there is already a type operator of that name in the current theory.
+
+\EXAMPLE
+A version of ZF set theory might declare a new type {\small\verb%set%} and start using it as
+follows:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #new_theory `ZF`;;
+ () : void
+
+ #new_type 0 `set`;;
+ () : void
+
+ #new_infix(`mem`,":set->set->bool");;
+ () : void
+
+ #new_axiom(`ext`,"(!z. z mem x = z mem y) ==> (x = y)");;
+ |- !x y. (!z. z mem x = z mem y) ==> (x = y)
+\end{verbatim}
+}
+\SEEALSO
+types, type_abbrevs, new_type_abbrev.
+
+\ENDDOC
\DOC{nil\_term\_net}
\TYPE {\small\verb%nil_term_net : * term_net%}\egroup
@@ -17554,6 +17552,38 @@ This function is for internal use only a
version of the system. It should not be used.
\ENDDOC
+\DOC{NO\_CONV}
+
+\TYPE {\small\verb%NO_CONV : conv%}\egroup
+
+\SYNOPSIS
+Conversion that always fails.
+
+\FAILURE
+{\small\verb%NO_CONV%} always fails.
+
+\SEEALSO
+ALL_CONV.
+
+\ENDDOC
+\DOC{NO\_TAC}
+
+\TYPE {\small\verb%NO_TAC : tactic%}\egroup
+
+\SYNOPSIS
+Tactic which always fails.
+
+\DESCRIBE
+Whatever goal it is applied to, {\small\verb%NO_TAC%} always fails
+with string {\small\verb%`NO_TAC`%}.
+
+\FAILURE
+Always fails.
+
+\SEEALSO
+ALL_TAC, ALL_THEN, FAIL_TAC, NO_THEN.
+
+\ENDDOC
\DOC{not}
\TYPE {\small\verb%$not : (bool -> bool)%}\egroup
@@ -17660,7 +17690,29 @@ When applied to a term of the form {\sma
Fails if applied to a term not of the form {\small\verb%~(!x.P)%}.
\SEEALSO
-EXISTS_NOT_CONV, FORALL_NOT_CONV, NOT_EXISTS_CONV.
+EXISTS_NOT_CONV, FORALL_NOT_CONV, NOT_EXISTS_CONV.
+
+\ENDDOC
+\DOC{NO\_THEN}
+
+\TYPE {\small\verb%NO_THEN : thm_tactical%}\egroup
+
+\SYNOPSIS
+Theorem-tactical which always fails.
+
+\DESCRIBE
+When applied to a theorem-tactic and a theorem, the theorem-tactical
+{\small\verb%NO_THEN%} always fails with string {\small\verb%`NO_THEN`%}.
+
+\FAILURE
+Always fails when applied to a theorem-tactic and a theorem (note that it
+never gets as far as being applied to a goal!)
+
+\USES
+Writing compound tactics or tacticals.
+
+\SEEALSO
+ALL_TAC, ALL_THEN, FAIL_TAC, NO_TAC.
\ENDDOC
\DOC{NOT\_INTRO}
@@ -17733,58 +17785,13 @@ expected to be a negation, use {\small\v
MP, EQ_MP, LIST_MP, MATCH_MP, MATCH_MP_TAC, MP_TAC.
\ENDDOC
-\DOC{NO\_CONV}
-
-\TYPE {\small\verb%NO_CONV : conv%}\egroup
-
-\SYNOPSIS
-Conversion that always fails.
-
-\FAILURE
-{\small\verb%NO_CONV%} always fails.
-
-\SEEALSO
-ALL_CONV.
-
-\ENDDOC
-\DOC{NO\_TAC}
-
-\TYPE {\small\verb%NO_TAC : tactic%}\egroup
-
-\SYNOPSIS
-Tactic which always fails.
-
-\DESCRIBE
-Whatever goal it is applied to, {\small\verb%NO_TAC%} always fails
-with string {\small\verb%`NO_TAC`%}.
-
-\FAILURE
-Always fails.
-
-\SEEALSO
-ALL_TAC, ALL_THEN, FAIL_TAC, NO_THEN.
-
-\ENDDOC
-\DOC{NO\_THEN}
+\DOC{n\_strip\_quant}
-\TYPE {\small\verb%NO_THEN : thm_tactical%}\egroup
+\TYPE {\small\verb%n_strip_quant : ((* -> (** # *)) -> int -> * -> (** list # *))%}\egroup
\SYNOPSIS
-Theorem-tactical which always fails.
-
-\DESCRIBE
-When applied to a theorem-tactic and a theorem, the theorem-tactical
-{\small\verb%NO_THEN%} always fails with string {\small\verb%`NO_THEN`%}.
-
-\FAILURE
-Always fails when applied to a theorem-tactic and a theorem (note that it
-never gets as far as being applied to a goal!)
-
-\USES
-Writing compound tactics or tacticals.
-
-\SEEALSO
-ALL_TAC, ALL_THEN, FAIL_TAC, NO_TAC.
+This function is for internal use only and is to be deleted from a future
+version of the system. It should not be used.
\ENDDOC
\DOC{null}
@@ -17883,15 +17890,6 @@ and {\small\verb%m%} are syntactically i
\end{verbatim}
}
\ENDDOC
-\DOC{n\_strip\_quant}
-
-\TYPE {\small\verb%n_strip_quant : ((* -> (** # *)) -> int -> * -> (** list # *))%}\egroup
-
-\SYNOPSIS
-This function is for internal use only and is to be deleted from a future
-version of the system. It should not be used.
-
-\ENDDOC
\DOC{o}
\TYPE {\small\verb%$o : (((* -> **) # (*** -> *)) -> *** -> **)%}\egroup
@@ -18063,6 +18061,71 @@ happens to generate a failure with strin
DEPTH_CONV, REDEPTH_CONV, TOP_DEPTH_CONV, ONCE_REW_DEPTH_CONV.
\ENDDOC
+\DOC{ONCE\_REW\_DEPTH\_CONV}
+
+\TYPE {\small\verb%ONCE_REW_DEPTH_CONV : (conv -> conv)%}\egroup
+
+\SYNOPSIS
+Applies a conversion once to the first suitable sub-term(s) encountered in
+top-down order. For use in rewriting.
+
+\DESCRIBE
+{\small\verb%ONCE_REW_DEPTH_CONV c tm%} applies the conversion {\small\verb%c%} once to the first
+subterm or subterms encountered in a top-down `parallel' search of the term
+{\small\verb%tm%} for which {\small\verb%c%} succeeds. If the conversion {\small\verb%c%} fails on all subterms of
+{\small\verb%tm%}, the theorem returned is {\small\verb%|- tm = tm%}.
+
+{\small\verb%ONCE_REW_DEPTH_CONV%} is a special version of {\small\verb%ONCE_DEPTH_CONV%} for use by the
+rewriting conversions, rules and tactics. It differs from {\small\verb%ONCE_DEPTH_CONV%} as
+follows: If converting an abstraction fails due to the presence of the bound
+variable in the hypotheses of the theorem generated by converting the body,
+{\small\verb%ONCE_REW_DEPTH_CONV%} retries the conversion having renamed the bound variable
+of the abstraction. If successful the renaming is reversed.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+The following example illustrates the difference between the functions
+{\small\verb%ONCE_REW_DEPTH_CONV%} and {\small\verb%ONCE_DEPTH_CONV%}. It is not intended to illustrate
+the full range of behaviour of the former. Both {\small\verb%ONCE_REW_DEPTH_CONV%} and
+{\small\verb%ONCE_DEPTH_CONV%} successfully apply the theorem {\small\verb%ADD_0%} inside an abstraction:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #ONCE_REW_DEPTH_CONV (REWR_CONV ADD_0) "\n. n + 0";;
+ |- (\n. n + 0) = (\n. n)
+
+ #ONCE_DEPTH_CONV (REWR_CONV ADD_0) "\n. n + 0";;
+ |- (\n. n + 0) = (\n. n)
+\end{verbatim}
+}
+\noindent However, if a hypothesis containing a free occurrence of the bound
+variable is added to the rewrite rule, it interferes with the operation of
+{\small\verb%ONCE_DEPTH_CONV%} but not that of {\small\verb%ONCE_REW_DEPTH_CONV%}:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #let th = ADD_ASSUM "n = 0" ADD_0;;
+ th = n = 0 |- !m. m + 0 = m
+
+ #ONCE_REW_DEPTH_CONV (REWR_CONV th) "\n. n + 0";;
+ n = 0 |- (\n. n + 0) = (\n. n)
+
+ #ONCE_DEPTH_CONV (REWR_CONV th) "\n. n + 0";;
+ |- (\n. n + 0) = (\n. n + 0)
+\end{verbatim}
+}
+\COMMENTS
+The implementation of this function uses failure to avoid rebuilding
+unchanged subterms. That is to say, during execution the failure string
+{\small\verb%`QCONV`%} may be generated and later trapped. The behaviour of the function
+is dependent on this use of failure. So, if the conversion given as argument
+happens to generate a failure with string {\small\verb%`QCONV`%}, the operation of
+{\small\verb%ONCE_REW_DEPTH_CONV%} will be unpredictable.
+
+\SEEALSO
+REW_DEPTH_CONV, ONCE_DEPTH_CONV.
+
+\ENDDOC
\DOC{ONCE\_REWRITE\_CONV}
\TYPE {\small\verb%ONCE_REWRITE_CONV : (thm list -> conv)%}\egroup
@@ -18176,71 +18239,6 @@ ASM_REWRITE_TAC, ONCE_ASM_REWRITE_TAC, P
PURE_ONCE_REWRITE_TAC, PURE_REWRITE_TAC, REWRITE_TAC, SUBST_TAC.
\ENDDOC
-\DOC{ONCE\_REW\_DEPTH\_CONV}
-
-\TYPE {\small\verb%ONCE_REW_DEPTH_CONV : (conv -> conv)%}\egroup
-
-\SYNOPSIS
-Applies a conversion once to the first suitable sub-term(s) encountered in
-top-down order. For use in rewriting.
-
-\DESCRIBE
-{\small\verb%ONCE_REW_DEPTH_CONV c tm%} applies the conversion {\small\verb%c%} once to the first
-subterm or subterms encountered in a top-down `parallel' search of the term
-{\small\verb%tm%} for which {\small\verb%c%} succeeds. If the conversion {\small\verb%c%} fails on all subterms of
-{\small\verb%tm%}, the theorem returned is {\small\verb%|- tm = tm%}.
-
-{\small\verb%ONCE_REW_DEPTH_CONV%} is a special version of {\small\verb%ONCE_DEPTH_CONV%} for use by the
-rewriting conversions, rules and tactics. It differs from {\small\verb%ONCE_DEPTH_CONV%} as
-follows: If converting an abstraction fails due to the presence of the bound
-variable in the hypotheses of the theorem generated by converting the body,
-{\small\verb%ONCE_REW_DEPTH_CONV%} retries the conversion having renamed the bound variable
-of the abstraction. If successful the renaming is reversed.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-The following example illustrates the difference between the functions
-{\small\verb%ONCE_REW_DEPTH_CONV%} and {\small\verb%ONCE_DEPTH_CONV%}. It is not intended to illustrate
-the full range of behaviour of the former. Both {\small\verb%ONCE_REW_DEPTH_CONV%} and
-{\small\verb%ONCE_DEPTH_CONV%} successfully apply the theorem {\small\verb%ADD_0%} inside an abstraction:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #ONCE_REW_DEPTH_CONV (REWR_CONV ADD_0) "\n. n + 0";;
- |- (\n. n + 0) = (\n. n)
-
- #ONCE_DEPTH_CONV (REWR_CONV ADD_0) "\n. n + 0";;
- |- (\n. n + 0) = (\n. n)
-\end{verbatim}
-}
-\noindent However, if a hypothesis containing a free occurrence of the bound
-variable is added to the rewrite rule, it interferes with the operation of
-{\small\verb%ONCE_DEPTH_CONV%} but not that of {\small\verb%ONCE_REW_DEPTH_CONV%}:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #let th = ADD_ASSUM "n = 0" ADD_0;;
- th = n = 0 |- !m. m + 0 = m
-
- #ONCE_REW_DEPTH_CONV (REWR_CONV th) "\n. n + 0";;
- n = 0 |- (\n. n + 0) = (\n. n)
-
- #ONCE_DEPTH_CONV (REWR_CONV th) "\n. n + 0";;
- |- (\n. n + 0) = (\n. n + 0)
-\end{verbatim}
-}
-\COMMENTS
-The implementation of this function uses failure to avoid rebuilding
-unchanged subterms. That is to say, during execution the failure string
-{\small\verb%`QCONV`%} may be generated and later trapped. The behaviour of the function
-is dependent on this use of failure. So, if the conversion given as argument
-happens to generate a failure with string {\small\verb%`QCONV`%}, the operation of
-{\small\verb%ONCE_REW_DEPTH_CONV%} will be unpredictable.
-
-\SEEALSO
-REW_DEPTH_CONV, ONCE_DEPTH_CONV.
-
-\ENDDOC
\DOC{oo}
\TYPE {\small\verb%$oo : ((((* # **) -> ***) # (**** -> *) # (**** -> **)) -> **** -> ***)%}\egroup
@@ -18311,43 +18309,43 @@ contents of file foo
close, openi, read, write
\ENDDOC
-\DOC{ORELSE}
+\DOC{ORELSEC}
-\TYPE {\small\verb%$ORELSE : (tactic -> tactic -> tactic)%}\egroup
+\TYPE {\small\verb%$ORELSEC : (conv -> conv -> conv)%}\egroup
\SYNOPSIS
-Applies first tactic, and iff it fails, applies the second instead.
+Applies the first of two conversions that succeeds.
\DESCRIBE
-If {\small\verb%T1%} and {\small\verb%T2%} are tactics, {\small\verb%T1 ORELSE T2%} is a tactic which applies {\small\verb%T1%} to
-a goal, and iff it fails, applies {\small\verb%T2%} to the goal instead.
+{\small\verb%(c1 ORELSEC c2) "t"%} returns the result of applying the conversion {\small\verb%c1%} to
+the term {\small\verb%"t"%} if this succeeds. Otherwise {\small\verb%(c1 ORELSEC c2) "t"%} returns the
+result of applying the conversion {\small\verb%c2%} to the term {\small\verb%"t"%}.
\FAILURE
-The application of {\small\verb%ORELSE%} to a pair of tactics never fails.
-The resulting tactic fails if both {\small\verb%T1%} and {\small\verb%T2%} fail when applied to the
-relevant goal.
+{\small\verb%(c1 ORELSEC c2) "t"%} fails both {\small\verb%c1%} and {\small\verb%c2%} fail when applied to {\small\verb%"t"%}.
\SEEALSO
-EVERY, FIRST, THEN.
+FIRST_CONV.
\ENDDOC
-\DOC{ORELSEC}
+\DOC{ORELSE}
-\TYPE {\small\verb%$ORELSEC : (conv -> conv -> conv)%}\egroup
+\TYPE {\small\verb%$ORELSE : (tactic -> tactic -> tactic)%}\egroup
\SYNOPSIS
-Applies the first of two conversions that succeeds.
+Applies first tactic, and iff it fails, applies the second instead.
\DESCRIBE
-{\small\verb%(c1 ORELSEC c2) "t"%} returns the result of applying the conversion {\small\verb%c1%} to
-the term {\small\verb%"t"%} if this succeeds. Otherwise {\small\verb%(c1 ORELSEC c2) "t"%} returns the
-result of applying the conversion {\small\verb%c2%} to the term {\small\verb%"t"%}.
+If {\small\verb%T1%} and {\small\verb%T2%} are tactics, {\small\verb%T1 ORELSE T2%} is a tactic which applies {\small\verb%T1%} to
+a goal, and iff it fails, applies {\small\verb%T2%} to the goal instead.
\FAILURE
-{\small\verb%(c1 ORELSEC c2) "t"%} fails both {\small\verb%c1%} and {\small\verb%c2%} fail when applied to {\small\verb%"t"%}.
+The application of {\small\verb%ORELSE%} to a pair of tactics never fails.
+The resulting tactic fails if both {\small\verb%T1%} and {\small\verb%T2%} fail when applied to the
+relevant goal.
\SEEALSO
-FIRST_CONV.
+EVERY, FIRST, THEN.
\ENDDOC
\DOC{ORELSE\_TCL}
@@ -18482,29 +18480,6 @@ evaluation failed outr
outl, inl, inr, isl
\ENDDOC
-\DOC{p}
-
-\TYPE {\small\verb%p : (int -> void)%}\egroup
-
-\SYNOPSIS
-Prints the top levels of the subgoal package goal stack.
-
-\DESCRIBE
-The function {\small\verb%p%} is part of the subgoal package. It is an abbreviation for the
-function {\small\verb%print_state%}. For a description of the subgoal package, see
-{\small\verb%set_goal%}.
-
-\FAILURE
-Never fails.
-
-\USES
-Examining the proof state during an interactive proof session.
-
-\SEEALSO
-b, backup, backup_limit, e, expand, expandf, g, get_state, print_state, r,
-rotate, save_top_thm, set_goal, set_state, top_goal, top_thm.
-
-\ENDDOC
\DOC{pair}
\TYPE {\small\verb%pair : (* -> ** -> (* # **))%}\egroup
@@ -18878,7 +18853,30 @@ implication (the inbuilt specialization
quantifier), and matches it to {\small\verb%T%}.
\SEEALSO
-INST_TYPE, INST_TY_TERM, match.
+INST_TYPE, INST_TY_TERM, match.
+
+\ENDDOC
+\DOC{p}
+
+\TYPE {\small\verb%p : (int -> void)%}\egroup
+
+\SYNOPSIS
+Prints the top levels of the subgoal package goal stack.
+
+\DESCRIBE
+The function {\small\verb%p%} is part of the subgoal package. It is an abbreviation for the
+function {\small\verb%print_state%}. For a description of the subgoal package, see
+{\small\verb%set_goal%}.
+
+\FAILURE
+Never fails.
+
+\USES
+Examining the proof state during an interactive proof session.
+
+\SEEALSO
+b, backup, backup_limit, e, expand, expandf, g, get_state, print_state, r,
+rotate, save_top_thm, set_goal, set_state, top_goal, top_thm.
\ENDDOC
\DOC{POP\_ASSUM}
@@ -20153,56 +20151,6 @@ Never fails.
set_prompt.
\ENDDOC
-\DOC{PROVE}
-
-\TYPE {\small\verb%PROVE : ((term # tactic) -> thm)%}\egroup
-
-\SYNOPSIS
-Attempts to prove a boolean term using the supplied tactic.
-
-\DESCRIBE
-When applied to a term-tactic pair {\small\verb%(tm,tac)%}, the function {\small\verb%PROVE%} attempts to
-prove the goal {\small\verb%?- tm%}, that is, the term {\small\verb%tm%} with no assumptions, using the
-tactic {\small\verb%tac%}. If {\small\verb%PROVE%} succeeds, it returns the corresponding theorem
-{\small\verb%A |- tm%}, where the assumption list {\small\verb%A%} may not be empty if the tactic is
-invalid; {\small\verb%PROVE%} has no inbuilt validity-checking.
-
-\FAILURE
-Fails if the term is not of type {\small\verb%bool%} (and so cannot possibly be
-the conclusion of a theorem), or if the tactic cannot solve the goal.
-In the latter case {\small\verb%PROVE%} will list the unsolved goals to help the user.
-
-\SEEALSO
-TAC_PROOF, prove, prove_thm, VALID.
-
-\ENDDOC
-\DOC{prove}
-
-\TYPE {\small\verb%prove : ((term # tactic) -> thm)%}\egroup
-
-\SYNOPSIS
-Attempts to prove a boolean term using the supplied tactic.
-
-\DESCRIBE
-When applied to a term-tactic pair {\small\verb%(tm,tac)%}, the function {\small\verb%prove%} attempts to
-prove the goal {\small\verb%?- tm%}, that is, the term {\small\verb%tm%} with no assumptions, using the
-tactic {\small\verb%tac%}. If {\small\verb%prove%} succeeds, it returns the corresponding theorem
-{\small\verb%A |- tm%}, where the assumption list {\small\verb%A%} may not be empty if the tactic is
-invalid; {\small\verb%prove%} has no inbuilt validity-checking.
-
-\FAILURE
-Fails if the term is not of type {\small\verb%bool%} (and so cannot possibly be
-the conclusion of a theorem), or if the tactic cannot solve the goal.
-
-\COMMENTS
-The function {\small\verb%PROVE%} provides almost identical functionality, and will
-also list unsolved goals if the tactic fails. It is therefore preferable
-for most purposes.
-
-\SEEALSO
-PROVE, prove_thm, TAC_PROOF, VALID.
-
-\ENDDOC
\DOC{prove\_abs\_fn\_one\_one}
\TYPE {\small\verb%prove_abs_fn_one_one : (thm -> thm)%}\egroup
@@ -20398,6 +20346,56 @@ define_type, INDUCT_THEN, new_recursive_
prove_constructors_distinct, prove_induction_thm, prove_rec_fn_exists.
\ENDDOC
+\DOC{prove}
+
+\TYPE {\small\verb%prove : ((term # tactic) -> thm)%}\egroup
+
+\SYNOPSIS
+Attempts to prove a boolean term using the supplied tactic.
+
+\DESCRIBE
+When applied to a term-tactic pair {\small\verb%(tm,tac)%}, the function {\small\verb%prove%} attempts to
+prove the goal {\small\verb%?- tm%}, that is, the term {\small\verb%tm%} with no assumptions, using the
+tactic {\small\verb%tac%}. If {\small\verb%prove%} succeeds, it returns the corresponding theorem
+{\small\verb%A |- tm%}, where the assumption list {\small\verb%A%} may not be empty if the tactic is
+invalid; {\small\verb%prove%} has no inbuilt validity-checking.
+
+\FAILURE
+Fails if the term is not of type {\small\verb%bool%} (and so cannot possibly be
+the conclusion of a theorem), or if the tactic cannot solve the goal.
+
+\COMMENTS
+The function {\small\verb%PROVE%} provides almost identical functionality, and will
+also list unsolved goals if the tactic fails. It is therefore preferable
+for most purposes.
+
+\SEEALSO
+PROVE, prove_thm, TAC_PROOF, VALID.
+
+\ENDDOC
+\DOC{PROVE}
+
+\TYPE {\small\verb%PROVE : ((term # tactic) -> thm)%}\egroup
+
+\SYNOPSIS
+Attempts to prove a boolean term using the supplied tactic.
+
+\DESCRIBE
+When applied to a term-tactic pair {\small\verb%(tm,tac)%}, the function {\small\verb%PROVE%} attempts to
+prove the goal {\small\verb%?- tm%}, that is, the term {\small\verb%tm%} with no assumptions, using the
+tactic {\small\verb%tac%}. If {\small\verb%PROVE%} succeeds, it returns the corresponding theorem
+{\small\verb%A |- tm%}, where the assumption list {\small\verb%A%} may not be empty if the tactic is
+invalid; {\small\verb%PROVE%} has no inbuilt validity-checking.
+
+\FAILURE
+Fails if the term is not of type {\small\verb%bool%} (and so cannot possibly be
+the conclusion of a theorem), or if the tactic cannot solve the goal.
+In the latter case {\small\verb%PROVE%} will list the unsolved goals to help the user.
+
+\SEEALSO
+TAC_PROOF, prove, prove_thm, VALID.
+
+\ENDDOC
\DOC{PROVE\_HYP}
\TYPE {\small\verb%PROVE_HYP : (thm -> thm -> thm)%}\egroup
@@ -20940,45 +20938,6 @@ Evaluating {\small\verb%quit()%} termina
Never fails.
\ENDDOC
-\DOC{r}
-
-\TYPE {\small\verb%r : (int -> void)%}\egroup
-
-\SYNOPSIS
-Reorders the subgoals on top of the subgoal package goal stack.
-
-\DESCRIBE
-The function {\small\verb%r%} is part of the subgoal package. It is an abbreviation for
-{\small\verb%rotate%}. For a description of the subgoal package, see {\small\verb%set_goal%}.
-
-\FAILURE
-As for {\small\verb%rotate%}.
-
-\USES
-Proving subgoals in a different order to that generated by the subgoal package.
-
-\SEEALSO
-b, backup, backup_limit, e, expand, expandf, g, get_state, p, print_state,
-rotate, save_top_thm, set_goal, set_state, top_goal, top_thm.
-
-\ENDDOC
-\DOC{rand}
-
-\TYPE {\small\verb%rand : (term -> term)%}\egroup
-
-\SYNOPSIS
-Returns the operand from a combination (function application).
-
-\DESCRIBE
-{\small\verb%rand "t1 t2"%} returns {\small\verb%"t2"%}.
-
-\FAILURE
-Fails with {\small\verb%rand%} if term is not a combination.
-
-\SEEALSO
-rator, dest_comb.
-
-\ENDDOC
\DOC{RAND\_CONV}
\TYPE {\small\verb%RAND_CONV : (conv -> conv)%}\egroup
@@ -21016,21 +20975,21 @@ function returned by {\small\verb%RAND_C
ABS_CONV, RATOR_CONV, SUB_CONV.
\ENDDOC
-\DOC{rator}
+\DOC{rand}
-\TYPE {\small\verb%rator : (term -> term)%}\egroup
+\TYPE {\small\verb%rand : (term -> term)%}\egroup
\SYNOPSIS
-Returns the operator from a combination (function application).
+Returns the operand from a combination (function application).
\DESCRIBE
-{\small\verb%rator("t1 t2")%} returns {\small\verb%"t1"%}.
+{\small\verb%rand "t1 t2"%} returns {\small\verb%"t2"%}.
\FAILURE
-Fails with {\small\verb%rator%} if term is not a combination.
+Fails with {\small\verb%rand%} if term is not a combination.
\SEEALSO
-rand, dest_comb.
+rator, dest_comb.
\ENDDOC
\DOC{RATOR\_CONV}
@@ -21070,6 +21029,45 @@ function returned by {\small\verb%RATOR_
ABS_CONV, RAND_CONV, SUB_CONV.
\ENDDOC
+\DOC{rator}
+
+\TYPE {\small\verb%rator : (term -> term)%}\egroup
+
+\SYNOPSIS
+Returns the operator from a combination (function application).
+
+\DESCRIBE
+{\small\verb%rator("t1 t2")%} returns {\small\verb%"t1"%}.
+
+\FAILURE
+Fails with {\small\verb%rator%} if term is not a combination.
+
+\SEEALSO
+rand, dest_comb.
+
+\ENDDOC
+\DOC{r}
+
+\TYPE {\small\verb%r : (int -> void)%}\egroup
+
+\SYNOPSIS
+Reorders the subgoals on top of the subgoal package goal stack.
+
+\DESCRIBE
+The function {\small\verb%r%} is part of the subgoal package. It is an abbreviation for
+{\small\verb%rotate%}. For a description of the subgoal package, see {\small\verb%set_goal%}.
+
+\FAILURE
+As for {\small\verb%rotate%}.
+
+\USES
+Proving subgoals in a different order to that generated by the subgoal package.
+
+\SEEALSO
+b, backup, backup_limit, e, expand, expandf, g, get_state, p, print_state,
+rotate, save_top_thm, set_goal, set_state, top_goal, top_thm.
+
+\ENDDOC
\DOC{read}
\TYPE {\small\verb%read : (string -> string)%}\egroup
@@ -21091,63 +21089,26 @@ descriptor.
\EXAMPLE
The following assumes that HOL is being run under Unix. It will overwrite an
existing file {\small\verb%test-file%} in the current directory. Notice that the actual
-string returned by {\small\verb%openi%} may vary on other systems.
-{\par\samepage\setseps\small
-\begin{verbatim}
- #system `echo "Hi" >test-file`;;
- 0 : int
-
- #let port = openi `test-file`;;
- port = `%test-file` : string
-
- #read port, read port, read port, read port, read port;;
- (`H`, `i`, `
- `, `nil`, `nil`)
- : (string # string # string # string # string)
-
- #close port;;
- () : void
-\end{verbatim}
-}
-\SEEALSO
-append_openw, close, openi, openw, tty_read, tty_write, write.
-
-\ENDDOC
-\DOC{RecordStep}
-
-\TYPE {\small\verb%RecordStep : step -> void%}\egroup
-
-
-\SYNOPSIS
-Record a single inference step.
-
-\DESCRIBE
-A proof is a list of inference steps. After the proof recorder is
-enabled, every inference performed by the system is recorded and
-cumulated in an internal buffer. When a proof is completed, the raw
-records can then be processed and output to a disk file.
-
-{\small\verb%record_proof%} is a system function for recording a single proof step.
-The type {\small\verb%step%} represents a basic inference step. It contains all
-the necessary information of each inference. There are currently 52
-basic inferences which are being recorded. All other ML functions
-representing inference rules are implemented by these basic
-inferences.
-If the proof recorder is enabled when an inference is performed,
-{\small\verb%RecordStep%} will add a step into the internal buffer.
+string returned by {\small\verb%openi%} may vary on other systems.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #system `echo "Hi" >test-file`;;
+ 0 : int
-\FAILURE
-Never fail.
+ #let port = openi `test-file`;;
+ port = `%test-file` : string
-\COMMENTS
-This is a system function implementing the proof recorded. Users
-should not use this function directly. User functions are provided in
-the library {\small\verb%record_proof%}. When new basic inference rule
-is implemented, this function should be called to record the inference step.
+ #read port, read port, read port, read port, read port;;
+ (`H`, `i`, `
+ `, `nil`, `nil`)
+ : (string # string # string # string # string)
+ #close port;;
+ () : void
+\end{verbatim}
+}
\SEEALSO
-record_proof, is_recording_proof, get_steps,
-suspend_recording, resume_recording.
+append_openw, close, openi, openw, tty_read, tty_write, write.
\ENDDOC
\DOC{record\_proof}
@@ -21225,6 +21186,43 @@ new_proof_file, close_proof_file, begin_
TAC_PROOF, PROVE, prove, prove_thm.
\ENDDOC
+\DOC{RecordStep}
+
+\TYPE {\small\verb%RecordStep : step -> void%}\egroup
+
+
+\SYNOPSIS
+Record a single inference step.
+
+\DESCRIBE
+A proof is a list of inference steps. After the proof recorder is
+enabled, every inference performed by the system is recorded and
+cumulated in an internal buffer. When a proof is completed, the raw
+records can then be processed and output to a disk file.
+
+{\small\verb%record_proof%} is a system function for recording a single proof step.
+The type {\small\verb%step%} represents a basic inference step. It contains all
+the necessary information of each inference. There are currently 52
+basic inferences which are being recorded. All other ML functions
+representing inference rules are implemented by these basic
+inferences.
+If the proof recorder is enabled when an inference is performed,
+{\small\verb%RecordStep%} will add a step into the internal buffer.
+
+\FAILURE
+Never fail.
+
+\COMMENTS
+This is a system function implementing the proof recorded. Users
+should not use this function directly. User functions are provided in
+the library {\small\verb%record_proof%}. When new basic inference rule
+is implemented, this function should be called to record the inference step.
+
+\SEEALSO
+record_proof, is_recording_proof, get_steps,
+suspend_recording, resume_recording.
+
+\ENDDOC
\DOC{REDEPTH\_CONV}
\TYPE {\small\verb%REDEPTH_CONV : (conv -> conv)%}\egroup
@@ -21373,25 +21371,6 @@ Fails if the name was not associated wit
set_sticky_type, sticky_list.
\ENDDOC
-\DOC{REPEAT}
-
-\TYPE {\small\verb%REPEAT : (tactic -> tactic)%}\egroup
-
-\SYNOPSIS
-Repeatedly applies a tactic until it fails.
-
-\DESCRIBE
-The tactic {\small\verb%REPEAT T%} is a tactic which applies {\small\verb%T%} to a goal, and while it
-succeeds, continues applying it to all subgoals generated.
-
-\FAILURE
-The application of {\small\verb%REPEAT%} to a tactic never fails, and neither does the
-composite tactic, even if the basic tactic fails immediately.
-
-\SEEALSO
-EVERY, FIRST, ORELSE, THEN, THENL.
-
-\ENDDOC
\DOC{REPEATC}
\TYPE {\small\verb%REPEATC : (conv -> conv)%}\egroup
@@ -21412,6 +21391,25 @@ returns {\small\verb%|- t1 = t(n+1)%}. A
Never fails, but can diverge if the supplied conversion never fails.
\ENDDOC
+\DOC{REPEAT}
+
+\TYPE {\small\verb%REPEAT : (tactic -> tactic)%}\egroup
+
+\SYNOPSIS
+Repeatedly applies a tactic until it fails.
+
+\DESCRIBE
+The tactic {\small\verb%REPEAT T%} is a tactic which applies {\small\verb%T%} to a goal, and while it
+succeeds, continues applying it to all subgoals generated.
+
+\FAILURE
+The application of {\small\verb%REPEAT%} to a tactic never fails, and neither does the
+composite tactic, even if the basic tactic fails immediately.
+
+\SEEALSO
+EVERY, FIRST, ORELSE, THEN, THENL.
+
+\ENDDOC
\DOC{REPEAT\_GTCL}
\TYPE {\small\verb%REPEAT_GTCL : (thm_tactical -> thm_tactical)%}\egroup
@@ -21492,20 +21490,6 @@ example the following goal:
REPEAT_GTCL, THEN_TCL.
\ENDDOC
-\DOC{replicate}
-
-\TYPE {\small\verb%replicate : (* -> int -> * list)%}\egroup
-
-\SYNOPSIS
-Makes a list consisting of a value replicated a specified number of times.
-
-\DESCRIBE
-{\small\verb%replicate x n%} returns {\small\verb%[x;...;x]%}, a list of length {\small\verb%n%}.
-
-\FAILURE
-Fails if number of replications is less than zero.
-
-\ENDDOC
\DOC{rep\_goals}
\TYPE {\small\verb%rep_goals : (goalstack -> subgoals list)%}\egroup
@@ -21515,43 +21499,18 @@ This function is for internal use only a
version of the system. It should not be used.
\ENDDOC
-\DOC{resume\_recording}
-
-\TYPE {\small\verb%resume_recording : void -> void%}\egroup
+\DOC{replicate}
+\TYPE {\small\verb%replicate : (* -> int -> * list)%}\egroup
\SYNOPSIS
-Suspend proof recording temporarily.
+Makes a list consisting of a value replicated a specified number of times.
\DESCRIBE
-A proof is a list of inference steps. After the proof recorder is
-enabled, every inference performed by the system is recorded and
-cumulated in an internal buffer. When a proof is completed, the raw
-records can then be processed and output to a disk file.
-
-{\small\verb%resume_recording%} is a low level user function for managing the proof
-recorder. It resumes the proof recorder without clearing the internal
-inference step buffer. The proof recorder should be in the suspended state.
-Otherwise, this function does nothing.
-
-The current state of the proof recorder can interrogated using the
-function {\small\verb%is_recording_proof%}. A value of {\small\verb%false%} indicates the proof
-recorder is disabled.
+{\small\verb%replicate x n%} returns {\small\verb%[x;...;x]%}, a list of length {\small\verb%n%}.
\FAILURE
-Never fail.
-
-\COMMENTS
-This function is used to implement higher level user functions for
-recording proof in the library {\small\verb%record_proof%}. It is much more
-convenient to use those functions than the low level functions
-such as {\small\verb%resume_recording%} directly.
-
-\SEEALSO
-record_proof, is_recording_proof, RecordStep, get_steps, suspend_recording,
-current_proof, current_proof_file,
-new_proof_file, close_proof_file, begin_proof, end_proof,
-TAC_PROOF, PROVE, prove, prove_thm.
+Fails if number of replications is less than zero.
\ENDDOC
\DOC{RES\_CANON}
@@ -21757,60 +21716,126 @@ assumptions of a goal. {\small\verb%RES_
implications used for resolution are taken from the assumptions of the goal
itself, rather than supplied as an argument.
-When applied to a goal {\small\verb%A ?- g%}, the tactic {\small\verb%RES_THEN ttac%} uses {\small\verb%RES_CANON%} to
-obtain a set of implicative theorems in canonical form from the assumptions {\small\verb%A%}
-of the goal. Each of the resulting theorems (if there are any) will have the
-form:
-{\par\samepage\setseps\small
-\begin{verbatim}
- ai |- !x1...xn. ui ==> vi
-\end{verbatim}
-}
-\noindent where {\small\verb%ai%} is one of the assumptions of the goal. Having obtained
-these implications, {\small\verb%RES_THEN%} then attempts to match each antecedent {\small\verb%ui%} to
-each assumption {\small\verb%aj |- aj%} in the assumptions {\small\verb%A%}. If the antecedent {\small\verb%ui%} of
-any implication matches the conclusion {\small\verb%aj%} of any assumption, then an instance
-of the theorem {\small\verb%ai, aj |- vi%}, called a `resolvent', is obtained by
-specialization of the variables {\small\verb%x1%}, ..., {\small\verb%xn%} and type instantiation,
-followed by an application of modus ponens. There may be more than one
-canonical implication derivable from the assumptions of the goal and each
-such implication is tried against every assumption, so there may be several
-resolvents (or, indeed, none).
+When applied to a goal {\small\verb%A ?- g%}, the tactic {\small\verb%RES_THEN ttac%} uses {\small\verb%RES_CANON%} to
+obtain a set of implicative theorems in canonical form from the assumptions {\small\verb%A%}
+of the goal. Each of the resulting theorems (if there are any) will have the
+form:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ ai |- !x1...xn. ui ==> vi
+\end{verbatim}
+}
+\noindent where {\small\verb%ai%} is one of the assumptions of the goal. Having obtained
+these implications, {\small\verb%RES_THEN%} then attempts to match each antecedent {\small\verb%ui%} to
+each assumption {\small\verb%aj |- aj%} in the assumptions {\small\verb%A%}. If the antecedent {\small\verb%ui%} of
+any implication matches the conclusion {\small\verb%aj%} of any assumption, then an instance
+of the theorem {\small\verb%ai, aj |- vi%}, called a `resolvent', is obtained by
+specialization of the variables {\small\verb%x1%}, ..., {\small\verb%xn%} and type instantiation,
+followed by an application of modus ponens. There may be more than one
+canonical implication derivable from the assumptions of the goal and each
+such implication is tried against every assumption, so there may be several
+resolvents (or, indeed, none).
+
+Tactics are produced using the theorem-tactic {\small\verb%ttac%} from all these resolvents
+(failures of {\small\verb%ttac%} at this stage are filtered out) and these tactics are then
+applied in an unspecified sequence to the goal. That is,
+{\par\samepage\setseps\small
+\begin{verbatim}
+ RES_THEN ttac (A ?- g)
+\end{verbatim}
+}
+\noindent has the effect of:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ MAP_EVERY (mapfilter ttac [... ; (ai,aj |- vi) ; ...]) (A ?- g)
+\end{verbatim}
+}
+\noindent where the theorems {\small\verb%ai,aj |- vi%} are all the consequences that can be
+drawn by a (single) matching modus-ponens inference from the assumptions {\small\verb%A%}
+and the implications derived using {\small\verb%RES_CANON%} from the assumptions. The
+sequence in which the theorems {\small\verb%ai,aj |- vi%} are generated and the
+corresponding tactics applied is unspecified.
+
+\FAILURE
+Evaluating {\small\verb%RES_THEN ttac th%} fails with `{\small\verb%no implication%}' if no
+implication(s) can be derived from the assumptions of the goal by the
+transformation process described under the entry for {\small\verb%RES_CANON%}. Evaluating
+{\small\verb%RES_THEN ttac (A ?- g)%} fails with `{\small\verb%no resolvents%}' if no assumption of the
+goal {\small\verb%A ?- g%} can be resolved with the derived implication or implications.
+Evaluation also fails, with `{\small\verb%no tactics%}', if there are resolvents, but for
+every resolvent {\small\verb%ai,aj |- vi%} evaluating the application {\small\verb%ttac (ai,aj |- vi)%}
+fails---that is, if for every resolvent {\small\verb%ttac%} fails to produce a tactic.
+Finally, failure is propagated if any of the tactics that are produced from the
+resolvents by {\small\verb%ttac%} fails when applied in sequence to the goal.
+
+\SEEALSO
+IMP_RES_TAC, IMP_RES_THEN, MATCH_MP, RES_CANON, RES_TAC.
+
+\ENDDOC
+\DOC{resume\_recording}
+
+\TYPE {\small\verb%resume_recording : void -> void%}\egroup
+
+
+\SYNOPSIS
+Suspend proof recording temporarily.
+
+\DESCRIBE
+A proof is a list of inference steps. After the proof recorder is
+enabled, every inference performed by the system is recorded and
+cumulated in an internal buffer. When a proof is completed, the raw
+records can then be processed and output to a disk file.
+
+{\small\verb%resume_recording%} is a low level user function for managing the proof
+recorder. It resumes the proof recorder without clearing the internal
+inference step buffer. The proof recorder should be in the suspended state.
+Otherwise, this function does nothing.
+
+The current state of the proof recorder can interrogated using the
+function {\small\verb%is_recording_proof%}. A value of {\small\verb%false%} indicates the proof
+recorder is disabled.
+
+\FAILURE
+Never fail.
+
+\COMMENTS
+This function is used to implement higher level user functions for
+recording proof in the library {\small\verb%record_proof%}. It is much more
+convenient to use those functions than the low level functions
+such as {\small\verb%resume_recording%} directly.
+
+\SEEALSO
+record_proof, is_recording_proof, RecordStep, get_steps, suspend_recording,
+current_proof, current_proof_file,
+new_proof_file, close_proof_file, begin_proof, end_proof,
+TAC_PROOF, PROVE, prove, prove_thm.
+
+\ENDDOC
+\DOC{rev\_assoc}
+
+\TYPE {\small\verb%rev_assoc : (* -> (** # *) list -> (** # *))%}\egroup
+
+\SYNOPSIS
+Searches a list of pairs for a pair whose second component equals a specified
+value.
+
+\DESCRIBE
+{\small\verb%rev_assoc y [(x1,y1);...;(xn,yn)]%} returns the first {\small\verb%(xi,yi)%} in the list
+such that {\small\verb%yi%} equals {\small\verb%y%}.
+
+\FAILURE
+Fails if no matching pair is found. This will always be the case if the list
+is empty.
-Tactics are produced using the theorem-tactic {\small\verb%ttac%} from all these resolvents
-(failures of {\small\verb%ttac%} at this stage are filtered out) and these tactics are then
-applied in an unspecified sequence to the goal. That is,
-{\par\samepage\setseps\small
-\begin{verbatim}
- RES_THEN ttac (A ?- g)
-\end{verbatim}
-}
-\noindent has the effect of:
+\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
- MAP_EVERY (mapfilter ttac [... ; (ai,aj |- vi) ; ...]) (A ?- g)
+#rev_assoc 2 [(1,4);(3,2);(2,5);(2,6)];;
+(3, 2) : (int # int)
\end{verbatim}
}
-\noindent where the theorems {\small\verb%ai,aj |- vi%} are all the consequences that can be
-drawn by a (single) matching modus-ponens inference from the assumptions {\small\verb%A%}
-and the implications derived using {\small\verb%RES_CANON%} from the assumptions. The
-sequence in which the theorems {\small\verb%ai,aj |- vi%} are generated and the
-corresponding tactics applied is unspecified.
-
-\FAILURE
-Evaluating {\small\verb%RES_THEN ttac th%} fails with `{\small\verb%no implication%}' if no
-implication(s) can be derived from the assumptions of the goal by the
-transformation process described under the entry for {\small\verb%RES_CANON%}. Evaluating
-{\small\verb%RES_THEN ttac (A ?- g)%} fails with `{\small\verb%no resolvents%}' if no assumption of the
-goal {\small\verb%A ?- g%} can be resolved with the derived implication or implications.
-Evaluation also fails, with `{\small\verb%no tactics%}', if there are resolvents, but for
-every resolvent {\small\verb%ai,aj |- vi%} evaluating the application {\small\verb%ttac (ai,aj |- vi)%}
-fails---that is, if for every resolvent {\small\verb%ttac%} fails to produce a tactic.
-Finally, failure is propagated if any of the tactics that are produced from the
-resolvents by {\small\verb%ttac%} fails when applied in sequence to the goal.
-
\SEEALSO
-IMP_RES_TAC, IMP_RES_THEN, MATCH_MP, RES_CANON, RES_TAC.
+assoc, find, mem, tryfind, exists, forall.
\ENDDOC
\DOC{rev}
@@ -21871,33 +21896,6 @@ FOLDL_CONV, FOLDR_CONV, list_FOLD_CONV.
\ENDDOC
-\DOC{rev\_assoc}
-
-\TYPE {\small\verb%rev_assoc : (* -> (** # *) list -> (** # *))%}\egroup
-
-\SYNOPSIS
-Searches a list of pairs for a pair whose second component equals a specified
-value.
-
-\DESCRIBE
-{\small\verb%rev_assoc y [(x1,y1);...;(xn,yn)]%} returns the first {\small\verb%(xi,yi)%} in the list
-such that {\small\verb%yi%} equals {\small\verb%y%}.
-
-\FAILURE
-Fails if no matching pair is found. This will always be the case if the list
-is empty.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#rev_assoc 2 [(1,4);(3,2);(2,5);(2,6)];;
-(3, 2) : (int # int)
-\end{verbatim}
-}
-\SEEALSO
-assoc, find, mem, tryfind, exists, forall.
-
-\ENDDOC
\DOC{rev\_itlist}
\TYPE {\small\verb%rev_itlist : ((* -> ** -> **) -> * list -> ** -> **)%}\egroup
@@ -21923,185 +21921,72 @@ Never fails.
itlist, end_itlist.
\ENDDOC
-\DOC{REWRITE\_CONV}
-
-\TYPE {\small\verb%REWRITE_CONV : (thm list -> conv)%}\egroup
-
-\SYNOPSIS
-Rewrites a term including built-in tautologies in the list of rewrites.
-
-\DESCRIBE
-Rewriting a term using {\small\verb%REWRITE_CONV%} utilizes as rewrites two sets
-of theorems: the tautologies in the ML list {\small\verb%basic_rewrites%} and the
-ones supplied by the user. The rule searches top-down and recursively
-for subterms which match the left-hand side of any of the possible
-rewrites, until none of the transformations are applicable. There is no
-ordering specified among the set of rewrites.
-
-Variants of this conversion allow changes in the set of equations used:
-{\small\verb%PURE_REWRITE_CONV%} and others in its family do not rewrite with the
-theorems in {\small\verb%basic_rewrites%}.
-
-The top-down recursive search for matches may not be desirable, as
-this may increase the number of inferences being made or may result in
-divergence. In this case other rewriting tools such as
-{\small\verb%ONCE_REWRITE_CONV%} and {\small\verb%GEN_REWRITE_CONV%} can be used, or the set of
-theorems given may be reduced.
-
-See {\small\verb%GEN_REWRITE_CONV%} for the general strategy for simplifying
-theorems in HOL using equational theorems.
-
-\FAILURE
-Does not fail, but may diverge if the sequence of rewrites is
-non-terminating.
-
-\USES
-Used to manipulate terms by rewriting them with theorems.
-While resulting in high degree of automation, {\small\verb%REWRITE_CONV%} can
-spawn a large number of inference steps. Thus, variants such
-as {\small\verb%PURE_REWRITE_CONV%}, or other rules such as {\small\verb%SUBST_CONV%}, may be used
-instead to improve efficiency.
-
-\SEEALSO
-basic_rewrites, GEN_REWRITE_CONV, ONCE_REWRITE_CONV,
-PURE_REWRITE_CONV, REWR_CONV, SUBST_CONV.
-
-\ENDDOC
-\DOC{REWRITE\_RULE}
-
-\TYPE {\small\verb%REWRITE_RULE : (thm list -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Rewrites a theorem including built-in tautologies in the list of rewrites.
-
-\DESCRIBE
-Rewriting a theorem using {\small\verb%REWRITE_RULE%} utilizes as rewrites two sets
-of theorems: the tautologies in the ML list {\small\verb%basic_rewrites%} and the
-ones supplied by the user. The rule searches top-down and recursively
-for subterms which match the left-hand side of any of the possible
-rewrites, until none of the transformations are applicable. There is no
-ordering specified among the set of rewrites.
-
-Variants of this rule allow changes in the set of equations used:
-{\small\verb%PURE_REWRITE_RULE%} and others in its family do not rewrite with the
-theorems in {\small\verb%basic_rewrites%}. Rules such as {\small\verb%ASM_REWRITE_RULE%} add the
-assumptions of the object theorem (or a specified subset of these assumptions)
-to the set of possible rewrites.
-
-The top-down recursive search for matches may not be desirable, as
-this may increase the number of inferences being made or may result in
-divergence. In this case other rewriting tools such as
-{\small\verb%ONCE_REWRITE_RULE%} and {\small\verb%GEN_REWRITE_RULE%} can be used, or the set of
-theorems given may be reduced.
-
-See {\small\verb%GEN_REWRITE_RULE%} for the general strategy for simplifying
-theorems in HOL using equational theorems.
-
-\FAILURE
-Does not fail, but may diverge if the sequence of rewrites is
-non-terminating.
-
-\USES
-Used to manipulate theorems by rewriting them with other theorems.
-While resulting in high degree of automation, {\small\verb%REWRITE_RULE%} can
-spawn a large number of inference steps. Thus, variants such
-as {\small\verb%PURE_REWRITE_RULE%}, or other rules such as {\small\verb%SUBST%}, may be used
-instead to improve efficiency.
-
-\SEEALSO
-ASM_REWRITE_RULE, basic_rewrites, GEN_REWRITE_RULE, ONCE_REWRITE_RULE,
-PURE_REWRITE_RULE, REWR_CONV, REWRITE_CONV, SUBST.
-
-\ENDDOC
-\DOC{REWRITE\_TAC}
+\DOC{REW\_DEPTH\_CONV}
-\TYPE {\small\verb%REWRITE_TAC : (thm list -> tactic)%}\egroup
+\TYPE {\small\verb%REW_DEPTH_CONV : (conv -> conv)%}\egroup
\SYNOPSIS
-Rewrites a goal including built-in tautologies in the list of rewrites.
+Applies a conversion top-down to all subterms, retraversing changed ones.
+For use in rewriting.
\DESCRIBE
-Rewriting tactics in HOL provide a recursive left-to-right matching
-and rewriting facility that automatically decomposes subgoals and
-justifies segments of proof in which equational theorems are used,
-singly or collectively. These include the unfolding of definitions,
-and the substitution of equals for equals. Rewriting is used either
-to advance or to complete the decomposition of subgoals.
-
-{\small\verb%REWRITE_TAC%} transforms (or solves) a goal by using as rewrite rules
-(i.e. as left-to-right replacement rules) the conclusions of the given
-list of (equational) theorems, as well as a set of built-in theorems
-(common tautologies) held in the ML variable {\small\verb%basic_rewrites%}.
-Recognition of a tautology often terminates the subgoaling process
-(i.e. solves the goal).
-
-The equational rewrites generated are applied recursively and to
-arbitrary depth, with matching and instantiation of variables and type
-variables. A list of rewrites can set off an infinite rewriting
-process, and it is not, of course, decidable in general whether a
-rewrite set has that property. The order in which the rewrite theorems
-are applied is unspecified, and the user should not depend on any
-ordering.
-
-See {\small\verb%GEN_REWRITE_TAC%} for more details on the rewriting process.
-Variants of {\small\verb%REWRITE_TAC%} allow the use of a different set of
-rewrites. Some of them, such as {\small\verb%PURE_REWRITE_TAC%}, exclude the basic
-tautologies from the possible transformations. {\small\verb%ASM_REWRITE_TAC%} and
-others include the assumptions at the goal in the set of possible
-rewrites.
+{\small\verb%REW_DEPTH_CONV c tm%} repeatedly applies the conversion {\small\verb%c%} to all the subterms
+of the term {\small\verb%tm%}, including the term {\small\verb%tm%} itself. The supplied conversion {\small\verb%c%}
+is applied to the subterms of {\small\verb%tm%} in top-down order and is applied repeatedly
+(zero or more times, as is done by {\small\verb%REPEATC%}) at each subterm until it fails.
+If a subterm {\small\verb%t%} is changed (up to alpha-equivalence) by virtue of the
+application of {\small\verb%c%} to its own subterms, then the term into which {\small\verb%t%} is
+transformed is retraversed by applying {\small\verb%REW_DEPTH_CONV c%} to it.
-Still other tactics allow greater control over the search for
-rewritable subterms. Several of them such as {\small\verb%ONCE_REWRITE_TAC%} do not
-apply rewrites recursively. {\small\verb%GEN_REWRITE_TAC%} allows a rewrite to be
-applied at a particular subterm.
+{\small\verb%REW_DEPTH_CONV%} is a special version of {\small\verb%TOP_DEPTH_CONV%} for use by the
+rewriting conversions, rules and tactics. It differs from {\small\verb%TOP_DEPTH_CONV%} as
+follows: If converting an abstraction fails due to the presence of the bound
+variable in the hypotheses of the theorem generated by converting the body,
+{\small\verb%REW_DEPTH_CONV%} retries the conversion having renamed the bound variable of
+the abstraction. If successful the renaming is reversed.
\FAILURE
-{\small\verb%REWRITE_TAC%} does not fail. Certain sets of rewriting theorems on
-certain goals may cause a non-terminating sequence of rewrites.
-Divergent rewriting behaviour results from a term {\small\verb%t%} being
-immediately or eventually rewritten to a term containing {\small\verb%t%} as a
-sub-term. The exact behaviour depends on the {\small\verb%HOL%} implementation; it
-may be possible (unfortunately) to fall into Lisp in this event.
+{\small\verb%REW_DEPTH_CONV c tm%} never fails but can diverge.
\EXAMPLE
-The arithmetic theorem {\small\verb%GREATER%}, {\small\verb%|- !m n. m > n = n < m%}, is used
-below to advance a goal:
+The following example illustrates the difference between the functions
+{\small\verb%REW_DEPTH_CONV%} and {\small\verb%TOP_DEPTH_CONV%}. It is not intended to illustrate the
+full range of behaviour of the former. Both {\small\verb%REW_DEPTH_CONV%} and
+{\small\verb%TOP_DEPTH_CONV%} successfully apply the theorem {\small\verb%ADD_0%} inside an abstraction:
{\par\samepage\setseps\small
\begin{verbatim}
- #REWRITE_TAC[GREATER]([],"5 > 4");;
- ([([], "4 < 5")], -) : subgoals
+ #REW_DEPTH_CONV (REWR_CONV ADD_0) "\n. n + 0";;
+ |- (\n. n + 0) = (\n. n)
+
+ #TOP_DEPTH_CONV (REWR_CONV ADD_0) "\n. n + 0";;
+ |- (\n. n + 0) = (\n. n)
\end{verbatim}
}
-\noindent It is used below with the theorem {\small\verb%LESS_0%},
-{\small\verb%|- !n. 0 < (SUC n)%}, to solve a goal:
+\noindent However, if a hypothesis containing a free occurrence of the bound
+variable is added to the rewrite rule, it interferes with the operation of
+{\small\verb%TOP_DEPTH_CONV%} but not that of {\small\verb%REW_DEPTH_CONV%}:
{\par\samepage\setseps\small
\begin{verbatim}
- #let gl,p = REWRITE_TAC[GREATER;LESS_0]([],"(SUC n) > 0");;
- gl = [] : goal list
- p = - : proof
+ #let th = ADD_ASSUM "n = 0" ADD_0;;
+ th = n = 0 |- !m. m + 0 = m
+
+ #REW_DEPTH_CONV (REWR_CONV th) "\n. n + 0";;
+ n = 0 |- (\n. n + 0) = (\n. n)
- #p[];;
- |- (SUC n) > 0
+ #TOP_DEPTH_CONV (REWR_CONV th) "\n. n + 0";;
+ |- (\n. n + 0) = (\n. n + 0)
\end{verbatim}
}
-\USES
-Rewriting is a powerful and general mechanism in HOL, and an
-important part of many proofs. It relieves the user of the burden of
-directing and justifying a large number of minor proof steps.
-{\small\verb%REWRITE_TAC%} fits a forward proof sequence smoothly into the general
-goal-oriented framework. That is, (within one subgoaling step) it
-produces and justifies certain forward inferences, none of which are
-necessarily on a direct path to the desired goal.
-
-{\small\verb%REWRITE_TAC%} may be more powerful a tactic than is needed in certain
-situations; if efficiency is at stake, alternatives might be
-considered.
+\COMMENTS
+The implementation of this function uses failure to avoid rebuilding
+unchanged subterms. That is to say, during execution the failure string
+{\small\verb%`QCONV`%} may be generated and later trapped. The behaviour of the function
+is dependent on this use of failure. So, if the conversion given as argument
+happens to generate a failure with string {\small\verb%`QCONV`%}, the operation of
+{\small\verb%REW_DEPTH_CONV%} will be unpredictable.
\SEEALSO
-ASM_REWRITE_TAC, GEN_REWRITE_TAC, FILTER_ASM_REWRITE_TAC,
-FILTER_ONCE_ASM_REWRITE_TAC, ONCE_ASM_REWRITE_TAC, ONCE_REWRITE_TAC,
-PURE_ASM_REWRITE_TAC, PURE_ONCE_ASM_REWRITE_TAC,
-PURE_ONCE_REWRITE_TAC, PURE_REWRITE_TAC, REWR_CONV, REWRITE_CONV, SUBST_TAC.
+ONCE_REW_DEPTH_CONV, TOP_DEPTH_CONV.
\ENDDOC
\DOC{REWR\_CONV}
@@ -22271,72 +22156,185 @@ must be instantiated in order to match t
REWRITE_CONV.
\ENDDOC
-\DOC{REW\_DEPTH\_CONV}
+\DOC{REWRITE\_CONV}
-\TYPE {\small\verb%REW_DEPTH_CONV : (conv -> conv)%}\egroup
+\TYPE {\small\verb%REWRITE_CONV : (thm list -> conv)%}\egroup
\SYNOPSIS
-Applies a conversion top-down to all subterms, retraversing changed ones.
-For use in rewriting.
+Rewrites a term including built-in tautologies in the list of rewrites.
\DESCRIBE
-{\small\verb%REW_DEPTH_CONV c tm%} repeatedly applies the conversion {\small\verb%c%} to all the subterms
-of the term {\small\verb%tm%}, including the term {\small\verb%tm%} itself. The supplied conversion {\small\verb%c%}
-is applied to the subterms of {\small\verb%tm%} in top-down order and is applied repeatedly
-(zero or more times, as is done by {\small\verb%REPEATC%}) at each subterm until it fails.
-If a subterm {\small\verb%t%} is changed (up to alpha-equivalence) by virtue of the
-application of {\small\verb%c%} to its own subterms, then the term into which {\small\verb%t%} is
-transformed is retraversed by applying {\small\verb%REW_DEPTH_CONV c%} to it.
+Rewriting a term using {\small\verb%REWRITE_CONV%} utilizes as rewrites two sets
+of theorems: the tautologies in the ML list {\small\verb%basic_rewrites%} and the
+ones supplied by the user. The rule searches top-down and recursively
+for subterms which match the left-hand side of any of the possible
+rewrites, until none of the transformations are applicable. There is no
+ordering specified among the set of rewrites.
-{\small\verb%REW_DEPTH_CONV%} is a special version of {\small\verb%TOP_DEPTH_CONV%} for use by the
-rewriting conversions, rules and tactics. It differs from {\small\verb%TOP_DEPTH_CONV%} as
-follows: If converting an abstraction fails due to the presence of the bound
-variable in the hypotheses of the theorem generated by converting the body,
-{\small\verb%REW_DEPTH_CONV%} retries the conversion having renamed the bound variable of
-the abstraction. If successful the renaming is reversed.
+Variants of this conversion allow changes in the set of equations used:
+{\small\verb%PURE_REWRITE_CONV%} and others in its family do not rewrite with the
+theorems in {\small\verb%basic_rewrites%}.
+
+The top-down recursive search for matches may not be desirable, as
+this may increase the number of inferences being made or may result in
+divergence. In this case other rewriting tools such as
+{\small\verb%ONCE_REWRITE_CONV%} and {\small\verb%GEN_REWRITE_CONV%} can be used, or the set of
+theorems given may be reduced.
+
+See {\small\verb%GEN_REWRITE_CONV%} for the general strategy for simplifying
+theorems in HOL using equational theorems.
\FAILURE
-{\small\verb%REW_DEPTH_CONV c tm%} never fails but can diverge.
+Does not fail, but may diverge if the sequence of rewrites is
+non-terminating.
+
+\USES
+Used to manipulate terms by rewriting them with theorems.
+While resulting in high degree of automation, {\small\verb%REWRITE_CONV%} can
+spawn a large number of inference steps. Thus, variants such
+as {\small\verb%PURE_REWRITE_CONV%}, or other rules such as {\small\verb%SUBST_CONV%}, may be used
+instead to improve efficiency.
+
+\SEEALSO
+basic_rewrites, GEN_REWRITE_CONV, ONCE_REWRITE_CONV,
+PURE_REWRITE_CONV, REWR_CONV, SUBST_CONV.
+
+\ENDDOC
+\DOC{REWRITE\_RULE}
+
+\TYPE {\small\verb%REWRITE_RULE : (thm list -> thm -> thm)%}\egroup
+
+\SYNOPSIS
+Rewrites a theorem including built-in tautologies in the list of rewrites.
+
+\DESCRIBE
+Rewriting a theorem using {\small\verb%REWRITE_RULE%} utilizes as rewrites two sets
+of theorems: the tautologies in the ML list {\small\verb%basic_rewrites%} and the
+ones supplied by the user. The rule searches top-down and recursively
+for subterms which match the left-hand side of any of the possible
+rewrites, until none of the transformations are applicable. There is no
+ordering specified among the set of rewrites.
+
+Variants of this rule allow changes in the set of equations used:
+{\small\verb%PURE_REWRITE_RULE%} and others in its family do not rewrite with the
+theorems in {\small\verb%basic_rewrites%}. Rules such as {\small\verb%ASM_REWRITE_RULE%} add the
+assumptions of the object theorem (or a specified subset of these assumptions)
+to the set of possible rewrites.
+
+The top-down recursive search for matches may not be desirable, as
+this may increase the number of inferences being made or may result in
+divergence. In this case other rewriting tools such as
+{\small\verb%ONCE_REWRITE_RULE%} and {\small\verb%GEN_REWRITE_RULE%} can be used, or the set of
+theorems given may be reduced.
+
+See {\small\verb%GEN_REWRITE_RULE%} for the general strategy for simplifying
+theorems in HOL using equational theorems.
+
+\FAILURE
+Does not fail, but may diverge if the sequence of rewrites is
+non-terminating.
+
+\USES
+Used to manipulate theorems by rewriting them with other theorems.
+While resulting in high degree of automation, {\small\verb%REWRITE_RULE%} can
+spawn a large number of inference steps. Thus, variants such
+as {\small\verb%PURE_REWRITE_RULE%}, or other rules such as {\small\verb%SUBST%}, may be used
+instead to improve efficiency.
+
+\SEEALSO
+ASM_REWRITE_RULE, basic_rewrites, GEN_REWRITE_RULE, ONCE_REWRITE_RULE,
+PURE_REWRITE_RULE, REWR_CONV, REWRITE_CONV, SUBST.
+
+\ENDDOC
+\DOC{REWRITE\_TAC}
+
+\TYPE {\small\verb%REWRITE_TAC : (thm list -> tactic)%}\egroup
+
+\SYNOPSIS
+Rewrites a goal including built-in tautologies in the list of rewrites.
+
+\DESCRIBE
+Rewriting tactics in HOL provide a recursive left-to-right matching
+and rewriting facility that automatically decomposes subgoals and
+justifies segments of proof in which equational theorems are used,
+singly or collectively. These include the unfolding of definitions,
+and the substitution of equals for equals. Rewriting is used either
+to advance or to complete the decomposition of subgoals.
+
+{\small\verb%REWRITE_TAC%} transforms (or solves) a goal by using as rewrite rules
+(i.e. as left-to-right replacement rules) the conclusions of the given
+list of (equational) theorems, as well as a set of built-in theorems
+(common tautologies) held in the ML variable {\small\verb%basic_rewrites%}.
+Recognition of a tautology often terminates the subgoaling process
+(i.e. solves the goal).
+
+The equational rewrites generated are applied recursively and to
+arbitrary depth, with matching and instantiation of variables and type
+variables. A list of rewrites can set off an infinite rewriting
+process, and it is not, of course, decidable in general whether a
+rewrite set has that property. The order in which the rewrite theorems
+are applied is unspecified, and the user should not depend on any
+ordering.
+
+See {\small\verb%GEN_REWRITE_TAC%} for more details on the rewriting process.
+Variants of {\small\verb%REWRITE_TAC%} allow the use of a different set of
+rewrites. Some of them, such as {\small\verb%PURE_REWRITE_TAC%}, exclude the basic
+tautologies from the possible transformations. {\small\verb%ASM_REWRITE_TAC%} and
+others include the assumptions at the goal in the set of possible
+rewrites.
+
+Still other tactics allow greater control over the search for
+rewritable subterms. Several of them such as {\small\verb%ONCE_REWRITE_TAC%} do not
+apply rewrites recursively. {\small\verb%GEN_REWRITE_TAC%} allows a rewrite to be
+applied at a particular subterm.
+
+\FAILURE
+{\small\verb%REWRITE_TAC%} does not fail. Certain sets of rewriting theorems on
+certain goals may cause a non-terminating sequence of rewrites.
+Divergent rewriting behaviour results from a term {\small\verb%t%} being
+immediately or eventually rewritten to a term containing {\small\verb%t%} as a
+sub-term. The exact behaviour depends on the {\small\verb%HOL%} implementation; it
+may be possible (unfortunately) to fall into Lisp in this event.
\EXAMPLE
-The following example illustrates the difference between the functions
-{\small\verb%REW_DEPTH_CONV%} and {\small\verb%TOP_DEPTH_CONV%}. It is not intended to illustrate the
-full range of behaviour of the former. Both {\small\verb%REW_DEPTH_CONV%} and
-{\small\verb%TOP_DEPTH_CONV%} successfully apply the theorem {\small\verb%ADD_0%} inside an abstraction:
+The arithmetic theorem {\small\verb%GREATER%}, {\small\verb%|- !m n. m > n = n < m%}, is used
+below to advance a goal:
{\par\samepage\setseps\small
\begin{verbatim}
- #REW_DEPTH_CONV (REWR_CONV ADD_0) "\n. n + 0";;
- |- (\n. n + 0) = (\n. n)
-
- #TOP_DEPTH_CONV (REWR_CONV ADD_0) "\n. n + 0";;
- |- (\n. n + 0) = (\n. n)
+ #REWRITE_TAC[GREATER]([],"5 > 4");;
+ ([([], "4 < 5")], -) : subgoals
\end{verbatim}
}
-\noindent However, if a hypothesis containing a free occurrence of the bound
-variable is added to the rewrite rule, it interferes with the operation of
-{\small\verb%TOP_DEPTH_CONV%} but not that of {\small\verb%REW_DEPTH_CONV%}:
+\noindent It is used below with the theorem {\small\verb%LESS_0%},
+{\small\verb%|- !n. 0 < (SUC n)%}, to solve a goal:
{\par\samepage\setseps\small
\begin{verbatim}
- #let th = ADD_ASSUM "n = 0" ADD_0;;
- th = n = 0 |- !m. m + 0 = m
-
- #REW_DEPTH_CONV (REWR_CONV th) "\n. n + 0";;
- n = 0 |- (\n. n + 0) = (\n. n)
+ #let gl,p = REWRITE_TAC[GREATER;LESS_0]([],"(SUC n) > 0");;
+ gl = [] : goal list
+ p = - : proof
- #TOP_DEPTH_CONV (REWR_CONV th) "\n. n + 0";;
- |- (\n. n + 0) = (\n. n + 0)
+ #p[];;
+ |- (SUC n) > 0
\end{verbatim}
}
-\COMMENTS
-The implementation of this function uses failure to avoid rebuilding
-unchanged subterms. That is to say, during execution the failure string
-{\small\verb%`QCONV`%} may be generated and later trapped. The behaviour of the function
-is dependent on this use of failure. So, if the conversion given as argument
-happens to generate a failure with string {\small\verb%`QCONV`%}, the operation of
-{\small\verb%REW_DEPTH_CONV%} will be unpredictable.
+\USES
+Rewriting is a powerful and general mechanism in HOL, and an
+important part of many proofs. It relieves the user of the burden of
+directing and justifying a large number of minor proof steps.
+{\small\verb%REWRITE_TAC%} fits a forward proof sequence smoothly into the general
+goal-oriented framework. That is, (within one subgoaling step) it
+produces and justifies certain forward inferences, none of which are
+necessarily on a direct path to the desired goal.
+
+{\small\verb%REWRITE_TAC%} may be more powerful a tactic than is needed in certain
+situations; if efficiency is at stake, alternatives might be
+considered.
\SEEALSO
-ONCE_REW_DEPTH_CONV, TOP_DEPTH_CONV.
+ASM_REWRITE_TAC, GEN_REWRITE_TAC, FILTER_ASM_REWRITE_TAC,
+FILTER_ONCE_ASM_REWRITE_TAC, ONCE_ASM_REWRITE_TAC, ONCE_REWRITE_TAC,
+PURE_ASM_REWRITE_TAC, PURE_ONCE_ASM_REWRITE_TAC,
+PURE_ONCE_REWRITE_TAC, PURE_REWRITE_TAC, REWR_CONV, REWRITE_CONV, SUBST_TAC.
\ENDDOC
\DOC{rhs}
@@ -22722,20 +22720,6 @@ It does not matter if the goal has no as
ASSUM_LIST, MAP_EVERY, MAP_FIRST, POP_ASSUM_LIST.
\ENDDOC
-\DOC{S}
-
-\TYPE {\small\verb%S : ((* -> ** -> ***) -> (* -> **) -> * -> ***)%}\egroup
-
-\SYNOPSIS
-Performs function composition: {\small\verb%S f g x%} = {\small\verb%f x (g x)%} (the {\small\verb%S%} combinator).
-
-\FAILURE
-Never fails.
-
-\SEEALSO
-\#, B, C, CB, Co, I, K, KI, o, oo, W.
-
-\ENDDOC
\DOC{save}
\TYPE {\small\verb%save : (string -> void)%}\egroup
@@ -22977,10 +22961,24 @@ To sum the elements of a list and save t
}
\SEEALSO
-SCANL_CONV, FOLDL_CONV, FOLDR_CONV, list_FOLD_CONV.
+SCANL_CONV, FOLDL_CONV, FOLDR_CONV, list_FOLD_CONV.
+
+\ENDDOC
+
+\DOC{S}
+
+\TYPE {\small\verb%S : ((* -> ** -> ***) -> (* -> **) -> * -> ***)%}\egroup
+
+\SYNOPSIS
+Performs function composition: {\small\verb%S f g x%} = {\small\verb%f x (g x)%} (the {\small\verb%S%} combinator).
+
+\FAILURE
+Never fails.
+
+\SEEALSO
+\#, B, C, CB, Co, I, K, KI, o, oo, W.
\ENDDOC
-
\DOC{search\_path}
\TYPE {\small\verb%search_path : (void -> string list)%}\egroup
@@ -23327,35 +23325,6 @@ constant defined using the epsilon opera
CHOOSE, SELECT_AX, SELECT_CONV, SELECT_ELIM, SELECT_INTRO.
\ENDDOC
-\DOC{setify}
-
-\TYPE {\small\verb%setify : (* list -> * list)%}\egroup
-
-\SYNOPSIS
-Removes repeated elements from a list. Makes a list into a `set'.
-
-\DESCRIBE
-{\small\verb%setify l%} removes repeated elements from {\small\verb%l%}, leaving the last occurrence of
-each duplicate in the list.
-
-\FAILURE
-Never fails.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#setify [1;2;3;1;4;3];;
-[2; 1; 4; 3] : int list
-\end{verbatim}
-}
-\COMMENTS
-Perhaps the first occurrence of each duplicate should be left in the list, not
-the last? However, other functions may rely on the ordering currently used.
-
-\SEEALSO
-distinct.
-
-\ENDDOC
\DOC{set\_equal}
\TYPE {\small\verb%set_equal : (* list -> * list -> bool)%}\egroup
@@ -23599,6 +23568,35 @@ Never fails.
help_search_path, install, search_path, set_search_path.
\ENDDOC
+\DOC{setify}
+
+\TYPE {\small\verb%setify : (* list -> * list)%}\egroup
+
+\SYNOPSIS
+Removes repeated elements from a list. Makes a list into a `set'.
+
+\DESCRIBE
+{\small\verb%setify l%} removes repeated elements from {\small\verb%l%}, leaving the last occurrence of
+each duplicate in the list.
+
+\FAILURE
+Never fails.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#setify [1;2;3;1;4;3];;
+[2; 1; 4; 3] : int list
+\end{verbatim}
+}
+\COMMENTS
+Perhaps the first occurrence of each duplicate should be left in the list, not
+the last? However, other functions may rely on the ordering currently used.
+
+\SEEALSO
+distinct.
+
+\ENDDOC
\DOC{set\_interface\_map}
\TYPE {\small\verb%set_interface_map : ((string # string) list -> (string # string) list)%}\egroup
@@ -24272,6 +24270,45 @@ that the `ordering' is not antisymmetric
\end{verbatim}
}
\ENDDOC
+\DOC{SPEC\_ALL}
+
+\TYPE {\small\verb%SPEC_ALL : (thm -> thm)%}\egroup
+
+\SYNOPSIS
+Specializes the conclusion of a theorem with its own quantified variables.
+
+\DESCRIBE
+When applied to a theorem {\small\verb%A |- !x1...xn. t%}, the inference rule {\small\verb%SPEC_ALL%}
+returns the theorem {\small\verb%A |- t[x1'/x1]...[xn'/xn]%} where the {\small\verb%xi'%} are distinct
+variants of the corresponding {\small\verb%xi%}, chosen to avoid clashes with any variables
+free in the assumption list and with the names of constants. Normally {\small\verb%xi'%} is
+just {\small\verb%xi%}, in which case {\small\verb%SPEC_ALL%} simply removes all universal quantifiers.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- !x1...xn. t
+ --------------------------- SPEC_ALL
+ A |- t[x1'/x1]...[xn'/xn]
+\end{verbatim}
+}
+\FAILURE
+Never fails.
+
+\EXAMPLE
+The following example shows how variables are also renamed to avoid clashing
+with the names of constants.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #let v=mk_var(`T`,":bool") in ASSUME "!^v. ^v \/ ~^v";;
+ !T. T \/ ~T |- !T. T \/ ~T
+
+ #SPEC_ALL it;;
+ !T. T \/ ~T |- T' \/ ~T'
+\end{verbatim}
+}
+\SEEALSO
+GEN, GENL, GEN_ALL, GEN_TAC, SPEC, SPECL, SPEC_ALL, SPEC_TAC.
+
+\ENDDOC
\DOC{SPEC}
\TYPE {\small\verb%SPEC : (term -> thm -> thm)%}\egroup
@@ -24379,45 +24416,6 @@ The following is a specialization of a t
GEN, GENL, GEN_ALL, GEN_TAC, SPEC, SPEC_ALL, SPEC_TAC.
\ENDDOC
-\DOC{SPEC\_ALL}
-
-\TYPE {\small\verb%SPEC_ALL : (thm -> thm)%}\egroup
-
-\SYNOPSIS
-Specializes the conclusion of a theorem with its own quantified variables.
-
-\DESCRIBE
-When applied to a theorem {\small\verb%A |- !x1...xn. t%}, the inference rule {\small\verb%SPEC_ALL%}
-returns the theorem {\small\verb%A |- t[x1'/x1]...[xn'/xn]%} where the {\small\verb%xi'%} are distinct
-variants of the corresponding {\small\verb%xi%}, chosen to avoid clashes with any variables
-free in the assumption list and with the names of constants. Normally {\small\verb%xi'%} is
-just {\small\verb%xi%}, in which case {\small\verb%SPEC_ALL%} simply removes all universal quantifiers.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- !x1...xn. t
- --------------------------- SPEC_ALL
- A |- t[x1'/x1]...[xn'/xn]
-\end{verbatim}
-}
-\FAILURE
-Never fails.
-
-\EXAMPLE
-The following example shows how variables are also renamed to avoid clashing
-with the names of constants.
-{\par\samepage\setseps\small
-\begin{verbatim}
- #let v=mk_var(`T`,":bool") in ASSUME "!^v. ^v \/ ~^v";;
- !T. T \/ ~T |- !T. T \/ ~T
-
- #SPEC_ALL it;;
- !T. T \/ ~T |- T' \/ ~T'
-\end{verbatim}
-}
-\SEEALSO
-GEN, GENL, GEN_ALL, GEN_TAC, SPEC, SPECL, SPEC_ALL, SPEC_TAC.
-
-\ENDDOC
\DOC{SPEC\_TAC}
\TYPE {\small\verb%SPEC_TAC : ((term # term) -> tactic)%}\egroup
@@ -25123,6 +25121,50 @@ Generating a case split from the axioms
ASM_CASES_TAC, BOOL_CASES_TAC, COND_CASES_TAC, DISJ_CASES_TAC.
\ENDDOC
+\DOC{SUB\_CONV}
+
+\TYPE {\small\verb%SUB_CONV : (conv -> conv)%}\egroup
+
+\SYNOPSIS
+Applies a conversion to the top-level subterms of a term.
+
+\DESCRIBE
+For any conversion {\small\verb%c%}, the function returned by {\small\verb%SUB_CONV c%} is a conversion
+that applies {\small\verb%c%} to all the top-level subterms of a term. If the conversion
+{\small\verb%c%} maps {\small\verb%t%} to {\small\verb%|- t = t'%}, then {\small\verb%SUB_CONV c%} maps an abstraction {\small\verb%"\x.t"%} to
+the theorem:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- (\x.t) = (\x.t')
+\end{verbatim}
+}
+\noindent That is, {\small\verb%SUB_CONV c "\x.t"%} applies {\small\verb%c%} to the body of the
+abstraction {\small\verb%"\x.t"%}. If {\small\verb%c%} is a conversion that maps {\small\verb%"t1"%} to the theorem
+{\small\verb%|- t1 = t1'%} and {\small\verb%"t2"%} to the theorem {\small\verb%|- t2 = t2'%}, then the conversion
+{\small\verb%SUB_CONV c%} maps an application {\small\verb%"t1 t2"%} to the theorem:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- (t1 t2) = (t1' t2')
+\end{verbatim}
+}
+\noindent That is, {\small\verb%SUB_CONV c "t1 t2"%} applies {\small\verb%c%} to the both the operator
+{\small\verb%t1%} and the operand {\small\verb%t2%} of the application {\small\verb%"t1 t2"%}. Finally, for any
+conversion {\small\verb%c%}, the function returned by {\small\verb%SUB_CONV c%} acts as the identity
+conversion on variables and constants. That is, if {\small\verb%"t"%} is a variable or
+constant, then {\small\verb%SUB_CONV c "t"%} returns {\small\verb%|- t = t%}.
+
+\FAILURE
+{\small\verb%SUB_CONV c tm%} fails if {\small\verb%tm%} is an abstraction {\small\verb%"\x.t"%} and the conversion {\small\verb%c%}
+fails when applied to {\small\verb%t%}, or if {\small\verb%tm%} is an application {\small\verb%"t1 t2"%} and the
+conversion {\small\verb%c%} fails when applied to either {\small\verb%t1%} or {\small\verb%t2%}. The function
+returned by {\small\verb%SUB_CONV c%} may also fail if the ML function {\small\verb%c:term->thm%} is not,
+in fact, a conversion (i.e. a function that maps a term {\small\verb%t%} to a theorem
+{\small\verb%|- t = t'%}).
+
+\SEEALSO
+ABS_CONV, RAND_CONV, RATOR_CONV.
+
+\ENDDOC
\DOC{SUBGOAL\_THEN}
\TYPE {\small\verb%SUBGOAL_THEN : (term -> thm_tactic -> tactic)%}\egroup
@@ -25220,141 +25262,80 @@ Substitutions are made with the theorems
\begin{verbatim}
#let thm1 = SPECL ["m:num"; "n:num"] ADD_SYM
#and thm2 = CONJUNCT1 ADD_CLAUSES;;
- thm1 = |- m + n = n + m
- thm2 = |- 0 + m = m
-\end{verbatim}
-}
-\noindent depending on the occurrence of free subterms
-{\par\samepage\setseps\small
-\begin{verbatim}
- #SUBS [thm1; thm2] (ASSUME "(n + 0) + (0 + m) = m + n");;
- . |- (n + 0) + m = n + m
-
- #SUBS [thm1; thm2] (ASSUME "!n. (n + 0) + (0 + m) = m + n");;
- . |- !n. (n + 0) + m = m + n
-\end{verbatim}
-}
-\USES
-{\small\verb%SUBS%} can sometimes be used when rewriting (for example, with {\small\verb%REWRITE_RULE%})
-would diverge and term instantiation is not needed. Moreover, applying the
-substitution rules is often much faster than using the rewriting rules.
-
-\SEEALSO
-ONCE_REWRITE_RULE, PURE_REWRITE_RULE, REWRITE_RULE, SUBST, SUBST_MATCH,
-SUBS_OCCS.
-
-\ENDDOC
-\DOC{SUBST}
-
-\TYPE {\small\verb%SUBST : ((thm # term) list -> term -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Makes a set of parallel substitutions in a theorem.
-
-\DESCRIBE
-Implements the following rule of simultaneous substitution
-{\par\samepage\setseps\small
-\begin{verbatim}
- A1 |- t1 = u1 , ... , An |- tn = un , A |- t[t1,...,tn]
- -------------------------------------------------------------
- A u A1 u ... u An |- t[ui]
-\end{verbatim}
-}
-\noindent Evaluating
-{\par\samepage\setseps\small
-\begin{verbatim}
- SUBST [((A1 |- t1=u1), x1); ... ;((An |- tn=un), xn)]
- t[x1,...,xn]
- (A |- t[t1,...,tn])
-\end{verbatim}
-}
-\noindent returns the theorem {\small\verb%A |- t[u1,...,un]%}. The term argument
-{\small\verb%t[x1,...,xn]%} is a template which should match the conclusion of the theorem
-being substituted into, with the variables {\small\verb%x1%}, ... , {\small\verb%xn%} marking those
-places where occurrences of {\small\verb%t1%}, ... , {\small\verb%tn%} are to be replaced by the terms
-{\small\verb%u1%}, ... , {\small\verb%un%}, respectively. The occurrence of {\small\verb%ti%} at the places marked by
-{\small\verb%xi%} must be free (i.e. {\small\verb%ti%} must not contain any bound variables). {\small\verb%SUBST%}
-automatically renames bound variables to prevent free variables in {\small\verb%ui%}
-becoming bound after substitution.
-
-{\small\verb%SUBST%} is a complex primitive because it performs both parallel simultaneous
-substitution and renaming of variables. This is for efficiency reasons, but it
-would be logically cleaner if {\small\verb%SUBST%} were simpler.
-
-\FAILURE
-If the template does not match the conclusion of the hypothesis, or the terms
-in the conclusion marked by the variables {\small\verb%x1%}, ... , {\small\verb%xn%} in the template are
-not identical to the left hand sides of the supplied equations (i.e. the terms
-{\small\verb%t1%}, ... , {\small\verb%tn%}).
-
-\EXAMPLE
+ thm1 = |- m + n = n + m
+ thm2 = |- 0 + m = m
+\end{verbatim}
+}
+\noindent depending on the occurrence of free subterms
{\par\samepage\setseps\small
\begin{verbatim}
-#let th0 = SPEC "0" ADD1 and th1 = SPEC "1" ADD1;;
-th0 = |- SUC 0 = 0 + 1
-th1 = |- SUC 1 = 1 + 1
-
-#SUBST [(th0,"x:num");(th1,"y:num")]
-# "(x+y) > SUC 0"
-# (ASSUME "(SUC 0 + SUC 1) > SUC 0");;
-. |- ((0 + 1) + (1 + 1)) > (SUC 0)
-
-#SUBST [(th0,"x:num");(th1,"y:num")]
-# "(SUC 0 + y) > SUC 0"
-# (ASSUME "(SUC 0 + SUC 1) > SUC 0");;
-. |- ((SUC 0) + (1 + 1)) > (SUC 0)
+ #SUBS [thm1; thm2] (ASSUME "(n + 0) + (0 + m) = m + n");;
+ . |- (n + 0) + m = n + m
-#SUBST [(th0,"x:num");(th1,"y:num")]
-# "(x+y) > x"
-# (ASSUME "(SUC 0 + SUC 1) > SUC 0");;
-. |- ((0 + 1) + (1 + 1)) > (0 + 1)
+ #SUBS [thm1; thm2] (ASSUME "!n. (n + 0) + (0 + m) = m + n");;
+ . |- !n. (n + 0) + m = m + n
\end{verbatim}
}
\USES
-For substituting at selected occurrences. Often useful
-for writing special purpose derived inference rules.
+{\small\verb%SUBS%} can sometimes be used when rewriting (for example, with {\small\verb%REWRITE_RULE%})
+would diverge and term instantiation is not needed. Moreover, applying the
+substitution rules is often much faster than using the rewriting rules.
\SEEALSO
-SUBS.
+ONCE_REWRITE_RULE, PURE_REWRITE_RULE, REWRITE_RULE, SUBST, SUBST_MATCH,
+SUBS_OCCS.
\ENDDOC
-\DOC{subst}
+\DOC{SUBS\_OCCS}
-\TYPE {\small\verb%subst : ((term # term) list -> term -> term)%}\egroup
+\TYPE {\small\verb%SUBS_OCCS : ((int list # thm) list -> thm -> thm)%}\egroup
\SYNOPSIS
-Substitutes terms in a term.
+Makes substitutions in a theorem at specific occurrences of a term, using a
+list of equational theorems.
\DESCRIBE
-Given a list of term pairs {\small\verb%[("a_1","b_1"),...,("a_n","b_n")]%}
-and a term {\small\verb%"c"%}, {\small\verb%subst%} attempts to substitute all free occurrences of
-{\small\verb%"b_i"%} in {\small\verb%"c"%} by {\small\verb%"a_i"%} for all {\small\verb%i%} ranging between {\small\verb%1%} and {\small\verb%n%}.
-
+Given a list {\small\verb%(l1,A1|-t1=v1),...,(ln,An|-tn=vn)%} and a theorem
+{\small\verb%(A|-t)%}, {\small\verb%SUBS_OCCS%} simultaneously replaces each {\small\verb%ti%} in {\small\verb%t%} with {\small\verb%vi%},
+at the occurrences specified by the integers
+in the list {\small\verb%li = [o1;...;ok]%} for each theorem {\small\verb%Ai|-ti=vi%}.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ (l1,A1|-t1=v1) ... (ln,An|-tn=vn) A|-t
+ ------------------------------------------- SUBS_OCCS[(l1,A1|-t1=v1);...;
+ A1 u ... An u A |- t[v1,...,vn/t1,...,tn] (ln,An|-tn=vn)] (A|-t)
+\end{verbatim}
+}
\FAILURE
-Failure occurs if for some {\small\verb%i%} ranging between {\small\verb%1%} and {\small\verb%n%}, the substitution
-of {\small\verb%"b_i"%} by {\small\verb%"a_i"%} fails.
-The substitution of {\small\verb%"b_i"%} by {\small\verb%"a_i"%} fails for some {\small\verb%i%},
-if the types of {\small\verb%"a_i"%} and {\small\verb%"b_i"%} are not the same.
+{\small\verb%SUBS_OCCS [(l1,th1);...;(ln,thn)] (A|-t)%} fails if
+the conclusion of any theorem in the list is not an equation.
+No change is made to the theorem if the supplied occurrences {\small\verb%li%} of the
+left-hand side of the conclusion of {\small\verb%thi%} do not appear in {\small\verb%t%}.
\EXAMPLE
+The commutative law for addition
{\par\samepage\setseps\small
\begin{verbatim}
- #subst [("1","SUC 0")] "SUC(SUC 0)";;
- "SUC 1" : term
-
- #subst [("1","SUC 0");("2","SUC 1")] "SUC(SUC 0)";;
- "SUC 1" : term
-
- #subst [("1","SUC 0");("2","SUC 1")] "SUC(SUC 0) = SUC 1";;
- "SUC 1 = 2" : term
-
- #subst [("b:num","a:num")] "\a:num. (b:num)";;
- "\a. b" : term
-
- #subst [("foo:*","flip:*")] "waddle:*";;
- "waddle" : term
+ #let thm = SPECL ["m:num"; "n:num"] ADD_SYM;;
+ thm = |- m + n = n + m
+\end{verbatim}
+}
+\noindent can be used for substituting only the second occurrence of
+the subterm {\small\verb%m + n%}
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #SUBS_OCCS [([2],thm)] (ASSUME "(n + m) + (m + n) = (m + n) + (m + n)");;
+ . |- (n + m) + (m + n) = (n + m) + (m + n)
\end{verbatim}
}
+\USES
+{\small\verb%SUBS_OCCS%} is used when rewriting at specific occurrences of a term, and rules
+such as {\small\verb%REWRITE_RULE%}, {\small\verb%PURE_REWRITE_RULE%}, {\small\verb%ONCE_REWRITE_RULE%}, and {\small\verb%SUBS%}
+are too extensive or would diverge.
+
+\SEEALSO
+ONCE_REWRITE_RULE, PURE_REWRITE_RULE, REWRITE_RULE, SUBS, SUBST, SUBST_MATCH.
+
\ENDDOC
\DOC{SUBST1\_TAC}
@@ -25549,6 +25530,118 @@ and using rewriting rules/conversions is
REWR_CONV, SUBS, SUBST, SUBS_OCCS.
\ENDDOC
+\DOC{subst}
+
+\TYPE {\small\verb%subst : ((term # term) list -> term -> term)%}\egroup
+
+\SYNOPSIS
+Substitutes terms in a term.
+
+\DESCRIBE
+Given a list of term pairs {\small\verb%[("a_1","b_1"),...,("a_n","b_n")]%}
+and a term {\small\verb%"c"%}, {\small\verb%subst%} attempts to substitute all free occurrences of
+{\small\verb%"b_i"%} in {\small\verb%"c"%} by {\small\verb%"a_i"%} for all {\small\verb%i%} ranging between {\small\verb%1%} and {\small\verb%n%}.
+
+\FAILURE
+Failure occurs if for some {\small\verb%i%} ranging between {\small\verb%1%} and {\small\verb%n%}, the substitution
+of {\small\verb%"b_i"%} by {\small\verb%"a_i"%} fails.
+The substitution of {\small\verb%"b_i"%} by {\small\verb%"a_i"%} fails for some {\small\verb%i%},
+if the types of {\small\verb%"a_i"%} and {\small\verb%"b_i"%} are not the same.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #subst [("1","SUC 0")] "SUC(SUC 0)";;
+ "SUC 1" : term
+
+ #subst [("1","SUC 0");("2","SUC 1")] "SUC(SUC 0)";;
+ "SUC 1" : term
+
+ #subst [("1","SUC 0");("2","SUC 1")] "SUC(SUC 0) = SUC 1";;
+ "SUC 1 = 2" : term
+
+ #subst [("b:num","a:num")] "\a:num. (b:num)";;
+ "\a. b" : term
+
+ #subst [("foo:*","flip:*")] "waddle:*";;
+ "waddle" : term
+\end{verbatim}
+}
+\ENDDOC
+\DOC{SUBST}
+
+\TYPE {\small\verb%SUBST : ((thm # term) list -> term -> thm -> thm)%}\egroup
+
+\SYNOPSIS
+Makes a set of parallel substitutions in a theorem.
+
+\DESCRIBE
+Implements the following rule of simultaneous substitution
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A1 |- t1 = u1 , ... , An |- tn = un , A |- t[t1,...,tn]
+ -------------------------------------------------------------
+ A u A1 u ... u An |- t[ui]
+\end{verbatim}
+}
+\noindent Evaluating
+{\par\samepage\setseps\small
+\begin{verbatim}
+ SUBST [((A1 |- t1=u1), x1); ... ;((An |- tn=un), xn)]
+ t[x1,...,xn]
+ (A |- t[t1,...,tn])
+\end{verbatim}
+}
+\noindent returns the theorem {\small\verb%A |- t[u1,...,un]%}. The term argument
+{\small\verb%t[x1,...,xn]%} is a template which should match the conclusion of the theorem
+being substituted into, with the variables {\small\verb%x1%}, ... , {\small\verb%xn%} marking those
+places where occurrences of {\small\verb%t1%}, ... , {\small\verb%tn%} are to be replaced by the terms
+{\small\verb%u1%}, ... , {\small\verb%un%}, respectively. The occurrence of {\small\verb%ti%} at the places marked by
+{\small\verb%xi%} must be free (i.e. {\small\verb%ti%} must not contain any bound variables). {\small\verb%SUBST%}
+automatically renames bound variables to prevent free variables in {\small\verb%ui%}
+becoming bound after substitution.
+
+{\small\verb%SUBST%} is a complex primitive because it performs both parallel simultaneous
+substitution and renaming of variables. This is for efficiency reasons, but it
+would be logically cleaner if {\small\verb%SUBST%} were simpler.
+
+\FAILURE
+If the template does not match the conclusion of the hypothesis, or the terms
+in the conclusion marked by the variables {\small\verb%x1%}, ... , {\small\verb%xn%} in the template are
+not identical to the left hand sides of the supplied equations (i.e. the terms
+{\small\verb%t1%}, ... , {\small\verb%tn%}).
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#let th0 = SPEC "0" ADD1 and th1 = SPEC "1" ADD1;;
+th0 = |- SUC 0 = 0 + 1
+th1 = |- SUC 1 = 1 + 1
+
+#SUBST [(th0,"x:num");(th1,"y:num")]
+# "(x+y) > SUC 0"
+# (ASSUME "(SUC 0 + SUC 1) > SUC 0");;
+. |- ((0 + 1) + (1 + 1)) > (SUC 0)
+
+#SUBST [(th0,"x:num");(th1,"y:num")]
+# "(SUC 0 + y) > SUC 0"
+# (ASSUME "(SUC 0 + SUC 1) > SUC 0");;
+. |- ((SUC 0) + (1 + 1)) > (SUC 0)
+
+#SUBST [(th0,"x:num");(th1,"y:num")]
+# "(x+y) > x"
+# (ASSUME "(SUC 0 + SUC 1) > SUC 0");;
+. |- ((0 + 1) + (1 + 1)) > (0 + 1)
+\end{verbatim}
+}
+\USES
+For substituting at selected occurrences. Often useful
+for writing special purpose derived inference rules.
+
+\SEEALSO
+SUBS.
+
+\ENDDOC
\DOC{SUBST\_MATCH}
\TYPE {\small\verb%SUBST_MATCH : (thm -> thm -> thm)%}\egroup
@@ -25738,89 +25831,38 @@ any {\small\verb%Ai%} is not a subset of
{\small\verb%vi%} becoming bound after substitution.
\FAILURE
-{\small\verb%SUBST_TAC [th1;...;thn] (A,t)%} fails if the conclusion of any theorem in the
-list is not an equation. No change is made to the goal if no occurrence of the
-left-hand side of the conclusion of {\small\verb%thi%} appears in {\small\verb%t%}.
-
-\EXAMPLE
-When trying to solve the goal
-{\par\samepage\setseps\small
-\begin{verbatim}
- ?- (n + 0) + (0 + m) = m + n
-\end{verbatim}
-}
-\noindent by substituting with the theorems
-{\par\samepage\setseps\small
-\begin{verbatim}
- #let thm1 = SPECL ["m:num"; "n:num"] ADD_SYM
- #and thm2 = CONJUNCT1 ADD_CLAUSES;;
- thm1 = |- m + n = n + m
- thm2 = |- 0 + m = m
-\end{verbatim}
-}
-\noindent applying {\small\verb%SUBST_TAC [thm1; thm2]%} results in the goal
-{\par\samepage\setseps\small
-\begin{verbatim}
- ?- (n + 0) + m = n + m
-\end{verbatim}
-}
-\USES
-{\small\verb%SUBST_TAC%} is used when rewriting (for example, with {\small\verb%REWRITE_TAC%}) is
-extensive or would diverge. Substituting is also much faster than rewriting.
-
-\SEEALSO
-ONCE_REWRITE_TAC, PURE_REWRITE_TAC, REWRITE_TAC, SUBST1_TAC, SUBST_ALL_TAC.
-
-\ENDDOC
-\DOC{SUBS\_OCCS}
-
-\TYPE {\small\verb%SUBS_OCCS : ((int list # thm) list -> thm -> thm)%}\egroup
-
-\SYNOPSIS
-Makes substitutions in a theorem at specific occurrences of a term, using a
-list of equational theorems.
-
-\DESCRIBE
-Given a list {\small\verb%(l1,A1|-t1=v1),...,(ln,An|-tn=vn)%} and a theorem
-{\small\verb%(A|-t)%}, {\small\verb%SUBS_OCCS%} simultaneously replaces each {\small\verb%ti%} in {\small\verb%t%} with {\small\verb%vi%},
-at the occurrences specified by the integers
-in the list {\small\verb%li = [o1;...;ok]%} for each theorem {\small\verb%Ai|-ti=vi%}.
+{\small\verb%SUBST_TAC [th1;...;thn] (A,t)%} fails if the conclusion of any theorem in the
+list is not an equation. No change is made to the goal if no occurrence of the
+left-hand side of the conclusion of {\small\verb%thi%} appears in {\small\verb%t%}.
+
+\EXAMPLE
+When trying to solve the goal
{\par\samepage\setseps\small
\begin{verbatim}
- (l1,A1|-t1=v1) ... (ln,An|-tn=vn) A|-t
- ------------------------------------------- SUBS_OCCS[(l1,A1|-t1=v1);...;
- A1 u ... An u A |- t[v1,...,vn/t1,...,tn] (ln,An|-tn=vn)] (A|-t)
+ ?- (n + 0) + (0 + m) = m + n
\end{verbatim}
}
-\FAILURE
-{\small\verb%SUBS_OCCS [(l1,th1);...;(ln,thn)] (A|-t)%} fails if
-the conclusion of any theorem in the list is not an equation.
-No change is made to the theorem if the supplied occurrences {\small\verb%li%} of the
-left-hand side of the conclusion of {\small\verb%thi%} do not appear in {\small\verb%t%}.
-
-\EXAMPLE
-The commutative law for addition
+\noindent by substituting with the theorems
{\par\samepage\setseps\small
\begin{verbatim}
- #let thm = SPECL ["m:num"; "n:num"] ADD_SYM;;
- thm = |- m + n = n + m
+ #let thm1 = SPECL ["m:num"; "n:num"] ADD_SYM
+ #and thm2 = CONJUNCT1 ADD_CLAUSES;;
+ thm1 = |- m + n = n + m
+ thm2 = |- 0 + m = m
\end{verbatim}
}
-\noindent can be used for substituting only the second occurrence of
-the subterm {\small\verb%m + n%}
+\noindent applying {\small\verb%SUBST_TAC [thm1; thm2]%} results in the goal
{\par\samepage\setseps\small
\begin{verbatim}
- #SUBS_OCCS [([2],thm)] (ASSUME "(n + m) + (m + n) = (m + n) + (m + n)");;
- . |- (n + m) + (m + n) = (n + m) + (m + n)
+ ?- (n + 0) + m = n + m
\end{verbatim}
}
\USES
-{\small\verb%SUBS_OCCS%} is used when rewriting at specific occurrences of a term, and rules
-such as {\small\verb%REWRITE_RULE%}, {\small\verb%PURE_REWRITE_RULE%}, {\small\verb%ONCE_REWRITE_RULE%}, and {\small\verb%SUBS%}
-are too extensive or would diverge.
+{\small\verb%SUBST_TAC%} is used when rewriting (for example, with {\small\verb%REWRITE_TAC%}) is
+extensive or would diverge. Substituting is also much faster than rewriting.
\SEEALSO
-ONCE_REWRITE_RULE, PURE_REWRITE_RULE, REWRITE_RULE, SUBS, SUBST, SUBST_MATCH.
+ONCE_REWRITE_TAC, PURE_REWRITE_TAC, REWRITE_TAC, SUBST1_TAC, SUBST_ALL_TAC.
\ENDDOC
\DOC{subtract}
@@ -25851,50 +25893,6 @@ Never fails.
setify, set_equal, union, intersect.
\ENDDOC
-\DOC{SUB\_CONV}
-
-\TYPE {\small\verb%SUB_CONV : (conv -> conv)%}\egroup
-
-\SYNOPSIS
-Applies a conversion to the top-level subterms of a term.
-
-\DESCRIBE
-For any conversion {\small\verb%c%}, the function returned by {\small\verb%SUB_CONV c%} is a conversion
-that applies {\small\verb%c%} to all the top-level subterms of a term. If the conversion
-{\small\verb%c%} maps {\small\verb%t%} to {\small\verb%|- t = t'%}, then {\small\verb%SUB_CONV c%} maps an abstraction {\small\verb%"\x.t"%} to
-the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- (\x.t) = (\x.t')
-\end{verbatim}
-}
-\noindent That is, {\small\verb%SUB_CONV c "\x.t"%} applies {\small\verb%c%} to the body of the
-abstraction {\small\verb%"\x.t"%}. If {\small\verb%c%} is a conversion that maps {\small\verb%"t1"%} to the theorem
-{\small\verb%|- t1 = t1'%} and {\small\verb%"t2"%} to the theorem {\small\verb%|- t2 = t2'%}, then the conversion
-{\small\verb%SUB_CONV c%} maps an application {\small\verb%"t1 t2"%} to the theorem:
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- (t1 t2) = (t1' t2')
-\end{verbatim}
-}
-\noindent That is, {\small\verb%SUB_CONV c "t1 t2"%} applies {\small\verb%c%} to the both the operator
-{\small\verb%t1%} and the operand {\small\verb%t2%} of the application {\small\verb%"t1 t2"%}. Finally, for any
-conversion {\small\verb%c%}, the function returned by {\small\verb%SUB_CONV c%} acts as the identity
-conversion on variables and constants. That is, if {\small\verb%"t"%} is a variable or
-constant, then {\small\verb%SUB_CONV c "t"%} returns {\small\verb%|- t = t%}.
-
-\FAILURE
-{\small\verb%SUB_CONV c tm%} fails if {\small\verb%tm%} is an abstraction {\small\verb%"\x.t"%} and the conversion {\small\verb%c%}
-fails when applied to {\small\verb%t%}, or if {\small\verb%tm%} is an application {\small\verb%"t1 t2"%} and the
-conversion {\small\verb%c%} fails when applied to either {\small\verb%t1%} or {\small\verb%t2%}. The function
-returned by {\small\verb%SUB_CONV c%} may also fail if the ML function {\small\verb%c:term->thm%} is not,
-in fact, a conversion (i.e. a function that maps a term {\small\verb%t%} to a theorem
-{\small\verb%|- t = t'%}).
-
-\SEEALSO
-ABS_CONV, RAND_CONV, RATOR_CONV.
-
-\ENDDOC
\DOC{suspend\_recording}
\TYPE {\small\verb%suspend_recording : void -> void%}\egroup
@@ -25958,50 +25956,50 @@ When applied to a term argument of the f
{\small\verb%?x y. P%}.
\ENDDOC
-\DOC{SYM}
+\DOC{SYM\_CONV}
-\TYPE {\small\verb%SYM : (thm -> thm)%}\egroup
+\TYPE {\small\verb%SYM_CONV : conv%}\egroup
\SYNOPSIS
-Swaps left-hand and right-hand sides of an equation.
+Interchanges the left and right-hand sides of an equation.
\DESCRIBE
-When applied to a theorem {\small\verb%A |- t1 = t2%}, the inference rule {\small\verb%SYM%} returns
-{\small\verb%A |- t2 = t1%}.
+When applied to an equational term {\small\verb%t1 = t2%}, the conversion
+{\small\verb%SYM_CONV%} returns the theorem:
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t1 = t2
- -------------- SYM
- A |- t2 = t1
+ |- (t1 = t2) = (t2 = t1)
\end{verbatim}
}
\FAILURE
-Fails unless the theorem is equational.
+Fails if applied to a term that is not an equation.
\SEEALSO
-GSYM, NOT_EQ_SYM, REFL.
+SYM.
\ENDDOC
-\DOC{SYM\_CONV}
+\DOC{SYM}
-\TYPE {\small\verb%SYM_CONV : conv%}\egroup
+\TYPE {\small\verb%SYM : (thm -> thm)%}\egroup
\SYNOPSIS
-Interchanges the left and right-hand sides of an equation.
+Swaps left-hand and right-hand sides of an equation.
\DESCRIBE
-When applied to an equational term {\small\verb%t1 = t2%}, the conversion
-{\small\verb%SYM_CONV%} returns the theorem:
+When applied to a theorem {\small\verb%A |- t1 = t2%}, the inference rule {\small\verb%SYM%} returns
+{\small\verb%A |- t2 = t1%}.
{\par\samepage\setseps\small
\begin{verbatim}
- |- (t1 = t2) = (t2 = t1)
+ A |- t1 = t2
+ -------------- SYM
+ A |- t2 = t1
\end{verbatim}
}
\FAILURE
-Fails if applied to a term that is not an equation.
+Fails unless the theorem is equational.
\SEEALSO
-SYM.
+GSYM, NOT_EQ_SYM, REFL.
\ENDDOC
\DOC{syserror}
@@ -26100,6 +26098,31 @@ Fails if the argument is less than 0.
int_of_term, int_of_string, string_of_int.
\ENDDOC
+\DOC{THENC}
+
+\TYPE {\small\verb%$THENC : (conv -> conv -> conv)%}\egroup
+
+\SYNOPSIS
+Applies two conversions in sequence.
+
+\DESCRIBE
+If the conversion {\small\verb%c1%} returns {\small\verb%|- t = t'%} when applied to a term {\small\verb%"t"%}, and
+{\small\verb%c2%} returns {\small\verb%|- t' = t''%} when applied to {\small\verb%"t'"%}, then the composite
+conversion {\small\verb%(c1 THENC c2) "t"%} returns {\small\verb%|- t = t''%}. That is, {\small\verb%(c1 THENC c2)
+"t"%} has the effect of transforming the term {\small\verb%"t"%} first with the conversion
+{\small\verb%c1%} and then with the conversion {\small\verb%c2%}.
+
+\FAILURE
+{\small\verb%(c1 THENC c2) "t"%} fails if either the conversion {\small\verb%c1%} fails when applied to
+{\small\verb%"t"%}, or if {\small\verb%c1 "t"%} succeeds and returns {\small\verb%|- t = t'%} but {\small\verb%c2%} fails when
+applied to {\small\verb%"t'"%}. {\small\verb%(c1 THENC c2) "t"%} may also fail if either of {\small\verb%c1%} or {\small\verb%c2%}
+is not, in fact, a conversion (i.e. a function that maps a term {\small\verb%t%} to a
+theorem {\small\verb%|- t = t'%}).
+
+\SEEALSO
+EVERY_CONV.
+
+\ENDDOC
\DOC{THEN}
\TYPE {\small\verb%$THEN : (tactic -> tactic -> tactic)%}\egroup
@@ -26136,31 +26159,6 @@ to multiple subgoals; sequences like the
EVERY, ORELSE, THENL.
\ENDDOC
-\DOC{THENC}
-
-\TYPE {\small\verb%$THENC : (conv -> conv -> conv)%}\egroup
-
-\SYNOPSIS
-Applies two conversions in sequence.
-
-\DESCRIBE
-If the conversion {\small\verb%c1%} returns {\small\verb%|- t = t'%} when applied to a term {\small\verb%"t"%}, and
-{\small\verb%c2%} returns {\small\verb%|- t' = t''%} when applied to {\small\verb%"t'"%}, then the composite
-conversion {\small\verb%(c1 THENC c2) "t"%} returns {\small\verb%|- t = t''%}. That is, {\small\verb%(c1 THENC c2)
-"t"%} has the effect of transforming the term {\small\verb%"t"%} first with the conversion
-{\small\verb%c1%} and then with the conversion {\small\verb%c2%}.
-
-\FAILURE
-{\small\verb%(c1 THENC c2) "t"%} fails if either the conversion {\small\verb%c1%} fails when applied to
-{\small\verb%"t"%}, or if {\small\verb%c1 "t"%} succeeds and returns {\small\verb%|- t = t'%} but {\small\verb%c2%} fails when
-applied to {\small\verb%"t'"%}. {\small\verb%(c1 THENC c2) "t"%} may also fail if either of {\small\verb%c1%} or {\small\verb%c2%}
-is not, in fact, a conversion (i.e. a function that maps a term {\small\verb%t%} to a
-theorem {\small\verb%|- t = t'%}).
-
-\SEEALSO
-EVERY_CONV.
-
-\ENDDOC
\DOC{THENL}
\TYPE {\small\verb%$THENL : (tactic -> tactic list -> tactic)%}\egroup
@@ -26253,41 +26251,6 @@ axiom, definition, load_theorem, load_th
theorems.
\ENDDOC
-\DOC{theorems}
-
-\TYPE {\small\verb%theorems : (string -> (string # thm) list)%}\egroup
-
-\SYNOPSIS
-Returns the derived theorems of a given theory segment of the current theory.
-
-\DESCRIBE
-A call of {\small\verb%theorems `thy`%} returns the derived theorems of the theory segment
-{\small\verb%thy%} together with their names. The theory segment {\small\verb%thy%} must be part of
-the current theory. The names are those given to the theorems by the user when
-they were originally added to the theory segment (by, for example, a call to
-{\small\verb%save_thm%}). The name of the current theory segment can be abbreviated by {\small\verb%`-`%}.
-
-\FAILURE
-The call {\small\verb%theorems `thy`%} will fail if the theory segment {\small\verb%thy%} is not part
-of the current theory.
-
-\EXAMPLE
-{\par\samepage\setseps\small
-\begin{verbatim}
-#theorems `bool`;;
-[(`PAIR_EQ`, |- !x y a b. (x,y = a,b) = (x = a) /\ (y = b));
- (`SND`, |- !x y. SND(x,y) = y);
- (`FST`, |- !x y. FST(x,y) = x);
- (`PAIR`, |- !x. FST x,SND x = x);
- (`PAIR_EXISTS`, |- ?p. IS_PAIR p)]
-: (string # thm) list
-\end{verbatim}
-}
-\SEEALSO
-axioms, definitions, load_theorem, load_theorems, print_theory, save_thm,
-theorem.
-
-\ENDDOC
\DOC{theorem\_lfn}
\TYPE {\small\verb%theorem_lfn : (string list -> thm)%}\egroup
@@ -26362,6 +26325,41 @@ autoload, autoload_theory, theorem, theo
load_theorems, undo_autoload.
\ENDDOC
+\DOC{theorems}
+
+\TYPE {\small\verb%theorems : (string -> (string # thm) list)%}\egroup
+
+\SYNOPSIS
+Returns the derived theorems of a given theory segment of the current theory.
+
+\DESCRIBE
+A call of {\small\verb%theorems `thy`%} returns the derived theorems of the theory segment
+{\small\verb%thy%} together with their names. The theory segment {\small\verb%thy%} must be part of
+the current theory. The names are those given to the theorems by the user when
+they were originally added to the theory segment (by, for example, a call to
+{\small\verb%save_thm%}). The name of the current theory segment can be abbreviated by {\small\verb%`-`%}.
+
+\FAILURE
+The call {\small\verb%theorems `thy`%} will fail if the theory segment {\small\verb%thy%} is not part
+of the current theory.
+
+\EXAMPLE
+{\par\samepage\setseps\small
+\begin{verbatim}
+#theorems `bool`;;
+[(`PAIR_EQ`, |- !x y a b. (x,y = a,b) = (x = a) /\ (y = b));
+ (`SND`, |- !x y. SND(x,y) = y);
+ (`FST`, |- !x y. FST(x,y) = x);
+ (`PAIR`, |- !x. FST x,SND x = x);
+ (`PAIR_EXISTS`, |- ?p. IS_PAIR p)]
+: (string # thm) list
+\end{verbatim}
+}
+\SEEALSO
+axioms, definitions, load_theorem, load_theorems, print_theory, save_thm,
+theorem.
+
+\ENDDOC
\DOC{thm\_count}
\TYPE {\small\verb%thm_count : (void -> int)%}\egroup
@@ -26653,15 +26651,36 @@ The following shows identical uses of {\
t1 = . |- a = b
t2 = . |- b = c
- #TRANS t1 t2;;
- .. |- a = c
+ #TRANS t1 t2;;
+ .. |- a = c
+
+ #t1 TRANS t2;;
+ .. |- a = c
+\end{verbatim}
+}
+\SEEALSO
+EQ_MP, IMP_TRANS, REFL, SYM.
+
+\ENDDOC
+\DOC{TRY\_CONV}
+
+\TYPE {\small\verb%TRY_CONV : (conv -> conv)%}\egroup
+
+\SYNOPSIS
+Attempts to apply a conversion; applies identity conversion in case of failure.
+
+\DESCRIBE
+{\small\verb%TRY_CONV c "t"%} attempts to apply the conversion {\small\verb%c%} to the term {\small\verb%"t"%}; if
+this fails, then the identity conversion applied instead. That is, if {\small\verb%c%} is a
+conversion that maps a term {\small\verb%"t"%} to the theorem {\small\verb%|- t = t'%}, then the
+conversion {\small\verb%TRY_CONV c%} also maps {\small\verb%"t"%} to {\small\verb%|- t = t'%}. But if {\small\verb%c%} fails when
+applied to {\small\verb%"t"%}, then {\small\verb%TRY_CONV c "t"%} returns {\small\verb%|- t = t%}.
+
+\FAILURE
+Never fails.
- #t1 TRANS t2;;
- .. |- a = c
-\end{verbatim}
-}
\SEEALSO
-EQ_MP, IMP_TRANS, REFL, SYM.
+ALL_CONV.
\ENDDOC
\DOC{TRY}
@@ -26704,27 +26723,6 @@ in the list. This will always be the cas
find, mem, exists, forall, assoc, rev_assoc.
\ENDDOC
-\DOC{TRY\_CONV}
-
-\TYPE {\small\verb%TRY_CONV : (conv -> conv)%}\egroup
-
-\SYNOPSIS
-Attempts to apply a conversion; applies identity conversion in case of failure.
-
-\DESCRIBE
-{\small\verb%TRY_CONV c "t"%} attempts to apply the conversion {\small\verb%c%} to the term {\small\verb%"t"%}; if
-this fails, then the identity conversion applied instead. That is, if {\small\verb%c%} is a
-conversion that maps a term {\small\verb%"t"%} to the theorem {\small\verb%|- t = t'%}, then the
-conversion {\small\verb%TRY_CONV c%} also maps {\small\verb%"t"%} to {\small\verb%|- t = t'%}. But if {\small\verb%c%} fails when
-applied to {\small\verb%"t"%}, then {\small\verb%TRY_CONV c "t"%} returns {\small\verb%|- t = t%}.
-
-\FAILURE
-Never fails.
-
-\SEEALSO
-ALL_CONV.
-
-\ENDDOC
\DOC{tty\_read}
\TYPE {\small\verb%tty_read : (void -> string)%}\egroup
@@ -26780,53 +26778,6 @@ standard output cannot be written.
append_openw, close, openi, openw, read, tty_read, write.
\ENDDOC
-\DOC{types}
-
-\TYPE {\small\verb%types : (string -> (int # string) list)%}\egroup
-
-\SYNOPSIS
-Lists the types in the named theory.
-
-\DESCRIBE
-The function {\small\verb%types%} should be applied to a string which is the name of an
-ancestor theory (including the current theory; the special string {\small\verb%`-`%} is
-always interpreted as the current theory). It returns a list of all the
-type constructors declared in the named theory, in the form of arity-name
-pairs.
-
-\FAILURE
-Fails unless the named theory is an ancestor.
-
-\EXAMPLE
-The theory {\small\verb%HOL%} has no types declared:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #types `HOL`;;
- [] : (int # string) list
-\end{verbatim}
-}
-\noindent but its ancestors have the following types declared:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #itlist union (map types (ancestors `HOL`)) [];;
- [(2, `fun`);
- (2, `prod`);
- (0, `bool`);
- (0, `ind`);
- (0, `num`);
- (1, `list`);
- (0, `tree`);
- (1, `ltree`);
- (2, `sum`);
- (0, `one`)]
- : (int # string) list
-\end{verbatim}
-}
-\SEEALSO
-ancestors, axioms, constants, definitions, infixes, new_type, new_type_abbrev,
-new_type_definition, parents.
-
-\ENDDOC
\DOC{type\_abbrevs}
\TYPE {\small\verb%type_abbrevs : (string -> (string # type) list)%}\egroup
@@ -26936,6 +26887,53 @@ Never fails.
\end{verbatim}
}
\ENDDOC
+\DOC{types}
+
+\TYPE {\small\verb%types : (string -> (int # string) list)%}\egroup
+
+\SYNOPSIS
+Lists the types in the named theory.
+
+\DESCRIBE
+The function {\small\verb%types%} should be applied to a string which is the name of an
+ancestor theory (including the current theory; the special string {\small\verb%`-`%} is
+always interpreted as the current theory). It returns a list of all the
+type constructors declared in the named theory, in the form of arity-name
+pairs.
+
+\FAILURE
+Fails unless the named theory is an ancestor.
+
+\EXAMPLE
+The theory {\small\verb%HOL%} has no types declared:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #types `HOL`;;
+ [] : (int # string) list
+\end{verbatim}
+}
+\noindent but its ancestors have the following types declared:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #itlist union (map types (ancestors `HOL`)) [];;
+ [(2, `fun`);
+ (2, `prod`);
+ (0, `bool`);
+ (0, `ind`);
+ (0, `num`);
+ (1, `list`);
+ (0, `tree`);
+ (1, `ltree`);
+ (2, `sum`);
+ (0, `one`)]
+ : (int # string) list
+\end{verbatim}
+}
+\SEEALSO
+ancestors, axioms, constants, definitions, infixes, new_type, new_type_abbrev,
+new_type_definition, parents.
+
+\ENDDOC
\DOC{type\_tyvars}
\TYPE {\small\verb%type_tyvars : (type -> type list)%}\egroup
@@ -27051,68 +27049,68 @@ Never fails.
curry.
\ENDDOC
-\DOC{UNDISCH}
+\DOC{UNDISCH\_ALL}
-\TYPE {\small\verb%UNDISCH : (thm -> thm)%}\egroup
+\TYPE {\small\verb%UNDISCH_ALL : (thm -> thm)%}\egroup
\SYNOPSIS
-Undischarges the antecedent of an implicative theorem.
+Iteratively undischarges antecedents in a chain of implications.
\DESCRIBE
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t1 ==> t2
- ---------------- UNDISCH
- A, t1 |- t2
+ A |- t1 ==> ... ==> tn ==> t
+ ------------------------------ UNDISCH_ALL
+ A, t1, ..., tn |- t
\end{verbatim}
}
-\noindent Note that {\small\verb%UNDISCH%} treats {\small\verb%"~u"%} as {\small\verb%"u ==> F"%}.
+\noindent Note that {\small\verb%UNDISCH_ALL%} treats {\small\verb%"~u"%} as {\small\verb%"u ==> F"%}.
\FAILURE
-{\small\verb%UNDISCH%} will fail on theorems which are not implications or negations.
+Unlike {\small\verb%UNDISCH%}, {\small\verb%UNDISCH_ALL%} will,
+when called on something other than an implication or negation,
+return its argument unchanged rather than failing.
\COMMENTS
-If the antecedent already appears in the hypotheses, it will not be duplicated.
-However, unlike {\small\verb%DISCH%},
-if the antecedent is alpha-equivalent to one of the hypotheses,
-it will still be added to the hypotheses.
+Identical terms which are repeated in {\small\verb%A, "t1", ..., "tn"%} will
+not be duplicated in the hypotheses of the resulting theorem.
+However, if two or more alpha-equivalent terms appear in {\small\verb%A, "t1", ..., "tn"%},
+then each distinct term will appear in the result.
\SEEALSO
-DISCH, DISCH_ALL, DISCH_TAC, DISCH_THEN, FILTER_DISCH_TAC, FILTER_DISCH_THEN,
-NEG_DISCH, STRIP_TAC, UNDISCH_ALL, UNDISCH_TAC.
+DISCH, DISCH_ALL, DISCH_TAC, DISCH_THEN, NEG_DISCH, FILTER_DISCH_TAC,
+FILTER_DISCH_THEN, STRIP_TAC, UNDISCH, UNDISCH_TAC.
\ENDDOC
-\DOC{UNDISCH\_ALL}
+\DOC{UNDISCH}
-\TYPE {\small\verb%UNDISCH_ALL : (thm -> thm)%}\egroup
+\TYPE {\small\verb%UNDISCH : (thm -> thm)%}\egroup
\SYNOPSIS
-Iteratively undischarges antecedents in a chain of implications.
+Undischarges the antecedent of an implicative theorem.
\DESCRIBE
{\par\samepage\setseps\small
\begin{verbatim}
- A |- t1 ==> ... ==> tn ==> t
- ------------------------------ UNDISCH_ALL
- A, t1, ..., tn |- t
+ A |- t1 ==> t2
+ ---------------- UNDISCH
+ A, t1 |- t2
\end{verbatim}
}
-\noindent Note that {\small\verb%UNDISCH_ALL%} treats {\small\verb%"~u"%} as {\small\verb%"u ==> F"%}.
+\noindent Note that {\small\verb%UNDISCH%} treats {\small\verb%"~u"%} as {\small\verb%"u ==> F"%}.
\FAILURE
-Unlike {\small\verb%UNDISCH%}, {\small\verb%UNDISCH_ALL%} will,
-when called on something other than an implication or negation,
-return its argument unchanged rather than failing.
+{\small\verb%UNDISCH%} will fail on theorems which are not implications or negations.
\COMMENTS
-Identical terms which are repeated in {\small\verb%A, "t1", ..., "tn"%} will
-not be duplicated in the hypotheses of the resulting theorem.
-However, if two or more alpha-equivalent terms appear in {\small\verb%A, "t1", ..., "tn"%},
-then each distinct term will appear in the result.
+If the antecedent already appears in the hypotheses, it will not be duplicated.
+However, unlike {\small\verb%DISCH%},
+if the antecedent is alpha-equivalent to one of the hypotheses,
+it will still be added to the hypotheses.
\SEEALSO
-DISCH, DISCH_ALL, DISCH_TAC, DISCH_THEN, NEG_DISCH, FILTER_DISCH_TAC,
-FILTER_DISCH_THEN, STRIP_TAC, UNDISCH, UNDISCH_TAC.
+DISCH, DISCH_ALL, DISCH_TAC, DISCH_THEN, FILTER_DISCH_TAC, FILTER_DISCH_THEN,
+NEG_DISCH, STRIP_TAC, UNDISCH_ALL, UNDISCH_TAC.
\ENDDOC
\DOC{UNDISCH\_TAC}
@@ -27424,18 +27422,21 @@ Never fails.
\#, B, C, CB, Co, I, K, KI, o, oo, S.
\ENDDOC
-\DOC{words}
+\DOC{words2}
-\TYPE {\small\verb%words : (string -> string list)%}\egroup
+\TYPE {\small\verb%words2 : (string -> string -> string list)%}\egroup
\SYNOPSIS
-Splits a string into a list of words.
+Splits a string into a list of substrings, breaking at occurrences of a
+specified character.
\DESCRIBE
-{\small\verb%words s%} splits the string {\small\verb%s%} into a list of substrings. Splitting occurs
-at each sequence of blanks and carriage returns (white space). This white
-space does not appear in the list of substrings. Leading and trailing white
-space in the input string is also thrown away.
+{\small\verb%words2 char s%} splits the string {\small\verb%s%} into a list of substrings. Splitting
+occurs at each occurrence of a sequence of the character {\small\verb%char%}. The {\small\verb%char%}
+characters do not appear in the list of substrings. Leading and trailing
+occurrences of {\small\verb%char%} are also thrown away. If {\small\verb%char%} is not a
+single-character string (its length is not 1), then {\small\verb%s%} will not be split and
+so the result will be the list {\small\verb%[s]%}.
\FAILURE
Never fails.
@@ -27443,37 +27444,29 @@ Never fails.
\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
-#words ` the cat sat on the mat `;;
+#words2 `/` `/the/cat//sat/on//the/mat/`;;
[`the`; `cat`; `sat`; `on`; `the`; `mat`] : string list
-\end{verbatim}
-}
-\USES
-Useful when wanting to map a function over a list of constant strings.
-Instead of using {\small\verb%[`string1`;...;`stringn`]%} one can use:
-{\par\samepage\setseps\small
-\begin{verbatim}
- (words `string1 ... stringn`)
+
+#words2 `//` `/the/cat//sat/on//the/mat/`;;
+[`/the/cat//sat/on//the/mat/`] : string list
\end{verbatim}
}
\SEEALSO
-words2, word_separators, maptok, explode.
+words, word_separators, explode.
\ENDDOC
-\DOC{words2}
+\DOC{words}
-\TYPE {\small\verb%words2 : (string -> string -> string list)%}\egroup
+\TYPE {\small\verb%words : (string -> string list)%}\egroup
\SYNOPSIS
-Splits a string into a list of substrings, breaking at occurrences of a
-specified character.
+Splits a string into a list of words.
\DESCRIBE
-{\small\verb%words2 char s%} splits the string {\small\verb%s%} into a list of substrings. Splitting
-occurs at each occurrence of a sequence of the character {\small\verb%char%}. The {\small\verb%char%}
-characters do not appear in the list of substrings. Leading and trailing
-occurrences of {\small\verb%char%} are also thrown away. If {\small\verb%char%} is not a
-single-character string (its length is not 1), then {\small\verb%s%} will not be split and
-so the result will be the list {\small\verb%[s]%}.
+{\small\verb%words s%} splits the string {\small\verb%s%} into a list of substrings. Splitting occurs
+at each sequence of blanks and carriage returns (white space). This white
+space does not appear in the list of substrings. Leading and trailing white
+space in the input string is also thrown away.
\FAILURE
Never fails.
@@ -27481,15 +27474,20 @@ Never fails.
\EXAMPLE
{\par\samepage\setseps\small
\begin{verbatim}
-#words2 `/` `/the/cat//sat/on//the/mat/`;;
+#words ` the cat sat on the mat `;;
[`the`; `cat`; `sat`; `on`; `the`; `mat`] : string list
-
-#words2 `//` `/the/cat//sat/on//the/mat/`;;
-[`/the/cat//sat/on//the/mat/`] : string list
+\end{verbatim}
+}
+\USES
+Useful when wanting to map a function over a list of constant strings.
+Instead of using {\small\verb%[`string1`;...;`stringn`]%} one can use:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ (words `string1 ... stringn`)
\end{verbatim}
}
\SEEALSO
-words, word_separators, explode.
+words2, word_separators, maptok, explode.
\ENDDOC
\DOC{word\_separators}
--- hol88-2.02.19940316.orig/lisp/f-format.l
+++ hol88-2.02.19940316/lisp/f-format.l
@@ -131,8 +131,8 @@
(defun flush-output-buffer nil
;; Some data types (e.g. streams) cannot be catenated in franz, so
;; print out items in buffer separately.
- #+franz (mapc #'llprinc (nreverse %output-buffer))
- #-franz (llprinc (apply #'catenate (nreverse %output-buffer)))
+ #+(or franz gcl) (mapc #'llprinc (nreverse %output-buffer))
+ #-(or franz gcl) (llprinc (apply #'catenate (nreverse %output-buffer)))
(setq %output-buffer nil))
--- hol88-2.02.19940316.orig/lisp/f-cl.l
+++ hol88-2.02.19940316/lisp/f-cl.l
@@ -164,10 +164,11 @@
:gc t)
#+kcl
(progn
- (setf (symbol-function 'si:top-level)
- `(lambda nil (tml)))
+; (setf (symbol-function 'si:top-level)
+; `(lambda nil (tml)))
+ (setq si::*top-level-hook* (lambda nil (tml)))
(gbc t)
- (save file))
+ (si::save-system file))
#+allegro
(progn
(setf (symbol-function 'excl::copyright-banner)
@@ -569,10 +570,19 @@
(setq *standard-input* (pop inputstack))
(close current-input)))
+(defconstant +fast-digits+ 4)
+(defconstant +slow-digits+ (- (truncate (log most-positive-fixnum 10) 1.0) +fast-digits+))
+(defconstant +fast-mod+ (expt 10 +fast-digits+))
+(defconstant +slow-mod+ (expt 10 +slow-digits+))
+
(defun clock ()
;; Get absolute time - just for time-stamps
- (get-universal-time))
+ (let ((s (get-universal-time))
+ (m (si::gettimeofday)))
+ (+ (* +fast-mod+ (mod s +slow-mod+))
+ (mod (truncate (* +fast-mod+ m) 1.0) +fast-mod+))))
+; (get-universal-time))
;;; Add extension .o to a file name for output name in process of
--- /dev/null
+++ hol88-2.02.19940316/lisp/f-ol-syntax.h
@@ -0,0 +1,367 @@
+
+static void L1();
+static void L2();
+static void L3();
+static void L4();
+static void L5();
+static void L6();
+static void L7();
+static void L8();
+static void L9();
+static void L10();
+static void L11();
+static void L12();
+static void L13();
+static void L14();
+static void L15();
+static void L16();
+static void L17();
+static void L18();
+static void L19();
+static void L20();
+static void L21();
+static void L22();
+static void L23();
+static void L24();
+static void L25();
+static void L26();
+static void L27();
+static void L28();
+static void L29();
+static void L30();
+static void L31();
+static void L32();
+static void L33();
+static void L34();
+static void L35();
+static void L36();
+static void L37();
+static void L38();
+static void L39();
+static void L40();
+static void L41();
+static void L42();
+static void L43();
+static void L44();
+static void L45();
+static void L46();
+static void L47();
+static void L48();
+static void L49();
+static void L50();
+static void L51();
+static void L52();
+static void L53();
+static void L54();
+static void L55();
+static void L56();
+static void L57();
+static void L58();
+static void L59();
+static void L60();
+static void L61();
+static void L62();
+static void L63();
+static void L64();
+static void L65();
+static void L66();
+static void L67();
+static void L68();
+static void L69();
+static void L70();
+#define VC1
+#define VC2
+#define VC3
+#define VC4
+#define VC5
+#define VC6
+#define VC7
+#define VC8
+#define VC9
+#define VC10
+#define VC11
+#define VC12
+#define VC13
+#define VC14
+#define VC15
+#define VC16
+#define VC17
+#define VC18
+#define VC19
+#define VC20
+#define VC21
+#define VC22
+#define VC23 object V37 ,V36;
+#define VC24 object V43 ,V42;
+#define VC25 object V46;
+#define VC26
+#define VC27
+#define VC28 object V57 ,V56;
+#define VC29
+#define VC30
+#define VC31
+#define VC32 object V62;
+#define VC33 object V68 ,V67;
+#define VC34
+#define VC35
+#define VC36
+#define VC37 object V79 ,V78 ,V77 ,V76;
+#define VC38
+#define VC39 object V82;
+#define VC40 object V96 ,V95 ,V94 ,V93 ,V92 ,V91 ,V90 ,V89 ,V88 ,V87 ,V86 ,V85;
+#define VC41
+#define VC42 object V112 ,V111 ,V110 ,V109 ,V108 ,V107 ,V106 ,V105 ,V104 ,V103 ,V102 ,V101;
+#define VC43 object V117 ,V116;
+#define VC44
+#define VC45 object V131 ,V130 ,V129 ,V128;
+#define VC46 object V141 ,V140 ,V139 ,V136;
+#define VC47 object V148 ,V147 ,V145;
+#define VC48
+#define VC49
+#define VC50
+#define VC51 object V160 ,V159;
+#define VC52 object V169 ,V168;
+#define VC53
+#define VC54 object V173;
+#define VC55
+#define VC56
+#define VC57
+#define VC58 object V185 ,V184;
+#define VC59
+#define VC60
+#define VC61 object V192 ,V190;
+#define VC62
+#define VC63
+#define VC64 object V197;
+#define VC65
+#define VC66
+#define VC67
+#define VC68
+#define VC69
+#define VC70
+#define VM70 2
+#define VM69 2
+#define VM68 2
+#define VM67 2
+#define VM66 1
+#define VM65 2
+#define VM64 2
+#define VM63 2
+#define VM62 2
+#define VM61 3
+#define VM60 2
+#define VM59 2
+#define VM58 2
+#define VM57 7
+#define VM56 5
+#define VM55 5
+#define VM54 2
+#define VM53 2
+#define VM52 6
+#define VM51 5
+#define VM50 5
+#define VM49 2
+#define VM48 4
+#define VM47 3
+#define VM46 3
+#define VM45 2
+#define VM44 3
+#define VM43 3
+#define VM42 2
+#define VM41 4
+#define VM40 2
+#define VM39 2
+#define VM38 2
+#define VM37 3
+#define VM36 4
+#define VM35 2
+#define VM34 2
+#define VM33 6
+#define VM32 3
+#define VM31 2
+#define VM30 2
+#define VM29 4
+#define VM28 5
+#define VM27 2
+#define VM26 2
+#define VM25 3
+#define VM24 6
+#define VM23 6
+#define VM22 2
+#define VM21 2
+#define VM20 3
+#define VM19 4
+#define VM18 2
+#define VM17 2
+#define VM16 3
+#define VM15 4
+#define VM14 2
+#define VM13 2
+#define VM12 2
+#define VM11 3
+#define VM10 2
+#define VM9 2
+#define VM8 3
+#define VM7 2
+#define VM6 2
+#define VM5 3
+#define VM4 2
+#define VM3 2
+#define VM2 5
+#define VM1 2
+static void * VVi[109]={
+#define Cdata VV[108]
+(void *)(L1),
+(void *)(L2),
+(void *)(L3),
+(void *)(L4),
+(void *)(L5),
+(void *)(L6),
+(void *)(L7),
+(void *)(L8),
+(void *)(L9),
+(void *)(L10),
+(void *)(L11),
+(void *)(L12),
+(void *)(L13),
+(void *)(L14),
+(void *)(L15),
+(void *)(L16),
+(void *)(L17),
+(void *)(L18),
+(void *)(L19),
+(void *)(L20),
+(void *)(L21),
+(void *)(L22),
+(void *)(L23),
+(void *)(L24),
+(void *)(L25),
+(void *)(L26),
+(void *)(L27),
+(void *)(L28),
+(void *)(L29),
+(void *)(L30),
+(void *)(L31),
+(void *)(L32),
+(void *)(L33),
+(void *)(L34),
+(void *)(L35),
+(void *)(L36),
+(void *)(L37),
+(void *)(L38),
+(void *)(L39),
+(void *)(L40),
+(void *)(L41),
+(void *)(L42),
+(void *)(L43),
+(void *)(L44),
+(void *)(L45),
+(void *)(L46),
+(void *)(L47),
+(void *)(L48),
+(void *)(L49),
+(void *)(L50),
+(void *)(L51),
+(void *)(L52),
+(void *)(L53),
+(void *)(L54),
+(void *)(L55),
+(void *)(L56),
+(void *)(L57),
+(void *)(L58),
+(void *)(L59),
+(void *)(L60),
+(void *)(L61),
+(void *)(L62),
+(void *)(L63),
+(void *)(L64),
+(void *)(L65),
+(void *)(L66),
+(void *)(L67),
+(void *)(L68),
+(void *)(L69),
+(void *)(L70)
+};
+#define VV (VVi)
+static void LnkT107();
+static void (*Lnk107)() = LnkT107;
+static void LnkT106();
+static void (*Lnk106)() = LnkT106;
+static void LnkT105();
+static void (*Lnk105)() = LnkT105;
+static void LnkT104();
+static void (*Lnk104)() = LnkT104;
+static object LnkTLI103(object,...);
+static object (*LnkLI103)() = (object (*)()) LnkTLI103;
+static object LnkTLI102(object,...);
+static object (*LnkLI102)() = (object (*)()) LnkTLI102;
+static void LnkT101();
+static void (*Lnk101)() = LnkT101;
+static void LnkT100();
+static void (*Lnk100)() = LnkT100;
+static void LnkT99();
+static void (*Lnk99)() = LnkT99;
+static void LnkT98();
+static void (*Lnk98)() = LnkT98;
+static void LnkT97();
+static void (*Lnk97)() = LnkT97;
+static void LnkT96();
+static void (*Lnk96)() = LnkT96;
+static void LnkT95();
+static void (*Lnk95)() = LnkT95;
+static void LnkT94();
+static void (*Lnk94)() = LnkT94;
+static void LnkT93();
+static void (*Lnk93)() = LnkT93;
+static void LnkT92();
+static void (*Lnk92)() = LnkT92;
+static void LnkT91();
+static void (*Lnk91)() = LnkT91;
+static void LnkT90();
+static void (*Lnk90)() = LnkT90;
+static void LnkT89();
+static void (*Lnk89)() = LnkT89;
+static void LnkT88();
+static void (*Lnk88)() = LnkT88;
+static void LnkT87();
+static void (*Lnk87)() = LnkT87;
+static void LnkT86();
+static void (*Lnk86)() = LnkT86;
+static void LnkT85();
+static void (*Lnk85)() = LnkT85;
+static void LnkT84();
+static void (*Lnk84)() = LnkT84;
+static void LnkT83();
+static void (*Lnk83)() = LnkT83;
+static void LnkT81();
+static void (*Lnk81)() = LnkT81;
+static void LnkT80();
+static void (*Lnk80)() = LnkT80;
+static void LnkT79();
+static void (*Lnk79)() = LnkT79;
+static void LnkT78();
+static void (*Lnk78)() = LnkT78;
+static void LnkT77();
+static void (*Lnk77)() = LnkT77;
+static void LnkT76();
+static void (*Lnk76)() = LnkT76;
+static void LnkT75();
+static void (*Lnk75)() = LnkT75;
+static void LnkT74();
+static void (*Lnk74)() = LnkT74;
+static void LnkT73();
+static void (*Lnk73)() = LnkT73;
+static void LnkT72();
+static void (*Lnk72)() = LnkT72;
+static void LnkT71();
+static void (*Lnk71)() = LnkT71;
+static void LnkT70();
+static void (*Lnk70)() = LnkT70;
+static void LnkT69();
+static void (*Lnk69)() = LnkT69;
+static void LnkT68();
+static void (*Lnk68)() = LnkT68;
+static void LnkT67();
+static void (*Lnk67)() = LnkT67;
+static void LnkT66();
+static void (*Lnk66)() = LnkT66;
--- /dev/null
+++ hol88-2.02.19940316/lisp/f-ol-syntax.c
@@ -0,0 +1,7805 @@
+#define SGC
+
+#define EXTER extern
+/* h/gclincl.h. Generated from gclincl.h.in by configure. */
+/* h/gclincl.h.in. Generated from configure.in by autoheader. */
+/* define where the heap could begin. Normally should
+be the smallest value returned by sbrk(). Underestimating
+by 10-20 megabytes is not a problem. */
+
+#define DBEGIN 0x8000000 /* where data begins */
+
+
+/* the size of the page tables for gcl. Each page is PAGESIZE which
+is usually 4K or 8K bytes. From 1 to 3 bytes per page are
+preallocated in a table at compile time. this must be a power of 2 if
+SGC is enabled. */
+
+#define MAXPAGE (128*1024*(SIZEOF_LONG>>2)/(1<<(PAGEWIDTH-12)))
+#define VSSIZE 128*1024
+#define BDSSIZE 2*1024
+#define IHSSIZE 4*1024
+#define FRSSIZE 4*1024
+
+#define HOLEPAGE (MAXPAGE/10)
+
+/* check to see if getcwd exists
+*/
+#define HAVE_GETCWD 1
+
+
+/* if we dont have USEGETCWD, we will use GETWD unless following defined
+*/
+#define HAVE_GETWD 1
+
+
+/* no gettimeofday function */
+
+/* #undef NO_GETTOD */
+
+/* define if have <asm/signal.h> */
+#define HAVE_ASM_SIGNAL_H 1
+
+/* define if have <asm/sigcontext.h> */
+#define HAVE_ASM_SIGCONTEXT_H 1
+
+/* define if have struct sigcontext in one of above */
+/* #undef HAVE_SIGCONTEXT */
+
+
+/* define if have <sys/ioctl.h> */
+#define HAVE_SYS_IOCTL_H 1
+
+/* define if we can use the file nsocket.c */
+#define HAVE_NSOCKET 1
+
+#ifndef HAVE_ALLOCA
+/* define this if you have alloca */
+#define HAVE_ALLOCA 1
+#endif
+
+
+/* define if need alloca.h */
+/* #undef NEED_ALLOCA_H */
+
+#ifdef NEED_ALLOCA_H
+#include <alloca.h>
+#endif
+
+
+/* define LISTEN_USE_FCNTL if we can check for input using fcntl */
+#define LISTEN_USE_FCNTL 1
+
+/* if signal.h alone contains the stuff necessary for sgc */
+#define SIGNAL_H_HAS_SIGCONTEXT 1
+
+
+/* define if the profil system call is not defined in libc */
+/* #undef NO_PROFILE */
+
+
+/* define if the _cleanup() function exists and should be called
+ before saving */
+/* #define USE_CLEANUP */
+
+
+/* define if BIG_ENDIAN or LITTLE_ENDIAN is defined by including
+ the standard includes */
+/* #define ENDIAN_ALREADY_DEFINED */
+
+/* define if SV_ONSTACK is defined in signal.h */
+#define HAVE_SV_ONSTACK 1
+
+
+/*
+ define to be a typical stack address. We use this to decide
+ whether we can use a cheap test for NULL_OR_ON_C_STACK, or whether
+ it has to be more complex..
+
+*/
+
+#define CSTACK_ADDRESS -1075718936
+
+/* define if SIGSYS is defined in signal.h */
+
+#define HAVE_SIGSYS 1
+
+/* define if SIGEMT is defined in signal.h */
+
+/* #undef HAVE_SIGEMT */
+
+
+/* define if setenv is define */
+#define HAVE_SETENV 1
+
+/* define if putenv is define */
+/* #undef HAVE_PUTENV */
+
+
+/* define if long long int works to multiply to ints, */
+
+#define HAVE_LONG_LONG 1
+
+/* define if want to use GMP */
+#define GMP 1
+
+/* have a broken version of C compiler which makes bad code for -O4 */
+/* #undef BROKEN_O4_OPT */
+
+/* See if gettimeofday is declared in the <sys/time.h> header file. */
+/* if not, set the GETTOD_NOT_DECLARED flag so that tclPort.h can */
+/* declare it. */
+
+#define GETTOD_NOT_DECLARED 1
+
+/* #undef HAVE_BSDGETTIMEOFDAY */
+
+/* #undef NO_UNAME */
+
+/* FIONBIO vs. O_NONBLOCK for nonblocking I/O */
+/* #undef USE_FIONBIO */
+
+/* readline support */
+#define HAVE_READLINE 1
+
+/* bfd support */
+/* #undef HAVE_LIBBFD */
+/* #undef NEED_CONST */
+#define HAVE_BFD_BOOLEAN
+
+#ifdef HAVE_BFD_BOOLEAN
+#define MY_BFD_BOOLEAN bfd_boolean
+#define MY_BFD_FALSE FALSE
+#define MY_BFD_TRUE TRUE
+#else
+#define MY_BFD_BOOLEAN boolean
+#define MY_BFD_FALSE false
+#define MY_BFD_TRUE true
+#endif
+/* isnormal check */
+#define HAVE_ISNORMAL 1
+
+/* #undef HAVE_IEEEFP */
+
+#ifdef IN_NUM_CO
+#ifdef HAVE_ISNORMAL
+#define _GNU_SOURCE
+#include <math.h>
+#define ISNORMAL(a) isnormal(a)
+#else
+#ifdef HAVE_IEEEFP
+#include <ieeefp.h>
+#define ISNORMAL(a) (fpclass(a)>=FP_NZERO)
+#else
+#include <math.h>
+#define ISNORMAL(a) ((sizeof (a) == sizeof (float)) ? \
+ gcl_isnormal_float(a) : \
+ gcl_isnormal_double(a))
+#endif
+#endif
+#endif
+
+#define HAVE_ISFINITE 1
+/* #undef HAVE_FINITE */
+
+#ifdef NEED_ISFINITE
+#ifdef HAVE_ISFINITE
+#define _GNU_SOURCE
+#include <math.h>
+#define ISFINITE(a) isfinite(a)
+#else
+#ifdef HAVE_FINITE
+#include <math.h>
+#include <ieeefp.h>
+#define ISFINITE(a) finite(a)
+#else
+#error "No isfinite found"
+#endif
+#endif
+#endif
+
+#define HAVE_VALUES_H 1
+#define HAVE_FLOAT_H 1
+
+#ifdef IN_NUM_CO
+#ifdef HAVE_VALUES_H
+#include <values.h>
+#endif
+#ifdef HAVE_FLOAT_H
+#include <float.h>
+#endif
+#endif
+
+
+
+/* math.h for definitions in generated C code */
+#define HAVE_MATH_H 1
+
+#ifdef HAVE_MATH_H
+#include <math.h>
+#endif
+
+#define LITTLE_END 1
+
+#define PAGEWIDTH 12
+
+/* #ifdef PAGEWIDTH */
+/* #undef PAGESIZE */
+/* #define PAGESIZE (1<<PAGEWIDTH) */
+/* #endif */
+
+#define SIZEOF_LONG 4
+
+/* #undef USE_DLOPEN */
+
+#define MP_LIMB_BYTES 4
+
+/* #undef ANSI_COMMON_LISP */
+
+/* #undef __SHORT_LIMB */
+/* #undef __LONG_LONG_LIMB */
+
+/* #undef HAVE_JAPI_H */
+
+#define HAVE_XDR 1
+/* #undef ENDIAN_ALREADY_DEFINED */
+/* #undef USE_CLEANUP */
+#define SIZEOF_CONTBLOCK 8
+
+/* #undef GCL_GPROF */
+#define HAVE_DECL_RL_COMPLETION_MATCHES 1
+#define HAVE_RL_COMPENTRY_FUNC_T 1
+#define HAVE_GNU_LD 1
+#define CAN_UNRANDOMIZE_SBRK 1
+#define HOST_CPU "I486"
+#define HOST_KERNEL "LINUX"
+#define HOST_SYSTEM "GNU"
+/* #undef GCL_GPROF_START */
+#define HZ 100
+/* #undef ADDR_NO_RANDOMIZE */
+/* #undef LEADING_UNDERSCORE */
+#define HAVE_XGCL 1
+/* #undef HAVE_SYS_SOCKIO_H */
+/* #undef HAVE_MALLOC_MALLOC_H */
+/* #undef HAVE_OBJC_MALLOC_H */
+/* #undef HAVE_OUTPUT_BFD */
+#define HAVE_BUILTIN_CLEAR_CACHE 1
+
+/* Define to 1 if you have the <asm/sigcontext.h> header file. */
+#define HAVE_ASM_SIGCONTEXT_H 1
+
+/* Define to 1 if you have the <asm/signal.h> header file. */
+#define HAVE_ASM_SIGNAL_H 1
+
+/* Define to 1 if you have the <elf_abi.h> header file. */
+/* #undef HAVE_ELF_ABI_H */
+
+/* Define to 1 if you have the <elf.h> header file. */
+#define HAVE_ELF_H 1
+
+/* Have finite function */
+/* #undef HAVE_FINITE */
+
+/* Define to 1 if you have the <float.h> header file. */
+#define HAVE_FLOAT_H 1
+
+/* Define to 1 if you have the `getcwd' function. */
+#define HAVE_GETCWD 1
+
+/* Define to 1 if you have the `getwd' function. */
+#define HAVE_GETWD 1
+
+/* Have ieeefp fpclass function */
+/* #undef HAVE_IEEEFP */
+
+/* Define to 1 if you have the <inttypes.h> header file. */
+/* #undef HAVE_INTTYPES_H */
+
+/* Have isfinite function */
+#define HAVE_ISFINITE 1
+
+/* Have isnormal function */
+#define HAVE_ISNORMAL 1
+
+/* Define to 1 if you have the <japi.h> header file. */
+/* #undef HAVE_JAPI_H */
+
+/* memalign element present */
+/* #undef HAVE_MALLOC_ZONE_MEMALIGN */
+
+/* Define to 1 if you have the <math.h> header file. */
+#define HAVE_MATH_H 1
+
+/* Define to 1 if you have the <memory.h> header file. */
+/* #undef HAVE_MEMORY_H */
+
+/* Define to 1 if you have the <readline/readline.h> header file. */
+#define HAVE_READLINE_READLINE_H 1
+
+/* Define to 1 if you have the <rpc/rpc.h> header file. */
+/* #undef HAVE_RPC_RPC_H */
+
+/* Define to 1 if you have the <stdint.h> header file. */
+/* #undef HAVE_STDINT_H */
+
+/* Define to 1 if you have the <stdlib.h> header file. */
+/* #undef HAVE_STDLIB_H */
+
+/* Define to 1 if you have the <strings.h> header file. */
+/* #undef HAVE_STRINGS_H */
+
+/* Define to 1 if you have the <string.h> header file. */
+/* #undef HAVE_STRING_H */
+
+/* Define to 1 if you have the <sys/ioctl.h> header file. */
+#define HAVE_SYS_IOCTL_H 1
+
+/* Define to 1 if you have the <sys/sockio.h> header file. */
+/* #undef HAVE_SYS_SOCKIO_H */
+
+/* Define to 1 if you have the <sys/stat.h> header file. */
+/* #undef HAVE_SYS_STAT_H */
+
+/* Define to 1 if you have the <sys/types.h> header file. */
+/* #undef HAVE_SYS_TYPES_H */
+
+/* Define to 1 if you have the <unistd.h> header file. */
+/* #undef HAVE_UNISTD_H */
+
+/* Define to 1 if you have the <values.h> header file. */
+#define HAVE_VALUES_H 1
+
+/* Define to the address where bug reports for this package should be sent. */
+#define PACKAGE_BUGREPORT ""
+
+/* Define to the full name of this package. */
+#define PACKAGE_NAME ""
+
+/* Define to the full name and version of this package. */
+#define PACKAGE_STRING ""
+
+/* Define to the one symbol short name of this package. */
+#define PACKAGE_TARNAME ""
+
+/* Define to the home page for this package. */
+#define PACKAGE_URL ""
+
+/* Define to the version of this package. */
+#define PACKAGE_VERSION ""
+
+/* The size of `long', as computed by sizeof. */
+#define SIZEOF_LONG 4
+
+/* staticly linked images */
+/* #undef STATIC_LINKING */
+
+/* Define to 1 if you have the ANSI C header files. */
+/* #undef STDC_HEADERS */
+#include <stdarg.h>
+#define _VA_LIST_DEFINED
+
+#include <setjmp.h>
+#include <stdio.h>
+
+/* #define endp(obje) endp1(obje) */
+
+#define STSET(type,x,i,val) do{SGC_TOUCH(x);STREF(type,x,i) = (val);} while(0)
+
+
+#ifndef NEW_LISP
+#define t_doublefloat t_longfloat
+#endif
+
+enum type {
+ t_cons,
+ t_start = 0,
+ t_fixnum,
+ t_bignum,
+ t_ratio,
+ t_shortfloat,
+ t_doublefloat,
+ t_complex,
+ t_character,
+ t_symbol,
+ t_package,
+ t_hashtable,
+ t_array,
+ t_vector,
+ t_string,
+ t_bitvector,
+ t_structure,
+ t_stream,
+ t_random,
+ t_readtable,
+ t_pathname,
+ t_cfun,
+ t_cclosure,
+ t_sfun,
+ t_gfun,
+ t_vfun,
+ t_afun,
+ t_closure,
+ t_cfdata,
+ t_spice,
+ t_end,
+ t_contiguous,
+ t_relocatable,
+ t_other
+};
+
+
+enum signals_allowed_values {
+ sig_none,
+ sig_normal,
+ sig_try_to_delay,
+ sig_safe,
+ sig_at_read,
+ sig_use_signals_allowed_value
+
+};
+
+
+#ifdef __SHORT_LIMB
+typedef unsigned int mp_limb_t;
+#else
+#ifdef __LONG_LONG_LIMB
+typedef unsigned long long int mp_limb_t;
+#else
+typedef unsigned long int mp_limb_t;
+#endif
+#endif
+
+typedef mp_limb_t * mp_ptr;
+
+typedef struct
+{
+ int _mp_alloc; /* Number of *limbs* allocated and pointed
+ to by the _mp_d field. */
+ int _mp_size; /* abs(_mp_size) is the number of limbs the
+ last field points to. If _mp_size is
+ negative this is a negative number. */
+ mp_limb_t *_mp_d; /* Pointer to the limbs. */
+} __mpz_struct;
+
+typedef __mpz_struct MP_INT;
+
+/*
+ Copyright (C) 1994 M. Hagiya, W. Schelter, T. Yuasa
+
+This file is part of GNU Common Lisp, herein referred to as GCL
+
+GCL is free software; you can redistribute it and/or modify it under
+the terms of the GNU LIBRARY GENERAL PUBLIC LICENSE as published by
+the Free Software Foundation; either version 2, or (at your option)
+any later version.
+
+GCL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
+License for more details.
+
+You should have received a copy of the GNU Library General Public License
+along with GCL; see the file COPYING. If not, write to the Free Software
+Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
+
+*/
+
+/*
+ object.h
+*/
+
+/*
+ Some system constants.
+*/
+
+#define TRUE 1 /* boolean true value */
+#define FALSE 0 /* boolean false value */
+
+#define FIRSTWORD unsigned char t,flag; char s,m
+
+#define NBPP 4 /* number of bytes per pointer */
+
+#ifndef PAGEWIDTH
+#define PAGEWIDTH 11 /* page width */
+#endif
+ /* log2(PAGESIZE) */
+#undef PAGESIZE
+#define PAGESIZE (1 << PAGEWIDTH) /* page size in bytes */
+
+
+#define CHCODELIM 256 /* character code limit */
+ /* ASCII character set */
+#define CHFONTLIM 1 /* character font limit */
+#define CHBITSLIM 1 /* character bits limit */
+#define CHCODEFLEN 8 /* character code field length */
+#define CHFONTFLEN 0 /* character font field length */
+#define CHBITSFLEN 0 /* character bits field length */
+
+#define PHTABSIZE 512 /* number of entries */
+ /* in the package hash table */
+
+#define ARANKLIM 64 /* array rank limit */
+
+#define RTABSIZE CHCODELIM
+ /* read table size */
+
+#define CBMINSIZE 64 /* contiguous block minimal size */
+
+#ifndef CHAR_SIZE
+#define CHAR_SIZE 8 /* number of bits in a char */
+#endif
+
+#undef bool
+typedef int bool;
+typedef long fixnum;
+typedef unsigned long ufixnum;
+typedef float shortfloat;
+typedef double longfloat;
+typedef unsigned short fatchar;
+
+#ifndef plong
+#define plong int
+#endif
+
+
+#define SIGNED_CHAR(x) (((char ) -1) < (char )0 ? (char) x \
+ : (x >= (1<<(CHAR_SIZE-1)) ? \
+ x - (((int)(1<<(CHAR_SIZE-1))) << 1) \
+ : (char ) x))
+
+
+/*
+ Definition of the type of LISP objects.
+*/
+typedef union lispunion *object;
+
+typedef union int_object iobject;
+union int_object {object o; fixnum i;};
+
+/*
+ OBJect NULL value.
+ It should not coincide with any legal object value.
+*/
+#define OBJNULL ((object)NULL)
+
+/*
+ Definition of each implementation type.
+*/
+
+struct fixnum_struct {
+ FIRSTWORD;
+ fixnum FIXVAL; /* fixnum value */
+};
+#define Mfix(obje) (obje)->FIX.FIXVAL
+#define fix(x) Mfix(x)
+
+#define SMALL_FIXNUM_LIMIT 1024
+
+/* EXTER */
+/* struct fixnum_struct small_fixnum_table[2*SMALL_FIXNUM_LIMIT]; */
+
+/* #define small_fixnum(i) \ */
+/* (object)(small_fixnum_table+SMALL_FIXNUM_LIMIT+(i)) */
+
+struct shortfloat_struct {
+ FIRSTWORD;
+ shortfloat SFVAL; /* shortfloat value */
+};
+#define Msf(obje) (obje)->SF.SFVAL
+#define sf(x) Msf(x)
+
+struct longfloat_struct {
+ FIRSTWORD;
+ longfloat LFVAL; /* longfloat value */
+};
+#define Mlf(obje) (obje)->LF.LFVAL
+#define lf(x) Mlf(x)
+
+
+
+/* #ifdef _MP_H */
+
+/* #else */
+/* typedef struct */
+/* { */
+/* int _mp_alloc; Number of *limbs* allocated and pointed */
+/* to by the _mp_d field. */
+/* int _mp_size; abs(_mp_size) is the number of limbs the */
+/* last field points to. If _mp_size is */
+/* negative this is a negative number. */
+/* void *_mp_d; Pointer to the limbs. */
+/* } our_mpz_struct; */
+/* #endif */
+
+struct bignum {
+ FIRSTWORD;
+#ifdef GMP
+ __mpz_struct big_mpz_t;
+#else
+ plong *big_self; /* bignum body */
+ int big_length; /* bignum length */
+#endif
+};
+
+struct ratio {
+ FIRSTWORD;
+ object rat_den; /* denominator */
+ /* must be an integer */
+ object rat_num; /* numerator */
+ /* must be an integer */
+};
+
+struct complex {
+ FIRSTWORD;
+ object cmp_real; /* real part */
+ /* must be a number */
+ object cmp_imag; /* imaginary part */
+ /* must be a number */
+};
+
+struct character {
+ FIRSTWORD;
+ unsigned short ch_code; /* code */
+ unsigned char ch_font; /* font */
+ unsigned char ch_bits; /* bits */
+};
+
+
+
+/* struct character character_table1[256+128]; */
+/* EXTER */
+/* union lispunion character_table1[256+128]; */
+/* #define character_table (character_table1+128) */
+/* #define code_char(c) (object)(character_table+(c)) */
+/* #define char_code(obje) ((object)obje)->ch.ch_code */
+/* #define char_font(obje) ((object)obje)->ch.ch_font */
+/* #define char_bits(obje) ((object)obje)->ch.ch_bits */
+
+enum stype { /* symbol type */
+ stp_ordinary, /* ordinary */
+ stp_constant, /* constant */
+ stp_special /* special */
+};
+
+#define Cnil ((object)&Cnil_body)
+#define Ct ((object)&Ct_body)
+#define sLnil Cnil
+#define sLt Ct
+
+#define NOT_SPECIAL ((void (*)())Cnil)
+#define s_fillp st_fillp
+#define s_self st_self
+
+struct symbol {
+ FIRSTWORD;
+ object s_dbind; /* dynamic binding */
+ void (*s_sfdef)(); /* special form definition */
+ /* This field coincides with c_car */
+ char *s_self; /* print name */
+ /* These fields coincide with */
+ /* st_fillp and st_self. */
+ int s_fillp; /* print name length */
+
+ object s_gfdef; /* global function definition */
+ /* For a macro, */
+ /* its expansion function */
+ /* is to be stored. */
+ object s_plist; /* property list */
+ object s_hpack; /* home package */
+ /* Cnil for uninterned symbols */
+ short s_stype; /* symbol type */
+ /* of enum stype */
+ short s_mflag; /* macro flag */
+};
+EXTER
+/* struct symbol Cnil_body, Ct_body; */
+union lispunion Cnil_body, Ct_body;
+
+struct package {
+ FIRSTWORD;
+ object p_name; /* package name */
+ /* a string */
+ object p_nicknames; /* nicknames */
+ /* list of strings */
+ object p_shadowings; /* shadowing symbol list */
+ object p_uselist; /* use-list of packages */
+ object p_usedbylist; /* used-by-list of packages */
+ object *p_internal; /* hashtable for internal symbols */
+ object *p_external; /* hashtable for external symbols */
+ int p_internal_size; /* size of internal hash table*/
+ int p_external_size; /* size of external hash table */
+ int p_internal_fp; /* [rough] number of symbols */
+ int p_external_fp; /* [rough] number of symbols */
+ struct package
+ *p_link; /* package link */
+};
+
+/*
+ The values returned by intern and find_symbol.
+ File_symbol may return 0.
+*/
+#define INTERNAL 1
+#define EXTERNAL 2
+#define INHERITED 3
+
+/*
+ All the packages are linked through p_link.
+*/
+EXTER struct package *pack_pointer; /* package pointer */
+
+struct cons {
+ FIRSTWORD;
+ object c_cdr; /* cdr */
+ object c_car; /* car */
+};
+
+enum httest { /* hash table key test function */
+ htt_eq, /* eq */
+ htt_eql, /* eql */
+ htt_equal /* equal */
+};
+
+struct htent { /* hash table entry */
+ object hte_key; /* key */
+ object hte_value; /* value */
+};
+
+struct hashtable { /* hash table header */
+ FIRSTWORD;
+ struct htent
+ *ht_self; /* pointer to the hash table */
+ object ht_rhsize; /* rehash size */
+ object ht_rhthresh; /* rehash threshold */
+ int ht_nent; /* number of entries */
+ int ht_size; /* hash table size */
+ short ht_test; /* key test function */
+ /* of enum httest */
+};
+
+enum aelttype { /* array element type */
+ aet_object, /* t */
+ aet_ch, /* string-char */
+ aet_bit, /* bit */
+ aet_fix, /* fixnum */
+ aet_sf, /* short-float */
+ aet_lf, /* plong-float */
+ aet_char, /* signed char */
+ aet_uchar, /* unsigned char */
+ aet_short, /* signed short */
+ aet_ushort, /* unsigned short */
+ aet_last
+ };
+
+struct array { /* array header */
+ FIRSTWORD;
+ object a_displaced; /* displaced */
+ short a_rank; /* array rank */
+ short a_elttype; /* element type */
+ object *a_self; /* pointer to the array */
+ short a_adjustable; /* adjustable flag */
+ short a_offset; /* bitvector offset */
+ int a_dim; /* dimension */
+ int *a_dims; /* table of dimensions */
+
+};
+
+
+
+struct vector { /* vector header */
+ FIRSTWORD;
+ object v_displaced; /* displaced */
+ short v_hasfillp; /* has-fill-pointer flag */
+ short v_elttype; /* element type */
+
+ object *v_self; /* pointer to the vector */
+ int v_fillp; /* fill pointer */
+ /* For simple vectors, */
+ /* v_fillp is equal to v_dim. */
+ int v_dim; /* dimension */
+ short v_adjustable; /* adjustable flag */
+ short v_offset; /* not used */
+};
+
+struct string { /* string header */
+ FIRSTWORD;
+ object st_displaced; /* displaced */
+ short st_hasfillp; /* has-fill-pointer flag */
+ short st_adjustable; /* adjustable flag */
+ char *st_self; /* pointer to the string */
+ int st_fillp; /* fill pointer */
+ /* For simple strings, */
+ /* st_fillp is equal to st_dim. */
+ int st_dim; /* dimension */
+ /* string length */
+
+};
+
+struct ustring {
+ FIRSTWORD;
+ object ust_displaced;
+ short ust_hasfillp;
+ short ust_adjustable;
+ unsigned char *ust_self;
+ int ust_fillp;
+
+ int ust_dim;
+
+
+};
+
+#define USHORT_GCL(x,i) (((unsigned short *)(x)->ust.ust_self)[i])
+#define SHORT_GCL(x,i) ((( short *)(x)->ust.ust_self)[i])
+
+#define BV_OFFSET(x) ((type_of(x)==t_bitvector ? x->bv.bv_offset : \
+ type_of(x)== t_array ? x->a.a_offset : (abort(),0)))
+
+#define SET_BV_OFFSET(x,val) ((type_of(x)==t_bitvector ? x->bv.bv_offset = val : \
+ type_of(x)== t_array ? x->a.a_offset=val : (abort(),0)))
+
+
+
+
+struct bitvector { /* bitvector header */
+ FIRSTWORD;
+ object bv_displaced; /* displaced */
+ short bv_hasfillp; /* has-fill-pointer flag */
+ short bv_elttype; /* not used */
+ char *bv_self; /* pointer to the bitvector */
+ int bv_fillp; /* fill pointer */
+ /* For simple bitvectors, */
+ /* st_fillp is equal to st_dim. */
+ int bv_dim; /* dimension */
+ /* number of bits */
+ short bv_adjustable; /* adjustable flag */
+ short bv_offset; /* bitvector offset */
+ /* the position of the first bit */
+ /* in the first byte */
+};
+
+struct fixarray { /* fixnum array header */
+ FIRSTWORD;
+ object fixa_displaced; /* displaced */
+ short fixa_rank; /* array rank */
+ short fixa_elttype; /* element type */
+ fixnum *fixa_self; /* pointer to the array */
+ short fixa_adjustable;/* adjustable flag */
+ short fixa_offset; /* not used */
+ int fixa_dim; /* dimension */
+ int *fixa_dims; /* table of dimensions */
+
+};
+
+struct sfarray { /* short-float array header */
+ FIRSTWORD;
+ object sfa_displaced; /* displaced */
+ short sfa_rank; /* array rank */
+ short sfa_elttype; /* element type */
+ shortfloat
+ *sfa_self; /* pointer to the array */
+ short sfa_adjustable; /* adjustable flag */
+ short sfa_offset; /* not used */
+ int sfa_dim; /* dimension */
+
+ int *sfa_dims; /* table of dimensions */
+
+
+
+};
+
+struct lfarray { /* plong-float array header */
+ FIRSTWORD;
+ object lfa_displaced; /* displaced */
+ short lfa_rank; /* array rank */
+ short lfa_elttype; /* element type */
+ longfloat
+ *lfa_self; /* pointer to the array */
+ short lfa_adjustable; /* adjustable flag */
+ short lfa_offset; /* not used */
+ int lfa_dim; /* dimension */
+ int *lfa_dims; /* table of dimensions */
+
+
+};
+
+struct structure { /* structure header */
+ FIRSTWORD;
+ object str_def; /* structure definition (a structure) */
+ object *str_self; /* structure self */
+};
+
+struct s_data {object name;
+ fixnum length;
+ object raw;
+ object included;
+ object includes;
+ object staticp;
+ object print_function;
+ object slot_descriptions;
+ object slot_position;
+ fixnum size;
+ object has_holes;
+ };
+
+#define S_DATA(x) ((struct s_data *)((x)->str.str_self))
+#define SLOT_TYPE(def,i) (((S_DATA(def))->raw->ust.ust_self[i]))
+#define SLOT_POS(def,i) USHORT_GCL(S_DATA(def)->slot_position,i)
+#define STREF(type,x,i) (*((type *)(((char *)((x)->str.str_self))+(i))))
+
+
+
+enum smmode { /* stream mode */
+ smm_input, /* input */
+ smm_output, /* output */
+ smm_io, /* input-output */
+ smm_probe, /* probe */
+ smm_synonym, /* synonym */
+ smm_broadcast, /* broadcast */
+ smm_concatenated, /* concatenated */
+ smm_two_way, /* two way */
+ smm_echo, /* echo */
+ smm_string_input, /* string input */
+ smm_string_output, /* string output */
+ smm_user_defined, /* for user defined */
+ smm_socket /* Socket stream */
+};
+
+/* for any stream that takes writec_char, directly (not two_way or echo)
+ ie. smm_output,smm_io, smm_string_output, smm_socket
+ */
+#define STREAM_FILE_COLUMN(str) ((str)->sm.sm_int1)
+
+/* for smm_echo */
+#define ECHO_STREAM_N_UNREAD(strm) ((strm)->sm.sm_int0)
+
+/* file fd for socket */
+#define SOCKET_STREAM_FD(strm) ((strm)->sm.sm_fd)
+#define SOCKET_STREAM_BUFFER(strm) ((strm)->sm.sm_object1)
+
+/* for smm_string_input */
+#define STRING_INPUT_STREAM_NEXT(strm) ((strm)->sm.sm_int0)
+#define STRING_INPUT_STREAM_END(strm) ((strm)->sm.sm_int1)
+
+/* for smm_two_way and smm_echo */
+#define STREAM_OUTPUT_STREAM(strm) ((strm)->sm.sm_object1)
+#define STREAM_INPUT_STREAM(strm) ((strm)->sm.sm_object0)
+
+/* for smm_string_{input,output} */
+#define STRING_STREAM_STRING(strm) ((strm)->sm.sm_object0)
+
+struct stream {
+ FIRSTWORD;
+ FILE *sm_fp; /* file pointer */
+ object sm_object0; /* some object */
+ object sm_object1; /* some object */
+ int sm_int0; /* some int */
+ int sm_int1; /* column for input or output, stream */
+ char *sm_buffer; /* ptr to BUFSIZE block of storage */
+ char sm_mode; /* stream mode */
+ unsigned char sm_flags; /* flags from gcl_sm_flags */
+ short sm_fd; /* stream fd */
+
+};
+/* flags */
+#define GET_STREAM_FLAG(strm,name) ((strm)->sm.sm_flags & (1<<(name)))
+#define SET_STREAM_FLAG(strm,name,val) {if (val) (strm)->sm.sm_flags |= (1<<(name)); else (strm)->sm.sm_flags &= ~(1<<(name));}
+
+#define GCL_MODE_BLOCKING 1
+#define GCL_MODE_NON_BLOCKING 0
+#define GCL_TCP_ASYNC 1
+
+enum gcl_sm_flags {
+ gcl_sm_blocking=1,
+ gcl_sm_tcp_async,
+ gcl_sm_input,
+ gcl_sm_output,
+ gcl_sm_had_error
+
+
+};
+
+#ifdef BSD
+#ifdef SUN3
+#define BASEFF (unsigned char *)0xffffffff
+#else
+#define BASEFF (char *)0xffffffff
+#endif
+#endif
+
+#ifdef ATT
+#define BASEFF (unsigned char *)0xffffffff
+#endif
+
+#ifdef E15
+#define BASEFF (unsigned char *)0xffffffff
+#endif
+
+#ifdef MV
+
+
+#endif
+
+struct random {
+ FIRSTWORD;
+ unsigned rnd_value; /* random state value */
+};
+
+enum chattrib { /* character attribute */
+ cat_whitespace, /* whitespace */
+ cat_terminating, /* terminating macro */
+ cat_non_terminating, /* non-terminating macro */
+ cat_single_escape, /* single-escape */
+ cat_multiple_escape, /* multiple-escape */
+ cat_constituent /* constituent */
+};
+
+struct rtent { /* read table entry */
+ enum chattrib rte_chattrib; /* character attribute */
+ object rte_macro; /* macro function */
+ object *rte_dtab; /* pointer to the */
+ /* dispatch table */
+ /* NULL for */
+ /* non-dispatching */
+ /* macro character, or */
+ /* non-macro character */
+};
+
+struct readtable { /* read table */
+ FIRSTWORD;
+ struct rtent *rt_self; /* read table itself */
+};
+
+struct pathname {
+ FIRSTWORD;
+ object pn_host; /* host */
+ object pn_device; /* device */
+ object pn_directory; /* directory */
+ object pn_name; /* name */
+ object pn_type; /* type */
+ object pn_version; /* version */
+};
+
+struct cfun { /* compiled function header */
+ FIRSTWORD;
+ object cf_name; /* compiled function name */
+ void (*cf_self)(); /* entry address */
+ object cf_data; /* data the function uses */
+ /* for GBC */
+};
+
+struct cclosure { /* compiled closure header */
+ FIRSTWORD;
+ object cc_name; /* compiled closure name */
+ void (*cc_self)(); /* entry address */
+ object cc_env; /* environment */
+ object cc_data; /* data the closure uses */
+ /* for GBC */
+ int cc_envdim;
+ object *cc_turbo; /* turbo charger */
+};
+
+struct closure {
+ FIRSTWORD;
+ object cl_name; /* name */
+ object (*cl_self)(); /* C start address of code */
+ object cl_data; /* To object holding VV vector */
+ int cl_argd; /* description of args + number */
+ int cl_envdim; /* length of the environment vector */
+ object *cl_env; /* environment vector referenced by cl_self()*/
+};
+
+struct sfun {
+ FIRSTWORD;
+ object sfn_name; /* name */
+ object (*sfn_self)(); /* C start address of code */
+ object sfn_data; /* To object holding VV vector */
+ int sfn_argd; /* description of args + number */
+
+ };
+
+struct vfun {
+ FIRSTWORD;
+ object vfn_name; /* name */
+ object (*vfn_self)(); /* C start address of code */
+ object vfn_data; /* To object holding VV data */
+ unsigned short vfn_minargs; /* Min args and where varargs start */
+ unsigned short vfn_maxargs; /* Max number of args */
+ };
+struct cfdata {
+ FIRSTWORD;
+ char *cfd_start; /* beginning of contblock for fun */
+ int cfd_size; /* size of contblock */
+ int cfd_fillp; /* size of self */
+ object *cfd_self; /* body */
+ };
+
+struct spice {
+ FIRSTWORD;
+ int spc_dummy;
+};
+
+/*
+ dummy type
+*/
+struct dummy {
+ FIRSTWORD;
+};
+
+/*
+ Definition of lispunion.
+*/
+union lispunion {
+ struct fixnum_struct
+ FIX; /* fixnum */
+ struct bignum big; /* bignum */
+ struct ratio rat; /* ratio */
+ struct shortfloat_struct
+ SF; /* short floating-point number */
+ struct longfloat_struct
+ LF; /* plong floating-point number */
+ struct complex cmp; /* complex number */
+ struct character
+ ch; /* character */
+ struct symbol s; /* symbol */
+ struct package p; /* package */
+ struct cons c; /* cons */
+ struct hashtable
+ ht; /* hash table */
+ struct array a; /* array */
+ struct vector v; /* vector */
+ struct string st; /* string */
+ struct ustring ust;
+ struct bitvector
+ bv; /* bit-vector */
+ struct structure
+ str; /* structure */
+ struct stream sm; /* stream */
+ struct random rnd; /* random-states */
+ struct readtable
+ rt; /* read table */
+ struct pathname pn; /* path name */
+ struct cfun cf; /* compiled function uses value stack] */
+ struct cclosure cc; /* compiled closure uses value stack */
+ struct closure cl; /* compiled closure uses c stack */
+ struct sfun sfn; /* simple function */
+ struct vfun vfn; /* function with variable number of args */
+ struct cfdata cfd; /* compiled fun data */
+ struct spice spc; /* spice */
+
+ struct dummy d; /* dummy */
+
+ struct fixarray fixa; /* fixnum array */
+ struct sfarray sfa; /* short-float array */
+ struct lfarray lfa; /* plong-float array */
+};
+
+
+/* struct character character_table1[256+128]; */
+EXTER
+union lispunion character_table1[256+128];
+#define character_table (character_table1+128)
+#define code_char(c) (object)(character_table+(c))
+#define char_code(obje) ((object)obje)->ch.ch_code
+#define char_font(obje) ((object)obje)->ch.ch_font
+#define char_bits(obje) ((object)obje)->ch.ch_bits
+
+EXTER
+union lispunion small_fixnum_table[2*SMALL_FIXNUM_LIMIT];
+
+#define small_fixnum(i) \
+ (object)(small_fixnum_table+SMALL_FIXNUM_LIMIT+(i))
+
+
+
+#define address_int unsigned long
+
+/*
+ The struct of free lists.
+*/
+struct freelist {
+ FIRSTWORD;
+ address_int f_link;
+};
+#ifndef INT_TO_ADDRESS
+#define INT_TO_ADDRESS(x) ((object )(long )x)
+#endif
+
+#define F_LINK(x) ((struct freelist *)(long) x)->f_link
+#define FL_LINK F_LINK
+#define SET_LINK(x,val) F_LINK(x) = (address_int) (val)
+#define OBJ_LINK(x) ((object) INT_TO_ADDRESS(F_LINK(x)))
+
+#define FREE (-1) /* free object */
+
+/*
+ Type_of.
+*/
+#define type_of(obje) ((enum type)(((object)(obje))->d.t))
+
+/*
+ Storage manager for each type.
+*/
+struct typemanager {
+ enum type
+ tm_type; /* type */
+ short tm_size; /* element size in bytes */
+ short tm_nppage; /* number per page */
+ object tm_free; /* free list */
+ /* Note that it is of type object. */
+ long tm_nfree; /* number of free elements */
+ long tm_nused; /* number of elements used */
+ long tm_npage; /* number of pages */
+ long tm_maxpage; /* maximum number of pages */
+ char *tm_name; /* type name */
+ int tm_gbccount; /* GBC count */
+ object tm_alt_free; /* Alternate free list (swap with tm_free) */
+ long tm_alt_nfree; /* Alternate nfree (length of nfree) */
+ short tm_sgc; /* this type has at least this many
+ sgc pages */
+ short tm_sgc_minfree; /* number free on a page to qualify for
+ being an sgc page */
+ short tm_sgc_max; /* max on sgc pages */
+ short tm_min_grow; /* min amount to grow when growing */
+ short tm_max_grow; /* max amount to grow when growing */
+ short tm_growth_percent; /* percent to increase maxpages */
+ short tm_percent_free; /* percent which must be free after a gc for this type */
+ short tm_distinct; /* pages of this type are distinct */
+ float tm_adjgbccnt;
+ long tm_opt_maxpage;
+};
+
+
+/*
+ The table of type managers.
+*/
+EXTER struct typemanager tm_table[ 32 /* (int) t_relocatable */];
+
+#define tm_of(t) (&(tm_table[(int)tm_table[(int)(t)].tm_type]))
+
+/*
+ Contiguous block header.
+*/
+struct contblock { /* contiguous block header */
+ int cb_size; /* size in bytes */
+ struct contblock
+ *cb_link; /* contiguous block link */
+};
+
+/*
+ The pointer to the contiguous blocks.
+*/
+EXTER struct contblock *cb_pointer; /* contblock pointer */
+
+/* SGC cont pages: After SGC_start, old_cb_pointer will be a linked
+ list of free blocks on non-SGC pages, and cb_pointer will be
+ likewise for SGC pages. CM 20030827*/
+EXTER struct contblock *old_cb_pointer; /* old contblock pointer when in SGC */
+
+/* SGC cont pages: FIXME -- at some point, enable runtime disabling of
+ SGC cont pages. Right now, the tm_sgc variable for type contiguous
+ will govern only the possible attempt to get new pages for SGC.
+ Contiguous pages normally allocated when SGC is on will always be
+ marked with SGC_PAGE_FLAG, as the current GBC algorithm always uses
+ sgc_contblock_sweep_phase in this case. */
+/* #define SGC_CONT_ENABLED (sgc_enabled && tm_table[t_contiguous].tm_sgc) */
+#define SGC_CONT_ENABLED (sgc_enabled)
+
+/*
+ Variables for memory management.
+*/
+EXTER long ncb; /* number of contblocks */
+/* int ncbpage; number of contblock pages */
+#define ncbpage tm_table[t_contiguous].tm_npage
+#define maxcbpage tm_table[t_contiguous].tm_maxpage
+#define cbgbccount tm_table[t_contiguous].tm_gbccount
+
+
+/* int maxcbpage; maximum number of contblock pages */
+EXTER
+long holepage; /* hole pages */
+#define nrbpage tm_table[t_relocatable].tm_npage
+#define rbgbccount tm_table[t_relocatable].tm_gbccount
+/* int nrbpage; number of relblock pages */
+
+
+EXTER
+char *rb_start; /* relblock start */
+EXTER char *rb_end; /* relblock end */
+EXTER char *rb_limit; /* relblock limit */
+EXTER char *rb_pointer; /* relblock pointer */
+EXTER char *rb_start1; /* relblock start in copy space */
+EXTER char *rb_pointer1; /* relblock pointer in copy space */
+
+EXTER char *heap_end; /* heap end */
+EXTER char *core_end; /* core end */
+EXTER
+char *tmp_alloc;
+
+/* make f allocate enough extra, so that we can round
+ up, the address given to an even multiple. Special
+ case of size == 0 , in which case we just want an aligned
+ number in the address range
+ */
+
+#define ALLOC_ALIGNED(f, size,align) \
+ (align <= sizeof(plong) ? (char *)((f)(size)) : \
+ (tmp_alloc = (char *)((f)(size+(size ?(align)-1 : 0)))+(align)-1 , \
+ (char *)(align * (((unsigned long)tmp_alloc)/align))))
+#define AR_ALLOC(f,n,type) (type *) \
+ (ALLOC_ALIGNED(f,(n)*sizeof(type),sizeof(type)))
+
+
+/* FIXME Make all other page constants scale similarly by default. */
+#ifndef HOLEPAGE
+#define HOLEPAGE (MAXPAGE/10)
+#endif
+
+
+/* #define INIT_HOLEPAGE 150 */
+/* #define INIT_NRBPAGE 50 */
+/* #define RB_GETA 512 */
+
+#define INIT_HOLEPAGE (6*HOLEPAGE/5)
+#define INIT_NRBPAGE (INIT_HOLEPAGE/3)
+#define RB_GETA (10*INIT_NRBPAGE)
+
+
+#ifdef AV
+#define STATIC register
+#endif
+#ifdef MV
+
+#endif
+
+#define TIME_ZONE (-9)
+/* EXTER */
+/* fixnum FIXtemp; */
+
+/* For IEEEFLOAT, the double may have exponent in the second word
+(little endian) or first word.*/
+
+#if defined(I386) || defined(LITTLE_END)
+#define HIND 1 /* (int) of double where the exponent and most signif is */
+#define LIND 0 /* low part of a double */
+#else /* big endian */
+#define HIND 0
+#define LIND 1
+#endif
+#ifndef VOL
+#define VOL
+#endif
+
+
+#define isUpper(xxx) (((xxx)&0200) == 0 && isupper((int)xxx))
+#define isLower(xxx) (((xxx)&0200) == 0 && islower((int)xxx))
+#define isDigit(xxx) (((xxx)&0200) == 0 && isdigit((int)xxx))
+enum ftype {f_object,f_fixnum};
+EXTER
+char *alloca_val;
+/* ...xx|xx|xxxx|xxxx|
+ ret Narg */
+
+/* a9a8a7a6a5a4a3a4a3a2a1a0rrrrnnnnnnnn
+ ai=argtype(i) ret nargs
+ */
+#define SFUN_NARGS(x) (x & 0xff) /* 8 bits */
+#define RESTYPE(x) (x<<8) /* 3 bits */
+ /* set if the VFUN_NARGS = m ; has been set correctly */
+#define VFUN_NARG_BIT (1 <<11)
+#define ARGTYPE(i,x) ((x) <<(12+(i*2)))
+#define ARGTYPE1(x) (1 | ARGTYPE(0,x))
+#define ARGTYPE2(x,y) (2 | ARGTYPE(0,x) | ARGTYPE(1,y))
+#define ARGTYPE3(x,y,z) (3 | ARGTYPE(0,x) | ARGTYPE(1,y) | ARGTYPE(2,z))
+
+object make_si_sfun();
+EXTER object MVloc[10];
+
+/* Set new to be an (object *) whose [i]'th elmt is the
+ ith elmnt in a va_list
+ if
+ ((vl[0] == va_arg(ap,object)) ||
+ (vl[1] == va_arg(ap,object)) || .. vl[n-1] == va_arg(ap,object))
+ you may set
+ #define DONT_COPY_VA_LIST
+ In recent versions of gcc, i think the builtin_alist stuff does not
+ allow setting this.
+ */
+#ifdef DONT_COPY_VA_LIST
+#define COERCE_VA_LIST(new,vl,n) new = (object *) (vl)
+#else
+#define COERCE_VA_LIST(new,vl,n) \
+ object Xxvl[65]; \
+ {int i; \
+ new=Xxvl; \
+ if (n >= 65) FEerror("Too plong vl",0); \
+ for (i=0 ; i < (n); i++) new[i]=va_arg(vl,object);}
+#endif
+
+#ifdef DONT_COPY_VA_LIST
+#error Cannot set DONT_COPY_VA_LIST in ANSI C
+#else
+#define COERCE_VA_LIST_NEW(new,fst,vl,n) \
+ object Xxvl[65]; \
+ {int i; \
+ new=Xxvl; \
+ if (n >= 65) FEerror("va_list too long",0); \
+ for (i=0 ; i < (n); i++) new[i]=i ? va_arg(vl,object) : fst;}
+#endif
+
+
+
+#define make_si_vfun(s,f,min,max) \
+ make_si_vfun1(s,f,min | (max << 8))
+
+/* Number of args supplied to a variable arg t_vfun
+ Used by the C function to set optionals */
+
+struct call_data {
+ object fun;
+ int argd;
+ int nvalues;
+ object values[50];
+ double double_return;
+};
+EXTER struct call_data fcall;
+
+#define VFUN_NARGS fcall.argd
+#define RETURN2(x,y) do{/* object _x = (void *) x; */\
+ fcall.values[2]=y;fcall.nvalues=2; \
+ return (x) ;} while(0)
+#define RETURN1(x) do{fcall.nvalues=1; return (x) ;} while(0)
+#define RETURN0 do{fcall.nvalues=0; return Cnil ;} while(0)
+
+#define RV(x) (*_p++ = x)
+
+#define RETURNI(n,val1,listvals) RETURN(n,int,val1,listvals)
+#define RETURNO(n,val1,listvals) RETURN(n,object,val1,listvals)
+
+/* eg: RETURN(3,object,val1,(RV(val2),RV(val3))) */
+#define RETURN(n,typ,val1,listvals) \
+ do{typ _val1 = val1; object *_p=&fcall.values[1]; listvals; fcall.nvalues= n; return _val1;}while(0)
+/* #define CALL(n,form) (VFUN_NARGS=n,form) */
+
+
+
+/* we sometimes have to touch the header of arrays or structures
+ to make sure the page is writable */
+#ifdef SGC
+#define SGC_TOUCH(x) if ((x)->d.m) system_error(); (x)->d.m=0
+#else
+#define SGC_TOUCH(x)
+#endif
+
+object funcall_cfun(void(*)(),int,...);
+object clear_compiler_properties();
+EXTER object sSlambda_block_expanded;
+
+# ifdef __GNUC__
+# define assert(ex)\
+{if (!(ex)){(void)fprintf(stderr, \
+ "Assertion failed: file \"%s\", line %d\n", __FILE__, __LINE__);exit(1);}}
+# else
+# define assert(ex)
+# endif
+
+#ifndef FIX_PATH_STRING
+#define FIX_PATH_STRING(file) file
+#endif
+
+
+#define CHECK_INTERRUPT if (signals_pending) raise_pending_signals(sig_safe)
+
+#define BEGIN_NO_INTERRUPT \
+ plong old_signals_allowed = signals_allowed; \
+ signals_allowed = 0
+
+#define END_NO_INTERRUPT \
+ signals_allowed = old_signals_allowed
+/* could add: if (signals_pending)
+ raise_pending_signals(sig_use_signals_allowed_value) */
+
+
+#define END_NO_INTERRUPT_SAFE \
+ signals_allowed = old_signals_allowed; \
+ if (signals_pending) \
+ do{ if(signals_allowed ==0) /* should not get here*/abort(); \
+ raise_pending_signals(sig_safe)}while(0)
+
+void raise_pending_signals();
+
+EXTER unsigned plong signals_allowed, signals_pending ;
+
+EXTER struct symbol Dotnil_body;
+#define Dotnil ((object)&Dotnil_body)
+
+#define endp(x) ({\
+ static union lispunion s_my_dot={.c={t_cons,0,0,0,Dotnil,Dotnil}}; \
+ object _x=(x);\
+ bool _b=FALSE;\
+ \
+ if (type_of(_x)==t_cons) {\
+ if (type_of(_x->c.c_cdr)!=t_cons && _x->c.c_cdr!=Cnil)\
+ s_my_dot.c.c_car=_x->c.c_cdr;\
+ else \
+ s_my_dot.c.c_car=Dotnil;\
+ } else {\
+ if (_x==s_my_dot.c.c_car)\
+ x=&s_my_dot;\
+ else {\
+ s_my_dot.c.c_car=Dotnil;\
+ if (_x==Cnil || _x==Dotnil)\
+ _b=TRUE;\
+ else\
+ FEwrong_type_argument(sLlist, _x);\
+ }\
+ }\
+ _b;\
+ })
+
+#define endp_prop(a) (type_of(a)==t_cons ? FALSE : ((a)==Cnil ? TRUE : (FEwrong_type_argument(sLlist, (a)),FALSE)))
+
+#define proper_list(a) (type_of(a)==t_cons || (a)==Cnil)
+#define fix_dot(a) ((a) == Dotnil ? Cnil : (type_of(a)==t_cons && (a)->c.c_cdr==Dotnil ? (a)->c.c_car : (a)))
+/*
+ Copyright (C) 1994 M. Hagiya, W. Schelter, T. Yuasa
+
+This file is part of GNU Common Lisp, herein referred to as GCL
+
+GCL is free software; you can redistribute it and/or modify it under
+the terms of the GNU LIBRARY GENERAL PUBLIC LICENSE as published by
+the Free Software Foundation; either version 2, or (at your option)
+any later version.
+
+GCL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
+License for more details.
+
+You should have received a copy of the GNU Library General Public License
+along with GCL; see the file COPYING. If not, write to the Free Software
+Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
+
+*/
+
+/*
+ vs.h
+
+ value stack
+*/
+
+EXTER object *vs_org;
+EXTER object *vs_limit; /* value stack limit */
+
+EXTER object *vs_base; /* value stack base */
+EXTER object *vs_top; /* value stack top */
+
+#define vs_push(obje) (*vs_top++ = (obje))
+
+#define vs_pop (*--vs_top)
+#define vs_popp (--vs_top)
+#define vs_head vs_top[-1]
+
+#define vs_mark object *old_vs_top = vs_top
+#define vs_reset vs_top = old_vs_top
+
+#define vs_check if (vs_top >= vs_limit) \
+ vs_overflow()
+
+#define vs_check_push(obje) \
+ (vs_top >= vs_limit ? \
+ (object)vs_overflow() : (*vs_top++ = (obje)))
+
+#define check_arg(n) \
+ if (vs_top - vs_base != (n)) \
+ check_arg_failed(n)
+
+#define CHECK_ARG_RANGE(n,m) if (VFUN_NARGS < n || VFUN_NARGS >m) \
+ check_arg_range(n,m)
+
+#define MMcheck_arg(n) \
+ if (vs_top - vs_base < (n)) \
+ too_few_arguments(); \
+ else if (vs_top - vs_base > (n)) \
+ too_many_arguments()
+
+#define vs_reserve(x) if(vs_base+(x) >= vs_limit) \
+ vs_overflow();
+/*
+ Copyright (C) 1994 M. Hagiya, W. Schelter, T. Yuasa
+
+This file is part of GNU Common Lisp, herein referred to as GCL
+
+GCL is free software; you can redistribute it and/or modify it under
+the terms of the GNU LIBRARY GENERAL PUBLIC LICENSE as published by
+the Free Software Foundation; either version 2, or (at your option)
+any later version.
+
+GCL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
+License for more details.
+
+You should have received a copy of the GNU Library General Public License
+along with GCL; see the file COPYING. If not, write to the Free Software
+Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
+
+*/
+
+/*
+ bds.h
+
+ bind stack
+*/
+
+struct bds_bd {
+ object bds_sym; /* symbol */
+ object bds_val; /* previous value of the symbol */
+};
+
+
+typedef struct bds_bd *bds_ptr;
+
+EXTER bds_ptr bds_org;
+
+EXTER bds_ptr bds_limit;
+
+EXTER bds_ptr bds_top; /* bind stack top */
+
+#ifdef KCLOVM
+
+/* for multiprocessing */
+EXTER struct bds_bd save_bind_stack[BDSSIZE + BDSGETA + BDSGETA];
+EXTER bds_ptr bds_save_org;
+EXTER bds_ptr bds_save_limit;
+EXTER bds_ptr bds_save_top;
+
+#endif
+
+#define bds_check \
+ if (bds_top >= bds_limit) \
+ bds_overflow()
+
+/* do this so that an interrupt in the middle will leave the VALID
+ part of the bds stack ie (<= bds_top) in a valid state, so
+ that a throw out will be ok */
+#define bds_bind(sym, val) \
+ do {bds_ptr _b = bds_top+1; \
+ (_b)->bds_sym = (sym); \
+ _b->bds_val = ((object)sym)->s.s_dbind; \
+ ((object)sym)->s.s_dbind = (val); bds_top=_b;} while (0)
+
+#define bds_unwind1 \
+ ((bds_top->bds_sym)->s.s_dbind = bds_top->bds_val, --bds_top)
+
+
+/*
+ Copyright (C) 1994 M. Hagiya, W. Schelter, T. Yuasa
+
+This file is part of GNU Common Lisp, herein referred to as GCL
+
+GCL is free software; you can redistribute it and/or modify it under
+the terms of the GNU LIBRARY GENERAL PUBLIC LICENSE as published by
+the Free Software Foundation; either version 2, or (at your option)
+any later version.
+
+GCL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
+License for more details.
+
+You should have received a copy of the GNU Library General Public License
+along with GCL; see the file COPYING. If not, write to the Free Software
+Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
+
+*/
+
+/*
+
+ frame.h
+
+ frame stack and non-local jump
+*/
+
+
+/* IHS Invocation History Stack */
+
+typedef struct invocation_history {
+ object ihs_function;
+ object *ihs_base;
+} *ihs_ptr;
+
+EXTER ihs_ptr ihs_org;
+
+EXTER ihs_ptr ihs_limit;
+
+EXTER ihs_ptr ihs_top;
+
+#define ihs_check \
+ if (ihs_top >= ihs_limit) \
+ ihs_overflow()
+
+#define ihs_push(function) \
+ (++ihs_top)->ihs_function = (function); \
+ ihs_top->ihs_base = vs_base
+#define ihs_push_base(function,base) \
+ (++ihs_top)->ihs_function = (function); \
+ ihs_top->ihs_base = base
+
+#define ihs_pop() (ihs_top--)
+
+
+#define make_nil_block() \
+{ \
+ object x; \
+ \
+ lex_copy(); \
+ x = alloc_frame_id(); \
+ vs_push(x); \
+ lex_block_bind(Cnil, x); \
+ vs_popp; \
+ frs_push(FRS_CATCH, x); \
+}
+
+
+/* Frame Stack */
+
+enum fr_class {
+ FRS_CATCH, /* for catch,block,tabbody */
+ FRS_CATCHALL, /* for catchall */
+ FRS_PROTECT /* for protect-all */
+};
+
+EXTER int in_signal_handler;
+struct frame {
+ jmp_buf frs_jmpbuf;
+ object *frs_lex;
+ bds_ptr frs_bds_top;
+ char frs_class;
+ char frs_in_signal_handler;
+ object frs_val;
+ ihs_ptr frs_ihs;
+};
+
+typedef struct frame *frame_ptr;
+
+#define alloc_frame_id() alloc_object(t_spice)
+
+/*
+frs_class | frs_value | frs_prev
+----------+--------------------------------------+--------------
+CATCH | frame-id, i.e. |
+ | throw-tag, |
+ | block-id (uninterned symbol), or | value of ihs_top
+ | tagbody-id (uninterned symbol) | when the frame
+----------+--------------------------------------| was pushed
+CATCHALL | NIL |
+----------+--------------------------------------|
+PROTECT | NIL |
+----------------------------------------------------------------
+*/
+
+
+EXTER frame_ptr frs_org;
+
+EXTER frame_ptr frs_limit;
+
+EXTER frame_ptr frs_top; /* frame stack top */
+
+
+#define frs_push(class, val) \
+ do { frame_ptr _frs_top = frs_top +1; \
+ if (_frs_top >= frs_limit) \
+ frs_overflow(); \
+ _frs_top->frs_lex = lex_env;\
+ _frs_top->frs_bds_top = bds_top; \
+ _frs_top->frs_class = (class); \
+ _frs_top->frs_in_signal_handler = in_signal_handler; \
+ _frs_top->frs_val = (val); \
+ _frs_top->frs_ihs = ihs_top; \
+ frs_top=_frs_top; \
+ setjmp(_frs_top->frs_jmpbuf); \
+ } while (0)
+
+#define frs_pop() frs_top--
+
+
+/* global variables used during non-local jump */
+
+EXTER bool nlj_active; /* true during non-local jump */
+EXTER frame_ptr nlj_fr; /* frame to return */
+EXTER object nlj_tag; /* throw-tag, block-id, or */
+ /* (tagbody-id . label). */
+
+
+/*
+(c) Copyright Taiichi Yuasa and Masami Hagiya, 1984. All rights reserved.
+Copying of this file is authorized to users who have executed the true and
+proper "License Agreement for Kyoto Common LISP" with SIGLISP.
+*/
+
+/*
+
+ lex.h
+
+ lexical environment
+*/
+
+
+EXTER object *lex_env;
+
+
+
+/*
+ VS
+ | |
+ |---------------|
+lex_env ------> | lex-var | : lex_env[0]
+ |---------------|
+ | lex-fd | : lex_env[1]
+ |---------------|
+ | lex-tag | : lex_env[2]
+ |---------------|
+ | |
+ | |
+ | |
+
+ lex-var: (symbol value) ; for local binding
+ (.... or ....)
+ (symbol) ; for special binding
+
+ lex-fd: (fun-name 'FUNCTION' function)
+ (.... or ...)
+ (macro-name 'MACRO' expansion-function)
+
+ lex-tag: (tag 'TAG' frame-id)
+ (.... or ....)
+ (block-name 'BLOCK' frame-id)
+
+where 'FUN' is the LISP object with pname FUN, etc.
+
+
+*/
+
+#define lex_copy() ihs_top->ihs_base = vs_top; \
+ vs_push(lex_env[0]); \
+ vs_push(lex_env[1]); \
+ vs_push(lex_env[2]); \
+ lex_env = vs_top - 3
+
+#define lex_new() ihs_top->ihs_base = vs_top; \
+ lex_env = vs_top; \
+ vs_top[0] = vs_top[1] = vs_top[2] = Cnil; \
+ vs_top += 3
+
+#define lex_var_sch(name) assoc_eq((name),lex_env[0])
+
+#define lex_fd_sch(name) assoc_eq((name),lex_env[1])
+
+/*
+ Copyright (C) 1994 M. Hagiya, W. Schelter, T. Yuasa
+
+This file is part of GNU Common Lisp, herein referred to as GCL
+
+GCL is free software; you can redistribute it and/or modify it under
+the terms of the GNU LIBRARY GENERAL PUBLIC LICENSE as published by
+the Free Software Foundation; either version 2, or (at your option)
+any later version.
+
+GCL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
+License for more details.
+
+You should have received a copy of the GNU Library General Public License
+along with GCL; see the file COPYING. If not, write to the Free Software
+Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
+
+*/
+
+/*
+ eval.h
+*/
+
+
+/* C control stack */
+
+#define CSSIZE 20000
+#define CSGETA 4000
+
+EXTER int *cs_org;
+EXTER int *cs_limit;
+
+
+/* we catch the segmentation fault and check to warn of c stack overflow */
+#ifdef AV
+#ifndef cs_check
+#define cs_check(something) \
+ if ((int *)(&something) < cs_limit) \
+ cs_overflow()
+#endif
+#endif
+#ifdef MV
+
+
+
+#endif
+
+/* bind template */
+
+struct bind_temp {
+ object bt_var;
+ object bt_spp;
+ object bt_init;
+ object bt_aux;
+};
+
+
+#define check_symbol(x) \
+ if (type_of(x) != t_symbol) \
+ not_a_symbol(x)
+
+#define check_var(x) \
+ if (type_of(x) != t_symbol || \
+ (enum stype)(x)->s.s_stype == stp_constant) \
+ not_a_variable(x)
+
+
+#define eval_assign(to, form) \
+{ \
+ object *old_top = vs_top; \
+ \
+ eval(form); \
+ to = vs_base[0]; \
+ vs_top = old_top; \
+}
+
+
+#define MMcall(x) \
+ ihs_check; \
+ ihs_push(x); \
+ (*(x)->cf.cf_self)(); \
+ ihs_pop()
+
+#define MMccall(x, env_top) \
+ ihs_check; \
+ ihs_push(x); \
+ (*(x)->cc.cc_self)(env_top); \
+ ihs_pop()
+
+
+#define MMcons(a,d) make_cons((a),(d))
+
+
+#define MMcar(x) (x)->c.c_car
+#define MMcdr(x) (x)->c.c_cdr
+#define MMcaar(x) (x)->c.c_car->c.c_car
+#define MMcadr(x) (x)->c.c_cdr->c.c_car
+#define MMcdar(x) (x)->c.c_car->c.c_cdr
+#define MMcddr(x) (x)->c.c_cdr->c.c_cdr
+#define MMcaaar(x) (x)->c.c_car->c.c_car->c.c_car
+#define MMcaadr(x) (x)->c.c_cdr->c.c_car->c.c_car
+#define MMcadar(x) (x)->c.c_car->c.c_cdr->c.c_car
+#define MMcaddr(x) (x)->c.c_cdr->c.c_cdr->c.c_car
+#define MMcdaar(x) (x)->c.c_car->c.c_car->c.c_cdr
+#define MMcdadr(x) (x)->c.c_cdr->c.c_car->c.c_cdr
+#define MMcddar(x) (x)->c.c_car->c.c_cdr->c.c_cdr
+#define MMcdddr(x) (x)->c.c_cdr->c.c_cdr->c.c_cdr
+#define MMcaaaar(x) (x)->c.c_car->c.c_car->c.c_car->c.c_car
+#define MMcaaadr(x) (x)->c.c_cdr->c.c_car->c.c_car->c.c_car
+#define MMcaadar(x) (x)->c.c_car->c.c_cdr->c.c_car->c.c_car
+#define MMcaaddr(x) (x)->c.c_cdr->c.c_cdr->c.c_car->c.c_car
+#define MMcadaar(x) (x)->c.c_car->c.c_car->c.c_cdr->c.c_car
+#define MMcadadr(x) (x)->c.c_cdr->c.c_car->c.c_cdr->c.c_car
+#define MMcaddar(x) (x)->c.c_car->c.c_cdr->c.c_cdr->c.c_car
+#define MMcadddr(x) (x)->c.c_cdr->c.c_cdr->c.c_cdr->c.c_car
+#define MMcdaaar(x) (x)->c.c_car->c.c_car->c.c_car->c.c_cdr
+#define MMcdaadr(x) (x)->c.c_cdr->c.c_car->c.c_car->c.c_cdr
+#define MMcdadar(x) (x)->c.c_car->c.c_cdr->c.c_car->c.c_cdr
+#define MMcdaddr(x) (x)->c.c_cdr->c.c_cdr->c.c_car->c.c_cdr
+#define MMcddaar(x) (x)->c.c_car->c.c_car->c.c_cdr->c.c_cdr
+#define MMcddadr(x) (x)->c.c_cdr->c.c_car->c.c_cdr->c.c_cdr
+#define MMcdddar(x) (x)->c.c_car->c.c_cdr->c.c_cdr->c.c_cdr
+#define MMcddddr(x) (x)->c.c_cdr->c.c_cdr->c.c_cdr->c.c_cdr
+
+
+#define MMnull(x) ((x)==Cnil)
+
+
+/* the link_desc, is an INT which carries the call information
+ for all uses of that link. It tells whether fcall.nargs is
+ set before the call, whether the VFUN_FUN is set, (to pass in
+ a closure function) or if the number of values is set after the
+ call. It gives the min and max number of args and the result
+ type expected. It describes the arg types.
+ enum F_arg_flags
+
+
+*/
+
+/*
+A link arg descriptor:
+ a6a5a4a3a2a1a0rrmmmmmmfffllllll
+ l = least number of args passed
+ m = max number of args passed
+ f = flags bits set according to F_arg_flags, There are F_end flag bits.
+ r = result type in F_arg_types
+ ai = i'th arg type in F_arg_types
+*/
+
+/* We allow 2 bits for encoding arg types and return type */
+#define F_TYPE_WIDTH 2
+#define F_MIN_ARGS(x) (x & MASK_RANGE(0,F_NARG_WIDTH))
+#define F_NARGS(x) F_MIN_ARGS(x)
+#define F_ARG_FLAGS_P(x,flag) (x & (1 << (F_NARG_WIDTH + flag)))
+#define F_ARG_FLAGS(x) ((x >> F_NARG_WIDTH) & MASK_RANGE(0,F_end))
+#define F_MAX_ARGS(x) ((x >> (F_NARG_WIDTH + F_end )) \
+ & MASK_RANGE(0,F_NARG_WIDTH))
+
+#define BITS_PER_CHAR 8
+#define MAX_ARGS 63
+#define F_TYPES(x) (((x) >> F_START_TYPES_POS ) \
+ & MASK_RANGE(0, sizeof(int)*BITS_PER_CHAR - F_START_TYPES_POS))
+#define F_RESULT_TYPE(x) (F_TYPES(x) & MASK_RANGE(0,F_TYPE_WIDTH))
+#define F_ARG_LIMIT ((1<< F_NARG_WIDTH) -1)
+
+/* make an argd slot
+ where flags and argtypes are already set up as fields
+ */
+#define F_ARGD(min,max,flags, argtypes) \
+ (min | ((flags | (max-min ? (1<<F_requires_nargs) : 0) \
+ << F_NARG_WIDTH)) \
+ | (max << (F_NARG_WIDTH+F_end)) \
+ | (argtypes<< (2* F_NARG_WIDTH + F_end )))
+
+#define ONE_VAL (1 << F_caller_sets_one_val)
+#define CLOS (1 << F_requires_fun_passed)
+#define VARARG (1 << F_requires_nargs)
+ /* the following may be used as an argument to DEFUN even in the case
+ of varargs, since the F_ARGD macro detects minargs<maxargs and sets this.*/
+#define NONE 0
+
+/* we dont want to define all these two letter macros... all the time */
+
+#ifndef NO_DEFUN
+#define OO (F_object | F_object << F_TYPE_WIDTH)
+#define OI (F_object | F_int << F_TYPE_WIDTH)
+#define OD (F_object | F_double_ptr << F_TYPE_WIDTH)
+#define IO (F_int | F_object << F_TYPE_WIDTH)
+#define II (F_int | F_int << F_TYPE_WIDTH)
+#define ID (F_int | F_double_ptr << F_TYPE_WIDTH)
+#define DO (F_double_ptr | F_object << F_TYPE_WIDTH)
+#define DI (F_double_ptr | F_int << F_TYPE_WIDTH)
+#define DD (F_double_ptr | F_double_ptr << F_TYPE_WIDTH)
+#endif
+
+#define ARGTYPES(a,b,c,d) \
+ (a | (b << (2* F_TYPE_WIDTH)) | (c << (4* F_TYPE_WIDTH)) | (d << (6*F_TYPE_WIDTH)))
+
+
+#define PUSH_FIRST_VAL(x) int nvals = 1 ; object result = (x)
+#define PUSH_VAL(x) if (nvals>=sizeof(fcall.values)/sizeof(*fcall.values) \
+ FEerror("Too many function call values"); \
+ else fcall.values[nvals++] = (x)
+#define RETURN_VALS fcall.nvalues= nvals; return result;} 0
+
+#define FUNCALL(n,form) (VFUN_NARGS=n,form)
+
+/*
+ Copyright (C) 1994 M. Hagiya, W. Schelter, T. Yuasa
+
+This file is part of GNU Common Lisp, herein referred to as GCL
+
+GCL is free software; you can redistribute it and/or modify it under
+the terms of the GNU LIBRARY GENERAL PUBLIC LICENSE as published by
+the Free Software Foundation; either version 2, or (at your option)
+any later version.
+
+GCL is distributed in the hope that it will be useful, but WITHOUT
+ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
+License for more details.
+
+You should have received a copy of the GNU Library General Public License
+along with GCL; see the file COPYING. If not, write to the Free Software
+Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
+
+*/
+#ifndef COM_LENG
+#define COM_LENG
+#endif
+
+/* alloc.c */
+char *alloc_page();
+object alloc_object();
+void *malloc(size_t);
+void *realloc(void *,size_t);
+/* void * memalign(size_t,size_t); */
+void *alloc_contblock(size_t);
+void *alloc_relblock(size_t);
+/* object fSallocate_contiguous_pages(); */
+/* object fSallocate_relocatable_pages(); */
+
+/* array.c */
+/* enum aelttype Iarray_element_type(); */
+object fLrow_major_aref();
+object fSaset1();
+EXTER object sLarray_dimension_limit;
+EXTER object sLarray_total_size_limit;
+object fSmake_array1();
+/* object fSmake_vector1(); */
+
+/* assignment.c */
+/* object setf(); */
+
+
+
+/* backq.c */
+EXTER int backq_level;
+EXTER object sLlistA;
+EXTER object sLappend;
+EXTER object sLnconc;
+
+
+/* bds.c */
+
+/* big.c */
+object make_integer_clear();
+object stretch_big();
+object copy_big();
+object copy_to_big();
+object big_minus();
+object big_plus();
+object big_times();
+object normalize_big_to_object();
+double big_to_double();
+EXTER struct bignum big_fixnum1_body,big_fixnum2_body;
+EXTER object big_fixnum1,big_fixnum2;
+object maybe_replace_big();
+
+
+
+
+/* bind.c */
+EXTER object ANDoptional;
+EXTER object ANDrest;
+EXTER object ANDkey;
+EXTER object ANDallow_other_keys;
+EXTER object ANDaux;
+EXTER object sKallow_other_keys;
+object find_special();
+object let_bind();
+object letA_bind();
+
+/* block.c */
+
+/* cfun.c */
+object make_cfun();
+object MF();
+/* object MM(); */
+/* object make_function_internal(); */
+/* object make_si_function_internal(); */
+/* object make_special_form_internal(); */
+object make_macro();
+object make_cclosure_new();
+
+/* character.d */
+EXTER object STreturn;
+EXTER object STspace;
+EXTER object STrubout;
+EXTER object STpage;
+EXTER object STtab;
+EXTER object STbackspace;
+EXTER object STlinefeed;
+EXTER object STnewline;
+object coerce_to_character();
+
+/* catch.c */
+
+/* cmpaux.c */
+char object_to_char();
+char *object_to_string();
+float object_to_float();
+double object_to_double();
+
+/* error.c */
+EXTER object sKerror;
+EXTER object sKwrong_type_argument;
+EXTER object sKcatch;
+EXTER object sKprotect;
+EXTER object sKcatchall;
+EXTER object sKtoo_few_arguments;
+EXTER object sKtoo_many_arguments;
+EXTER object sKunexpected_keyword;
+EXTER object sKinvalid_form;
+EXTER object sKunbound_variable;
+EXTER object sKinvalid_variable;
+EXTER object sKundefined_function;
+EXTER object sKinvalid_function;
+EXTER object sKpackage_error;
+object wrong_type_argument();
+EXTER object sSuniversal_error_handler;
+
+/* eval.c */
+EXTER object sLapply;
+EXTER object sLfuncall;
+object simple_lispcall();
+object simple_lispcall_no_event();
+object simple_symlispcall();
+object simple_symlispcall_no_event();
+EXTER object Vevalhook;
+EXTER object Vapplyhook;
+object ieval();
+object ifuncall(object,int,...);
+object ifuncall1();
+object ifuncall2();
+object ifuncall3();
+object fcalln1(object,...);
+#define fcalln ((object (*)())fcalln1)
+object Ieval();
+object Imacro_expand1();
+
+/* unixfasl.c fasload.c */
+
+/* file.d */
+EXTER object sKabort;
+EXTER object sKappend;
+EXTER object sKcreate;
+EXTER object sKdefault;
+EXTER object sKdirection;
+EXTER object sKelement_type;
+EXTER object sKif_does_not_exist;
+EXTER object sKif_exists;
+EXTER object sKinput;
+EXTER object sKio;
+EXTER object sKnew_version;
+EXTER object sKoutput;
+EXTER object sKoverwrite;
+EXTER object sKprint;
+EXTER object sKprobe;
+EXTER object sKrename;
+EXTER object sKrename_and_delete;
+EXTER object sKset_default_pathname;
+EXTER object sKsupersede;
+EXTER object sKverbose;
+
+EXTER object sLAstandard_inputA;
+EXTER object sLAstandard_outputA;
+EXTER object sLAerror_outputA;
+EXTER object sLAquery_ioA;
+EXTER object sLAdebug_ioA;
+EXTER object sLAterminal_ioA;
+EXTER object sLAtrace_outputA;
+EXTER object terminal_io;
+EXTER object standard_io;
+
+EXTER object sLAload_verboseA;
+EXTER object FASL_string;
+/* object stream_element_type(); */
+object open_stream();
+/* object make_two_way_stream(); */
+/* object make_echo_stream(); */
+object make_string_input_stream();
+object make_string_output_stream();
+/* object get_output_stream_string(); */
+object read_fasl_data();
+
+#ifdef UNIX
+/* unixfsys.c */
+FILE *backup_fopen();
+#else
+/* filesystem.c */
+FILE *backup_fopen();
+#endif
+
+/* frame.c */
+frame_ptr frs_sch();
+frame_ptr frs_sch_catch();
+
+/* gbc.c */
+EXTER bool GBC_enable;
+
+/* let.c */
+
+/* lex.c */
+object assoc_eq();
+object lex_tag_sch();
+object lex_block_sch();
+
+/* list.d */
+EXTER object sKtest;
+EXTER object sKtest_not;
+EXTER object sKkey;
+EXTER object sKrev;
+object car();
+object cdr();
+object kar();
+object kdr();
+object caar();
+object cadr();
+object cdar();
+object cddr();
+object caaar();
+object caadr();
+object cadar();
+object caddr();
+object cdaar();
+object cdadr();
+object cddar();
+object cdddr();
+object caaaar();
+object caaadr();
+object caadar();
+object caaddr();
+object cadaar();
+object cadadr();
+object caddar();
+object cadddr();
+object cdaaar();
+object cdaadr();
+object cdadar();
+object cdaddr();
+object cddaar();
+object cddadr();
+object cdddar();
+object cddddr();
+object nth();
+object nthcdr();
+object make_cons();
+object list(int,...);
+object listA(int,...);
+object append();
+object copy_list();
+object make_list();
+object nconc();
+object sublis1();
+
+/* macros.c */
+EXTER object sLAmacroexpand_hookA;
+EXTER object sSdefmacroA;
+object macro_expand();
+
+/* main.c */
+EXTER char* system_directory;
+EXTER int ARGC;
+EXTER char **ARGV;
+void error();
+#ifdef UNIX
+EXTER char **ENVP;
+#endif
+object vs_overflow(void);
+
+EXTER object sSAsystem_directoryA;
+#ifdef UNIX
+EXTER char *kcl_self;
+#endif
+#if !defined(IN_MAIN) || !defined(ATT)
+EXTER bool initflag,raw_image;
+#endif
+char *merge_system_directory();
+
+
+EXTER object sLquote;
+
+EXTER object sLlambda;
+
+EXTER object sLlambda_block;
+EXTER object sLlambda_closure;
+EXTER object sLlambda_block_closure;
+
+EXTER object sLfunction;
+EXTER object sLmacro;
+EXTER object sLtag;
+EXTER object sLblock;
+
+
+/* mapfun.c */
+
+/* multival.c */
+
+/* number.c */
+EXTER object shortfloat_zero;
+EXTER object longfloat_zero;
+#define make_fixnum(a) ({fixnum _a=(a);((_a+SMALL_FIXNUM_LIMIT)&(-2*SMALL_FIXNUM_LIMIT))==0?small_fixnum(_a):make_fixnum1(_a);})
+object make_fixnum1(long);
+object make_ratio();
+object make_shortfloat();
+object make_longfloat();
+object make_complex();
+double number_to_double();
+long fixint(object);
+/* num_pred.c */
+
+/* num_comp.c */
+
+/* num_arith */
+object bignum2();
+object bignum3();
+/* object number_to_complex(); */
+object complex_plus();
+object number_plus();
+object number_negate();
+object number_minus();
+object number_times();
+object number_divide();
+object number_expt();
+object integer_divide1();
+object get_gcd();
+object get_lcm();
+object one_plus();
+object one_minus();
+object fixnum_add();
+object fixnum_sub();
+object new_bignum();
+
+/* num_co.c */
+object double_to_integer();
+
+/* num_log.c */
+object shift_integer();
+
+/* package.d */
+EXTER object lisp_package;
+EXTER object user_package;
+#ifdef ANSI_COMMON_LISP
+EXTER object common_lisp_package;
+#endif
+EXTER object keyword_package;
+EXTER object system_package;
+EXTER object sLApackageA;
+EXTER object sKinternal;
+EXTER object sKexternal;
+EXTER object sKinherited;
+EXTER object sKnicknames;
+EXTER object sKuse;
+EXTER int intern_flag;
+EXTER object uninterned_list;
+/* object make_package(); */
+/* object in_package(); */
+/* object rename_package(); */
+object find_package();
+/* object coerce_to_package(); */
+object current_package();
+object intern();
+object find_symbol();
+
+/* pathname.d */
+EXTER object Vdefault_pathname_defaults;
+EXTER object sKwild;
+EXTER object sKnewest;
+EXTER object sKstart;
+EXTER object sKend;
+EXTER object sKjunk_allowed;
+EXTER object sKhost;
+EXTER object sKdevice;
+EXTER object sKdirectory;
+EXTER object sKname;
+EXTER object sKtype;
+EXTER object sKversion;
+EXTER object sKdefaults;
+EXTER object sKroot;
+EXTER object sKcurrent;
+EXTER object sKparent;
+EXTER object sKper;
+/* object parse_namestring(); */
+object coerce_to_pathname();
+/* object default_device(); */
+object merge_pathnames();
+object namestring();
+object coerce_to_namestring();
+
+/* prediate.c */
+
+int eql(),equal(),eq();
+
+/* print.d */
+EXTER object sKupcase;
+EXTER object sKdowncase;
+EXTER object sKcapitalize;
+EXTER object sKstream;
+EXTER object sKreadably;
+EXTER object sKescape;
+EXTER object sKpretty;
+EXTER object sKcircle;
+EXTER object sKbase;
+EXTER object sKradix;
+EXTER object sKcase;
+EXTER object sKgensym;
+EXTER object sKlevel;
+EXTER object sKlength;
+EXTER object sKarray;
+EXTER object sLAprint_readablyA;
+EXTER object sLAprint_escapeA;
+EXTER object sLAprint_prettyA;
+EXTER object sLAprint_circleA;
+EXTER object sLAprint_baseA;
+EXTER object sLAprint_radixA;
+EXTER object sLAprint_caseA;
+EXTER object sLAprint_gensymA;
+EXTER object sLAprint_levelA;
+EXTER object sLAprint_lengthA;
+EXTER object sLAprint_arrayA;
+EXTER object *PRINTvs_top;
+EXTER object *PRINTvs_limit;
+EXTER object PRINTstream;
+EXTER bool PRINTreadably;
+EXTER bool PRINTescape;
+EXTER bool PRINTpretty;
+EXTER bool PRINTcircle;
+EXTER int PRINTbase;
+EXTER bool PRINTradix;
+EXTER object PRINTcase;
+EXTER bool PRINTgensym;
+EXTER int PRINTlevel;
+EXTER int PRINTlength;
+EXTER bool PRINTarray;
+EXTER void (*write_ch_fun)(int);
+object princ();
+object prin1();
+object print();
+object terpri();
+EXTER object sSpretty_print_format;
+EXTER int line_length;
+
+/* Read.d */
+EXTER object standard_readtable;
+EXTER object Vreadtable;
+EXTER object sLAread_default_float_formatA;
+EXTER object sLAread_baseA;
+EXTER object sLAread_suppressA;
+EXTER object READtable;
+EXTER object read_byte1();
+EXTER int READdefault_float_format;
+EXTER int READbase;
+EXTER bool READsuppress;
+EXTER object siSsharp_comma;
+EXTER bool escape_flag;
+EXTER object delimiting_char;
+EXTER bool detect_eos_flag;
+/* bool in_list_flag; */
+EXTER bool dot_flag;
+EXTER bool preserving_whitespace_flag;
+EXTER object default_dispatch_macro;
+EXTER object big_register_0;
+EXTER int sharp_eq_context_max;
+object read_char();
+object read_char1(object,object);
+object peek_char();
+/* object read_object_recursive(); */
+object read_object_non_recursive();
+object standard_read_object_non_recursive();
+object read_object();
+/* object parse_number(); */
+/* object parse_integer(); */
+/* object copy_readtable(); */
+/* object current_readtable(); */
+/* object patch_sharp(); */
+object read_fasl_vector();
+
+/* fasdump.c */
+EXTER object sharing_table;
+
+/* reference.c */
+object symbol_function();
+
+
+/* sequence.d */
+object alloc_simple_vector();
+object alloc_simple_bitvector();
+object elt();
+object elt_set();
+object reverse();
+object nreverse();
+
+/* structure.c */
+EXTER object sSs_data;
+object structure_ref();
+object structure_set();
+object structure_to_list();
+
+/* string.d */
+object alloc_simple_string();
+object make_simple_string();
+object copy_simple_string();
+object coerce_to_string();
+EXTER int string_sign, string_boundary;
+
+/* symbol.d */
+EXTER object string_register;
+EXTER object gensym_prefix;
+/* EXTER int gensym_counter; */
+EXTER object sLgensym_counter;
+EXTER object gentemp_prefix;
+EXTER int gentemp_counter;
+EXTER object token;
+object make_symbol();
+object make_ordinary();
+object make_special();
+object make_constant();
+object make_si_ordinary();
+object make_si_special();
+object make_si_constant();
+object make_keyword();
+object symbol_value();
+object symbol_name();
+object getf();
+object get();
+object putf();
+object putprop();
+object sputprop();
+object remprop();
+object gensym(); /* to be deleted */
+
+#ifdef UNIX
+/* unixsys.c */
+#else
+/* sys.c */
+#endif
+
+#ifdef UNIX
+/* unixtime.c */
+object unix_time_to_universal_time();
+#else
+/* time.c */
+#endif
+
+/* toplevel.c */
+EXTER object sLspecial,sLdeclare;
+EXTER object sSvariable_documentation;
+EXTER object sSfunction_documentation;
+
+/* typespec.c */
+EXTER object sLcommon,sLnull,sLcons,sLlist,sLsymbol,sLarray,sLvector,sLbit_vector,sLstring;
+EXTER object sLsequence,sLsimple_array,sLsimple_vector,sLsimple_bit_vector,sLsimple_string;
+EXTER object sLcompiled_function,sLpathname,sLcharacter,sLnumber,sLrational,sLfloat,sLstring_char;
+EXTER object sLinteger,sLratio,sLshort_float,sLstandard_char,sLfixnum,sLpositive_fixnum, sLcomplex;
+EXTER object sLsingle_float,sLpackage,sLbignum,sLrandom_state,sLdouble_float,sLstream,sLbit,sLreadtable;
+EXTER object sLlong_float,sLhash_table,sLstructure,sLboolean;
+
+#ifdef ANSI_COMMON_LISP
+/* new ansi types */
+EXTER object sLarithmetic_error,sLbase_char,sLbase_string,sLbroadcast_stream,sLbuilt_in_class;
+EXTER object sLcell_error,sLclass,sLconcatenated_stream,sLcondition,sLcontrol_error,sLdivision_by_zero;
+EXTER object sLecho_stream,sLend_of_file,sLerror,sLextended_char,sLfile_error,sLfile_stream;
+EXTER object sLfloating_point_inexact,sLfloating_point_invalid_operation,sLfloating_point_overflow;
+EXTER object sLfloating_point_underflow,sLgeneric_function,sLlogical_pathname,sLmethod,sLpackage_error;
+EXTER object sLparse_error,sLprint_not_readable,sLprogram_error,sLreader_error,sLserious_condition;
+EXTER object sLsimple_base_string,sLsimple_condition,sLsimple_type_error,sLsimple_warning,sLstandard_class;
+EXTER object sLstandard_generic_function,sLstandard_method,sLstandard_object,sLstorage_condition;
+EXTER object sLstream_error,sLstring_stream,sLstructure_class,sLstyle_warning,sLsynonym_stream;
+EXTER object sLtwo_way_stream,sLtype_error,sLunbound_slot,sLunbound_variable,sLundefined_function,sLwarning;
+EXTER object sLmethod_combination,sLstructure_object;
+#endif
+
+EXTER object sLsatisfies;
+EXTER object sLmember;
+EXTER object sLnot;
+EXTER object sLor;
+EXTER object sLand;
+EXTER object sLvalues;
+EXTER object sLmod;
+EXTER object sLsigned_byte;
+EXTER object sLunsigned_byte;
+EXTER object sLsigned_char;
+EXTER object sLunsigned_char;
+EXTER object sLsigned_short;
+EXTER object sLunsigned_short;
+EXTER object sLA;
+EXTER object sLplusp;
+EXTER object TSor_symbol_string;
+EXTER object TSor_string_symbol;
+EXTER object TSor_symbol_string_package;
+EXTER object TSnon_negative_integer;
+EXTER object TSpositive_number;
+EXTER object TSor_integer_float;
+EXTER object TSor_rational_float;
+#ifdef UNIX
+EXTER object TSor_pathname_string_symbol;
+#endif
+EXTER object TSor_pathname_string_symbol_stream;
+
+EXTER int interrupt_flag; /* console interupt flag */
+EXTER int interrupt_enable; /* console interupt enable */
+
+/* CMPtemp */
+EXTER object CMPtemp;
+EXTER object CMPtemp1;
+EXTER object CMPtemp2;
+EXTER object CMPtemp3;
+
+EXTER object sLAlink_arrayA;
+
+/* nfunlink.c */
+object Icall_proc();
+float Icall_proc_float();
+/* object Icall_proc(); */
+float Icall_proc_float();
+object ImakeStructure();
+object list_vector();
+object list_vector_new();
+object Iapply_ap();
+object IisFboundp();
+object IapplyVector();
+object c_apply_n();
+EXTER object sSPmemory;
+EXTER object sSPinit;
+object sLfset();
+object MakeAfun();
+extern object Cstd_key_defaults[];
+extern object call_proc0();
+/* extern object call_proc(); */
+/* extern object call_vproc(); */
+object fLrow_major_aref();
+object Icheck_one_type();
+
+/* utils.c */
+object Iis_fixnum();
+object Iapply_fun_n(object,int,int,...);
+object Iapply_fun_n1(object (*)(),int,int,...);
+object Iapply_fun_n2(object,int,int,...);
+object Ifuncall_n(object,int,...);
+object Ivs_values();
+object Icheck_one_type();
+object fSincorrect_type();
+EXTER object fLbye (fixnum exitc);
+EXTER object fLquit (fixnum exitc);
+EXTER object sSAno_initA;
+EXTER object fLidentity (object x0);
+EXTER object fSgcl_compile_time (void);
+EXTER object fSldb1 (fixnum a,fixnum b, fixnum c);
+EXTER object fLlisp_implementation_version (void);
+EXTER object sSAlisp_maxpagesA;
+EXTER object sSAsystem_directoryA;
+EXTER object sSAmultiply_stacksA;
+EXTER object sStop_level;
+EXTER object sSAcommand_argsA;
+EXTER object sSAafter_gbc_hookA;
+EXTER object sSAignore_maximum_pagesA;
+EXTER object sSAoptimize_maximum_pagesA;
+EXTER object sSAnotify_optimize_maximum_pagesA;
+EXTER object fSallocated (object typ);
+EXTER object fSreset_number_used (object typ);
+EXTER object fSstaticp (object x);
+EXTER object fSallocate_sgc (object type,fixnum min,fixnum max,fixnum free_percent);
+EXTER object fSallocate_growth (object type,fixnum min,fixnum max,fixnum percent,fixnum percent_free);
+EXTER object fSallocate_contiguous_pages (fixnum npages,...);
+EXTER object fSallocated_contiguous_pages (void);
+EXTER object fSmaximum_contiguous_pages (void);
+EXTER object fSallocate_relocatable_pages (fixnum npages,...);
+EXTER object fSallocate (object type,fixnum npages,...);
+EXTER object fSallocated_relocatable_pages (void);
+EXTER object fSget_hole_size (void);
+EXTER object fSset_hole_size (fixnum npages,...);
+EXTER object fLgbc (object x0);
+EXTER object sSAnotify_gbcA;
+EXTER object sSAgbc_messageA;
+EXTER object sLcommon;
+EXTER object sLnull;
+EXTER object sLcons;
+EXTER object sLlist;
+EXTER object sLsymbol;
+EXTER object sLarray;
+EXTER object sLvector;
+EXTER object sLbit_vector;
+EXTER object sLstring;
+EXTER object sLsequence;
+EXTER object sLsimple_array;
+EXTER object sLsimple_vector;
+EXTER object sLsimple_bit_vector;
+EXTER object sLsimple_string;
+EXTER object sLfunction;
+EXTER object sLcompiled_function;
+EXTER object sLpathname;
+EXTER object sLcharacter;
+EXTER object sLnumber;
+EXTER object sLrational;
+EXTER object sLfloat;
+EXTER object sLstring_char;
+EXTER object sLinteger;
+EXTER object sLratio;
+EXTER object sLshort_float;
+EXTER object sLstandard_char;
+EXTER object sLboolean;
+EXTER object sLfixnum;
+EXTER object sLpositive_fixnum;
+EXTER object sLcomplex;
+EXTER object sLsingle_float;
+EXTER object sLpackage;
+EXTER object sLbignum;
+EXTER object sLrandom_state;
+EXTER object sLdouble_float;
+EXTER object sLstream;
+EXTER object sLbit;
+EXTER object sLreadtable;
+EXTER object sLlong_float;
+EXTER object sLhash_table;
+EXTER object sLkeyword;
+EXTER object sLstructure;
+EXTER object sLsatisfies;
+EXTER object sLmember;
+EXTER object sLnot;
+EXTER object sLor;
+EXTER object sLand;
+EXTER object sLvalues;
+EXTER object sLmod;
+EXTER object sLsigned_byte;
+EXTER object sLunsigned_byte;
+EXTER object sLsigned_char;
+EXTER object sLunsigned_char;
+EXTER object sLsigned_short;
+EXTER object sLunsigned_short;
+EXTER object sLA;
+EXTER object sLplusp;
+EXTER object sSchar_size;
+EXTER object sSshort_size;
+EXTER object fLfuncall (object fun,...);
+EXTER object fLapply (object fun,...);
+EXTER object fLeval (object x0);
+EXTER object fLconstantp (object x0);
+EXTER object sSlambda_block_expanded;
+EXTER object sSAbreak_pointsA;
+EXTER object sSAbreak_stepA;
+EXTER object fLmacroexpand (object form,...);
+EXTER object sLfuncall;
+EXTER object sLAmacroexpand_hookA;
+EXTER object sSdefmacroA;
+EXTER object sSAinhibit_macro_specialA;
+EXTER object fLnull (object x0);
+EXTER object fLnot (object x0);
+EXTER object fLsymbolp (object x0);
+EXTER object fLatom (object x0);
+EXTER object fLconsp (object x0);
+EXTER object fLlistp (object x0);
+EXTER object fLnumberp (object x0);
+EXTER object fLintegerp (object x0);
+EXTER object fLrationalp (object x0);
+EXTER object fLrealp (object x0);
+EXTER object fLfloatp (object x0);
+EXTER object fLcomplexp (object x0);
+EXTER object fLcharacterp (object x0);
+EXTER object fLstringp (object x0);
+EXTER object fLbit_vector_p (object x0);
+EXTER object fLvectorp (object x0);
+EXTER object fLsimple_string_p (object x0);
+EXTER object fLsimple_bit_vector_p (object x0);
+EXTER object fLsimple_vector_p (object x0);
+EXTER object fLarrayp (object x0);
+EXTER object fLpackagep (object x0);
+EXTER object fLfunctionp (object x0);
+EXTER object fLcompiled_function_p (object x0);
+EXTER object fLcommonp (object x0);
+EXTER object fLeq (object x0,object x1);
+EXTER object fLeql (object x0,object x1);
+EXTER object fLequal (object x0,object x1);
+EXTER object fLequalp (object x0,object x1);
+EXTER object fScontains_sharp_comma (object x0);
+EXTER object fSspicep (object x0);
+EXTER object fSfixnump (object x0);
+EXTER object fLset (object symbol,object value);
+EXTER object fSfset (object sym,object function);
+EXTER object fLmakunbound (object sym);
+EXTER object fLfmakunbound (object sym);
+EXTER object sSclear_compiler_properties;
+EXTER object fSclear_compiler_properties (object x0,object x1);
+EXTER object sLaref;
+EXTER object sLcar;
+EXTER object sLcdr;
+EXTER object sLchar;
+EXTER object sLdecf;
+EXTER object sLelt;
+EXTER object sLfill_pointer;
+EXTER object sLget;
+EXTER object sLgetf;
+EXTER object sLgethash;
+EXTER object sLincf;
+EXTER object sLpop;
+EXTER object sLpush;
+EXTER object sLschar;
+EXTER object sLsetf;
+EXTER object sSsetf_lambda;
+EXTER object sSstructure_access;
+EXTER object sLsvref;
+EXTER object sStraced;
+EXTER object sLvector;
+EXTER object sKallow_other_keys;
+EXTER object fSerror_set (volatile object x0);
+EXTER object sLgensym_counter;
+EXTER object fSmc (object name,object address);
+EXTER object fSmfsfun (object name,object address,object argd);
+EXTER object fSmfvfun (object name,object address,object argd);
+EXTER object fSmfvfun_key (object symbol,object address,object argd,object keys);
+EXTER object fSmf (object name,object addr);
+EXTER object fSmm (object name,object addr);
+EXTER object fScompiled_function_name (object fun);
+EXTER object fSturbo_closure (object funobj);
+EXTER object fSspecialp (object sym);
+EXTER object sSdebug;
+EXTER object fSdefvar1 (object sym,object val,...);
+EXTER object fSdebug (object sym,object val);
+EXTER object fSsetvv (object index,object val);
+EXTER object sSPmemory;
+EXTER object sSPinit;
+EXTER object fSinit_cmp_anon (void);
+EXTER object fSfind_init_name (object namestring);
+EXTER object sKexternal;
+EXTER object sKinherited;
+EXTER object sKinternal;
+EXTER object sKnicknames;
+EXTER object sKuse;
+EXTER object sLApackageA;
+EXTER object fSset_gmp_allocate_relocatable (object flag);
+EXTER object fSallocate_bigger_fixnum_range (fixnum min,fixnum max);
+EXTER object fScmod (object num);
+EXTER object fScplus (object x0,object x1);
+EXTER object fSctimes (object x0,object x1);
+EXTER object fScdifference (object x0,object x1);
+EXTER object fLnth (fixnum index,object list);
+EXTER object fLfirst (object x);
+EXTER object fLsecond (object x);
+EXTER object fLthird (object x);
+EXTER object fLfourth (object x);
+EXTER object fLfifth (object x);
+EXTER object fLsixth (object x);
+EXTER object fLseventh (object x);
+EXTER object fLeighth (object x);
+EXTER object fLninth (object x);
+EXTER object fLtenth (object x);
+EXTER object fSnext_hash_table_entry (object table,object ind);
+EXTER object fLhash_table_test (object table);
+EXTER object fLhash_table_size (object table);
+EXTER object sLarray_rank_limit;
+EXTER object sLarray_dimension_limit;
+EXTER object sLarray_total_size_limit;
+EXTER object sLbit;
+EXTER object fLaref (object x,fixnum i, ...);
+EXTER object fLsvref (object x,ufixnum i);
+EXTER object fLrow_major_aref (object x,fixnum i);
+EXTER object fSaset1 (object x, fixnum i,object val);
+EXTER object fSaset (object x,object ii,object y, ...);
+EXTER object fSsvset (object x,fixnum i,object val);
+EXTER object fSmake_vector1 (fixnum n,fixnum elt_type,object staticp,...);
+EXTER object fSget_aelttype (object x);
+EXTER object fSmake_vector (object x0,object x1,object x2,object x3,object x4,object x5,object x6,...);
+EXTER object fSmake_array1 (fixnum elt_type,object staticp,object initial_element,object displaced_to,fixnum displaced_index_offset, object dimensions);
+EXTER object fScopy_array_portion (object x,object y,fixnum i1,fixnum i2,object n1o);
+EXTER object fSfill_pointer_set (object x,fixnum i);
+EXTER object fLfill_pointer (object x);
+EXTER object fLarray_has_fill_pointer_p (object x);
+EXTER object fLarray_element_type (object x);
+EXTER object fLadjustable_array_p (object x);
+EXTER object fSdisplaced_array_p (object x);
+EXTER object fLarray_rank (object x);
+EXTER object fLarray_dimension (object x,fixnum i);
+EXTER object fSreplace_array (object old,object new);
+EXTER object fLarray_total_size (object x);
+EXTER object fSaset_by_cursor (object array,object val,object cursor);
+EXTER object sSAmatch_dataA;
+EXTER object sSAcase_fold_searchA;
+EXTER object fSmatch_beginning (fixnum i);
+EXTER object fSmatch_end (fixnum i);
+EXTER object fScompile_regexp (object p);
+EXTER object fSstring_match (object pattern,object string,...);
+EXTER object sSs_data;
+EXTER object sLcompile;
+EXTER object sKcompile_toplevel;
+EXTER object sLdeclare;
+EXTER object sLeval;
+EXTER object sKexecute;
+EXTER object sSfunction_documentation;
+EXTER object sLload;
+EXTER object sKload_toplevel;
+EXTER object sLprogn;
+EXTER object sLtypep;
+EXTER object sLvalues;
+EXTER object sSvariable_documentation;
+EXTER object sLwarn;
+EXTER object sSAallow_gzipped_fileA;
+EXTER object sSAcollect_binary_modulesA;
+EXTER object sSAbinary_modulesA;
+EXTER object sKmyaddr;
+EXTER object sKmyport;
+EXTER object sKasync;
+EXTER object sKhost;
+EXTER object sKserver;
+EXTER object sKdaemon;
+EXTER object sKpersistent;
+EXTER object sSsocket;
+EXTER object sLAstandard_inputA;
+EXTER object sLAstandard_outputA;
+EXTER object sLAerror_outputA;
+EXTER object sLAterminal_ioA;
+EXTER object sLAquery_ioA;
+EXTER object sLAdebug_ioA;
+EXTER object sLAtrace_outputA;
+EXTER object sSAignore_eof_on_terminal_ioA;
+EXTER object sSAload_pathnameA;
+EXTER object sLAload_verboseA;
+EXTER object sKabort;
+EXTER object sKappend;
+EXTER object sKcreate;
+EXTER object sKdefault;
+EXTER object sKdirection;
+EXTER object sKelement_type;
+EXTER object sKerror;
+EXTER object sKif_does_not_exist;
+EXTER object sKif_exists;
+EXTER object sKinput;
+EXTER object sKio;
+EXTER object sKnew_version;
+EXTER object sKoutput;
+EXTER object sKoverwrite;
+EXTER object sKprint;
+EXTER object sKprobe;
+EXTER object sKrename;
+EXTER object sKrename_and_delete;
+EXTER object sKset_default_pathname;
+EXTER object sKsupersede;
+EXTER object sKverbose;
+EXTER object sLAread_default_float_formatA;
+EXTER object sLAread_baseA;
+EXTER object sLAread_suppressA;
+EXTER object sSY;
+EXTER object sSYB;
+EXTER object sSYZ;
+EXTER object sLlistA;
+EXTER object sLappend;
+EXTER object sLnconc;
+EXTER object sLapply;
+EXTER object sLvector;
+EXTER object sKupcase;
+EXTER object sKdowncase;
+EXTER object sKcapitalize;
+EXTER object sKstream;
+EXTER object sKescape;
+EXTER object sKreadably;
+EXTER object sKpretty;
+EXTER object sKcircle;
+EXTER object sKbase;
+EXTER object sKradix;
+EXTER object sKcase;
+EXTER object sKgensym;
+EXTER object sKlevel;
+EXTER object sKlength;
+EXTER object sKarray;
+EXTER object sLAprint_escapeA;
+EXTER object sLAprint_readablyA;
+EXTER object sLAprint_prettyA;
+EXTER object sLAprint_circleA;
+EXTER object sLAprint_baseA;
+EXTER object sLAprint_radixA;
+EXTER object sLAprint_caseA;
+EXTER object sLAprint_gensymA;
+EXTER object sLAprint_levelA;
+EXTER object sLAprint_lengthA;
+EXTER object sLAprint_arrayA;
+EXTER object sSAprint_packageA;
+EXTER object sSAprint_structureA;
+EXTER object sSpretty_print_format;
+EXTER object sSAprint_nansA;
+EXTER object fLformat (object strm, object control,...);
+EXTER object sSAindent_formatted_outputA;
+EXTER object sKdirectory;
+EXTER object sKlink;
+EXTER object sKfile;
+EXTER object fSstat (object path);
+EXTER object fSsetenv (object variable,object value);
+EXTER object fLdelete_file (object path);
+EXTER object fLerror (object fmt_string,...);
+EXTER object fLspecific_error (object error_name,object fmt_string,...);
+EXTER object fLspecific_correctable_error (object error_name,object fmt_string,...);
+EXTER object fLcerror (object continue_fmt_string,object fmt_string,...);
+EXTER object fSihs_top (void);
+EXTER object fSihs_fun (object x0);
+EXTER object fSihs_vs (object x0);
+EXTER object fSfrs_top (void);
+EXTER object fSfrs_vs (object x0);
+EXTER object fSfrs_bds (object x0);
+EXTER object fSfrs_class (object x0);
+EXTER object fSfrs_tag (object x0);
+EXTER object fSfrs_ihs (object x0);
+EXTER object fSbds_top (void);
+EXTER object fSbds_var (object x0);
+EXTER object fSbds_val (object x0);
+EXTER object fSvs_top (void);
+EXTER object fSvs (object x0);
+EXTER object fSsch_frs_base (object x0,object x1);
+EXTER object fSinternal_super_go (object tag,object x1,object x2);
+EXTER object sSuniversal_error_handler;
+EXTER object fSuniversal_error_handler (object x0,object x1,object x2,object x3,object error_fmt_string);
+EXTER object sSterminal_interrupt;
+EXTER object sKwrong_type_argument;
+EXTER object sKtoo_few_arguments;
+EXTER object sKtoo_many_arguments;
+EXTER object sKunexpected_keyword;
+EXTER object sKinvalid_form;
+EXTER object sKunbound_variable;
+EXTER object sKinvalid_variable;
+EXTER object sKundefined_function;
+EXTER object sKinvalid_function;
+EXTER object sKpackage_error;
+EXTER object sKcatch;
+EXTER object sKprotect;
+EXTER object sKcatchall;
+EXTER object fLget_universal_time (void);
+EXTER object fSgettimeofday (void);
+EXTER object fLget_internal_real_time (void);
+EXTER object sSAdefault_time_zoneA;
+EXTER object fSgetpid (void);
+EXTER object sSAload_with_freadA;
+EXTER object fSuse_fast_links (object flag,...);
+EXTER object sScdefn;
+EXTER object sLAlink_arrayA;
+EXTER object fSprofile (object start_address,object scale);
+EXTER object fSfunction_start (object funobj);
+EXTER object fSset_up_combined (object first,...);
+EXTER object fSdisplay_profile (object start_addr,object scal);
+EXTER object fSarray_adress (object array);
+EXTER object sSAprofile_arrayA;
+EXTER object sSAinterrupt_enableA;
+EXTER object sSsigusr1_interrupt;
+EXTER object sSsigio_interrupt;
+EXTER object sSsignal_safety_required (fixnum signo,fixnum safety);
+EXTER object fSallow_signal (fixnum n);
+EXTER object fSinitfun (object sym,object addr_ind,object argd,...);
+EXTER object fSinitmacro (object first,...);
+EXTER object fSset_key_struct (object key_struct_ind);
+EXTER object fSinvoke (object x);
+EXTER object fSopen_named_socket (fixnum port);
+EXTER object fSclose_fd (fixnum fd);
+EXTER object fSclose_sfd (object sfd);
+EXTER object fSaccept_socket_connection (object named_socket);
+EXTER object fShostname_to_hostid (object host);
+EXTER object fSgethostname (void);
+EXTER object fShostid_to_hostname (object host_id);
+EXTER object fScheck_fd_for_input (fixnum fd,fixnum timeout);
+EXTER object fSclear_connection (fixnum fd);
+EXTER object fSconnection_state_fd (object sfd);
+EXTER object fSour_write (object sfd,object buffer,fixnum nbytes);
+EXTER object fSour_read_with_offset (object fd,object buffer,fixnum offset,fixnum nbytes,fixnum timeout);
+EXTER object fSprint_to_string1 (object str,object x,object the_code);
+EXTER object fSset_sigio_for_fd (fixnum fd);
+EXTER object fSreset_string_input_stream (object strm,object string,fixnum start,fixnum end);
+EXTER object fScheck_state_input (object osfd,fixnum timeout);
+EXTER object fSclear_connection_state (object osfd);
+EXTER object fSgetpeername (object sock);
+EXTER object fSgetsockname (object sock);
+EXTER object fSset_blocking (object sock,object setBlocking);
+EXTER object sSAreadline_prefixA;
+/* if already mp.h has been included skip */
+#ifdef GMP
+#define save_avma
+#define restore_avma
+#endif
+
+#ifdef _MP_H
+#ifdef GMP
+
+#else /* no gmp */
+
+typedef plong *GEN1;
+/* if genpari.h not loaded */
+#ifndef MAXBLOC
+typedef plong *GEN;
+GEN1 addii(),mulii(),mulsi(),powerii(),shifti(),stoi(),dvmdii(),subii();
+int cmpii();
+plong itos();
+#define signe(x) (((GEN1)(x))[1]>>24)
+#define lg(x) (((GEN1)(x))[0]&0xffff)
+#define setlg(x,s) (((GEN1)(x))[0]=(((GEN1)(x))[0]&0xffff0000)+s)
+#define lgef(x) (((GEN1)(x))[1]&0xffff)
+#define setlgef(x,s) (((GEN1)(x))[1]=(((GEN1)(x))[1]&0xffff0000)+s)
+
+#define our_ulong unsigned plong
+#endif /* end MAXBLOC */
+
+
+EXTER int in_saved_avma ;
+EXTER unsigned plong avma;
+EXTER GEN1 gzero;
+EXTER GEN1 icopy_x;
+/* #define DEBUG_AVMA */
+
+#ifdef DEBUG_AVMA
+#define save_avma long lvma = (in_saved_avma = 1, avma)
+#define restore_avma avma = (in_saved_avma = 0, lvma)
+#else
+#define save_avma long lvma = avma
+#define restore_avma avma = lvma
+#endif
+
+#endif /* NO GMP */
+#endif /* _MP_H */
+
+ /* copy x to y, increasing space by factor of 2 */
+object make_integer();
+
+#define Mcar(x) (x)->c.c_car
+#define Mcdr(x) (x)->c.c_cdr
+#define Mcaar(x) (x)->c.c_car->c.c_car
+#define Mcadr(x) (x)->c.c_cdr->c.c_car
+#define Mcdar(x) (x)->c.c_car->c.c_cdr
+#define Mcddr(x) (x)->c.c_cdr->c.c_cdr
+#define Mcaaar(x) (x)->c.c_car->c.c_car->c.c_car
+#define Mcaadr(x) (x)->c.c_cdr->c.c_car->c.c_car
+#define Mcadar(x) (x)->c.c_car->c.c_cdr->c.c_car
+#define Mcaddr(x) (x)->c.c_cdr->c.c_cdr->c.c_car
+#define Mcdaar(x) (x)->c.c_car->c.c_car->c.c_cdr
+#define Mcdadr(x) (x)->c.c_cdr->c.c_car->c.c_cdr
+#define Mcddar(x) (x)->c.c_car->c.c_cdr->c.c_cdr
+#define Mcdddr(x) (x)->c.c_cdr->c.c_cdr->c.c_cdr
+#define Mcaaaar(x) (x)->c.c_car->c.c_car->c.c_car->c.c_car
+#define Mcaaadr(x) (x)->c.c_cdr->c.c_car->c.c_car->c.c_car
+#define Mcaadar(x) (x)->c.c_car->c.c_cdr->c.c_car->c.c_car
+#define Mcaaddr(x) (x)->c.c_cdr->c.c_cdr->c.c_car->c.c_car
+#define Mcadaar(x) (x)->c.c_car->c.c_car->c.c_cdr->c.c_car
+#define Mcadadr(x) (x)->c.c_cdr->c.c_car->c.c_cdr->c.c_car
+#define Mcaddar(x) (x)->c.c_car->c.c_cdr->c.c_cdr->c.c_car
+#define Mcadddr(x) (x)->c.c_cdr->c.c_cdr->c.c_cdr->c.c_car
+#define Mcdaaar(x) (x)->c.c_car->c.c_car->c.c_car->c.c_cdr
+#define Mcdaadr(x) (x)->c.c_cdr->c.c_car->c.c_car->c.c_cdr
+#define Mcdadar(x) (x)->c.c_car->c.c_cdr->c.c_car->c.c_cdr
+#define Mcdaddr(x) (x)->c.c_cdr->c.c_cdr->c.c_car->c.c_cdr
+#define Mcddaar(x) (x)->c.c_car->c.c_car->c.c_cdr->c.c_cdr
+#define Mcddadr(x) (x)->c.c_cdr->c.c_car->c.c_cdr->c.c_cdr
+#define Mcdddar(x) (x)->c.c_car->c.c_cdr->c.c_cdr->c.c_cdr
+#define Mcddddr(x) (x)->c.c_cdr->c.c_cdr->c.c_cdr->c.c_cdr
+
+/* for cmp */
+
+#define CMPcar(x) (x)->c.c_car
+#define CMPcdr(x) (x)->c.c_cdr
+#define CMPcaar(x) (x)->c.c_car->c.c_car
+#define CMPcadr(x) (x)->c.c_cdr->c.c_car
+#define CMPcdar(x) (x)->c.c_car->c.c_cdr
+#define CMPcddr(x) (x)->c.c_cdr->c.c_cdr
+#define CMPcaaar(x) (x)->c.c_car->c.c_car->c.c_car
+#define CMPcaadr(x) (x)->c.c_cdr->c.c_car->c.c_car
+#define CMPcadar(x) (x)->c.c_car->c.c_cdr->c.c_car
+#define CMPcaddr(x) (x)->c.c_cdr->c.c_cdr->c.c_car
+#define CMPcdaar(x) (x)->c.c_car->c.c_car->c.c_cdr
+#define CMPcdadr(x) (x)->c.c_cdr->c.c_car->c.c_cdr
+#define CMPcddar(x) (x)->c.c_car->c.c_cdr->c.c_cdr
+#define CMPcdddr(x) (x)->c.c_cdr->c.c_cdr->c.c_cdr
+#define CMPcaaaar(x) (x)->c.c_car->c.c_car->c.c_car->c.c_car
+#define CMPcaaadr(x) (x)->c.c_cdr->c.c_car->c.c_car->c.c_car
+#define CMPcaadar(x) (x)->c.c_car->c.c_cdr->c.c_car->c.c_car
+#define CMPcaaddr(x) (x)->c.c_cdr->c.c_cdr->c.c_car->c.c_car
+#define CMPcadaar(x) (x)->c.c_car->c.c_car->c.c_cdr->c.c_car
+#define CMPcadadr(x) (x)->c.c_cdr->c.c_car->c.c_cdr->c.c_car
+#define CMPcaddar(x) (x)->c.c_car->c.c_cdr->c.c_cdr->c.c_car
+#define CMPcadddr(x) (x)->c.c_cdr->c.c_cdr->c.c_cdr->c.c_car
+#define CMPcdaaar(x) (x)->c.c_car->c.c_car->c.c_car->c.c_cdr
+#define CMPcdaadr(x) (x)->c.c_cdr->c.c_car->c.c_car->c.c_cdr
+#define CMPcdadar(x) (x)->c.c_car->c.c_cdr->c.c_car->c.c_cdr
+#define CMPcdaddr(x) (x)->c.c_cdr->c.c_cdr->c.c_car->c.c_cdr
+#define CMPcddaar(x) (x)->c.c_car->c.c_car->c.c_cdr->c.c_cdr
+#define CMPcddadr(x) (x)->c.c_cdr->c.c_car->c.c_cdr->c.c_cdr
+#define CMPcdddar(x) (x)->c.c_car->c.c_cdr->c.c_cdr->c.c_cdr
+#define CMPcddddr(x) (x)->c.c_cdr->c.c_cdr->c.c_cdr->c.c_cdr
+#define CMPfuncall funcall
+#define Creturn(v) return((vs_top=vs,(v)))
+/* end for cmp*/
+
+/* 2^6 is the limit on the number of args */
+#define F_NARG_WIDTH 6
+#define F_START_TYPES_POS (2* F_NARG_WIDTH + F_end )
+enum F_arg_flags
+{ F_requires_nargs, /* if set, then caller must store VFUN_NARGS with number
+ of args passed. F_ARGD is used to set up the argd,
+ and it sets this if minargs < maxargs. */
+ F_caller_sets_one_val, /* If set, then the CALLER will look after setting the
+ fcall.nvalues to 1, if necessary (eg the call is at the
+ end of a function, or if multiple-values-list invokes
+ the function.) If foo is proclaimed to return exactly
+ one value, then the CALLER might set this flag in the
+ link argd, or it might do it in the case we have (setq
+ x (foo)) or (values (foo)).
+
+ If this flag is not set, then the CALLED function is
+ responsible for setting the number of values in
+ fcall.nvalues, and also for always returning as C value
+ Cnil, in the case that it sets fcall.nvalues == 0. */
+ F_requires_fun_passed, /* if set, the caller must set VFUN_FUN to the
+ calling function. This is used by closures, but
+ could be used by other things i suppose. */
+ F_end /* 1 bigger than the largest flag */
+ };
+enum F_arg_types
+{ F_object,
+ F_int,
+ F_double_ptr,
+ F_shortfloat
+ };
+
+/* Make a mask for bits i < j, masking j-i bits */
+#define MASK_RANGE(i,j) ((~(~0 << (j-i)))<< i)
+
+#define F_PLAIN(x) (((x) & MASK_RANGE( F_START_TYPES_POS,31)) == 0)
+#define ARG_LIMIT 63
+
+EXTER object MVloc[10];
+
+#define TYPEP(x,t) (type_of(x) == (t))
+
+
+#ifdef HAVE_ALLOCA
+/* #ifndef alloca */
+/* char *alloca(); */
+/* #endif */
+#include <stdlib.h>
+EXTER char *alloca_val;
+#define OUR_ALLOCA(n) alloca(n)
+#define ALLOCA_FREE(n)
+
+#define ALLOCA_CONS(n) (alloca_val=alloca((n)*sizeof(struct cons)))
+#define ON_STACK_CONS(x,y) (alloca_val=alloca(sizeof(struct cons)), on_stack_cons(x,y))
+#define ON_STACK_LIST on_stack_list
+#define ON_STACK_LIST_VECTOR on_stack_list_vector
+#define ON_STACK_LIST_VECTOR_NEW on_stack_list_vector_new
+#define ON_STACK_MAKE_LIST on_stack_make_list
+object on_stack_cons();
+object on_stack_list(int,...);
+/* object on_stack_list_vector(int,va_list); */
+object on_stack_list_vector_new(int,object,va_list);
+object on_stack_make_list();
+#else /* no HAVE_ALLOCA */
+#define OUR_ALLOCA(n) malloc(n)
+#define ALLOCA_FREE(n) free(n)
+#define ALLOCA_CONS(n) 0
+#define ON_STACK_CONS(x,y) MMcons(x,y)
+#define ON_STACK_LIST list
+#define ON_STACK_LIST_VECTOR list_vector
+#define ON_STACK_MAKE_LIST make_list
+#endif
+#ifndef KEYTYPE
+#define KEYTYPE void *
+#endif
+
+
+
+#define Scons sLcons
+#define aref1 fLrow_major_aref
+#define aref fLrow_major_aref
+/* #define aset1 fSaset1 */
+#define aset aset1
+#define siSPinit sSPinit
+#define siSPmemory sSPmemory
+#define siSdefmacroA sSdefmacroA
+#define siSfunction_documentation sSfunction_documentation
+#define siSlambda_block_expanded sSlambda_block_expanded
+#define siSpretty_print_format sSpretty_print_format
+#define IdoInit(x,y) do_init(y)
+/* #define siSsharp_comma */
+#define siSvariable_documentation sSvariable_documentation
+
+
+#define EQ(x,y) ((x)==(y))
+
+#define CMPmake_fixnum(x) make_fixnum(x)
+
+object make_integer();
+ /* copy x to y, increasing space by factor of 2 */
+
+#ifndef GMP
+GEN otoi();
+/*
+object integ_temp;
+#define otoi(x) (integ_temp = (x) , (type_of(integ_temp) == t_bignum \
+ ? MP(integ_temp) :stoi(fix(integ_temp))))
+*/
+#define ISETQ_FIX(a,b,c) isetq_fix(a,c)
+void isetq_fix();
+#ifdef HAVE_ALLOCA
+#define SETQ_II(var,alloc,val) \
+ do{GEN _xx =(val) ; \
+ int _n = replace_copy1(_xx,var); \
+ if(_n) var = replace_copy2(_xx,alloca(_n));}while(0)
+
+#define SETQ_IO(var,alloc,val) {object _xx =(val) ; \
+ int _n = obj_replace_copy1(_xx,var); \
+ if(_n) var = obj_replace_copy2(_xx,alloca(_n));}
+#define IDECL(a,b,c) our_ulong b[4];a =(b[0]=0x1010000 +4,b) ; object c
+#else
+GEN setq_io(),setq_ii();
+#define SETQ_IO(x,alloc,val) (x)=setq_io(x,&alloc,val)
+#define SETQ_II(x,alloc,val) (x)=setq_ii(x,&alloc,val)
+#define IDECL(a,b,c) our_ulong b[4];a =(b[0]=0x1010000 +4,b);object c
+#endif
+
+#else
+
+typedef MP_INT * GEN;
+
+int obj_to_mpz(object,MP_INT *);
+int obj_to_mpz1(object,MP_INT *,void *);
+int mpz_to_mpz(MP_INT *,MP_INT *);
+int mpz_to_mpz1(MP_INT *,MP_INT *,void *);
+void isetq_fix(MP_INT *,int);
+MP_INT * otoi(object x);
+
+#ifndef HAVE_ALLOCA
+#error Need alloca for GMP
+#endif
+
+/* Add fourth argument af to the SETQ macros to allow for malloc allocation */
+/* inside setjmp frames, and faster alloca allocation otherwise.*/
+/* FIXME, verify that IDECL need not be changed, improve logic behind malloc */
+/* selection, e.g. closure boundaries. CM 20031201*/
+#define IDECL(a,b,c) mp_limb_t *c=(mp_limb_t *)alloca(1*sizeof(mp_limb_t));MP_INT b={1,1,c}; a = &b
+#define SETQ_IO(var,alloc,val,af) { object _xx = (val); \
+ int _n; \
+ if ((_n=obj_to_mpz(_xx,(var)))) {\
+ obj_to_mpz1(_xx,(var),af(_n));}}
+#define SETQ_II(var,alloc,val,af) { MP_INT * _xx = (val); \
+ int _n; \
+ if ((_n=mpz_to_mpz(_xx,(var)))) {\
+ mpz_to_mpz1(_xx,(var),af(_n));}}
+#define ISETQ_FIX(a,b,c) isetq_fix(a,c)
+
+
+/* #define IDECL(a,b,c) MP_INT b; a = (mpz_init(&b),&b) ; object c */
+/* #define SETQ_IO(var,alloc,val) { object _xx = (val); \ */
+/* obj_to_mpz(_xx,(var));} */
+/* #define SETQ_II(var,alloc,val) { MP_INT * _xx = (val); \ */
+/* mpz_to_mpz(_xx,(var));} */
+/* #define ISETQ_FIX(a,b,c) isetq_fix(a,c) */
+
+
+#endif /* end no GMP */
+
+#define cclosure_call funcall
+
+#ifndef _REGEXP
+#define _REGEXP 1
+
+#define NSUBEXP 10
+typedef struct regexp {
+ char *startp[NSUBEXP];
+ char *endp[NSUBEXP];
+ char regstart; /* Internal use only. */
+ char reganch; /* Internal use only. */
+ char *regmust; /* Internal use only. */
+ int regmlen; /* Internal use only. */
+ unsigned char regmaybe_boyer;
+ char program[1]; /* Unwarranted chumminess with compiler. */
+} regexp;
+
+#if __STDC__ == 1
+#define _ANSI_ARGS_(x) x
+#else
+#define _ANSI_ARGS_(x) ()
+#endif
+
+/* extern regexp *regcomp _ANSI_ARGS_((char *exp)); */
+/* extern int regexec _ANSI_ARGS_((regexp *prog, char *string, char *start,int length )); */
+extern void regsub _ANSI_ARGS_((regexp *prog, char *source, char *dest));
+#ifndef regerror
+extern void regerror _ANSI_ARGS_((char *msg));
+#endif
+
+#endif /* REGEXP */
+/* alloc.c:89:OF */ extern char *alloc_page (long n); /* (n) int n; */
+/* alloc.c:149:OF */ extern void add_page_to_freelist (char *p, struct typemanager *tm); /* (p, tm) char *p; struct typemanager *tm; */
+/* alloc.c:196:OF */ extern object type_name (int t); /* (t) int t; */
+/* alloc.c:213:OF */ extern object alloc_object (enum type t); /* (t) enum type t; */
+/* alloc.c:296:OF */ extern object make_cons (object a, object d); /* (a, d) object a; object d; */
+/* alloc.c:364:OF */ extern object on_stack_cons (object x, object y); /* (x, y) object x; object y; */
+/* alloc.c:376:OF */ extern object fSallocated (object typ); /* (typ) object typ; */
+/* alloc.c:401:OF */ extern object fSreset_number_used (object typ); /* (typ) object typ; */
+/* alloc.c:480:OF */ extern void insert_contblock (char *p, int s); /* (p, s) char *p; int s; */
+/* alloc.c:480:OF */ extern void insert_maybe_sgc_contblock (char *p, int s); /* (p, s) char *p; int s; */
+/* alloc.c:611:OF */ extern void set_maxpage (void); /* () */
+/* alloc.c:635:OF */ extern void gcl_init_alloc (void); /* () */
+/* alloc.c:737:OF */ extern object fSstaticp (object x); /* (x) object x; */
+/* alloc.c:822:OF */ extern object fSallocate_sgc (object type,fixnum min,fixnum max,fixnum free_percent); /* (type, min, max, free_percent) object type; int min; int max; int free_percent; */
+/* alloc.c:846:OF */ extern object fSallocate_growth (object type,fixnum min,fixnum max,fixnum percent,fixnum percent_free); /* (type, min, max, percent, percent_free) object type; int min; int max; int percent; int percent_free; */
+/* alloc.c:911:OF */ extern object fSallocated_contiguous_pages (void); /* () */
+/* alloc.c:918:OF */ extern object fSmaximum_contiguous_pages (void); /* () */
+/* alloc.c:958:OF */ extern object fSallocated_relocatable_pages (void); /* () */
+/* alloc.c:965:OF */ extern object fSget_hole_size (void); /* () */
+/* alloc.c:1000:OF */ extern void gcl_init_alloc_function (void); /* () */
+/* alloc.c:1126:OF */ extern void free (void *ptr); /* (ptr) void *ptr; */
+/* array.c:57:OF */ extern void Laref (void); /* () */
+/* array.c:126:OF */ extern object fLsvref (object x, ufixnum i); /* (x, i) object x; unsigned int i; */
+/* array.c:142:OF */ extern object fLrow_major_aref (object x,fixnum i); /* (x, i) object x; int i; */
+/* array.c:190:OF */ extern object fSaset1 (object x,fixnum i, object val); /* (x, i, val) object x; int i; object val; */
+/* array.c:262:OF */ extern void siLaset (void); /* () */
+/* array.c:321:OF */ extern void siLsvset (void); /* () */
+/* array.c:324:OF */ extern object fSsvset (object x,fixnum i, object val); /* (x, i, val) object x; int i; object val; */
+/* array.c:461:OF */ extern object fSget_aelttype (object x); /* (x) object x; */
+/* array.c:480:OF */ extern void siLmake_vector (void); /* () */
+/* array.c:519:OF */ extern object fSmake_array1 (fixnum elt_type, object staticp, object initial_element, object displaced_to,fixnum displaced_index_offset, object dimensions); /* (elt_type, staticp, initial_element, displaced_to, displaced_index_offset, dimensions) int elt_type; object staticp; object initial_element; object displaced_to; int displaced_index_offset; object dimensions; */
+/* array.c::OF */ extern object fSmake_vector1_1 (fixnum n,fixnum elt_type,object staticp);
+/* array.c:738:OF */ extern void adjust_displaced (object x, long diff); /* (x, diff) object x; int diff; */
+/* array.c:790:OF */ extern void gset (void *p1, void *val, int n, int typ); /* (p1, val, n, typ) char *p1; char *val; int n; int typ; */
+/* array.c:831:OF */ extern object fScopy_array_portion (object x, object y,fixnum i1,fixnum i2, object n1); /* (x, y, i1, i2, n1) object x; object y; int i1; int i2; int n1; */
+/* array.c:879:OF */ extern void array_allocself (object x, int staticp, object dflt); /* (x, staticp, dflt) object x; int staticp; object dflt; */
+/* array.c:920:OF */ extern void siLfill_pointer_set (void); /* () */
+/* array.c:923:OF */ extern object fSfill_pointer_set (object x,fixnum i); /* (x, i) object x; int i; */
+/* array.c:944:OF */ extern void Lfill_pointer (void); /* () */
+/* array.c:947:OF */ extern object fLfill_pointer (object x); /* (x) object x; */
+/* array.c:965:OF */ extern object fLarray_has_fill_pointer_p (object x); /* (x) object x; */
+/* array.c:986:OF */ extern void Larray_element_type (void); /* () */
+/* array.c:989:OF */ extern object fLarray_element_type (object x); /* (x) object x; */
+/* array.c:995:OF */ extern void Ladjustable_array_p (void); /* () */
+/* array.c:998:OF */ extern object fLadjustable_array_p (object x); /* (x) object x; */
+/* array.c:1002:OF */ extern void siLdisplaced_array_p (void); /* () */
+/* array.c:1005:OF */ extern object fSdisplaced_array_p (object x); /* (x) object x; */
+/* array.c:1010:OF */ extern void Larray_rank (void); /* () */
+/* array.c:1013:OF */ extern object fLarray_rank (object x); /* (x) object x; */
+/* array.c:1020:OF */ extern void Larray_dimension (void); /* () */
+/* array.c:1023:OF */ extern object fLarray_dimension (object x,fixnum i); /* (x, i) object x; int i; */
+/* array.c:1090:OF */ extern void siLreplace_array (void); /* () */
+/* array.c:1093:OF */ extern object fSreplace_array (object old, object new); /* (old, new) object old; object new; */
+/* array.c:1132:OF */ extern object fLarray_total_size (object x); /* (x) object x; */
+/* array.c:1140:OF */ extern object fSaset_by_cursor (object array, object val, object cursor); /* (array, val, cursor) object array; object val; object cursor; */
+/* array.c:1160:OF */ extern void gcl_init_array_function (void); /* () */
+/* assignment.c:62:OF */ extern void setq (object sym, object val); /* (sym, val) object sym; object val; */
+/* assignment.c:128:OF */ extern void Lset (void); /* () */
+/* assignment.c:130:OF */ extern object fLset (object symbol, object value); /* (symbol, value) object symbol; object value; */
+/* assignment.c:142:OF */ extern void siLfset (void); /* () */
+/* assignment.c:144:OF */ extern object fSfset (object sym, object function); /* (sym, function) object sym; object function; */
+/* assignment.c:214:OF */ extern object fLmakunbound (object sym); /* (sym) object sym; */
+/* assignment.c:228:OF */ extern void Lfmakunbound (void); /* () */
+/* assignment.c:230:OF */ extern object fLfmakunbound (object sym); /* (sym) object sym; */
+/* assignment.c:547:OF */ extern object clear_compiler_properties (object sym, object code); /* (sym, code) object sym; object code; */
+/* assignment.c:563:OF */ extern object fSclear_compiler_properties (object x0, object x1); /* (x0, x1) object x0; object x1; */
+/* assignment.c:591:OF */ extern void gcl_init_assignment (void); /* () */
+/* backq.c:259:OF */ extern int backq_car (object x); /* (x) object x; */
+/* backq.c:381:OF */ extern void gcl_init_backq (void); /* () */
+/* bds.c:31:OF */ extern void bds_unwind (bds_ptr new_bds_top); /* (new_bds_top) bds_ptr new_bds_top; */
+/* big.c:53:OF */ extern object fSset_gmp_allocate_relocatable (object flag); /* (flag) object flag; */
+/* gmp_big.c:96:OF */ extern void gcl_init_big1 (void); /* () */
+/* gmp_big.c:108:OF */ extern object new_bignum (void); /* () */
+/* gmp_big.c:161:OF */ extern object make_integer (__mpz_struct *u); /* (u) __mpz_struct *u; */
+/* gmp_big.c:207:OF */ extern int big_compare (object x, object y); /* (x, y) object x; object y; */
+/* gmp_big.c:214:OF */ extern object normalize_big_to_object (object x); /* (x) object x; */
+/* gmp_big.c:230:OF */ extern void add_int_big (int i, object x); /* (i, x) int i; object x; */
+/* gmp_big.c:244:OF */ extern void mul_int_big (int i, object x); /* (i, x) int i; object x; */
+/* gmp_big.c:289:OF */ extern object normalize_big (object x); /* (x) object x; */
+/* gmp_big.c:302:OF */ extern object big_minus (object x); /* (x) object x; */
+/* gmp_big.c:324:OF */ extern double big_to_double (object x); /* (x) object x; */
+/* gmp_big.c:454:OF */ extern object maybe_replace_big (object x); /* (x) object x; */
+/* gmp_big.c:472:OF */ extern object bignum2 (unsigned int h, unsigned int l); /* (h, l) unsigned int h; unsigned int l; */
+/* gmp_big.c:482:OF */ extern void integer_quotient_remainder_1 (object x, object y, object *qp, object *rp); /* (x, y, qp, rp) object x; object y; object *qp; object *rp; */
+/* gmp_big.c:502:OF */ extern object coerce_big_to_string (object x, int printbase); /* (x, printbase) object x; int printbase; */
+/* gmp_big.c:521:OF */ extern void gcl_init_big (void); /* () */
+/* big.c:72:OF */ extern int big_sign (object x); /* (x) object x; */
+/* big.c:78:OF */ extern void set_big_sign (object x, int sign); /* (x, sign) object x; int sign; */
+/* big.c:85:OF */ extern void zero_big (object x); /* (x) object x; */
+/* bind.c:74:OF */ extern void lambda_bind (object *arg_top); /* (arg_top) object *arg_top; */
+/* bind.c:564:OF */ extern void bind_var (object var, object val, object spp); /* (var, val, spp) object var; object val; object spp; */
+/* bind.c:610:OF */ extern object find_special (object body, struct bind_temp *start, struct bind_temp *end); /* (body, start, end) object body; struct bind_temp *start; struct bind_temp *end; */
+/* bind.c:670:OF */ extern object let_bind (object body, struct bind_temp *start, struct bind_temp *end); /* (body, start, end) object body; struct bind_temp *start; struct bind_temp *end; */
+/* bind.c:688:OF */ extern object letA_bind (object body, struct bind_temp *start, struct bind_temp *end); /* (body, start, end) object body; struct bind_temp *start; struct bind_temp *end; */
+/* bind.c:712:OF */ extern void parse_key (object *base, bool rest, bool allow_other_keys, register int n, ... );
+/* bind.c:820:OF */ extern void check_other_key (object l, int n, ...);
+struct key {short n,allow_other_keys;
+ iobject *defaults;
+ iobject keys[1];
+ };
+
+/* bind.c:866:OF */ extern int parse_key_new_new (int n, object *base, struct key *keys, object first, va_list ap); /* (n, base, keys, ap) int n; object *base; struct key *keys; va_list ap; */
+/* bind.c:916:OF */ extern int parse_key_rest_new (object rest, int n, object *base, struct key *keys, object first, va_list ap); /* (rest, n, base, keys, ap) object rest; int n; object *base; struct key *keys; va_list ap; */
+/* bind.c:975:OF */ extern void set_key_struct (struct key *ks, object data); /* (ks, data) struct key *ks; object data; */
+/* bind.c:995:OF */ extern void gcl_init_bind (void); /* () */
+/* block.c:121:OF */ extern void gcl_init_block (void); /* () */
+/* bsearch.c:5:OF */ extern void *bsearch (const void *key, const void *base, size_t nel, size_t keysize, int (*compar) (const void *,const void *)); /* (key, base, nel, keysize, compar) char *key; char *base; unsigned int nel; unsigned int keysize; int (*compar)(); */
+#if defined (__MINGW32__)
+/* bzero.c:3:OF */ /* extern void bzero (char *b, size_t length); */ /* (b, length) char *b; int length; */
+#endif
+/* catch.c:61:OF */ extern object fSerror_set (object x0); /* (x0) object x0; */
+/* catch.c:166:OF */ extern void gcl_init_catch (void); /* () */
+/* cfun.c:37:OF */ extern object make_cfun (void (*self)(), object name, object data, char *start, int size); /* (self, name, data, start, size) int (*self)(); object name; object data; char *start; int size; */
+/* cfun.c:56:OF */ extern object make_sfun (object name, object (*self)(), int argd, object data); /* (name, self, argd, data) object name; int (*self)(); int argd; object data; */
+/* cfun.c:91:OF */ extern object make_cclosure_new (void (*self)(), object name, object env, object data); /* (self, name, env, data) int (*self)(); object name; object env; object data; */
+/* cfun.c:108:OF */ extern object make_cclosure (void (*self)(), object name, object env, object data, char *start, int size); /* (self, name, env, data, start, size) int (*self)(); object name; object env; object data; char *start; int size; */
+/* cfun.c:124:OF */ extern object fSmc (object name, object address); /* (name, address) object name; object address; */
+/* cfun.c:150:OF */ extern object fSmfsfun (object name, object address, object argd); /* (name, address, argd) object name; object address; object argd; */
+/* cfun.c:174:OF */ extern object fSmfvfun (object name, object address, object argd); /* (name, address, argd) object name; object address; object argd; */
+/* cfun.c:193:OF */ extern object fSmfvfun_key (object symbol, object address, object argd, object keys); /* (symbol, address, argd, keys) object symbol; object address; object argd; object keys; */
+/* cfun.c:221:OF */ extern object fSmf (object name, object addr); /* (name, addr) object name; object addr; */
+/* cfun.c:269:OF */ extern object fSmm (object name, object addr); /* (name, addr) object name; object addr; */
+/* cfun.c:283:OF */ extern object make_function_internal (char *s, void(*f)()); /* (s, f) char *s; int (*f)(); */
+/* cfun.c:299:OF */ extern object make_si_sfun_internal (char *s, object (*f)(), int argd); /* (s, f, argd) char *s; int (*f)(); int argd; */
+/* cfun.c:322:OF */ extern object make_si_function_internal (char *s, void (*f) ()); /* (s, f) char *s; int (*f)(); */
+/* cfun.c:341:OF */ extern object make_special_form_internal (char *s, void (*f)()); /* (s, f) char *s; int (*f)(); */
+/* cfun.c:352:OF */ extern object fScompiled_function_name (object fun); /* (fun) object fun; */
+/* cfun.c:371:OF */ extern void turbo_closure (object fun); /* (fun) object fun; */
+/* cfun.c:392:OF */ extern object fSturbo_closure (object funobj); /* (funobj) object funobj; */
+/* cfun.c:403:OF */ extern void gcl_init_cfun (void); /* () */
+/* cmac.c:147:OF */ extern object fScmod (object num); /* (num) object num; */
+/* cmac.c:156:OF */ extern object fScplus (object x0, object x1); /* (x0, x1) object x0; object x1; */
+/* cmac.c:165:OF */ extern object fSctimes (object x0, object x1); /* (x0, x1) object x0; object x1; */
+/* cmac.c:175:OF */ extern object fScdifference (object x0, object x1); /* (x0, x1) object x0; object x1; */
+/* cmac.c:191:OF */ extern void gcl_init_cmac (void); /* () */
+/* cmpaux.c:33:OF */ extern void siLspecialp (void); /* () */
+/* cmpaux.c:35:OF */ extern object fSspecialp (object sym); /* (sym) object sym; */
+/* cmpaux.c:73:OF */ extern object fSdebug (object sym, object val); /* (sym, val) object sym; object val; */
+/* cmpaux.c:82:OF */ extern object fSsetvv (object index, object val); /* (index, val) object index; object val; */
+/* cmpaux.c:95:OF */ extern void gcl_init_cmpaux (void); /* () */
+/* cmpaux.c:106:OF */ /* extern int ifloor (int x, int y); */ /* (x, y) int x; int y; */
+/* cmpaux.c:124:OF */ /* extern int imod (int x, int y); */ /* (x, y) int x; int y; */
+/* cmpaux.c:185:OF */ extern int object_to_int (object x); /* (x) object x; */
+/* cmpaux.c:185:OF */ extern fixnum object_to_fixnum (object x); /* (x) object x; */
+/* cmpaux.c:263:OF */ extern char *object_to_string (object x); /* (x) object x; */
+typedef int (*FUNC)();
+/* cmpaux.c:294:OF */ extern void call_init (int init_address, object memory, object fasl_vec, FUNC fptr); /* (init_address, memory, fasl_vec, fptr) int init_address; object memory; object fasl_vec; FUNC fptr; */
+/* cmpaux.c:339:OF */ extern void do_init (object *statVV); /* (statVV) object *statVV; */
+/* cmpaux.c:416:OF */ extern void gcl_init_or_load1 (void (*fn) (void), const char *file); /* (fn, file) int (*fn)(); char *file; */
+/* conditional.c:200:OF */ extern void gcl_init_conditional (void); /* () */
+/* error.c:38:OF */ extern void terminal_interrupt (int correctable); /* (correctable) int correctable; */
+/* error.c:147:OF */ extern void Lerror (void); /* () */
+/* error.c:164:OF */ extern void Lcerror (void); /* () */
+/* error.c:184:OF */ extern void FEerror (char *s, int num, ... ); /* (s, num, arg1, arg2, arg3, arg4) char *s; int num; object arg1; object arg2; object arg3; object arg4; */
+/* error.c:203:OF */ extern void FEwrong_type_argument (object type, object value); /* (type, value) object type; object value; */
+/* error.c:210:OF */ extern void FEtoo_few_arguments (object *base, object *top); /* (base, top) object *base; object *top; */
+/* error.c:219:OF */ extern void FEtoo_few_argumentsF (object args); /* (args) object args; */
+/* error.c:227:OF */ extern void FEtoo_many_arguments (object *base, object *top); /* (base, top) object *base; object *top; */
+/* error.c:234:OF */ extern void FEtoo_many_argumentsF (object args); /* (args) object args; */
+/* error.c:247:OF */ extern void FEunexpected_keyword (object key); /* (key) object key; */
+/* error.c:258:OF */ extern void FEinvalid_form (char *s, object form); /* (s, form) char *s; object form; */
+/* error.c:266:OF */ extern void FEunbound_variable (object sym); /* (sym) object sym; */
+/* error.c:273:OF */ extern void FEinvalid_variable (char *s, object obj); /* (s, obj) char *s; object obj; */
+/* error.c:280:OF */ extern void FEundefined_function (object fname); /* (fname) object fname; */
+/* error.c:287:OF */ extern void FEinvalid_function (object obj); /* (obj) object obj; */
+/* error.c:297:OF */ extern object CEerror (char *error_str, char *cont_str, int num, object arg1, object arg2, object arg3, object arg4); /* (error_str, cont_str, num, arg1, arg2, arg3, arg4) char *error_str; char *cont_str; int num; object arg1; object arg2; object arg3; object arg4; */
+/* error.c:330:OF */ extern object fSihs_top (void); /* () */
+/* error.c:337:OF */ extern object fSihs_fun (object x0); /* (x0) object x0; */
+/* error.c:346:OF */ extern object fSihs_vs (object x0); /* (x0) object x0; */
+/* error.c:371:OF */ extern object fSfrs_top (void); /* () */
+/* error.c:378:OF */ extern object fSfrs_vs (object x0); /* (x0) object x0; */
+/* error.c:387:OF */ extern object fSfrs_bds (object x0); /* (x0) object x0; */
+/* error.c:397:OF */ extern object fSfrs_class (object x0); /* (x0) object x0; */
+/* error.c:413:OF */ extern object fSfrs_tag (object x0); /* (x0) object x0; */
+/* error.c:422:OF */ extern object fSfrs_ihs (object x0); /* (x0) object x0; */
+/* error.c:448:OF */ extern object fSbds_top (void); /* () */
+/* error.c:455:OF */ extern object fSbds_var (object x0); /* (x0) object x0; */
+/* error.c:464:OF */ extern object fSbds_val (object x0); /* (x0) object x0; */
+/* error.c:487:OF */ extern object fSvs_top (void); /* () */
+/* error.c:496:OF */ extern object fSvs (object x0); /* (x0) object x0; */
+/* error.c:505:OF */ extern object fSsch_frs_base (object x0, object x1); /* (x0, x1) object x0; object x1; */
+/* error.c:523:OF */ extern object fSinternal_super_go (object tag, object x1, object x2); /* (tag, x1, x2) object tag; object x1; object x2; */
+/* error.c:549:OF */ extern object fSuniversal_error_handler (object x0, object x1, object x2, object x3, object error_fmt_string); /* (x0, x1, x2, x3, error_fmt_string) object x0; object x1; object x2; object x3; object error_fmt_string; */
+/* error.c:561:OF */ extern void check_arg_failed (int n); /* (n) int n; */
+/* error.c:568:OF */ extern void too_few_arguments (void); /* () */
+/* error.c:573:OF */ extern void too_many_arguments (void); /* () */
+/* error.c:586:OF */ extern void ck_larg_exactly (int n, object x); /* (n, x) int n; object x; */
+/* error.c:595:OF */ extern void invalid_macro_call (void); /* () */
+/* error.c:618:OF */ extern object wrong_type_argument (object typ, object obj); /* (typ, obj) object typ; object obj; */
+/* error.c:625:OF */ extern void illegal_declare (object form); /* (form) int form; */
+/* error.c:635:OF */ extern void not_a_string_or_symbol (object x); /* (x) object x; */
+/* error.c:641:OF */ extern void not_a_symbol (object obj); /* (obj) object obj; */
+/* error.c:647:OF */ extern int not_a_variable (object obj); /* (obj) object obj; */
+/* error.c:653:OF */ extern void illegal_index (object x, object i); /* (x, i) object x; object i; */
+/* error.c:660:OF */ extern void check_socket (object x); /* (x) object x; */
+/* error.c:670:OF */ extern void check_stream (object strm); /* (strm) object strm; */
+/* error.c:697:OF */ extern void check_arg_range (int n, int m); /* (n, m) int n; int m; */
+/* error.c:727:OF */ extern void gcl_init_error (void); /* () */
+/* eval.c:143:OF */ extern void funcall (object fun); /* (fun) object fun; */
+/* eval.c:375:OF */ extern void lispcall (object *funp, int narg); /* (funp, narg) object *funp; int narg; */
+/* eval.c:461:OF */ extern void symlispcall (object sym, object *base, int narg); /* (sym, base, narg) object sym; object *base; int narg; */
+/* eval.c:549:OF */ extern object simple_lispcall (object *funp, int narg); /* (funp, narg) object *funp; int narg; */
+/* eval.c:645:OF */ extern object simple_symlispcall (object sym, object *base, int narg); /* (sym, base, narg) object sym; object *base; int narg; */
+/* eval.c:739:OF */ extern void super_funcall (object fun); /* (fun) object fun; */
+/* eval.c:752:OF */ extern void super_funcall_no_event (object fun); /* (fun) object fun; */
+/* eval.c:936:OF */ extern object Ieval (object form); /* (form) object form; */
+/* eval.c:944:OF */ extern void eval (object form); /* (form) object form; */
+/* eval.c:1189:OF */ extern void Leval (void); /* () */
+/* eval.c:1191:OF */ extern object fLeval (object x0); /* (x0) object x0; */
+/* eval.c:1203:OF */ extern void Levalhook (void); /* () */
+/* eval.c:1269:OF */ extern void Lconstantp (void); /* () */
+/* eval.c:1271:OF */ extern object fLconstantp (object x0); /* (x0) object x0; */
+/* eval.c:1293:OF */ extern object ieval (object x); /* (x) object x; */
+/* eval.c:1309:OF */ extern object ifuncall1 (object fun, object arg1); /* (fun, arg1) object fun; object arg1; */
+/* eval.c:1328:OF */ extern object ifuncall2 (object fun, object arg1, object arg2); /* (fun, arg1, arg2) object fun; object arg1; object arg2; */
+/* eval.c:1348:OF */ extern object ifuncall3 (object fun, object arg1, object arg2, object arg3); /* (fun, arg1, arg2, arg3) object fun; object arg1; object arg2; object arg3; */
+typedef void (*funcvoid)(void);
+/* eval.c:1545:OF */ extern void gcl_init_eval (void); /* () */
+/* fasdump.c:1465:OF */ extern object read_fasl_vector (object in); /* (in) object in; */
+/* fat_string.c:29:OF */ extern object fSprofile (object start_address, object scale); /* (start_address, scale) object start_address; object scale; */
+/* fat_string.c:46:OF */ extern object fSfunction_start (object funobj); /* (funobj) object funobj; */
+/* fat_string.c:331:OF */ extern object fSdisplay_profile (object start_addr, object scal); /* (start_addr, scal) object start_addr; object scal; */
+/* fat_string.c:394:OF */ extern object fSarray_adress (object array); /* (array) object array; */
+/* fat_string.c:435:OF */ extern void gcl_init_fat_string (void); /* () */
+/* sfasli.c::OF */ extern void gcl_init_sfasl (void); /* () */
+/* format.c::OF */ extern object fLformat_1(object strm, object control,object x);
+/* format.c:2084:OF */ extern void Lformat (void); /* () */
+/* format.c:2171:OF */ extern void gcl_init_format (void); /* () */
+/* frame.c:32:OF */ extern void unwind (frame_ptr fr, object tag); /* (fr, tag) frame_ptr fr; object tag; */
+/* frame.c:58:OF */ extern frame_ptr frs_sch (object frame_id); /* (frame_id) object frame_id; */
+/* frame.c:69:OF */ extern frame_ptr frs_sch_catch (object frame_id); /* (frame_id) object frame_id; */
+/* funlink.c:19:OF */ extern void call_or_link (object sym, void **link); /* (sym, link) object sym; void **link; */
+/* funlink.c:41:OF */ extern void call_or_link_closure (object sym, void **link, void **ptr); /* (sym, link, ptr) object sym; void **link; object *ptr; */
+/* funlink.c:230:OF */ extern object c_apply_n (object (*fn)(), int n, object *x); /* (fn, n, x) long int (*fn)(); int n; object *x; */
+/* funlink.c:696:OF */ extern object call_proc0 (object sym, void *link); /* (sym, link) object sym; void *link; */
+/* funlink.c:784:OF */ extern int clear_stack (object *beg, object *limit); /* (beg, limit) object *beg; object *limit; */
+/* funlink.c:821:OF */ extern void gcl_init_links (void); /* () */
+/* gbc.c:151:OF */ extern void enter_mark_origin (object *p); /* (p) object *p; */
+/* gbc.c:938:OF */ extern void GBC (enum type t); /* (t) enum type t; */
+/* gbc.c:1326:OF */ extern object fLgbc (object x0); /* (x0) object x0; */
+/* sgbc.c:924:OF */ extern int sgc_count_type (int t); /* (t) int t; */
+/* sgbc.c:938:OF */ extern int sgc_start (void); /* () */
+/* sgbc.c:1068:OF */ extern int sgc_quit (void); /* () */
+/* sgbc.c:1131:OF */ extern void make_writable (unsigned long beg, unsigned long i); /* (beg, i) int beg; int i; */
+#ifndef __MINGW32__
+/* #include <signal.h> */
+#endif
+/* sgbc.c:1246:OF */ extern void memory_protect (int on); /* (on) int on; */
+/* sgbc.c:1306:OF */ extern void perm_writable (char *p, long n); /* (p, n) char *p; int n; */
+/* sgbc.c:1321:OF */ extern void system_error (void); /* () */
+/* gbc.c:1357:OF */ extern void gcl_init_GBC (void); /* () */
+/* gnumalloc.c:286:OF */ extern void malloc_init (char *start, void (*warnfun) (/* ??? */)); /* (start, warnfun) char *start; void (*warnfun)(); */
+/* gnumalloc.c:301:OF */ extern int malloc_usable_size (char *mem); /* (mem) char *mem; */
+/* gnumalloc.c:461:OF */ /* extern void *malloc (size_t n); */ /* (n) unsigned int n; */
+/* gnumalloc.c:529:OF */ /* extern int free (char *mem); */ /* (mem) char *mem; */
+/* gnumalloc.c:577:OF */ /* extern char *realloc (char *mem, register unsigned int n); */ /* (mem, n) char *mem; register unsigned int n; */
+/* gnumalloc.c:639:OF */ /* extern char *memalign (unsigned int alignment, unsigned int size); */ /* (alignment, size) unsigned int alignment; unsigned int size; */
+/* gnumalloc.c:737:OF */ extern int get_lim_data (void); /* () */
+/* grab_defs.c:35:OF */ extern int read_some (char *buf, int n, int start_ch, int copy); /* (buf, n, start_ch, copy) char *buf; int n; int start_ch; int copy; */
+/* grab_defs.c:71:OF */ /* extern int main (void); */ /* () */
+/* iteration.c:457:OF */ extern void gcl_init_iteration (void); /* () */
+/* let.c:29:OF */ extern void let_var_list (object var_list); /* (var_list) object var_list; */
+/* let.c:321:OF */ extern void gcl_init_let (void); /* () */
+/* lex.c:34:OF */ extern object assoc_eq (object key, object alist); /* (key, alist) object key; object alist; */
+/* lex.c:47:OF */ extern void lex_fun_bind (object name, object fun); /* (name, fun) object name; object fun; */
+/* lex.c:59:OF */ extern void lex_macro_bind (object name, object exp_fun); /* (name, exp_fun) object name; object exp_fun; */
+/* lex.c:70:OF */ extern void lex_tag_bind (object tag, object id); /* (tag, id) object tag; object id; */
+/* lex.c:82:OF */ extern void lex_block_bind (object name, object id); /* (name, id) object name; object id; */
+/* lex.c:95:OF */ extern object lex_tag_sch (object tag); /* (tag) object tag; */
+/* lex.c:110:OF */ extern object lex_block_sch (object name); /* (name) object name; */
+/* lex.c:125:OF */ extern void gcl_init_lex (void); /* () */
+/* littleXwin.c:32:OF */ /* extern Window open_window (void); */ /* () */
+/* littleXwin.c:102:OF */ /* extern int close_window (Window the_window); */ /* (the_window) Window the_window; */
+/* littleXwin.c:110:OF */ /* extern int draw_line (Window the_window, int x1, int y1, int x2, int y2); */ /* (the_window, x1, y1, x2, y2) Window the_window; int x1; int y1; int x2; int y2; */
+/* littleXwin.c:119:OF */ /* extern int draw_arc (Window the_window, int x, int y, int width, int height, int angle1, int angle2); *//* (the_window, x, y, width, height, angle1, angle2) Window the_window; int x; int y; int width; int height; int angle1; int angle2; */
+/* littleXwin.c:129:OF */ /* extern int fill_arc (Window the_window, int x, int y, int width, int height, int angle1, int angle2); */ /* (the_window, x, y, width, height, angle1, angle2) Window the_window; int x; int y; int width; int height; int angle1; int angle2; */
+/* littleXwin.c:139:OF */ /* extern int clear_arc (Window the_window, int x, int y, int width, int height, int angle1, int angle2); *//* (the_window, x, y, width, height, angle1, angle2) Window the_window; int x; int y; int width; int height; int angle1; int angle2; */
+/* littleXwin.c:149:OF */ /* extern int set_arc_mode (int pie_or_chord); */ /* (pie_or_chord) int pie_or_chord; */
+/* littleXwin.c:162:OF */ /* extern int erase_line (Window the_window, int x1, int y1, int x2, int y2); *//* (the_window, x1, y1, x2, y2) Window the_window; int x1; int y1; int x2; int y2; */
+/* littleXwin.c:171:OF */ /* extern int draw_text (Window the_window, char *string, int x, int y); */ /* (the_window, string, x, y) Window the_window; char *string; int x; int y; */
+/* littleXwin.c:182:OF */ /* extern int erase_text (Window the_window, char *string, int x, int y); */ /* (the_window, string, x, y) Window the_window; char *string; int x; int y; */
+/* littleXwin.c:193:OF */ /* extern int clear_window (Window the_window); */ /* (the_window) Window the_window; */
+/* littleXwin.c:201:OF */ /* extern int resize_window (Window the_window, int width, int height); */ /* (the_window, width, height) Window the_window; int width; int height; */
+/* littleXwin.c:210:OF */ /* extern int raise_window (Window the_window); */ /* (the_window) Window the_window; */
+/* littleXwin.c:218:OF */ /* extern int use_font (char *font_name); */ /* (font_name) char *font_name; */
+/* littleXwin.c:233:OF */ /* extern int set_background (Window the_window, char *color_string); */ /* (the_window, color_string) Window the_window; char *color_string; */
+/* littleXwin.c:251:OF */ /* extern int set_foreground (char *color_string); */ /* (color_string) char *color_string; */
+/* macros.c:139:OF */ extern object Imacro_expand1 (object exp_fun, object form); /* (exp_fun, form) object exp_fun; object form; */
+/* macros.c:173:OF */ extern void Lmacroexpand (void); /* () */
+/* macros.c:224:OF */ extern void Lmacroexpand_1 (void); /* () */
+/* macros.c:265:OF */ extern object macro_expand (object form); /* (form) object form; */
+/* macros.c:344:OF */ extern void gcl_init_macros (void); /* () */
+/* main.c:111:OF */ extern int main (int argc, char **argv, char **envp); /* (argc, argv, envp) int argc; char **argv; char **envp; */
+/* main.c:346:OF */ extern void install_segmentation_catcher (void); /* () */
+/* main.c:359:OF */ extern void error (char *s); /* (s) char *s; */
+/* main.c:519:OF */ extern object vs_overflow (void); /* () */
+/* main.c:528:OF */ extern void bds_overflow (void); /* () */
+/* main.c:537:OF */ extern void frs_overflow (void); /* () */
+/* main.c:546:OF */ extern void ihs_overflow (void); /* () */
+/* main.c:556:OF */ extern void segmentation_catcher (int); /* () */
+/* main.c:587:OF */ extern void Lby (void); /* () */
+/* main.c:607:OF */ extern void Lquit(void); /* () */
+/* main.c:612:OF */ extern void Lexit(void); /* () */
+/* main.c:619:OF */ extern int c_trace (void); /* () */
+/* main.c:695:OF */ extern void siLreset_stack_limits (void); /* (arg) int arg; */
+/* main.c:797:OF */ extern void Lidentity(void); /* () */
+/* main.c:799:OF */ extern object fLidentity (object x0); /* (x0) object x0; */
+/* main.c:805:OF */ extern void Llisp_implementation_version(void); /* () */
+/* main.c:807:OF */ extern object fLlisp_implementation_version (void); /* () */
+/* makefun.c:10:OF */ extern object MakeAfun (object (*addr)(object,object), unsigned int argd, object data); /* (addr, argd, data) int (*addr)(); unsigned int argd; object data; */
+/* makefun.c:113:OF */ extern object fSset_key_struct (object key_struct_ind); /* (key_struct_ind) object key_struct_ind; */
+/* makefun.c:122:OF */ extern void SI_makefun (char *strg, object (*fn) (/* ??? */), unsigned int argd); /* (strg, fn, argd) char *strg; object (*fn)(); unsigned int argd; */
+/* makefun.c:131:OF */ extern void LISP_makefun (char *strg, object (*fn) (/* ??? */), unsigned int argd); /* (strg, fn, argd) char *strg; object (*fn)(); unsigned int argd; */
+/* makefun.c:167:OF */ extern object fSinvoke (object x); /* (x) object x; */
+/* mapfun.c:324:OF */ extern void gcl_init_mapfun (void); /* () */
+/* multival.c:32:OF */ extern void Lvalues (void); /* () */
+/* multival.c:37:OF */ extern void Lvalues_list (void); /* () */
+/* multival.c:134:OF */ extern void gcl_init_multival (void); /* () */
+/* nfunlink.c:190:OF */ extern object IapplyVector (object fun, int nargs, object *base); /* (fun, nargs, base) object fun; int nargs; object *base; */
+/* nfunlink.c:269:OF */ extern void Iinvoke_c_function_from_value_stack (object (*f)(), int fargd); /* (f, fargd) object (*f)(); int fargd; */
+/* nsocket.c:190:OF */ extern int CreateSocket (int port, char *host, int server, char *myaddr, int myport, int async); /* (port, host, server, myaddr, myport, async) int port; char *host; int server; char *myaddr; int myport; int async; */
+/* nsocket.c:329:OF */ extern object fSgetpeername (object sock); /* (sock) object sock; */
+/* nsocket.c:353:OF */ extern object fSgetsockname (object sock); /* (sock) object sock; */
+/* nsocket.c:385:OF */ extern object fSset_blocking (object sock, object setBlocking); /* (sock, setBlocking) object sock; object setBlocking; */
+/* nsocket.c:484:OF */ extern int getOneChar (FILE *fp); /* (fp) FILE *fp; */
+/* nsocket.c:539:OF */ extern void ungetCharGclSocket (int c, object strm); /* (c, strm) int c; object strm; */
+#ifndef __MINGW32__
+/* nsocket.c:592:OF */ extern void tcpCloseSocket (int fd); /* (fd) int fd; */
+/* nsocket.c:575:OF */ extern int TcpOutputProc (int fd, char *buf, int toWrite, int *errorCodePtr); /* (fd, buf, toWrite, errorCodePtr) int fd; char *buf; int toWrite; int *errorCodePtr; */
+#endif
+/* nsocket.c:619:OF */ extern int getCharGclSocket (object strm, object block); /* (strm, block) object strm; object block; */
+/* num_arith.c:31:OF */ extern object fixnum_add (fixnum i, fixnum j); /* (i, j) int i; int j; */
+/* num_arith.c:48:OF */ extern object fixnum_sub (fixnum i, fixnum j); /* (i, j) int i; int j; */
+/* num_arith.c:100:OF */ extern object number_plus (object x, object y); /* (x, y) object x; object y; */
+/* num_arith.c:246:OF */ extern object one_plus (object x); /* (x) object x; */
+/* num_arith.c:292:OF */ extern object number_minus (object x, object y); /* (x, y) object x; object y; */
+/* num_arith.c:438:OF */ extern object one_minus (object x); /* (x) object x; */
+/* num_arith.c:478:OF */ extern object number_negate (object x); /* (x) object x; */
+/* num_arith.c:520:OF */ extern object number_times (object x, object y); /* (x, y) object x; object y; */
+/* num_arith.c:670:OF */ extern object number_divide (object x, object y); /* (x, y) object x; object y; */
+/* num_arith.c:818:OF */ extern object integer_divide1 (object x, object y); /* (x, y) object x; object y; */
+/* num_arith.c:828:OF */ extern object get_gcd (object x, object y); /* (x, y) object x; object y; */
+/* num_arith.c:873:OF */ extern void Lplus (void); /* () */
+/* num_arith.c:889:OF */ extern void Lminus (void); /* () */
+/* num_arith.c:907:OF */ extern void Ltimes (void); /* () */
+/* num_arith.c:923:OF */ extern void Ldivide (void); /* () */
+/* num_arith.c:1029:OF */ extern void gcl_init_num_arith (void); /* () */
+/* num_co.c:292:OF */ extern object double_to_integer (double d); /* (d) double d; */
+/* num_co.c:372:OF */ extern void Lfloat (void); /* () */
+/* num_co.c:424:OF */ extern void Lnumerator (void); /* () */
+/* num_co.c:432:OF */ extern void Ldenominator (void); /* () */
+/* num_co.c:442:OF */ extern void Lfloor (void); /* () */
+/* num_co.c:563:OF */ extern void Lceiling (void); /* () */
+/* num_co.c:684:OF */ extern void Ltruncate (void); /* () */
+/* num_co.c:766:OF */ extern void Lround (void); /* () */
+/* num_co.c:896:OF */ extern void Lmod (void); /* () */
+/* num_co.c:987:OF */ extern void Lfloat_radix (void); /* () */
+/* num_co.c:1089:OF */ extern void Linteger_decode_float (void); /* () */
+/* num_co.c:1114:OF */ extern void Lcomplex (void); /* () */
+/* num_co.c:1136:OF */ extern void Lrealpart (void); /* () */
+/* num_co.c:1147:OF */ extern void Limagpart (void); /* () */
+/* num_co.c:1185:OF */ extern void gcl_init_num_co (void); /* () */
+/* num_comp.c:40:OF */ extern int number_compare (object x, object y); /* (x, y) object x; object y; */
+/* num_comp.c:269:OF */ extern void Lmonotonically_increasing (void); /* () */
+/* num_comp.c:271:OF */ extern void Lmonotonically_nondecreasing (void); /* () */
+/* num_comp.c:272:OF */ extern void Lmonotonically_nonincreasing (void); /* () */
+/* num_comp.c:292:OF */ extern void Lmin (void); /* () */
+/* num_comp.c:309:OF */ extern void gcl_init_num_comp (void); /* () */
+/* num_log.c:224:OF */ extern object shift_integer (object x, int w); /* (x, w) object x; int w; */
+/* num_log.c:258:OF */ extern void Llogior (void); /* () */
+/* num_log.c:279:OF */ extern void Llogxor (void); /* () */
+/* num_log.c:299:OF */ extern void Llogand (void); /* () */
+/* num_log.c:339:OF */ extern void Lboole (void); /* () */
+/* num_log.c:380:OF */ extern void Llogbitp (void); /* () */
+/* num_log.c:420:OF */ extern void Lash (void); /* () */
+/* num_log.c:482:OF */ extern void Linteger_length (void); /* () */
+/* num_log.c:549:OF */ extern void gcl_init_num_log (void); /* () */
+/* num_log.c:585:OF */ extern void siLbit_array_op (void); /* () */
+/* num_pred.c:31:OF */ extern int number_zerop (object x); /* (x) object x; */
+/* num_pred.c:67:OF */ extern int number_plusp (object x); /* (x) object x; */
+/* num_pred.c:107:OF */ extern int number_minusp (object x); /* (x) object x; */
+/* num_pred.c:147:OF */ extern int number_oddp (object x); /* (x) object x; */
+/* num_pred.c:161:OF */ extern int number_evenp (object x); /* (x) object x; */
+/* num_pred.c:240:OF */ extern void gcl_init_num_pred (void); /* () */
+/* num_rand.c:111:OF */ extern void Lrandom (void); /* () */
+/* num_rand.c:151:OF */ extern void gcl_init_num_rand (void); /* () */
+/* num_sfun.c:91:OF */ extern object number_expt (object x, object y); /* (x, y) object x; object y; */
+/* num_sfun.c:453:OF */ extern void Lexp (void); /* () */
+/* num_sfun.c:469:OF */ extern void Llog (void); /* () */
+/* num_sfun.c:488:OF */ extern void Lsqrt (void); /* () */
+/* num_sfun.c:495:OF */ extern void Lsin (void); /* () */
+/* num_sfun.c:502:OF */ extern void Lcos (void); /* () */
+/* num_sfun.c:516:OF */ extern void Latan (void); /* () */
+/* num_sfun.c:535:OF */ extern void gcl_init_num_sfun (void); /* () */
+/* number.c:35:OF */ extern long int fixint (object x); /* (x) object x; */
+/* number.c:44:OF */ extern int fixnnint (object x); /* (x) object x; */
+/* number.c:59:OF */ extern object fSallocate_bigger_fixnum_range (fixnum min,fixnum max); /* (min, max) int min; int max; */
+/* number.c:81:OF */ extern object make_fixnum1 (long i); /* (i) int i; */
+/* number.c:102:OF */ extern object make_ratio (object num, object den); /* (num, den) object num; object den; */
+/* number.c:144:OF */ extern object make_shortfloat (double f); /* (f) double f; */
+/* number.c:157:OF */ extern object make_longfloat (longfloat f); /* (f) longfloat f; */
+/* number.c:170:OF */ extern object make_complex (object r, object i); /* (r, i) object r; object i; */
+/* number.c:229:OF */ extern double number_to_double (object x); /* (x) object x; */
+/* number.c:254:OF */ extern void gcl_init_number (void); /* () */
+/* peculiar.c:14:OF */ /* extern int main (void); */ /* () */
+/* predicate.c:35:OF */ extern object fLnot (object x0); /* (x0) object x0; */
+/* predicate.c:46:OF */ extern void Lsymbolp (void); /* () */
+/* predicate.c:48:OF */ extern object fLsymbolp (object x0); /* (x0) object x0; */
+/* predicate.c:61:OF */ extern object fLatom (object x0); /* (x0) object x0; */
+/* predicate.c:74:OF */ extern object fLconsp (object x0); /* (x0) object x0; */
+/* predicate.c:87:OF */ extern object fLlistp (object x0); /* (x0) object x0; */
+/* predicate.c:100:OF */ extern object fLnumberp (object x0); /* (x0) object x0; */
+/* predicate.c:117:OF */ extern object fLintegerp (object x0); /* (x0) object x0; */
+/* predicate.c:132:OF */ extern object fLrationalp (object x0); /* (x0) object x0; */
+/* predicate.c:148:OF */ extern object fLrealp (object x0); /* (x0) object x0; */
+/* predicate.c:164:OF */ extern object fLfloatp (object x0); /* (x0) object x0; */
+/* predicate.c:176:OF */ extern void Lcomplexp (void); /* () */
+/* predicate.c:178:OF */ extern object fLcomplexp (object x0); /* (x0) object x0; */
+/* predicate.c:190:OF */ extern object fLcharacterp (object x0); /* (x0) object x0; */
+/* predicate.c:202:OF */ extern object fLstringp (object x0); /* (x0) object x0; */
+/* predicate.c:214:OF */ extern object fLbit_vector_p (object x0); /* (x0) object x0; */
+/* predicate.c:226:OF */ extern object fLvectorp (object x0); /* (x0) object x0; */
+/* predicate.c:238:OF */ extern void Lsimple_string_p (void); /* () */
+/* predicate.c:240:OF */ extern object fLsimple_string_p (object x0); /* (x0) object x0; */
+/* predicate.c:253:OF */ extern void Lsimple_bit_vector_p (void); /* () */
+/* predicate.c:255:OF */ extern object fLsimple_bit_vector_p (object x0); /* (x0) object x0; */
+/* predicate.c:268:OF */ extern void Lsimple_vector_p (void); /* () */
+/* predicate.c:270:OF */ extern object fLsimple_vector_p (object x0); /* (x0) object x0; */
+/* predicate.c:288:OF */ extern object fLarrayp (object x0); /* (x0) object x0; */
+/* predicate.c:301:OF */ extern void Lpackagep (void); /* () */
+/* predicate.c:303:OF */ extern object fLpackagep (object x0); /* (x0) object x0; */
+/* predicate.c:313:OF */ extern void Lfunctionp (void); /* () */
+/* predicate.c:315:OF */ extern object fLfunctionp (object x0); /* (x0) object x0; */
+/* predicate.c:344:OF */ extern void Lcompiled_function_p (void); /* () */
+/* predicate.c:346:OF */ extern object fLcompiled_function_p (object x0); /* (x0) object x0; */
+/* predicate.c:367:OF */ extern object fLcommonp (object x0); /* (x0) object x0; */
+/* predicate.c:379:OF */ extern object fLeq (object x0, object x1); /* (x0, x1) object x0; object x1; */
+/* predicate.c:393:OF */ extern int eql (object x, object y); /* (x, y) object x; object y; */
+/* predicate.c:455:OF */ extern object fLeql (object x0, object x1); /* (x0, x1) object x0; object x1; */
+/* predicate.c:469:OF */ extern int equal (register object x, register object y); /* (x, y) register object x; register object y; */
+/* predicate.c:543:OF */ extern object fLequal (object x0, object x1); /* (x0, x1) object x0; object x1; */
+/* predicate.c:557:OF */ extern bool equalp (object x, object y); /* (x, y) object x; object y; */
+/* predicate.c:681:OF */ extern object fLequalp (object x0, object x1); /* (x0, x1) object x0; object x1; */
+/* predicate.c:750:OF */ extern bool contains_sharp_comma (object x); /* (x) object x; */
+/* predicate.c:797:OF */ extern object fScontains_sharp_comma (object x0); /* (x0) object x0; */
+/* predicate.c:810:OF */ extern object fSspicep (object x0); /* (x0) object x0; */
+/* predicate.c:822:OF */ extern object fSfixnump (object x0); /* (x0) object x0; */
+/* predicate.c:833:OF */ extern void gcl_init_predicate_function (void); /* () */
+/* prog.c:48:OF */ extern void Ftagbody (object body); /* (body) object body; */
+/* prog.c:246:OF */ extern void Fprogn (object body); /* (body) object body; */
+/* prog.c:303:OF */ extern void gcl_init_prog (void); /* () */
+/* reference.c:32:OF */ extern void Lfboundp (void); /* () */
+/* reference.c:49:OF */ extern object symbol_function (object sym); /* (sym) object sym; */
+/* reference.c:69:OF */ extern void Lsymbol_function (void); /* () */
+/* reference.c:143:OF */ extern void Lsymbol_value (void); /* () */
+/* reference.c:156:OF */ extern void Lboundp (void); /* () */
+/* reference.c:169:OF */ extern void Lmacro_function (void); /* () */
+/* reference.c:180:OF */ extern void Lspecial_form_p (void); /* () */
+/* reference.c:191:OF */ extern void gcl_init_reference (void); /* () */
+/* #include "regexp.h" */
+/* regexp.c:1588:OF */ extern void regerror (char *s); /* (s) char *s; */
+/* regexpr.c:48:OF */ extern object fSmatch_beginning (fixnum i); /* (i) int i; */
+/* regexpr.c:57:OF */ extern object fSmatch_end (fixnum i); /* (i) int i; */
+/* save.c:17:OF */ extern void Lsave (void); /* () */
+#include <unistd.h>
+/* sbrk.c:9:OF */ /* extern void * sbrk (int n); */ /* (n) int n; */
+/* strcspn.c:3:OF */ /* extern size_t strcspn (const char *s1, const char *s2); */ /* (s1, s2) char *s1; char *s2; */
+/* structure.c:59:OF */ extern object structure_ref (object x, object name, int i); /* (x, name, i) object x; object name; int i; */
+/* structure.c:107:OF */ extern object structure_set (object x, object name, int i, object v); /* (x, name, i, v) object x; object name; int i; object v; */
+/* structure.c:164:OF */ extern object structure_to_list (object x); /* (x) object x; */
+/* structure.c:188:OF */ extern void siLmake_structure (void); /* () */
+/* structure.c:281:OF */ extern void siLstructure_set (void); /* () */
+/* structure.c:326:OF */ extern void siLlist_nth (void); /* () */
+/* structure.c:439:OF */ extern void gcl_init_structure_function (void); /* () */
+/* toplevel.c:211:OF */ extern void gcl_init_toplevel (void); /* () */
+/* typespec.c:38:OF */ extern void check_type_integer (object *p); /* (p) object *p; */
+/* typespec.c:47:OF */ extern void check_type_non_negative_integer (object *p); /* (p) object *p; */
+/* typespec.c:65:OF */ extern void check_type_rational (object *p); /* (p) object *p; */
+/* typespec.c:75:OF */ extern void check_type_float (object *p); /* (p) object *p; */
+/* typespec.c:94:OF */ extern void check_type_or_rational_float (object *p); /* (p) object *p; */
+/* typespec.c:104:OF */ extern void check_type_number (object *p); /* (p) object *p; */
+/* typespec.c:123:OF */ extern void check_type_character (object *p); /* (p) object *p; */
+/* typespec.c:139:OF */ extern void check_type_symbol (object *p); /* (p) object *p; */
+/* typespec.c:146:OF */ extern void check_type_or_symbol_string (object *p); /* (p) object *p; */
+/* typespec.c:153:OF */ extern void check_type_or_string_symbol (object *p); /* (p) object *p; */
+/* typespec.c:170:OF */ extern void check_type_package (object *p); /* (p) object *p; */
+/* typespec.c:177:OF */ extern void check_type_string (object *p); /* (p) object *p; */
+/* typespec.c:191:OF */ extern void check_type_cons (object *p); /* (p) object *p; */
+/* typespec.c:198:OF */ extern void check_type_stream (object *p); /* (p) object *p; */
+/* typespec.c:205:OF */ extern void check_type_readtable (object *p); /* (p) object *p; */
+/* typespec.c:213:OF */ extern void check_type_or_Pathname_string_symbol (object *p); /* (p) object *p; */
+/* typespec.c:225:OF */ extern void check_type_or_pathname_string_symbol_stream (object *p); /* (p) object *p; */
+/* typespec.c:236:OF */ extern void check_type_random_state (object *p); /* (p) object *p; */
+/* typespec.c:243:OF */ extern void check_type_hash_table (object *p); /* (p) object *p; */
+/* typespec.c:250:OF */ extern void check_type_array (object *p); /* (p) object *p; */
+/* typespec.c:284:OF */ extern void check_type (object x, int t); /* (x, t) object x; int t; */
+/* typespec.c:294:OF */ extern void Ltype_of (void); /* () */
+/* typespec.c:493:OF */ extern void gcl_init_typespec (void); /* () */
+/* typespec.c:497:OF */ extern void gcl_init_typespec_function (void); /* () */
+/* unexec-19.29.c:1016:OF */ extern int write_segment (int new, register char *ptr, register char *end); /* (new, ptr, end) int new; register char *ptr; register char *end; */
+/* unexec.c:1016:OF */ extern int write_segment (int new, register char *ptr, register char *end); /* (new, ptr, end) int new; register char *ptr; register char *end; */
+/* unexlin.c:808:OF */ extern int write_segment (int new, register char *ptr, register char *end); /* (new, ptr, end) int new; register char *ptr; register char *end; */
+/* unixfasl.c:409:OF */ extern void gcl_init_unixfasl (void); /* () */
+/* unixfsys.c:145:OF */ extern char *getwd (char *buffer); /* (buffer) char *buffer; */
+/* unixfsys.c:209:OF */ extern void coerce_to_filename (object pathname, char *p); /* (pathname, p) object pathname; char *p; */
+/* unixfsys.c:329:OF */ extern bool file_exists (object file); /* (file) object file; */
+/* unixfsys.c:359:OF */ extern FILE *backup_fopen (char *filename, char *option); /* (filename, option) char *filename; char *option; */
+/* unixfsys.c:359:OF */ extern FILE *fopen_not_dir (char *filename, char *option); /* (filename, option) char *filename; char *option; */
+/* unixfsys.c:372:OF */ extern int file_len (FILE *fp); /* (fp) FILE *fp; */
+/* unixfsys.c:382:OF */ extern object truename (object); /* () */
+/* unixfsys.c:382:OF */ extern void Ltruename (void); /* () */
+/* unixfsys.c:418:OF */ extern object fSsetenv (object variable, object value); /* (variable, value) object variable; object value; */
+/* unixfsys.c:442:OF */ extern object fLdelete_file (object path); /* (path) object path; */
+/* unixfsys.c:456:OF */ extern void Lprobe_file (void); /* () */
+/* unixfsys.c:533:OF */ extern void Ldirectory (void); /* () */
+/* unixfsys.c:777:OF */ extern void gcl_init_unixfsys (void); /* () */
+/* unixsave.c:173:OF */ extern void gcl_init_unixsave (void); /* () */
+/* unixsys.c:83:OF */ extern object fSgetpid (void); /* () */
+/* unixsys.c:87:OF */ extern void gcl_init_unixsys (void); /* () */
+/* unixtime.c:67:OF */ extern int runtime (void); /* () */
+/* unixtime.c:82:OF */ extern object unix_time_to_universal_time (int i); /* (i) int i; */
+/* unixtime.c:99:OF */ extern object fLget_universal_time (void); /* () */
+/* unixtime.c:144:OF */ extern object fLget_internal_real_time (void); /* () */
+/* unixtime.c:173:OF */ extern void gcl_init_unixtime (void); /* () */
+/* user_init.c:2:OF */ extern object user_init (void); /* () */
+/* user_init.c:2:OF */ extern int user_match (const char *,int n); /* () */
+/* usig.c:49:OF */ extern void gcl_signal (int signo, void (*handler) (/* ??? */)); /* (signo, handler) int signo; void (*handler)(); */
+/* usig.c:92:OF */ extern int unblock_signals (int n, int m); /* (n, m) int n; int m; */
+/* usig.c:119:OF */ extern void unblock_sigusr_sigio (void); /* () */
+/* usig.c:182:OF */ extern void install_default_signals (void); /* () */
+/* usig2.c:142:OF */ extern void gcl_init_safety (void); /* () */
+/* usig2.c:158:OF */ extern object sSsignal_safety_required (fixnum signo,fixnum safety); /* (signo, safety) int signo; int safety; */
+#ifdef __MINGW32__
+/* usig2.c:167:OF */ extern void main_signal_handler (int signo); /* (signo) int signo */
+#else
+/* usig2.c:167:OF */ extern void main_signal_handler (int signo, int a, int b); /* (signo, a, b) int signo; int a; int b; */
+#endif
+/* usig2.c:375:OF */ extern void raise_pending_signals (int cond); /* (cond) int cond; */
+/* usig2.c:407:OF */ extern object fSallow_signal (fixnum n); /* (n) int n; */
+/* utils.c:12:OF */ extern object IisSymbol (object f); /* (f) object f; */
+/* utils.c:20:OF */ extern object IisFboundp (object f); /* (f) object f; */
+/* utils.c:30:OF */ extern object IisArray (object f); /* (f) object f; */
+/* utils.c:44:OF */ extern object Iis_fixnum (object f); /* (f) object f; */
+/* utils.c:61:OF */ extern object Iapply_ap_new (object (*f) (/* ??? */), object first, va_list ap); /* (f, ap) object (*f)(); va_list ap; */
+/* utils.c:178:OF */ extern object Icheck_one_type (object x, enum type t); /* (x, t) object x; enum type t; */
+/* utils.c:189:OF */ extern object fSincorrect_type (object val, object type); /* (val, type) object val; object type; */
+/* utils.c:202:OF */ extern object Ivs_values (void); /* () */
+/* utils.c:227:OF */ extern char *lisp_copy_to_null_terminated (object string, char *buf, int n); /* (string, buf, n) object string; char *buf; int n; */
+
+
+/* readline.d */
+extern int readline_on;
+void
+gcl_init_readline_function(void);
+
+/* sys_gcl.c */
+void
+gcl_init_init(void);
+
+/* misc */
+void
+gcl_init_symbol(void);
+
+void
+gcl_init_package(void);
+
+void
+gcl_init_character(void);
+
+void
+gcl_init_read(void);
+
+void
+gcl_init_pathname(void);
+
+void
+gcl_init_print(void);
+
+void
+gcl_init_character_function(void);
+
+void
+gcl_init_file_function(void);
+
+void
+gcl_init_list_function(void);
+
+void
+gcl_init_package_function(void);
+
+void
+gcl_init_pathname_function(void);
+
+void
+gcl_init_print_function(void);
+
+void
+gcl_init_read_function(void);
+
+void
+gcl_init_sequence_function(void);
+
+void
+gcl_init_string_function(void);
+
+void
+gcl_init_symbol_function(void);
+
+void
+gcl_init_socket_function(void);
+
+void
+gcl_init_hash(void);
+
+void
+import(object,object);
+
+void
+export(object,object);
+
+void
+NewInit(void);
+
+void
+gcl_init_system(object);
+
+void
+set_up_string_register(char *);
+
+bool
+endp1(object);
+
+void
+stack_cons(void);
+
+bool
+char_equal(object,object);
+
+bool
+string_equal(object,object);
+
+bool
+string_eq(object,object);
+
+bool
+remf(object *,object);
+
+bool
+keywordp(object);
+
+int
+pack_hash(object);
+
+void
+load(const char *);
+
+bool
+member_eq(object,object);
+
+void
+delete_eq(object,object *);
+
+int
+length(object);
+
+int
+rl_getc_em(FILE *);
+
+void
+setupPRINTdefault(object);
+
+void
+write_str(char *);
+
+void
+write_object(object,int);
+
+void
+cleanupPRINT(void);
+
+int
+fasload(object);
+
+int
+readc_stream(object);
+
+void
+unreadc_stream(int,object);
+
+void
+end_of_stream(object);
+
+bool
+stream_at_end(object);
+
+int
+digitp(int,int);
+
+bool
+char_eq(object,object);
+
+bool
+listen_stream(object);
+
+void
+get_string_start_end(object,object,object,int *,int *);
+
+int
+file_column(object);
+
+int
+writec_stream(int,object);
+
+int
+digit_weight(int,int);
+
+void
+flush_stream(object);
+
+void
+writestr_stream(char *,object);
+
+void
+write_string(object,object);
+
+void
+edit_double(int, double, int *, char *, int *);
+
+void
+sethash(object,object,object);
+
+int
+file_position(object);
+
+int
+file_position_set(object, int);
+
+void
+princ_str(char *s, object);
+
+void
+close_stream(object);
+
+void
+build_symbol_table(void);
+
+void
+gcl_init_file(void);
+
+object
+aset1(object,fixnum,object);
+
+void
+dfprintf(FILE *,char *,...);
+
+void
+Lmake_list(void);
+
+void
+Llast(void);
+
+void
+Lgensym(void);
+
+void
+Lldiff(void);
+
+void
+Lintern(void);
+
+void
+Lgensym(void);
+
+void
+Lldiff(void);
+
+void
+Lgensym(void);
+
+void
+Lintern(void);
+
+void
+Lintern(void);
+
+void
+Lreconc(void);
+
+void
+Lmember(void);
+
+void
+Ladjoin(void);
+
+void
+Llist(void);
+
+void
+Lappend(void);
+
+void
+Lread(void);
+
+void
+Lread_char(void);
+
+void
+Lchar_eq(void);
+
+void
+Lwrite_char(void);
+
+void
+Lforce_output(void);
+
+void
+Lchar_neq(void);
+
+void
+Llist(void);
+
+void
+Lwrite(void);
+
+void
+Lfresh_line(void);
+
+void
+Lsymbol_package(void);
+
+void
+Lfind_package(void);
+
+void
+Lfind_symbol(void);
+
+void
+Lpackage_name(void);
+
+void
+Lsymbol_plist(void);
+
+void
+Lpackage_nicknames(void);
+
+void
+Lpackage_use_list(void);
+
+void
+Lpackage_used_by_list(void);
+
+void
+Lstandard_char_p(void);
+
+void
+Lstring_char_p(void);
+
+void
+Lchar_code(void);
+
+void
+Lchar_bits(void);
+
+void
+Lchar_font(void);
+
+void
+Lread_line(void);
+
+void
+siLpackage_internal(void);
+
+void
+siLpackage_external(void);
+
+void
+Llist_all_packages(void);
+
+void
+Lgensym(void);
+
+void
+Lread(void);
+
+void
+Lwrite(void);
+
+void
+Lstring_equal(void);
+
+void
+Lclose(void);
+
+void
+Lnamestring(void);
+
+void
+Lmake_echo_stream(void);
+
+void
+Lmake_broadcast_stream(void);
+
+void
+Lmake_two_way_stream(void);
+
+void
+Lbutlast(void);
+
+void
+Ladjoin(void);
+
+void
+Lstring_downcase(void);
+
+void
+Lmember(void);
+
+void
+Lgensym(void);
+
+void
+Llist_all_packages(void);
+
+void
+Lfind_symbol(void);
+
+void
+Lstring_equal(void);
+
+void
+Lfind_package(void);
+
+void
+siLpackage_internal(void);
+
+void
+siLpackage_external(void);
+
+void
+Lpackage_use_list(void);
+
+void
+Lreconc(void);
+
+void
+Lstandard_char_p(void);
+
+void
+Lstring_char_p(void);
+
+void
+Lcharacter(void);
+
+void
+Llength(void);
+
+void
+Lreconc(void);
+
+void
+Llength(void);
+
+void
+Lgensym(void);
+
+void
+Llist_length(void);
+
+void
+Lgensym(void);
+
+void
+Lbutlast(void);
+
+void
+Lnconc(void);
+
+void
+Lfind_package(void);
+
+void
+Lpackage_name(void);
+
+void
+Llist(void);
+
+void
+Lfresh_line(void);
+
+void
+Lread_char(void);
+
+void
+Lunread_char(void);
+
+void
+Lread_line(void);
+
+void
+Lread(void);
+
+void
+Lforce_output(void);
+
+void
+Lwrite(void);
+
+void
+Lmember(void);
+
+void
+siLpackage_internal(void);
+
+void
+siLpackage_external(void);
+
+void
+Lmake_pathname(void);
+
+void
+Lnamestring(void);
+
+void
+Lclose(void);
+
+void
+Lgensym(void);
+
+void
+Lfresh_line(void);
+
+void
+Llist(void);
+
+void
+Lread_char(void);
+
+void
+Lchar_eq(void);
+
+void
+Lfinish_output(void);
+
+void
+Lchar_neq(void);
+
+void
+Lwrite(void);
+
+void
+Lgensym(void);
+
+void
+Lmember(void);
+
+void
+Lappend(void);
+
+void
+Lcopy_tree(void);
+
+void
+Ladjoin(void);
+
+void
+Lgetf(void);
+
+void
+Lsubst(void);
+
+void
+Lsymbol_package(void);
+
+void
+Lcopy_list(void);
+
+void
+Lintern(void);
+
+void
+Lfind_package(void);
+
+void
+LlistA(void);
+
+void
+Llist(void);
+
+void
+Lgetf(void);
+
+void
+Lstreamp(void);
+
+void
+Lpeek_char(void);
+
+void
+Lread_char(void);
+
+void
+Lread_line(void);
+
+void
+Lset_macro_character(void);
+
+void
+Lclrhash(void);
+
+void
+siLhash_set(void);
+
+void
+Lgethash(void);
+
+void
+Lremhash(void);
+
+void
+Llist_all_packages(void);
+
+void
+Lintern(void);
+
+void
+Lunintern(void);
+
+void
+Lsubseq(void);
+
+void
+Lsymbol_package(void);
+
+void
+Lfind_package(void);
+
+void
+siLpackage_internal(void);
+
+void
+siLpackage_external(void);
+
+void
+Lread_char(void);
+
+void
+Lfile_length(void);
+
+void
+Lfile_position(void);
+
+void
+Lclose(void);
+
+void
+Lsubseq(void);
+
+void
+Lnamestring(void);
+
+void
+Lmerge_pathnames(void);
+
+void
+Lcopy_list(void);
+
+void
+Lread_line(void);
+
+void
+Lgensym(void);
+
+void
+Lcopy_list(void);
+
+void
+Lintern(void);
+
+void
+Lappend(void);
+
+void
+Lgensym(void);
+
+void
+Lcopy_list(void);
+
+void
+Lmember(void);
+
+void
+Lintern(void);
+
+void
+Lappend(void);
+
+void
+Lfind_package(void);
+
+void
+Lpackage_name(void);
+
+void
+Lpackage_nicknames(void);
+
+void
+Lpackage_use_list(void);
+
+void
+siLpackage_external(void);
+
+void
+siLpackage_internal(void);
+
+void
+Lsymbol_package(void);
+
+void
+Lappend(void);
+
+void
+Lgentemp(void);
+
+void
+Lgensym(void);
+
+void
+Lassoc(void);
+
+void
+Ladjoin(void);
+
+void
+Lstring_eq(void);
+
+void
+Lmember(void);
+
+void
+Lgethash(void);
+
+void
+Lfinish_output(void);
+
+void
+Lread(void);
+
+void
+Lmake_hash_table(void);
+
+void
+siLhash_set(void);
+
+void
+Lrevappend(void);
+
+void
+Lreconc(void);
+
+void
+Lcopy_list(void);
+
+void
+LlistA(void);
+
+void
+Lfind_package(void);
+
+void
+siLpackage_internal(void);
+
+void
+siLpackage_external(void);
+
+void
+princ_char(int,object);
+
+void
+Ldigit_char_p(void);
+
+void
+Lwrite_byte(void);
+
+void
+unlink_loaded_files(void);
+
+void
+FEpackage_error(object,const char *s);
+
+int
+system_time_zone_helper(void);
+
+object
+call_proc_new(object,void **,int,object,va_list);
+
+object
+call_vproc_new(object,void *,object,va_list);
+
+void
+funcall_with_catcher(object, object);
+
+void
+siLset_symbol_plist(void);
+
+void
+Lhash_table_p(void);
+
+void
+Lreadtablep(void);
+
+int
+fixnum_expt(int, int);
+
+void
+check_alist(object);
+
+void
+ck_larg_at_least(int,object);
+
+void
+vfun_wrong_number_of_args(object);
+
+/* FIXME from lfun_list.lsp -- should be automatically generated */
+void Lgensym(void);
+void Lsubseq(void);
+void Lminusp(void);
+void Linteger_decode_float(void);
+void Lminus(void);
+void Lint_char(void);
+void Lchar_int(void);
+void Lall_different(void);
+void Lcopy_seq(void);
+void Lkeywordp(void);
+void Lname_char(void);
+void Lchar_name(void);
+void Lrassoc_if(void);
+void Lmake_list(void);
+void Lhost_namestring(void);
+void Lmake_echo_stream(void);
+void Lnth(void);
+void Lsin(void);
+void Lnumerator(void);
+void Larray_rank(void);
+void Lcaar(void);
+void Lboth_case_p(void);
+void Lnull(void);
+void Lrename_file(void);
+void Lfile_author(void);
+void Lstring_capitalize(void);
+void Lmacroexpand(void);
+void Lnconc(void);
+void Lboole(void);
+void Ltailp(void);
+void Lconsp(void);
+void Llistp(void);
+void Lmapcan(void);
+void Llength(void);
+void Lrassoc(void);
+void Lpprint(void);
+void Lpathname_host(void);
+void Lnsubst_if_not(void);
+void Lfile_position(void);
+void Lstring_l(void);
+void Lreverse(void);
+void Lstreamp(void);
+void siLputprop(void);
+void Lremprop(void);
+void Lsymbol_package(void);
+void Lnstring_upcase(void);
+void Lstring_ge(void);
+void Lrealpart(void);
+void Lnbutlast(void);
+void Larray_dimension(void);
+void Lcdr(void);
+void Leql(void);
+void Llog(void);
+void Ldirectory(void);
+void Lstring_not_equal(void);
+void Lshadowing_import(void);
+void Lmapc(void);
+void Lmapl(void);
+void Lmakunbound(void);
+void Lcons(void);
+void Llist(void);
+void Luse_package(void);
+void Lfile_length(void);
+void Lmake_symbol(void);
+void Lstring_right_trim(void);
+void Lenough_namestring(void);
+void Lprint(void);
+void Lcddaar(void);
+void Lcdadar(void);
+void Lcdaadr(void);
+void Lcaddar(void);
+void Lcadadr(void);
+void Lcaaddr(void);
+void Lset_macro_character(void);
+void Lforce_output(void);
+void Lnthcdr(void);
+void Llogior(void);
+void Lchar_downcase(void);
+void Lstring_char_p(void);
+void Lstream_element_type(void);
+void Lpackage_used_by_list(void);
+void Ldivide(void);
+void Lmaphash(void);
+void Lstring_eq(void);
+void Lpairlis(void);
+void Lsymbolp(void);
+void Lchar_not_lessp(void);
+void Lone_plus(void);
+void Lby(void);
+void Lnsubst_if(void);
+void Lcopy_list(void);
+void Ltan(void);
+void Lset(void);
+void Lfunctionp(void);
+void Lwrite_byte(void);
+void Llast(void);
+void Lmake_string(void);
+void Lcaaar(void);
+void Llist_length(void);
+void Lcdddr(void);
+void Lprin1(void);
+void Lprinc(void);
+void Llower_case_p(void);
+void Lchar_le(void);
+void Lstring_equal(void);
+void Lclear_output(void);
+void CERROR(void);
+void Lterpri(void);
+void Lnsubst(void);
+void Lunuse_package(void);
+void Lstring_not_greaterp(void);
+void Lstring_g(void);
+void Lfinish_output(void);
+void Lspecial_form_p(void);
+void Lstringp(void);
+void Lget_internal_run_time(void);
+void Ltruncate(void);
+void Lcode_char(void);
+void Lchar_code(void);
+void Lsimple_string_p(void);
+void Lrevappend(void);
+void Lhash_table_count(void);
+void Lpackage_use_list(void);
+void Lrem(void);
+void Lmin(void);
+void Lapplyhook(void);
+void Lexp(void);
+void Lchar_lessp(void);
+void Lcdar(void);
+void Lcadr(void);
+void Llist_all_packages(void);
+void Lcdr(void);
+void Lcopy_symbol(void);
+void Lacons(void);
+void Ladjustable_array_p(void);
+void Lsvref(void);
+void Lapply(void);
+void Ldecode_float(void);
+void Lsubst_if_not(void);
+void Lrplaca(void);
+void Lsymbol_plist(void);
+void Lwrite_string(void);
+void Llogeqv(void);
+void Lstring(void);
+void Lstring_upcase(void);
+void Lceiling(void);
+void Lgethash(void);
+void Ltype_of(void);
+void Lbutlast(void);
+void Lone_minus(void);
+void Lmake_hash_table(void);
+void Lstring_neq(void);
+void Lmonotonically_nondecreasing(void);
+void Lmake_broadcast_stream(void);
+void Limagpart(void);
+void Lintegerp(void);
+void Lread_char(void);
+void Lpeek_char(void);
+void Lchar_font(void);
+void Lstring_greaterp(void);
+void Loutput_stream_p(void);
+void Lash(void);
+void Llcm(void);
+void Lelt(void);
+void Lcos(void);
+void Lnstring_downcase(void);
+void Lcopy_alist(void);
+void Latan(void);
+void Ldelete_file(void);
+void Lfloat_radix(void);
+void Lsymbol_name(void);
+void Lclear_input(void);
+void Lfind_symbol(void);
+void Lchar_l(void);
+void Lhash_table_p(void);
+void Levenp(void);
+void siLcmod(void);
+void siLcplus(void);
+void siLctimes(void);
+void siLcdifference(void);
+void Lzerop(void);
+void Lcaaaar(void);
+void Lchar_ge(void);
+void Lcdddar(void);
+void Lcddadr(void);
+void Lcdaddr(void);
+void Lcadddr(void);
+void Lfill_pointer(void);
+void Lmapcar(void);
+void Lfloatp(void);
+void Lshadow(void);
+void Lmacroexpand_1(void);
+void Lsxhash(void);
+void Llisten(void);
+void Larrayp(void);
+void Lmake_pathname(void);
+void Lpathname_type(void);
+void Lfuncall(void);
+void Lclrhash(void);
+void Lgraphic_char_p(void);
+void Lfboundp(void);
+void Lnsublis(void);
+void Lchar_not_equal(void);
+void Lmacro_function(void);
+void Lsubst_if(void);
+void Lcomplexp(void);
+void Lread_line(void);
+void Lpathnamep(void);
+void Lmax(void);
+void Lin_package(void);
+void Lreadtablep(void);
+void Lfloat_sign(void);
+void Lcharacterp(void);
+void Lread(void);
+void Lnamestring(void);
+void Lunread_char(void);
+void Lcdaar(void);
+void Lcadar(void);
+void Lcaadr(void);
+void Lchar_eq(void);
+void Lalpha_char_p(void);
+void Lstring_trim(void);
+void Lmake_package(void);
+void Lclose(void);
+void Ldenominator(void);
+void Lfloat(void);
+void Lcar(void);
+void Lround(void);
+void Lsubst(void);
+void Lupper_case_p(void);
+void Larray_element_type(void);
+void Ladjoin(void);
+void Llogand(void);
+void Lmapcon(void);
+void Lintern(void);
+void Lvalues(void);
+void Lexport(void);
+void Ltimes(void);
+void Lmonotonically_increasing(void);
+void Lcomplex(void);
+void Lset_syntax_from_char(void);
+void Lchar_bit(void);
+void Linteger_length(void);
+void Lpackagep(void);
+void Linput_stream_p(void);
+void Lmonotonically_nonincreasing(void);
+void Lpathname(void);
+void Leq(void);
+void Lmake_char(void);
+void Lfile_namestring(void);
+void Lcharacter(void);
+void Lsymbol_function(void);
+void Lconstantp(void);
+void Lchar_equal(void);
+void Ltree_equal(void);
+void Lcddr(void);
+void Lgetf(void);
+void Lsave(void);
+void Lmake_random_state(void);
+void Lchar_not_greaterp(void);
+void Lexpt(void);
+void Lsqrt(void);
+void Lscale_float(void);
+void Lchar_g(void);
+void Lldiff(void);
+void Lassoc_if_not(void);
+void Lbit_vector_p(void);
+void Lnstring_capitalize(void);
+void Lsymbol_value(void);
+void Lrplacd(void);
+void Lboundp(void);
+void Lequalp(void);
+void Lsimple_bit_vector_p(void);
+void Lmember_if_not(void);
+void Lmake_two_way_stream(void);
+void Lparse_integer(void);
+void Lplus(void);
+void Lall_the_same(void);
+void Lgentemp(void);
+void Lrename_package(void);
+void Lcommonp(void);
+void Lnumberp(void);
+void Lcopy_readtable(void);
+void Lrandom_state_p(void);
+void Ldirectory_namestring(void);
+void Lstandard_char_p(void);
+void Ltruename(void);
+void Lidentity(void);
+void Lnreverse(void);
+void Lpathname_device(void);
+void Lunintern(void);
+void Lunexport(void);
+void Lfloat_precision(void);
+void Lstring_downcase(void);
+void Lcar(void);
+void Lconjugate(void);
+void Lnull(void);
+void Lread_char_no_hang(void);
+void Lfresh_line(void);
+void Lwrite_char(void);
+void Lparse_namestring(void);
+void Lstring_not_lessp(void);
+void Lchar(void);
+void Laref(void);
+void Lpackage_nicknames(void);
+void Lendp(void);
+void Loddp(void);
+void Lchar_upcase(void);
+void LlistA(void);
+void Lvalues_list(void);
+void Lequal(void);
+void Ldigit_char_p(void);
+void ERROR(void);
+void Lchar_neq(void);
+void Lpathname_directory(void);
+void Lcdaaar(void);
+void Lcadaar(void);
+void Lcaadar(void);
+void Lcaaadr(void);
+void Lcddddr(void);
+void Lget_macro_character(void);
+void Lformat(void);
+void Lcompiled_function_p(void);
+void Lsublis(void);
+void Lpathname_name(void);
+void Limport(void);
+void Llogxor(void);
+void Lrassoc_if_not(void);
+void Lchar_greaterp(void);
+void Lmake_synonym_stream(void);
+void Lalphanumericp(void);
+void Lremhash(void);
+void Lreconc(void);
+void Lmonotonically_decreasing(void);
+void Llogbitp(void);
+void Lmaplist(void);
+void Lvectorp(void);
+void Lassoc_if(void);
+void Lget_properties(void);
+void Lstring_le(void);
+void Levalhook(void);
+void Lfile_write_date(void);
+void Llogcount(void);
+void Lmerge_pathnames(void);
+void Lmember_if(void);
+void Lread_byte(void);
+void Lsimple_vector_p(void);
+void Lchar_bits(void);
+void Lcopy_tree(void);
+void Lgcd(void);
+void Lby(void);
+void Lget(void);
+void Lmod(void);
+void Ldigit_char(void);
+void Lprobe_file(void);
+void Lstring_left_trim(void);
+void Lpathname_version(void);
+void Lwrite_line(void);
+void Leval(void);
+void Latom(void);
+void Lcddar(void);
+void Lcdadr(void);
+void Lcaddr(void);
+void Lfmakunbound(void);
+void Lsleep(void);
+void Lpackage_name(void);
+void Lfind_package(void);
+void Lassoc(void);
+void Lset_char_bit(void);
+void Lfloor(void);
+void Lwrite(void);
+void Lplusp(void);
+void Lfloat_digits(void);
+void Lread_delimited_list(void);
+void Lappend(void);
+void Lmember(void);
+void Lstring_lessp(void);
+void Lrandom(void);
+void siLspecialp(void);
+void siLoutput_stream_string(void);
+void siLstructurep(void);
+void siLcopy_stream(void);
+void siLinit_system(void);
+void siLstring_to_object(void);
+void siLreset_stack_limits(void);
+void siLdisplaced_array_p(void);
+void siLrplaca_nthcdr(void);
+void siLlist_nth(void);
+void siLmake_vector(void);
+void siLaset(void);
+void siLsvset(void);
+void siLfill_pointer_set(void);
+void siLreplace_array(void);
+void siLfset(void);
+void siLhash_set(void);
+void Lboole(void);
+void siLpackage_internal(void);
+void siLpackage_external(void);
+void siLelt_set(void);
+void siLchar_set(void);
+void siLmake_structure(void);
+void siLstructure_name(void);
+void siLstructure_ref(void);
+void siLstructure_set(void);
+void siLput_f(void);
+void siLrem_f(void);
+void siLset_symbol_plist(void);
+void siLbit_array_op(void);
+
+object
+cmod(object);
+object
+ctimes(object,object);
+object
+cdifference(object,object);
+object
+cplus(object,object);
+
+object
+Icall_error_handler(object,object,int,...);
+
+void *
+gcl_gmp_alloc(size_t);
+
+int
+my_plt(const char *,unsigned long *);
+
+int
+parse_plt(void);
+
+int
+sgc_count_read_only_type(int);
+
+int
+gcl_isnormal_double(double);
+
+int
+gcl_isnormal_float(float);
+
+object
+find_init_name1(char *,unsigned);
+
+#ifdef SGC
+void
+memprotect_test_reset(void);
+#endif
+
+
+#if defined (__MINGW32__)
+int bcmp ( const void *s1, const void *s2, size_t n );
+void bcopy ( const void *s1, void *s2, size_t n );
+void bzero(void *b, size_t length);
+int TcpOutputProc ( int fd, char *buf, int toWrite, int *errorCodePtr, int block );
+void recreate_heap1 ( void );
+void gcl_init_shared_memory ( void );
+void fix_filename ( object pathname, char *filename1 );
+void alarm ( int n );
+void *sbrk ( unsigned long increment );
+void sigemptyset( sigset_t *set);
+void sigaddset ( sigset_t *set, int n);
+int sigismember ( sigset_t *set, int n );
+int sigprocmask ( int how, const sigset_t *set, sigset_t *oldset );
+#endif
+
+#ifdef GCL_GPROF
+void
+gprof_cleanup(void);
+#endif
+
+int
+msystem(const char *);
+
+void
+assert_error(const char *,unsigned,const char *,const char *);
+
+#ifdef _WIN32
+void
+detect_wine(void);
+
+void
+init_shared_memory(void);
+
+void *
+alloca(size_t);
+
+object
+find_init_string(const char *);
+
+#endif
+
+void *
+get_mmap(FILE *,void **);
+
+int
+un_mmap(void *,void *);
+
+object
+fSuse_fast_links_2(object,object);
+
+MP_INT *
+otoi(object);
+void
+isetq_fix(MP_INT *,int);
+int
+mpz_to_mpz1(MP_INT *,MP_INT *,void *);
+int
+mpz_to_mpz(MP_INT *,MP_INT *);
+int
+obj_to_mpz1(object,MP_INT *,void *);
+int
+obj_to_mpz(object,MP_INT *);
+
+
+#include "f-ol-syntax.h"
+void init_code(){do_init((void *)VV);}
+/* function definition for Q-MK_ANTIQUOT */
+
+static void L1()
+{register object *base=vs_base;
+ register object *sup=base+VM1; VC1
+ vs_check;
+ {object V1;
+ V1=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= make_cons(((object)VV[0]),(V1));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for Q-MK_PRED */
+
+static void L2()
+{register object *base=vs_base;
+ register object *sup=base+VM2; VC2
+ vs_check;
+ {object V2;
+ object V3;
+ V2=(base[0]);
+ V3=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[4]= (V2);
+ vs_top=(vs_base=base+4)+1;
+ (void) (*Lnk66)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ vs_top=(vs_base=base+3)+1;
+ (void) (*Lnk67)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ base[4]= (V3);
+ vs_top=(vs_base=base+4)+1;
+ (void) (*Lnk68)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk69)();
+ vs_top=sup;
+ if((vs_base[0])==Cnil){
+ goto T2;}
+ base[2]= listA(3,((object)VV[1]),(V2),(V3));
+ vs_top=(vs_base=base+2)+1;
+ return;
+ goto T2;
+T2:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[3]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for ML-IS_PRED */
+
+static void L3()
+{register object *base=vs_base;
+ register object *sup=base+VM3; VC3
+ vs_check;
+ {object V4;
+ V4=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V4)))==(((object)VV[1]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_PRED */
+
+static void L4()
+{register object *base=vs_base;
+ register object *sup=base+VM4; VC4
+ vs_check;
+ {object V5;
+ V5=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V5)),((object)VV[1])))){
+ goto T11;}
+ base[1]= CMPcdr((V5));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T11;
+T11:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[4]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_CONJ */
+
+static void L5()
+{register object *base=vs_base;
+ register object *sup=base+VM5; VC5
+ vs_check;
+ {object V6;
+ object V7;
+ V6=(base[0]);
+ V7=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[2]= listA(3,((object)VV[5]),(V6),(V7));
+ vs_top=(vs_base=base+2)+1;
+ return;
+ }
+}
+/* function definition for ML-IS_CONJ */
+
+static void L6()
+{register object *base=vs_base;
+ register object *sup=base+VM6; VC6
+ vs_check;
+ {object V8;
+ V8=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V8)))==(((object)VV[5]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_CONJ */
+
+static void L7()
+{register object *base=vs_base;
+ register object *sup=base+VM7; VC7
+ vs_check;
+ {object V9;
+ V9=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V9)),((object)VV[5])))){
+ goto T15;}
+ base[1]= CMPcdr((V9));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T15;
+T15:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[6]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_DISJ */
+
+static void L8()
+{register object *base=vs_base;
+ register object *sup=base+VM8; VC8
+ vs_check;
+ {object V10;
+ object V11;
+ V10=(base[0]);
+ V11=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[2]= listA(3,((object)VV[7]),(V10),(V11));
+ vs_top=(vs_base=base+2)+1;
+ return;
+ }
+}
+/* function definition for ML-IS_DISJ */
+
+static void L9()
+{register object *base=vs_base;
+ register object *sup=base+VM9; VC9
+ vs_check;
+ {object V12;
+ V12=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V12)))==(((object)VV[7]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_DISJ */
+
+static void L10()
+{register object *base=vs_base;
+ register object *sup=base+VM10; VC10
+ vs_check;
+ {object V13;
+ V13=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V13)),((object)VV[7])))){
+ goto T19;}
+ base[1]= CMPcdr((V13));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T19;
+T19:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[8]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_IMP */
+
+static void L11()
+{register object *base=vs_base;
+ register object *sup=base+VM11; VC11
+ vs_check;
+ {object V14;
+ object V15;
+ V14=(base[0]);
+ V15=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[2]= listA(3,((object)VV[9]),(V14),(V15));
+ vs_top=(vs_base=base+2)+1;
+ return;
+ }
+}
+/* function definition for ML-IS_IMP */
+
+static void L12()
+{register object *base=vs_base;
+ register object *sup=base+VM12; VC12
+ vs_check;
+ {object V16;
+ V16=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V16)))==(((object)VV[9]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_IMP */
+
+static void L13()
+{register object *base=vs_base;
+ register object *sup=base+VM13; VC13
+ vs_check;
+ {object V17;
+ V17=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V17)),((object)VV[9])))){
+ goto T23;}
+ base[1]= CMPcdr((V17));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T23;
+T23:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[10]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_NEG */
+
+static void L14()
+{register object *base=vs_base;
+ register object *sup=base+VM14; VC14
+ vs_check;
+ {object V18;
+ V18=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= listA(3,((object)VV[9]),(V18),(((object)VV[11])->s.s_dbind));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for Q-MK_FORALL */
+
+static void L15()
+{register object *base=vs_base;
+ register object *sup=base+VM15; VC15
+ vs_check;
+ {object V19;
+ object V20;
+ V19=(base[0]);
+ V20=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V21;
+ base[2]= (V19);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk70)();
+ vs_top=sup;
+ V21= vs_base[0];
+ base[2]= (V21);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk71)();
+ vs_top=sup;
+ base[2]= (V21);
+ base[3]= (V20);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk72)();
+ return;}
+ }
+}
+/* function definition for ML-MK_FORALL */
+
+static void L16()
+{register object *base=vs_base;
+ register object *sup=base+VM16; VC16
+ vs_check;
+ {object V22;
+ object V23;
+ V22=(base[0]);
+ V23=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!((CMPcar((V22)))==(((object)VV[12])))){
+ goto T33;}
+ base[2]= listA(3,((object)VV[13]),(V22),(V23));
+ vs_top=(vs_base=base+2)+1;
+ return;
+ goto T33;
+T33:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[14]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for ML-IS_FORALL */
+
+static void L17()
+{register object *base=vs_base;
+ register object *sup=base+VM17; VC17
+ vs_check;
+ {object V24;
+ V24=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V24)))==(((object)VV[13]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_FORALL */
+
+static void L18()
+{register object *base=vs_base;
+ register object *sup=base+VM18; VC18
+ vs_check;
+ {object V25;
+ V25=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V25)),((object)VV[13])))){
+ goto T37;}
+ base[1]= CMPcdr((V25));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T37;
+T37:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[15]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_EXISTS */
+
+static void L19()
+{register object *base=vs_base;
+ register object *sup=base+VM19; VC19
+ vs_check;
+ {object V26;
+ object V27;
+ V26=(base[0]);
+ V27=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V28;
+ base[2]= (V26);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk70)();
+ vs_top=sup;
+ V28= vs_base[0];
+ base[2]= (V28);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk71)();
+ vs_top=sup;
+ base[2]= (V28);
+ base[3]= (V27);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk73)();
+ return;}
+ }
+}
+/* function definition for ML-MK_EXISTS */
+
+static void L20()
+{register object *base=vs_base;
+ register object *sup=base+VM20; VC20
+ vs_check;
+ {object V29;
+ object V30;
+ V29=(base[0]);
+ V30=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!((CMPcar((V29)))==(((object)VV[12])))){
+ goto T47;}
+ base[2]= listA(3,((object)VV[16]),(V29),(V30));
+ vs_top=(vs_base=base+2)+1;
+ return;
+ goto T47;
+T47:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[17]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for ML-IS_EXISTS */
+
+static void L21()
+{register object *base=vs_base;
+ register object *sup=base+VM21; VC21
+ vs_check;
+ {object V31;
+ V31=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V31)))==(((object)VV[16]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_EXISTS */
+
+static void L22()
+{register object *base=vs_base;
+ register object *sup=base+VM22; VC22
+ vs_check;
+ {object V32;
+ V32=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V32)),((object)VV[16])))){
+ goto T51;}
+ base[1]= CMPcdr((V32));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T51;
+T51:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[18]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_EQUIV */
+
+static void L23()
+{register object *VOL base=vs_base;
+ register object *VOL sup=base+VM23; VC23
+ vs_check;
+ {VOL object V33;
+ VOL object V34;
+ V33=(base[0]);
+ V34=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {VOL object V35;
+ frs_push(FRS_CATCH,((object)VV[2]));
+ if(nlj_active)
+ {nlj_active=FALSE;frs_pop();
+ vs_top=sup;
+ V35= vs_base[0];
+ goto T54;}
+ else{
+ base[2]= ((object)VV[19]);
+ base[4]= (V33);
+ base[5]= (V34);
+ vs_top=(vs_base=base+4)+2;
+ (void) (*Lnk74)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk75)();
+ vs_top=sup;
+ V36= vs_base[0];
+ V37= make_cons(V36,Cnil);
+ frs_pop();
+ V35= V37;}
+ goto T54;
+T54:;
+ if(!(type_of((V35))!=t_cons)){
+ goto T62;}
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[20]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}
+ goto T62;
+T62:;
+ base[2]= CMPcar((V35));
+ vs_top=(vs_base=base+2)+1;
+ return;}
+ }
+}
+/* function definition for Q-MK_INEQUIV */
+
+static void L24()
+{register object *VOL base=vs_base;
+ register object *VOL sup=base+VM24; VC24
+ vs_check;
+ {VOL object V39;
+ VOL object V40;
+ V39=(base[0]);
+ V40=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {VOL object V41;
+ frs_push(FRS_CATCH,((object)VV[2]));
+ if(nlj_active)
+ {nlj_active=FALSE;frs_pop();
+ vs_top=sup;
+ V41= vs_base[0];
+ goto T65;}
+ else{
+ base[2]= ((object)VV[21]);
+ base[4]= (V39);
+ base[5]= (V40);
+ vs_top=(vs_base=base+4)+2;
+ (void) (*Lnk74)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk75)();
+ vs_top=sup;
+ V42= vs_base[0];
+ V43= make_cons(V42,Cnil);
+ frs_pop();
+ V41= V43;}
+ goto T65;
+T65:;
+ if(!(type_of((V41))!=t_cons)){
+ goto T73;}
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[22]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}
+ goto T73;
+T73:;
+ base[2]= CMPcar((V41));
+ vs_top=(vs_base=base+2)+1;
+ return;}
+ }
+}
+/* function definition for Q-MK_VAR */
+
+static void L25()
+{register object *base=vs_base;
+ register object *sup=base+VM25; VC25
+ vs_check;
+ {object V45;
+ V45=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;{object V47;
+ base[1]= (V45);
+ base[2]= (((object)VV[23])->s.s_dbind);
+ vs_top=(vs_base=base+1)+2;
+ (void) (*Lnk76)();
+ vs_top=sup;
+ V47= vs_base[0];
+ if(V47==Cnil)goto T77;
+ V46= V47;
+ goto T76;
+ goto T77;
+T77:;}
+ base[1]= (V45);
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk77)();
+ vs_top=sup;
+ V46= vs_base[0];
+ goto T76;
+T76:;
+ base[1]= listA(3,((object)VV[12]),(V45),V46);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for NEW-VAR-TYPE */
+
+static void L26()
+{register object *base=vs_base;
+ register object *sup=base+VM26; VC26
+ vs_check;
+ {object V48;
+ V48=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V49;
+ vs_base=vs_top;
+ (void) (*Lnk78)();
+ vs_top=sup;
+ V49= vs_base[0];
+ {object V50;
+ V50= make_cons((V48),(V49));
+ (((object)VV[23])->s.s_dbind)= make_cons((V50),(((object)VV[23])->s.s_dbind));}
+ base[1]= (V49);
+ vs_top=(vs_base=base+1)+1;
+ return;}
+ }
+}
+/* function definition for Q-FREE-VAR */
+
+static void L27()
+{register object *base=vs_base;
+ register object *sup=base+VM27; VC27
+ vs_check;
+ {object V51;
+ V51=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!((CMPcar((V51)))==(((object)VV[12])))){
+ goto T87;}
+ base[1]= CMPcadr((V51));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk77)();
+ return;
+ goto T87;
+T87:;
+ base[1]= Cnil;
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for MK_REALVAR */
+
+static void L28()
+{register object *base=vs_base;
+ register object *sup=base+VM28; VC28
+ vs_check;
+ {object V52;
+ object V53;
+ V52=(base[0]);
+ V53=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;{object V54;
+ base[2]= (V53);
+ {object V55 =((V52))->s.s_plist;
+ object ind= ((object)VV[24]);
+ while(V55!=Cnil){
+ if(V55->c.c_car==ind){
+ base[3]= (V55->c.c_cdr->c.c_car);
+ goto T93;
+ }else V55=V55->c.c_cdr->c.c_cdr;}
+ base[3]= Cnil;}
+ goto T93;
+T93:;
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk76)();
+ vs_top=sup;
+ V54= vs_base[0];
+ if(V54==Cnil)goto T90;
+ base[2]= V54;
+ vs_top=(vs_base=base+2)+1;
+ return;
+ goto T90;
+T90:;}
+ base[2]= (V52);
+ V57= listA(3,((object)VV[12]),(V52),(V53));
+ base[3]= make_cons((V53),/* INLINE-ARGS */V57);
+ base[4]= ((object)VV[24]);
+ vs_top=(vs_base=base+2)+3;
+ (void) (*Lnk79)();
+ vs_top=sup;
+ V56= vs_base[0];
+ base[2]= CMPcdr(V56);
+ vs_top=(vs_base=base+2)+1;
+ return;
+ }
+}
+/* function definition for ML-GENVAR */
+
+static void L29()
+{register object *base=vs_base;
+ register object *sup=base+VM29; VC29
+ vs_check;
+ {object V58;
+ V58=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[2]= ((object)VV[25]);
+ base[3]= ((object)VV[12]);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk80)();
+ vs_top=sup;
+ base[1]= vs_base[0];
+ base[2]= (V58);
+ vs_top=(vs_base=base+1)+2;
+ (void) (*Lnk81)();
+ return;
+ }
+}
+/* function definition for ML-IS_VAR */
+
+static void L30()
+{register object *base=vs_base;
+ register object *sup=base+VM30; VC30
+ vs_check;
+ {object V59;
+ V59=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V59)))==(((object)VV[12]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_VAR */
+
+static void L31()
+{register object *base=vs_base;
+ register object *sup=base+VM31; VC31
+ vs_check;
+ {object V60;
+ V60=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V60)),((object)VV[12])))){
+ goto T103;}
+ base[1]= CMPcdr((V60));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T103;
+T103:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[26]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_CONST */
+
+static void L32()
+{register object *base=vs_base;
+ register object *sup=base+VM32; VC32
+ vs_check;
+ {object V61;
+ V61=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[2]= (V61);
+ base[1]= simple_symlispcall(((object)VV[82]),base+2,1);
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk67)();
+ vs_top=sup;
+ V62= vs_base[0];
+ base[1]= listA(3,((object)VV[27]),(V61),V62);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-MK_CONST */
+
+static void L33()
+{register object *base=vs_base;
+ register object *sup=base+VM33; VC33
+ vs_check;
+ {register object V63;
+ register object V64;
+ V63=(base[0]);
+ V64=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V65;
+ base[2]= (V64);
+ {object V66 =((V63))->s.s_plist;
+ object ind= ((object)VV[28]);
+ while(V66!=Cnil){
+ if(V66->c.c_car==ind){
+ base[3]= (V66->c.c_cdr->c.c_car);
+ goto T111;
+ }else V66=V66->c.c_cdr->c.c_cdr;}
+ base[3]= Cnil;}
+ goto T111;
+T111:;
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk76)();
+ vs_top=sup;
+ V65= vs_base[0];
+ if(((V65))==Cnil){
+ goto T113;}
+ base[2]= (V65);
+ vs_top=(vs_base=base+2)+1;
+ return;
+ goto T113;
+T113:;
+ base[2]= (V63);
+ if((simple_symlispcall(((object)VV[82]),base+2,1))==Cnil){
+ goto T116;}
+ base[2]= (V64);
+ base[5]= (V63);
+ base[4]= simple_symlispcall(((object)VV[82]),base+5,1);
+ vs_top=(vs_base=base+4)+1;
+ (void) (*Lnk67)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk69)();
+ vs_top=sup;
+ if((vs_base[0])==Cnil){
+ goto T116;}
+ base[2]= (V63);
+ V68= listA(3,((object)VV[27]),(V63),(V64));
+ base[3]= make_cons((V64),/* INLINE-ARGS */V68);
+ base[4]= ((object)VV[28]);
+ vs_top=(vs_base=base+2)+3;
+ (void) (*Lnk79)();
+ vs_top=sup;
+ V67= vs_base[0];
+ base[2]= CMPcdr(V67);
+ vs_top=(vs_base=base+2)+1;
+ return;
+ goto T116;
+T116:;
+ base[2]= (V63);
+ if((simple_symlispcall(((object)VV[82]),base+2,1))!=Cnil){
+ goto T130;}
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[29]);
+ base[3]= (V63);
+ base[4]= ((object)VV[30]);
+ vs_top=(vs_base=base+2)+3;
+ (void) (*Lnk83)();
+ unwind(fr,((object)VV[2]));}
+ goto T130;
+T130:;
+ base[2]= (V64);
+ base[5]= (V63);
+ base[4]= simple_symlispcall(((object)VV[82]),base+5,1);
+ vs_top=(vs_base=base+4)+1;
+ (void) (*Lnk67)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk69)();
+ vs_top=sup;
+ if((vs_base[0])!=Cnil){
+ goto T138;}
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[31]);
+ base[3]= (V63);
+ base[4]= ((object)VV[32]);
+ vs_top=(vs_base=base+2)+3;
+ (void) (*Lnk83)();
+ unwind(fr,((object)VV[2]));}
+ goto T138;
+T138:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[33]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}}
+ }
+}
+/* function definition for ML-IS_CONST */
+
+static void L34()
+{register object *base=vs_base;
+ register object *sup=base+VM34; VC34
+ vs_check;
+ {object V69;
+ V69=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V69)))==(((object)VV[27]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_CONST */
+
+static void L35()
+{register object *base=vs_base;
+ register object *sup=base+VM35; VC35
+ vs_check;
+ {object V70;
+ V70=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V70)),((object)VV[27])))){
+ goto T150;}
+ base[1]= CMPcdr((V70));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T150;
+T150:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[34]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_ABS */
+
+static void L36()
+{register object *base=vs_base;
+ register object *sup=base+VM36; VC36
+ vs_check;
+ {object V71;
+ object V72;
+ V71=(base[0]);
+ V72=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V73;
+ base[2]= (V71);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk70)();
+ vs_top=sup;
+ V73= vs_base[0];
+ base[2]= (V73);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk71)();
+ vs_top=sup;
+ base[2]= (V73);
+ base[3]= (V72);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk84)();
+ return;}
+ }
+}
+/* function definition for ML-MK_ABS */
+
+static void L37()
+{register object *base=vs_base;
+ register object *sup=base+VM37; VC37
+ vs_check;
+ {object V74;
+ object V75;
+ V74=(base[0]);
+ V75=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!((CMPcar((V74)))==(((object)VV[12])))){
+ goto T160;}
+ V76= make_cons((V74),(V75));
+ base[2]= (V74);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk68)();
+ vs_top=sup;
+ V77= vs_base[0];
+ base[2]= (V75);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk68)();
+ vs_top=sup;
+ V78= vs_base[0];
+ V79= list(2,V77,V78);
+ base[2]= listA(3,((object)VV[35]),/* INLINE-ARGS */V76,make_cons(((object)VV[36]),/* INLINE-ARGS */V79));
+ vs_top=(vs_base=base+2)+1;
+ return;
+ goto T160;
+T160:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[37]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for ML-IS_ABS */
+
+static void L38()
+{register object *base=vs_base;
+ register object *sup=base+VM38; VC38
+ vs_check;
+ {object V80;
+ V80=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V80)))==(((object)VV[35]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_ABS */
+
+static void L39()
+{register object *base=vs_base;
+ register object *sup=base+VM39; VC39
+ vs_check;
+ {object V81;
+ V81=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V81)),((object)VV[35])))){
+ goto T169;}
+ V82= CMPcdr((V81));
+ goto T167;
+ goto T169;
+T169:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[38]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ goto T167;
+T167:;
+ base[1]= CMPcar(V82);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for PREP-TERM-FN */
+
+static void L40()
+{register object *base=vs_base;
+ register object *sup=base+VM40; VC40
+ vs_check;
+ {register object V83;
+ V83=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V84= CMPcar((V83));
+ if((V84!= ((object)VV[12])))goto T172;
+ V85= CMPcadr((V83));
+ base[1]= CMPcddr((V83));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk85)();
+ vs_top=sup;
+ V86= vs_base[0];
+ base[1]= listA(3,((object)VV[12]),/* INLINE-ARGS */V85,V86);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T172;
+T172:;
+ if((V84!= ((object)VV[27])))goto T175;
+ V87= CMPcadr((V83));
+ base[1]= CMPcddr((V83));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk85)();
+ vs_top=sup;
+ V88= vs_base[0];
+ base[1]= listA(3,((object)VV[27]),/* INLINE-ARGS */V87,V88);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T175;
+T175:;
+ if((V84!= ((object)VV[39])))goto T178;
+ base[1]= CMPcaadr((V83));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk86)();
+ vs_top=sup;
+ V89= vs_base[0];
+ base[1]= CMPcdadr((V83));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk86)();
+ vs_top=sup;
+ V90= vs_base[0];
+ V91= make_cons(V89,V90);
+ base[1]= CMPcddr((V83));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk85)();
+ vs_top=sup;
+ V92= vs_base[0];
+ base[1]= listA(3,((object)VV[39]),/* INLINE-ARGS */V91,V92);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T178;
+T178:;
+ if((V84!= ((object)VV[35])))goto T185;
+ base[1]= CMPcaadr((V83));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk86)();
+ vs_top=sup;
+ V93= vs_base[0];
+ base[1]= CMPcdadr((V83));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk86)();
+ vs_top=sup;
+ V94= vs_base[0];
+ V95= make_cons(V93,V94);
+ base[1]= CMPcddr((V83));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk85)();
+ vs_top=sup;
+ V96= vs_base[0];
+ base[1]= listA(3,((object)VV[35]),/* INLINE-ARGS */V95,V96);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T185;
+T185:;
+ if((V84!= ((object)VV[0])))goto T192;
+ V83= CMPcdr((V83));
+ goto TTL;
+ goto T192;
+T192:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[40]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}}
+ }
+}
+/* function definition for PREP-TERM-FOR-PRINT */
+
+static void L41()
+{register object *base=vs_base;
+ register object *sup=base+VM41; VC41
+ vs_check;
+ bds_check;
+ {object V97;
+ V97=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V98;
+ base[1]= (V97);
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk87)();
+ vs_top=sup;
+ V98= vs_base[0];
+ base[3]= (V98);
+ vs_top=(vs_base=base+3)+1;
+ (void) (*Lnk88)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk89)();
+ vs_top=sup;
+ base[1]= vs_base[0];
+ bds_bind(((object)VV[41]),base[1]);
+ base[2]= (V98);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk86)();
+ bds_unwind1;
+ return;}
+ }
+}
+/* function definition for ADD-TERM-LINKS */
+
+static void L42()
+{register object *base=vs_base;
+ register object *sup=base+VM42; VC42
+ vs_check;
+ {register object V99;
+ V99=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V100= CMPcar((V99));
+ if((V100!= ((object)VV[12])))goto T202;
+ V101= CMPcadr((V99));
+ base[1]= CMPcddr((V99));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk90)();
+ vs_top=sup;
+ V102= vs_base[0];
+ base[1]= listA(3,((object)VV[12]),/* INLINE-ARGS */V101,V102);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T202;
+T202:;
+ if((V100!= ((object)VV[27])))goto T205;
+ V103= CMPcadr((V99));
+ base[1]= CMPcddr((V99));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk90)();
+ vs_top=sup;
+ V104= vs_base[0];
+ base[1]= listA(3,((object)VV[27]),/* INLINE-ARGS */V103,V104);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T205;
+T205:;
+ if((V100!= ((object)VV[39])))goto T208;
+ base[1]= CMPcaadr((V99));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk87)();
+ vs_top=sup;
+ V105= vs_base[0];
+ base[1]= CMPcdadr((V99));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk87)();
+ vs_top=sup;
+ V106= vs_base[0];
+ V107= make_cons(V105,V106);
+ base[1]= CMPcddr((V99));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk90)();
+ vs_top=sup;
+ V108= vs_base[0];
+ base[1]= listA(3,((object)VV[39]),/* INLINE-ARGS */V107,V108);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T208;
+T208:;
+ if((V100!= ((object)VV[35])))goto T215;
+ base[1]= CMPcaadr((V99));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk87)();
+ vs_top=sup;
+ V109= vs_base[0];
+ base[1]= CMPcdadr((V99));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk87)();
+ vs_top=sup;
+ V110= vs_base[0];
+ V111= make_cons(V109,V110);
+ base[1]= CMPcddr((V99));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk90)();
+ vs_top=sup;
+ V112= vs_base[0];
+ base[1]= listA(3,((object)VV[35]),/* INLINE-ARGS */V111,V112);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T215;
+T215:;
+ if((V100!= ((object)VV[0])))goto T222;
+ V99= CMPcdr((V99));
+ goto TTL;
+ goto T222;
+T222:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[42]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}}
+ }
+}
+/* function definition for ADD-TYPE-LINKS */
+
+static void L43()
+{register object *base=vs_base;
+ register object *sup=base+VM43; VC43
+ vs_check;
+ {register object V113;
+ V113=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V114= CMPcar((V113));
+ if((V114!= ((object)VV[0])))goto T226;
+ base[1]= CMPcdr((V113));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T226;
+T226:;
+ if((V114!= ((object)VV[47])))goto T227;
+ base[1]= (V113);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T227;
+T227:;
+ if((V114!= ((object)VV[43])))goto T228;
+ {object V115= CMPcdr((V113));
+ if(!(type_of(V115)==t_fixnum||
+type_of(V115)==t_bignum||
+type_of(V115)==t_ratio||
+type_of(V115)==t_shortfloat||
+type_of(V115)==t_longfloat||
+type_of(V115)==t_complex)){
+ goto T230;}}
+ base[1]= (V113);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T230;
+T230:;
+ if((CMPcdr((V113)))!=Cnil){
+ goto T233;}
+ (((object)VV[44])->s.s_dbind)= number_plus((((object)VV[44])->s.s_dbind),small_fixnum(1));
+ base[1]= make_cons(((object)VV[43]),(((object)VV[44])->s.s_dbind));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T233;
+T233:;
+ V113= CMPcdr((V113));
+ goto TTL;
+ goto T228;
+T228:;
+ V116= CMPcar((V113));
+ {object V118;
+ object V119= CMPcdr((V113));
+ if(V119==Cnil){
+ V117= Cnil;
+ goto T238;}
+ base[1]=V118=MMcons(Cnil,Cnil);
+ goto T239;
+T239:;
+ base[2]= (V119->c.c_car);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk90)();
+ vs_top=sup;
+ (V118->c.c_car)= vs_base[0];
+ if((V119=MMcdr(V119))==Cnil){
+ V117= base[1];
+ goto T238;}
+ V118=MMcdr(V118)=MMcons(Cnil,Cnil);
+ goto T239;}
+ goto T238;
+T238:;
+ base[1]= make_cons(/* INLINE-ARGS */V116,V117);
+ vs_top=(vs_base=base+1)+1;
+ return;}
+ }
+}
+/* function definition for GET-TYPE-LINKS */
+
+static void L44()
+{register object *base=vs_base;
+ register object *sup=base+VM44; VC44
+ vs_check;
+ {register object V120;
+ V120=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V121= CMPcar((V120));
+ if((V121!= ((object)VV[0]))
+ && (V121!= ((object)VV[47])))goto T242;
+ base[1]= Cnil;
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T242;
+T242:;
+ if((V121!= ((object)VV[43])))goto T243;
+ {object V122= CMPcdr((V120));
+ if(!(type_of(V122)==t_fixnum||
+type_of(V122)==t_bignum||
+type_of(V122)==t_ratio||
+type_of(V122)==t_shortfloat||
+type_of(V122)==t_longfloat||
+type_of(V122)==t_complex)){
+ goto T245;}}
+ base[1]= make_cons(CMPcdr((V120)),Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T245;
+T245:;
+ V120= CMPcdr((V120));
+ goto TTL;
+ goto T243;
+T243:;
+ {object V123;
+ {object V124;
+ object V125= CMPcdr((V120));
+ if(V125==Cnil){
+ V123= Cnil;
+ goto T249;}
+ base[1]=V124=MMcons(Cnil,Cnil);
+ goto T250;
+T250:;
+ base[2]= (V125->c.c_car);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk91)();
+ vs_top=sup;
+ (V124->c.c_car)= vs_base[0];
+ if((V125=MMcdr(V125))==Cnil){
+ V123= base[1];
+ goto T249;}
+ V124=MMcdr(V124)=MMcons(Cnil,Cnil);
+ goto T250;}
+ goto T249;
+T249:;
+ vs_top=base+1;
+ while(V123!=Cnil)
+ {vs_push((V123)->c.c_car);V123=(V123)->c.c_cdr;}
+ vs_base=base+1;}
+ Lappend();
+ return;}
+ }
+}
+/* function definition for GET-TERM-LINKS */
+
+static void L45()
+{register object *base=vs_base;
+ register object *sup=base+VM45; VC45
+ vs_check;
+ {register object V126;
+ V126=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V127= CMPcar((V126));
+ if((V127!= ((object)VV[12])))goto T253;
+ base[1]= CMPcddr((V126));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk91)();
+ return;
+ goto T253;
+T253:;
+ if((V127!= ((object)VV[27])))goto T255;
+ base[1]= CMPcddr((V126));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk91)();
+ return;
+ goto T255;
+T255:;
+ if((V127!= ((object)VV[39])))goto T257;
+ base[1]= CMPcaadr((V126));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk88)();
+ vs_top=sup;
+ V128= vs_base[0];
+ base[1]= CMPcdadr((V126));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk88)();
+ vs_top=sup;
+ V129= vs_base[0];
+ base[1]= append(V128,V129);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T257;
+T257:;
+ if((V127!= ((object)VV[35])))goto T262;
+ base[1]= CMPcaadr((V126));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk88)();
+ vs_top=sup;
+ V130= vs_base[0];
+ base[1]= CMPcdadr((V126));
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk88)();
+ vs_top=sup;
+ V131= vs_base[0];
+ base[1]= append(V130,V131);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T262;
+T262:;
+ if((V127!= ((object)VV[0])))goto T267;
+ V126= CMPcdr((V126));
+ goto TTL;
+ goto T267;
+T267:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[45]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}}
+ }
+}
+/* function definition for MAKE-LINK-NAMES */
+
+static void L46()
+{register object *base=vs_base;
+ register object *sup=base+VM46; VC46
+ vs_check;
+ {object V132;
+ V132=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {register object V133;
+ register object V134;
+ register object V135;
+ V133= Cnil;
+ V134= Cnil;
+ V135= Cnil;
+ if(((V132))!=Cnil){
+ goto T275;}
+ base[1]= make_cons(Cnil,Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T275;
+T275:;
+ if(!(((long)length((V132)))==((long)1))){
+ goto T273;}
+ V136= make_cons(CMPcar((V132)),((object)VV[46]));
+ base[1]= make_cons(/* INLINE-ARGS */V136,Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T273;
+T273:;
+ V135= small_fixnum(1);
+ V133= (V132);
+ V134= Cnil;
+ goto T272;
+T272:;
+ if(((V133))!=Cnil){
+ goto T286;}
+ base[1]= (V134);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T286;
+T286:;
+ {object V137;
+ {register object x= CMPcar((V133)),V138= (V134);
+ while(V138!=Cnil)
+ if(equal(x,V138->c.c_car->c.c_car) &&V138->c.c_car != Cnil){
+ V137= (V138->c.c_car);
+ goto T288;
+ }else V138=V138->c.c_cdr;
+ V137= Cnil;}
+ goto T288;
+T288:;
+ if(((V137))==Cnil){
+ goto T290;}
+ goto T284;
+ goto T290;
+T290:;
+ V139= CMPcar((V133));
+ base[1]= ((object)VV[46]);
+ base[2]= (V135);
+ vs_top=(vs_base=base+1)+2;
+ (void) (*Lnk83)();
+ vs_top=sup;
+ V140= vs_base[0];
+ V141= make_cons(/* INLINE-ARGS */V139,V140);
+ V134= make_cons(/* INLINE-ARGS */V141,(V134));
+ V135= one_plus((V135));}
+ goto T284;
+T284:;
+ V133= CMPcdr((V133));
+ goto T272;}
+ }
+}
+/* function definition for PREP-TY-FN */
+
+static void L47()
+{register object *base=vs_base;
+ register object *sup=base+VM47; VC47
+ vs_check;
+ {register object V142;
+ V142=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V143= CMPcar((V142));
+ if((V143!= ((object)VV[0])))goto T301;
+ base[1]= CMPcdr((V142));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T301;
+T301:;
+ if((V143!= ((object)VV[47])))goto T302;
+ base[1]= (V142);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T302;
+T302:;
+ if((V143!= ((object)VV[43])))goto T303;
+ {object V144= CMPcdr((V142));
+ if(!(type_of(V144)==t_fixnum||
+type_of(V144)==t_bignum||
+type_of(V144)==t_ratio||
+type_of(V144)==t_shortfloat||
+type_of(V144)==t_longfloat||
+type_of(V144)==t_complex)){
+ goto T305;}}
+ {register object x= CMPcdr((V142)),V146= (((object)VV[41])->s.s_dbind);
+ while(V146!=Cnil)
+ if(equal(x,V146->c.c_car->c.c_car) &&V146->c.c_car != Cnil){
+ V145= (V146->c.c_car);
+ goto T307;
+ }else V146=V146->c.c_cdr;
+ V145= Cnil;}
+ goto T307;
+T307:;
+ base[1]= make_cons(((object)VV[47]),CMPcdr(V145));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T305;
+T305:;
+ V142= CMPcdr((V142));
+ goto TTL;
+ goto T303;
+T303:;
+ V147= CMPcar((V142));
+ {object V149;
+ object V150= CMPcdr((V142));
+ if(V150==Cnil){
+ V148= Cnil;
+ goto T310;}
+ base[1]=V149=MMcons(Cnil,Cnil);
+ goto T311;
+T311:;
+ base[2]= (V150->c.c_car);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk85)();
+ vs_top=sup;
+ (V149->c.c_car)= vs_base[0];
+ if((V150=MMcdr(V150))==Cnil){
+ V148= base[1];
+ goto T310;}
+ V149=MMcdr(V149)=MMcons(Cnil,Cnil);
+ goto T311;}
+ goto T310;
+T310:;
+ base[1]= make_cons(/* INLINE-ARGS */V147,V148);
+ vs_top=(vs_base=base+1)+1;
+ return;}
+ }
+}
+/* function definition for PREP-TY-FOR-PRINT */
+
+static void L48()
+{register object *base=vs_base;
+ register object *sup=base+VM48; VC48
+ vs_check;
+ bds_check;
+ {object V151;
+ V151=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V152;
+ base[1]= (V151);
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk90)();
+ vs_top=sup;
+ V152= vs_base[0];
+ base[3]= (V152);
+ vs_top=(vs_base=base+3)+1;
+ (void) (*Lnk91)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk89)();
+ vs_top=sup;
+ base[1]= vs_base[0];
+ bds_bind(((object)VV[41]),base[1]);
+ base[2]= (V152);
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk85)();
+ bds_unwind1;
+ return;}
+ }
+}
+/* function definition for PREP-TERM-TY */
+
+static void L49()
+{register object *base=vs_base;
+ register object *sup=base+VM49; VC49
+ vs_check;
+ {object V153;
+ V153=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!((CMPcar((V153)))==(((object)VV[0])))){
+ goto T321;}
+ base[1]= CMPcddr(CMPcdr((V153)));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T321;
+T321:;
+ base[1]= CMPcddr((V153));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for PRINT-MK_COMB-ERROR */
+
+static void L50()
+{register object *base=vs_base;
+ register object *sup=base+VM50; VC50
+ vs_check;
+ {object V154;
+ object V155;
+ V154=(base[0]);
+ V155=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[2]= ((object)VV[48]);
+ base[3]= small_fixnum(27);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk92)();
+ vs_top=sup;
+ base[2]= small_fixnum(2);
+ base[3]= small_fixnum(4);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk93)();
+ vs_top=sup;
+ base[3]= (V154);
+ vs_top=(vs_base=base+3)+1;
+ (void) (*Lnk94)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk95)();
+ vs_top=sup;
+ vs_base=vs_top;
+ (void) (*Lnk96)();
+ vs_top=sup;
+ base[2]= ((object)VV[49]);
+ base[3]= small_fixnum(27);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk92)();
+ vs_top=sup;
+ base[2]= small_fixnum(2);
+ base[3]= small_fixnum(4);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk93)();
+ vs_top=sup;
+ base[4]= (V154);
+ vs_top=(vs_base=base+4)+1;
+ (void) (*Lnk97)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ vs_top=(vs_base=base+3)+1;
+ (void) (*Lnk98)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk99)();
+ vs_top=sup;
+ vs_base=vs_top;
+ (void) (*Lnk96)();
+ vs_top=sup;
+ base[2]= ((object)VV[50]);
+ base[3]= small_fixnum(27);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk92)();
+ vs_top=sup;
+ base[2]= small_fixnum(2);
+ base[3]= small_fixnum(4);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk93)();
+ vs_top=sup;
+ base[3]= (V155);
+ vs_top=(vs_base=base+3)+1;
+ (void) (*Lnk94)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk95)();
+ vs_top=sup;
+ vs_base=vs_top;
+ (void) (*Lnk96)();
+ vs_top=sup;
+ base[2]= ((object)VV[51]);
+ base[3]= small_fixnum(27);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk92)();
+ vs_top=sup;
+ base[2]= small_fixnum(2);
+ base[3]= small_fixnum(4);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk93)();
+ vs_top=sup;
+ base[4]= (V155);
+ vs_top=(vs_base=base+4)+1;
+ (void) (*Lnk97)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ vs_top=(vs_base=base+3)+1;
+ (void) (*Lnk98)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ vs_top=(vs_base=base+2)+1;
+ (void) (*Lnk99)();
+ vs_top=sup;
+ vs_base=vs_top;
+ (void) (*Lnk96)();
+ vs_top=sup;
+ vs_base=vs_top;
+ (void) (*Lnk96)();
+ return;
+ }
+}
+/* function definition for Q-MK_COMB */
+
+static void L51()
+{register object *base=vs_base;
+ register object *sup=base+VM51; VC51
+ vs_check;
+ {object V156;
+ object V157;
+ V156=(base[0]);
+ V157=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V158;
+ vs_base=vs_top;
+ (void) (*Lnk78)();
+ vs_top=sup;
+ V158= vs_base[0];
+ base[3]= (V156);
+ vs_top=(vs_base=base+3)+1;
+ (void) (*Lnk68)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ base[4]= (V157);
+ vs_top=(vs_base=base+4)+1;
+ (void) (*Lnk68)();
+ vs_top=sup;
+ V159= vs_base[0];
+ V160= list(2,V159,(V158));
+ base[3]= make_cons(((object)VV[36]),/* INLINE-ARGS */V160);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk69)();
+ vs_top=sup;
+ if((vs_base[0])==Cnil){
+ goto T367;}
+ base[2]= listA(3,((object)VV[39]),make_cons((V156),(V157)),(V158));
+ vs_top=(vs_base=base+2)+1;
+ return;
+ goto T367;
+T367:;
+ if(((((object)VV[52])->s.s_dbind))==Cnil){
+ goto T374;}
+ base[2]= (V156);
+ base[3]= (V157);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk100)();
+ vs_top=sup;
+ goto T374;
+T374:;
+ {object V161;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[53]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}
+ base[2]= (V161);
+ vs_top=(vs_base=base+2)+1;
+ return;}}
+ }
+}
+/* function definition for ML-MK_COMB */
+
+static void L52()
+{register object *VOL base=vs_base;
+ register object *VOL sup=base+VM52; VC52
+ vs_check;
+ {VOL object V162;
+ VOL object V163;
+ V162=(base[0]);
+ V163=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {VOL object V164;
+ VOL object V165;
+ VOL object V166;
+ {VOL object V167;
+ frs_push(FRS_CATCH,((object)VV[2]));
+ if(nlj_active)
+ {nlj_active=FALSE;frs_pop();
+ vs_top=sup;
+ V167= vs_base[0];
+ goto T382;}
+ else{
+ base[5]= CMPcddr((V162));
+ vs_top=(vs_base=base+5)+1;
+ (void) (*Lnk101)();
+ vs_top=sup;
+ V168= vs_base[0];
+ V169= make_cons(V168,Cnil);
+ frs_pop();
+ V167= V169;}
+ goto T382;
+T382:;
+ if(!(type_of((V167))!=t_cons)){
+ goto T387;}
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[5]= ((object)VV[53]);
+ vs_top=(vs_base=base+5)+1;
+ unwind(fr,((object)VV[2]));}
+ goto T387;
+T387:;
+ V164= CMPcar((V167));}
+ V165= CMPcar((V164));
+ V166= CMPcdr((V164));
+ if(!(((V165))==(((object)VV[36])))){
+ goto T393;}
+ if(!(equal(CMPcar((V166)),CMPcddr((V163))))){
+ goto T393;}
+ base[5]= listA(3,((object)VV[39]),make_cons((V162),(V163)),CMPcadr((V166)));
+ vs_top=(vs_base=base+5)+1;
+ return;
+ goto T393;
+T393:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[5]= ((object)VV[53]);
+ vs_top=(vs_base=base+5)+1;
+ unwind(fr,((object)VV[2]));}}
+ }
+}
+/* function definition for ML-IS_COMB */
+
+static void L53()
+{register object *base=vs_base;
+ register object *sup=base+VM53; VC53
+ vs_check;
+ {object V171;
+ V171=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V171)))==(((object)VV[39]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_COMB */
+
+static void L54()
+{register object *base=vs_base;
+ register object *sup=base+VM54; VC54
+ vs_check;
+ {object V172;
+ V172=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!(eql(CMPcar((V172)),((object)VV[39])))){
+ goto T400;}
+ V173= CMPcdr((V172));
+ goto T398;
+ goto T400;
+T400:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[54]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ goto T398;
+T398:;
+ base[1]= CMPcar(V173);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for Q-MK_TYPED */
+
+static void L55()
+{register object *base=vs_base;
+ register object *sup=base+VM55; VC55
+ vs_check;
+ {object V174;
+ object V175;
+ V174=(base[0]);
+ V175=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[3]= (V174);
+ vs_top=(vs_base=base+3)+1;
+ (void) (*Lnk68)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ base[4]= (V175);
+ vs_top=(vs_base=base+4)+1;
+ (void) (*Lnk104)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk69)();
+ vs_top=sup;
+ if((vs_base[0])==Cnil){
+ goto T404;}
+ base[2]= (V174);
+ vs_top=(vs_base=base+2)+1;
+ return;
+ goto T404;
+T404:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[55]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_PAIR */
+
+static void L56()
+{register object *base=vs_base;
+ register object *sup=base+VM56; VC56
+ vs_check;
+ {object V176;
+ object V177;
+ V176=(base[0]);
+ V177=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[4]= ((object)VV[56]);
+ vs_top=(vs_base=base+4)+1;
+ (void) (*Lnk105)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ base[4]= (V176);
+ vs_top=(vs_base=base+3)+2;
+ (void) (*Lnk106)();
+ vs_top=sup;
+ base[2]= vs_base[0];
+ base[3]= (V177);
+ vs_top=(vs_base=base+2)+2;
+ (void) (*Lnk106)();
+ return;
+ }
+}
+/* function definition for Q-MK_COND */
+
+static void L57()
+{register object *base=vs_base;
+ register object *sup=base+VM57; VC57
+ vs_check;
+ {object V178;
+ object V179;
+ object V180;
+ V178=(base[0]);
+ V179=(base[1]);
+ V180=(base[2]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[6]= ((object)VV[57]);
+ vs_top=(vs_base=base+6)+1;
+ (void) (*Lnk105)();
+ vs_top=sup;
+ base[5]= vs_base[0];
+ base[6]= (V178);
+ vs_top=(vs_base=base+5)+2;
+ (void) (*Lnk106)();
+ vs_top=sup;
+ base[4]= vs_base[0];
+ base[5]= (V179);
+ vs_top=(vs_base=base+4)+2;
+ (void) (*Lnk106)();
+ vs_top=sup;
+ base[3]= vs_base[0];
+ base[4]= (V180);
+ vs_top=(vs_base=base+3)+2;
+ (void) (*Lnk106)();
+ return;
+ }
+}
+/* function definition for Q-MK_VARTYPE */
+
+static void L58()
+{register object *base=vs_base;
+ register object *sup=base+VM58; VC58
+ vs_check;
+ {register object V181;
+ V181=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V182;
+ {object V183 =((V181))->s.s_plist;
+ object ind= ((object)VV[58]);
+ while(V183!=Cnil){
+ if(V183->c.c_car==ind){
+ V182= (V183->c.c_cdr->c.c_car);
+ goto T423;
+ }else V183=V183->c.c_cdr->c.c_cdr;}
+ V182= Cnil;}
+ goto T423;
+T423:;
+ if(((V182))==Cnil){
+ goto T425;}
+ base[1]= (V182);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T425;
+T425:;
+ base[1]= (V181);
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk107)();
+ vs_top=sup;
+ V184= vs_base[0];
+ if(!(number_compare(CMPcar(V184),small_fixnum(42))==0)){
+ goto T428;}
+ V185= make_cons(((object)VV[47]),(V181));
+ base[1]= sputprop((V181),((object)VV[58]),/* INLINE-ARGS */V185);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T428;
+T428:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[58]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}}
+ }
+}
+/* function definition for ML-IS_VARTYPE */
+
+static void L59()
+{register object *base=vs_base;
+ register object *sup=base+VM59; VC59
+ vs_check;
+ {object V186;
+ V186=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= ((CMPcar((V186)))==(((object)VV[47]))?Ct:Cnil);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_VARTYPE */
+
+static void L60()
+{register object *base=vs_base;
+ register object *sup=base+VM60; VC60
+ vs_check;
+ {object V187;
+ V187=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!((CMPcar((V187)))==(((object)VV[47])))){
+ goto T434;}
+ base[1]= CMPcdr((V187));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ goto T434;
+T434:;
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[59]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ }
+}
+/* function definition for Q-MK_TYPE */
+
+static void L61()
+{register object *base=vs_base;
+ register object *sup=base+VM61; VC61
+ vs_check;
+ {object V188;
+ object V189;
+ V188=(base[0]);
+ V189=(base[1]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V191 =((V188))->s.s_plist;
+ object ind= ((object)VV[60]);
+ while(V191!=Cnil){
+ if(V191->c.c_car==ind){
+ V190= (V191->c.c_cdr->c.c_car);
+ goto T440;
+ }else V191=V191->c.c_cdr->c.c_cdr;}
+ V190= Cnil;}
+ goto T440;
+T440:;
+ V192 = CMPmake_fixnum((long)length((V189)));
+ if(equal(V190,V192)){
+ goto T438;}
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[2]= ((object)VV[61]);
+ vs_top=(vs_base=base+2)+1;
+ unwind(fr,((object)VV[2]));}
+ goto T438;
+T438:;
+ if(((V189))!=Cnil){
+ goto T443;}
+ {object V193 =((V188))->s.s_plist;
+ object ind= ((object)VV[62]);
+ while(V193!=Cnil){
+ if(V193->c.c_car==ind){
+ base[2]= (V193->c.c_cdr->c.c_car);
+ vs_top=(vs_base=base+2)+1;
+ return;
+ }else V193=V193->c.c_cdr->c.c_cdr;}
+ base[2]= Cnil;
+ vs_top=(vs_base=base+2)+1;
+ return;}
+ goto T443;
+T443:;
+ base[2]= make_cons((V188),(V189));
+ vs_top=(vs_base=base+2)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_TYPE */
+
+static void L62()
+{register object *base=vs_base;
+ register object *sup=base+VM62; VC62
+ vs_check;
+ {object V194;
+ V194=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ if(!((CMPcar((V194)))==(((object)VV[47])))){
+ goto T446;}
+ {frame_ptr fr;
+ fr=frs_sch_catch(((object)VV[2]));
+ if(fr==NULL) FEerror("The tag ~s is undefined.",1,((object)VV[2]));
+ base[1]= ((object)VV[63]);
+ vs_top=(vs_base=base+1)+1;
+ unwind(fr,((object)VV[2]));}
+ goto T446;
+T446:;
+ base[1]= (V194);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-TYPE_OF */
+
+static void L63()
+{register object *base=vs_base;
+ register object *sup=base+VM63; VC63
+ vs_check;
+ {object V195;
+ V195=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= CMPcddr((V195));
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for Q-TYPEOF */
+
+static void L64()
+{register object *base=vs_base;
+ register object *sup=base+VM64; VC64
+ vs_check;
+ {object V196;
+ V196=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= (V196);
+ vs_top=(vs_base=base+1)+1;
+ (void) (*Lnk70)();
+ vs_top=sup;
+ V197= vs_base[0];
+ base[1]= CMPcddr(V197);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for STRIP-ANTIQUOT */
+
+static void L65()
+{register object *base=vs_base;
+ register object *sup=base+VM65; VC65
+ vs_check;
+ {register object V198;
+ V198=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ goto T453;
+T453:;
+ if(!((CMPcar((V198)))==(((object)VV[0])))){
+ goto T456;}
+ V198= CMPcdr((V198));
+ goto T453;
+ goto T456;
+T456:;
+ goto T451;
+ goto T451;
+ goto T451;
+T451:;
+ base[1]= (V198);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-THM_COUNT */
+
+static void L66()
+{register object *base=vs_base;
+ register object *sup=base+VM66; VC66
+ vs_check;
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[0]= (((object)VV[64])->s.s_dbind);
+ vs_top=(vs_base=base+0)+1;
+ return;
+}
+/* function definition for ML-MK_THM */
+
+static void L67()
+{register object *base=vs_base;
+ register object *sup=base+VM67; VC67
+ vs_check;
+ {object V199;
+ V199=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ (((object)VV[64])->s.s_dbind)= number_plus((((object)VV[64])->s.s_dbind),small_fixnum(1));
+ base[1]= (V199);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for ML-DEST_THM */
+
+static void L68()
+{register object *base=vs_base;
+ register object *sup=base+VM68; VC68
+ vs_check;
+ {object V200;
+ V200=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ base[1]= (V200);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }
+}
+/* function definition for PREDICATEP */
+
+static void L69()
+{register object *base=vs_base;
+ register object *sup=base+VM69; VC69
+ vs_check;
+ {object V201;
+ V201=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V202 =((V201))->s.s_plist;
+ object ind= ((object)VV[65]);
+ while(V202!=Cnil){
+ if(V202->c.c_car==ind){
+ base[1]= (V202->c.c_cdr->c.c_car);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }else V202=V202->c.c_cdr->c.c_cdr;}
+ base[1]= Cnil;
+ vs_top=(vs_base=base+1)+1;
+ return;}
+ }
+}
+/* function definition for CONSTP */
+
+static void L70()
+{register object *base=vs_base;
+ register object *sup=base+VM70; VC70
+ vs_check;
+ {object V203;
+ V203=(base[0]);
+ vs_top=sup;
+ goto TTL;
+TTL:;
+ {object V204 =((V203))->s.s_plist;
+ object ind= ((object)VV[27]);
+ while(V204!=Cnil){
+ if(V204->c.c_car==ind){
+ base[1]= (V204->c.c_cdr->c.c_car);
+ vs_top=(vs_base=base+1)+1;
+ return;
+ }else V204=V204->c.c_cdr->c.c_cdr;}
+ base[1]= Cnil;
+ vs_top=(vs_base=base+1)+1;
+ return;}
+ }
+}
+static void LnkT107(){ call_or_link(((object)VV[107]),(void **)(void *)&Lnk107);} /* EXPLODEN */
+static void LnkT106(){ call_or_link(((object)VV[106]),(void **)(void *)&Lnk106);} /* Q-MK_COMB */
+static void LnkT105(){ call_or_link(((object)VV[105]),(void **)(void *)&Lnk105);} /* Q-MK_CONST */
+static void LnkT104(){ call_or_link(((object)VV[104]),(void **)(void *)&Lnk104);} /* Q-MK_ANTIQUOT */
+static object LnkTLI103(object first,...){object V1;va_list ap;va_start(ap,first);V1=call_proc_new(((object)VV[103]),(void **)(void *)&LnkLI103,1,first,ap);va_end(ap);return V1;} /* SECOND */
+static object LnkTLI102(object first,...){object V1;va_list ap;va_start(ap,first);V1=call_proc_new(((object)VV[102]),(void **)(void *)&LnkLI102,1,first,ap);va_end(ap);return V1;} /* FIRST */
+static void LnkT101(){ call_or_link(((object)VV[101]),(void **)(void *)&Lnk101);} /* ML-DEST_TYPE */
+static void LnkT100(){ call_or_link(((object)VV[100]),(void **)(void *)&Lnk100);} /* PRINT-MK_COMB-ERROR */
+static void LnkT99(){ call_or_link(((object)VV[99]),(void **)(void *)&Lnk99);} /* ML-PRINT_TYPE */
+static void LnkT98(){ call_or_link(((object)VV[98]),(void **)(void *)&Lnk98);} /* PREP-TY-FOR-PRINT */
+static void LnkT97(){ call_or_link(((object)VV[97]),(void **)(void *)&Lnk97);} /* PREP-TERM-TY */
+static void LnkT96(){ call_or_link(((object)VV[96]),(void **)(void *)&Lnk96);} /* PNEWLINE */
+static void LnkT95(){ call_or_link(((object)VV[95]),(void **)(void *)&Lnk95);} /* ML-PRINT_TERM */
+static void LnkT94(){ call_or_link(((object)VV[94]),(void **)(void *)&Lnk94);} /* PREP-TERM-FOR-PRINT */
+static void LnkT93(){ call_or_link(((object)VV[93]),(void **)(void *)&Lnk93);} /* PBREAK */
+static void LnkT92(){ call_or_link(((object)VV[92]),(void **)(void *)&Lnk92);} /* PSTRINGLEN */
+static void LnkT91(){ call_or_link(((object)VV[91]),(void **)(void *)&Lnk91);} /* GET-TYPE-LINKS */
+static void LnkT90(){ call_or_link(((object)VV[90]),(void **)(void *)&Lnk90);} /* ADD-TYPE-LINKS */
+static void LnkT89(){ call_or_link(((object)VV[89]),(void **)(void *)&Lnk89);} /* MAKE-LINK-NAMES */
+static void LnkT88(){ call_or_link(((object)VV[88]),(void **)(void *)&Lnk88);} /* GET-TERM-LINKS */
+static void LnkT87(){ call_or_link(((object)VV[87]),(void **)(void *)&Lnk87);} /* ADD-TERM-LINKS */
+static void LnkT86(){ call_or_link(((object)VV[86]),(void **)(void *)&Lnk86);} /* PREP-TERM-FN */
+static void LnkT85(){ call_or_link(((object)VV[85]),(void **)(void *)&Lnk85);} /* PREP-TY-FN */
+static void LnkT84(){ call_or_link(((object)VV[84]),(void **)(void *)&Lnk84);} /* ML-MK_ABS */
+static void LnkT83(){ call_or_link(((object)VV[83]),(void **)(void *)&Lnk83);} /* CONCAT */
+static void LnkT81(){ call_or_link(((object)VV[81]),(void **)(void *)&Lnk81);} /* MK_REALVAR */
+static void LnkT80(){ call_or_link(((object)VV[80]),(void **)(void *)&Lnk80);} /* UNIQUESYM */
+static void LnkT79(){ call_or_link(((object)VV[79]),(void **)(void *)&Lnk79);} /* CONSPROP */
+static void LnkT78(){ call_or_link(((object)VV[78]),(void **)(void *)&Lnk78);} /* GENLINK */
+static void LnkT77(){ call_or_link(((object)VV[77]),(void **)(void *)&Lnk77);} /* NEW-VAR-TYPE */
+static void LnkT76(){ call_or_link(((object)VV[76]),(void **)(void *)&Lnk76);} /* ASSOC1 */
+static void LnkT75(){ call_or_link(((object)VV[75]),(void **)(void *)&Lnk75);} /* Q-MK_PRED */
+static void LnkT74(){ call_or_link(((object)VV[74]),(void **)(void *)&Lnk74);} /* Q-MK_PAIR */
+static void LnkT73(){ call_or_link(((object)VV[73]),(void **)(void *)&Lnk73);} /* ML-MK_EXISTS */
+static void LnkT72(){ call_or_link(((object)VV[72]),(void **)(void *)&Lnk72);} /* ML-MK_FORALL */
+static void LnkT71(){ call_or_link(((object)VV[71]),(void **)(void *)&Lnk71);} /* Q-FREE-VAR */
+static void LnkT70(){ call_or_link(((object)VV[70]),(void **)(void *)&Lnk70);} /* STRIP-ANTIQUOT */
+static void LnkT69(){ call_or_link(((object)VV[69]),(void **)(void *)&Lnk69);} /* UNIFY */
+static void LnkT68(){ call_or_link(((object)VV[68]),(void **)(void *)&Lnk68);} /* Q-TYPEOF */
+static void LnkT67(){ call_or_link(((object)VV[67]),(void **)(void *)&Lnk67);} /* OMUTANT */
+static void LnkT66(){ call_or_link(((object)VV[66]),(void **)(void *)&Lnk66);} /* PREDICATEP */
--- hol88-2.02.19940316.orig/lisp/f-iox-stand.l
+++ hol88-2.02.19940316/lisp/f-iox-stand.l
@@ -283,7 +283,7 @@
(defun find-file1 (dir name exts)
(do
- ((exts exts (cdr exts))
+ ((exts (cons "" exts) (cdr exts))
(file nil))
((null exts) nil)
(setq file (catenate dir name (car exts)))
--- hol88-2.02.19940316.orig/Library/numeral/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/numeral/Manual/theorems.tex
@@ -1,13 +1,4 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\section{Numeral theory}
-\THEOREM BASEN numeral
-|- (!radix. BASEN radix[] = 0) /\
- (!radix digit digits.
- BASEN radix(CONS digit digits) =
- (digit * (radix EXP (LENGTH digits))) + (BASEN radix digits))
-\ENDTHEOREM
-\THEOREM BASEN\_11 numeral
+\chapter{Pre-proved Theorems}\input{theorems-intro}\section{Numeral theory}\THEOREM BASEN\_11 numeral
|- !r l1 l2.
1 < r ==>
IS_BASEN r l1 ==>
@@ -24,14 +15,20 @@
\THEOREM BASEN\_CONS\_0 numeral
|- !r l. BASEN r(CONS 0 l) = BASEN r l
\ENDTHEOREM
+\THEOREM BASEN\_DIGIT\_EQ\_DIGIT numeral
+|- !r e. BASEN r[e] = e
+\ENDTHEOREM
\THEOREM BASEN\_DIGITS numeral
|- !n m r.
1 < r ==>
(LENGTH(BASEN_DIGITS r n m) = n) /\
(BASEN r(BASEN_DIGITS r n m) = m MOD (r EXP n))
\ENDTHEOREM
-\THEOREM BASEN\_DIGIT\_EQ\_DIGIT numeral
-|- !r e. BASEN r[e] = e
+\THEOREM BASEN numeral
+|- (!radix. BASEN radix[] = 0) /\
+ (!radix digit digits.
+ BASEN radix(CONS digit digits) =
+ (digit * (radix EXP (LENGTH digits))) + (BASEN radix digits))
\ENDTHEOREM
\THEOREM BASEN\_EMPTY\_EQ\_0 numeral
|- !r l. 1 < r ==> IS_NORMALIZED l ==> ((BASEN r l = 0) = (l = []))
@@ -85,9 +82,6 @@
\THEOREM BASEN\_ZEROS numeral
|- !r n. BASEN r(REPLICATE n 0) = 0
\ENDTHEOREM
-\THEOREM BINARY numeral
-|- BINARY = BASEN 2
-\ENDTHEOREM
\THEOREM BINARY\_11 numeral
|- !l1 l2.
IS_BINARY l1 ==>
@@ -102,6 +96,9 @@
\THEOREM BINARY\_DIGIT\_EQ\_DIGIT numeral
|- !e. BINARY[e] = e
\ENDTHEOREM
+\THEOREM BINARY numeral
+|- BINARY = BASEN 2
+\ENDTHEOREM
\THEOREM BINARY\_EMPTY\_EQ\_0 numeral
|- !l. IS_NORMALIZED l ==> ((BINARY l = 0) = (l = []))
\ENDTHEOREM
@@ -134,9 +131,6 @@
\THEOREM BINARY\_ZEROS numeral
|- !n. BINARY(REPLICATE n 0) = 0
\ENDTHEOREM
-\THEOREM DECIMAL numeral
-|- DECIMAL = BASEN 10
-\ENDTHEOREM
\THEOREM DECIMAL\_11 numeral
|- !l1 l2.
IS_DECIMAL l1 ==>
@@ -151,6 +145,9 @@
\THEOREM DECIMAL\_DIGIT\_EQ\_DIGIT numeral
|- !e. DECIMAL[e] = e
\ENDTHEOREM
+\THEOREM DECIMAL numeral
+|- DECIMAL = BASEN 10
+\ENDTHEOREM
\THEOREM DECIMAL\_EMPTY\_EQ\_0 numeral
|- !l. IS_NORMALIZED l ==> ((DECIMAL l = 0) = (l = []))
\ENDTHEOREM
@@ -183,9 +180,6 @@
\THEOREM DECIMAL\_ZEROS numeral
|- !n. DECIMAL(REPLICATE n 0) = 0
\ENDTHEOREM
-\THEOREM HEX numeral
-|- HEX = BASEN 16
-\ENDTHEOREM
\THEOREM HEX\_11 numeral
|- !l1 l2.
IS_HEX l1 ==>
@@ -200,6 +194,9 @@
\THEOREM HEX\_DIGIT\_EQ\_DIGIT numeral
|- !e. HEX[e] = e
\ENDTHEOREM
+\THEOREM HEX numeral
+|- HEX = BASEN 16
+\ENDTHEOREM
\THEOREM HEX\_EMPTY\_EQ\_0 numeral
|- !l. IS_NORMALIZED l ==> ((HEX l = 0) = (l = []))
\ENDTHEOREM
@@ -232,9 +229,6 @@
\THEOREM HEX\_ZEROS numeral
|- !n. HEX(REPLICATE n 0) = 0
\ENDTHEOREM
-\THEOREM IS\_BASEN numeral
-|- !radix digits. IS_BASEN radix digits = EVERY($> radix)digits
-\ENDTHEOREM
\THEOREM IS\_BASEN\_APPEND numeral
|- !r l m. IS_BASEN r(APPEND l m) = IS_BASEN r l /\ IS_BASEN r m
\ENDTHEOREM
@@ -250,12 +244,12 @@
\THEOREM IS\_BASEN\_CONS\_IMP\_LESS numeral
|- !r l e. 1 < r ==> IS_BASEN r(CONS e l) ==> e < r
\ENDTHEOREM
+\THEOREM IS\_BASEN numeral
+|- !radix digits. IS_BASEN radix digits = EVERY($> radix)digits
+\ENDTHEOREM
\THEOREM IS\_BASEN\_NIL numeral
|- !r. IS_BASEN r[]
\ENDTHEOREM
-\THEOREM IS\_BINARY numeral
-|- IS_BINARY = IS_BASEN 2
-\ENDTHEOREM
\THEOREM IS\_BINARY\_CONS numeral
|- !l e. IS_BINARY(CONS e l) = e < 2 /\ IS_BINARY l
\ENDTHEOREM
@@ -265,6 +259,9 @@
\THEOREM IS\_BINARY\_CONS\_IMP\_LESS numeral
|- !l e. IS_BINARY(CONS e l) ==> e < 2
\ENDTHEOREM
+\THEOREM IS\_BINARY numeral
+|- IS_BINARY = IS_BASEN 2
+\ENDTHEOREM
\THEOREM IS\_BINARY\_NIL numeral
|- IS_BINARY[]
\ENDTHEOREM
@@ -273,9 +270,6 @@
IS_BINARY_NORMALIZED digits =
IS_BINARY digits /\ IS_NORMALIZED digits
\ENDTHEOREM
-\THEOREM IS\_DECIMAL numeral
-|- IS_DECIMAL = IS_BASEN 10
-\ENDTHEOREM
\THEOREM IS\_DECIMAL\_CONS numeral
|- !l e. IS_DECIMAL(CONS e l) = e < 10 /\ IS_DECIMAL l
\ENDTHEOREM
@@ -285,6 +279,9 @@
\THEOREM IS\_DECIMAL\_CONS\_IMP\_LESS numeral
|- !l e. IS_DECIMAL(CONS e l) ==> e < 10
\ENDTHEOREM
+\THEOREM IS\_DECIMAL numeral
+|- IS_DECIMAL = IS_BASEN 10
+\ENDTHEOREM
\THEOREM IS\_DECIMAL\_NIL numeral
|- IS_DECIMAL[]
\ENDTHEOREM
@@ -293,9 +290,6 @@
IS_DECIMAL_NORMALIZED digits =
IS_DECIMAL digits /\ IS_NORMALIZED digits
\ENDTHEOREM
-\THEOREM IS\_HEX numeral
-|- IS_HEX = IS_BASEN 16
-\ENDTHEOREM
\THEOREM IS\_HEX\_CONS numeral
|- !l e. IS_HEX(CONS e l) = e < 16 /\ IS_HEX l
\ENDTHEOREM
@@ -305,6 +299,9 @@
\THEOREM IS\_HEX\_CONS\_IMP\_LESS numeral
|- !l e. IS_HEX(CONS e l) ==> e < 16
\ENDTHEOREM
+\THEOREM IS\_HEX numeral
+|- IS_HEX = IS_BASEN 16
+\ENDTHEOREM
\THEOREM IS\_HEX\_NIL numeral
|- IS_HEX[]
\ENDTHEOREM
@@ -312,18 +309,15 @@
|- !digits.
IS_HEX_NORMALIZED digits = IS_HEX digits /\ IS_NORMALIZED digits
\ENDTHEOREM
-\THEOREM IS\_NORMALIZED numeral
-|- !digits. IS_NORMALIZED digits = (digits = []) \/ 0 < (HD digits)
-\ENDTHEOREM
\THEOREM IS\_NORMALIZED\_CONS numeral
|- !e l. IS_NORMALIZED(CONS e l) = 0 < e
\ENDTHEOREM
+\THEOREM IS\_NORMALIZED numeral
+|- !digits. IS_NORMALIZED digits = (digits = []) \/ 0 < (HD digits)
+\ENDTHEOREM
\THEOREM IS\_NORMALIZED\_NIL numeral
|- IS_NORMALIZED[]
\ENDTHEOREM
-\THEOREM IS\_OCTAL numeral
-|- IS_OCTAL = IS_BASEN 8
-\ENDTHEOREM
\THEOREM IS\_OCTAL\_CONS numeral
|- !l e. IS_OCTAL(CONS e l) = e < 8 /\ IS_OCTAL l
\ENDTHEOREM
@@ -333,6 +327,9 @@
\THEOREM IS\_OCTAL\_CONS\_IMP\_LESS numeral
|- !l e. IS_OCTAL(CONS e l) ==> e < 8
\ENDTHEOREM
+\THEOREM IS\_OCTAL numeral
+|- IS_OCTAL = IS_BASEN 8
+\ENDTHEOREM
\THEOREM IS\_OCTAL\_NIL numeral
|- IS_OCTAL[]
\ENDTHEOREM
@@ -340,12 +337,12 @@
|- !digits.
IS_OCTAL_NORMALIZED digits = IS_OCTAL digits /\ IS_NORMALIZED digits
\ENDTHEOREM
-\THEOREM LOG numeral
-|- !r n. LOG r n = (@x. (r EXP x) <= n /\ n < (r EXP (x + 1)))
-\ENDTHEOREM
\THEOREM LOG\_1 numeral
|- !r. 1 < r ==> (LOG r 1 = 0)
\ENDTHEOREM
+\THEOREM LOG numeral
+|- !r n. LOG r n = (@x. (r EXP x) <= n /\ n < (r EXP (x + 1)))
+\ENDTHEOREM
\THEOREM NORMALIZED\_BASEN\_11 numeral
|- !l1 l2 r.
1 < r ==>
@@ -376,9 +373,6 @@
(BASEN r l1 = BASEN r l2) /\
(LENGTH l1) < (LENGTH l2))
\ENDTHEOREM
-\THEOREM OCTAL numeral
-|- OCTAL = BASEN 8
-\ENDTHEOREM
\THEOREM OCTAL\_11 numeral
|- !l1 l2.
IS_OCTAL l1 ==>
@@ -393,6 +387,9 @@
\THEOREM OCTAL\_DIGIT\_EQ\_DIGIT numeral
|- !e. OCTAL[e] = e
\ENDTHEOREM
+\THEOREM OCTAL numeral
+|- OCTAL = BASEN 8
+\ENDTHEOREM
\THEOREM OCTAL\_EMPTY\_EQ\_0 numeral
|- !l. IS_NORMALIZED l ==> ((OCTAL l = 0) = (l = []))
\ENDTHEOREM
--- hol88-2.02.19940316.orig/Library/numeral/Manual/Makefile
+++ hol88-2.02.19940316/Library/numeral/Manual/Makefile
@@ -15,19 +15,19 @@ all:; make clean; make thms; make ids; m
clean:; \
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \
- echo "\begin{theindex}" >index.tex; \
- echo "\mbox{}" >>index.tex; \
- echo "\end{theindex}" >>index.tex
+ printf '\\begin{theindex}' >index.tex; \
+ printf '\\mbox{}' >>index.tex; \
+ printf '\\end{theindex}' >>index.tex
ids:; \
- echo "\chapter{ML Functions in the numeral Library}" >entries.tex; \
- echo "\input{entries-intro}" >>entries.tex; \
+ printf '\\chapter{ML Functions in the numeral Library}' >entries.tex; \
+ printf '\\input{entries-intro}' >>entries.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
thms:; \
- echo "\chapter{Pre-proved Theorems}" > theorems.tex; \
- echo "\input{theorems-intro}" >> theorems.tex; \
- echo "\section{Numeral theory}" >> theorems.tex; \
+ printf '\\chapter{Pre-proved Theorems}' > theorems.tex; \
+ printf '\\input{theorems-intro}' >> theorems.tex; \
+ printf '\\section{Numeral theory}' >> theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/numeral theorems.tex
index:; \
--- hol88-2.02.19940316.orig/Library/latex-hol/Manual/Makefile
+++ hol88-2.02.19940316/Library/latex-hol/Manual/Makefile
@@ -28,16 +28,16 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the {\tt latex-hol} Library}">entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the {\\tt latex-hol} Library}'>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
--- hol88-2.02.19940316.orig/Library/string/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/string/Manual/theorems.tex
@@ -1,7 +1,4 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\section{Definitions}
-\THEOREM ASCII\_DEF ascii
+\chapter{Pre-proved Theorems}\input{theorems-intro}\section{Definitions}\THEOREM ASCII\_DEF ascii
|- !b0 b1 b2 b3 b4 b5 b6 b7.
ASCII b0 b1 b2 b3 b4 b5 b6 b7 =
ABS_ascii(Node(b0,b1,b2,b3,b4,b5,b6,b7)[])
@@ -25,6 +22,9 @@
(LENGTH tl = 0)))
rep
\ENDTHEOREM
+\THEOREM ``\_DEF string
+|- `` = ABS_string(Node(INL one)[]))
+\ENDTHEOREM
\THEOREM STRING\_DEF string
|- !a s. STRING a s = ABS_string(Node(INR a)[REP_string s])
\ENDTHEOREM
@@ -47,11 +47,7 @@
(?a. v = INR a) /\ (LENGTH tl = SUC 0)))
rep
\ENDTHEOREM
-\THEOREM ``\_DEF string
-|- `` = ABS_string(Node(INL one)[]))
-\ENDTHEOREM
-\section{Theorems}
-\THEOREM ASCII\_11 ascii
+\section{Theorems}\THEOREM ASCII\_11 ascii
|- !b0 b1 b2 b3 b4 b5 b6 b7 b0' b1' b2' b3' b4' b5' b6' b7'.
(ASCII b0 b1 b2 b3 b4 b5 b6 b7 =
ASCII b0' b1' b2' b3' b4' b5' b6' b7') =
--- hol88-2.02.19940316.orig/Library/string/Manual/Makefile
+++ hol88-2.02.19940316/Library/string/Manual/Makefile
@@ -26,24 +26,24 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids theorems
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the string Library}">entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the string Library}'>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{Definitions}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{Definitions}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/defs theorems.tex
- @echo "\section{Theorems}">>theorems.tex
+ @printf '\\section{Theorems}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms theorems.tex
index:
--- hol88-2.02.19940316.orig/Library/string/Manual/entries.tex
+++ hol88-2.02.19940316/Library/string/Manual/entries.tex
@@ -1,6 +1,4 @@
-\chapter{ML Functions in the string Library}
-\input{entries-intro}
-\DOC{ascii\_EQ\_CONV}
+\chapter{ML Functions in the string Library}\input{entries-intro}\DOC{ascii\_EQ\_CONV}
\TYPE {\small\verb%ascii_EQ_CONV : conv%}\egroup
--- hol88-2.02.19940316.orig/Library/wellorder/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/wellorder/Manual/theorems.tex
@@ -1,7 +1,4 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\section{Basic definitions}
-\THEOREM wo\_chain WELLORDER
+\chapter{Pre-proved Theorems}\input{theorems-intro}\section{Basic definitions}\THEOREM wo\_chain WELLORDER
|- !l P. chain l P = (!x y. P x /\ P y ==> l(x,y) \/ l(y,x))
\ENDTHEOREM
\THEOREM wo\_fl WELLORDER
@@ -41,8 +38,7 @@
(!x. P x ==> fl l x) /\ (?x. P x) ==>
(?y. P y /\ (!z. P z ==> l(y,z))))
\ENDTHEOREM
-\section{Miscellaneous lemmas}
-\THEOREM AGREE\_LEMMA WELLORDER
+\section{Miscellaneous lemmas}\THEOREM AGREE\_LEMMA WELLORDER
|- !l h ms m n f g z.
woset l /\
(!x. fl l(ms x)) /\
@@ -152,44 +148,6 @@
\THEOREM UNION\_INSEG WELLORDER
|- !P l. (!m. P m ==> m inseg l) ==> (Union P) inseg l
\ENDTHEOREM
-\THEOREM WOSET WELLORDER
-|- !l.
- woset l =
- (!x y. l(x,y) /\ l(y,x) ==> (x = y)) /\
- (!P.
- (!x. P x ==> fl l x) /\ (?x. P x) ==>
- (?y. P y /\ (!z. P z ==> l(y,z))))
-\ENDTHEOREM
-\THEOREM WOSET\_FLEQ WELLORDER
-|- !l. woset l ==> (!x. fl l x = l(x,x))
-\ENDTHEOREM
-\THEOREM WOSET\_NUM WELLORDER
-|- woset(\(m,n). m <= n)
-\ENDTHEOREM
-\THEOREM WOSET\_POSET WELLORDER
-|- !l. woset l ==> poset l
-\ENDTHEOREM
-\THEOREM WOSET\_TOTAL\_LE WELLORDER
-|- !l. woset l ==> (!x y. fl l x /\ fl l y ==> l(x,y) \/ less l(y,x))
-\ENDTHEOREM
-\THEOREM WOSET\_TOTAL\_LT WELLORDER
-|- !l.
- woset l ==>
- (!x y. fl l x /\ fl l y ==> (x = y) \/ less l(x,y) \/ less l(y,x))
-\ENDTHEOREM
-\THEOREM WOSET\_TRANS\_LE WELLORDER
-|- !l. woset l ==> (!x y z. l(x,y) /\ less l(y,z) ==> less l(x,z))
-\ENDTHEOREM
-\THEOREM WOSET\_TRANS\_LESS WELLORDER
-|- !l. woset l ==> (!x y z. less l(x,y) /\ l(y,z) ==> less l(x,z))
-\ENDTHEOREM
-\THEOREM WOSET\_WELL\_CONTRAPOS WELLORDER
-|- !l.
- woset l ==>
- (!P.
- (!x. P x ==> fl l x) /\ (?x. P x) ==>
- (?y. P y /\ (!z. less l(z,y) ==> ~P z)))
-\ENDTHEOREM
\THEOREM WO\_FL\_RESTRICT WELLORDER
|- !l.
woset l ==>
@@ -233,8 +191,45 @@
(!y. (ms y) < (ms x) ==> (f y = g y)) ==> (h f x = h g x)) ==>
(?! f. !x. f x = h f x)
\ENDTHEOREM
-\section{Main theorems}
-\THEOREM HP WELLORDER
+\THEOREM WOSET WELLORDER
+|- !l.
+ woset l =
+ (!x y. l(x,y) /\ l(y,x) ==> (x = y)) /\
+ (!P.
+ (!x. P x ==> fl l x) /\ (?x. P x) ==>
+ (?y. P y /\ (!z. P z ==> l(y,z))))
+\ENDTHEOREM
+\THEOREM WOSET\_FLEQ WELLORDER
+|- !l. woset l ==> (!x. fl l x = l(x,x))
+\ENDTHEOREM
+\THEOREM WOSET\_NUM WELLORDER
+|- woset(\(m,n). m <= n)
+\ENDTHEOREM
+\THEOREM WOSET\_POSET WELLORDER
+|- !l. woset l ==> poset l
+\ENDTHEOREM
+\THEOREM WOSET\_TOTAL\_LE WELLORDER
+|- !l. woset l ==> (!x y. fl l x /\ fl l y ==> l(x,y) \/ less l(y,x))
+\ENDTHEOREM
+\THEOREM WOSET\_TOTAL\_LT WELLORDER
+|- !l.
+ woset l ==>
+ (!x y. fl l x /\ fl l y ==> (x = y) \/ less l(x,y) \/ less l(y,x))
+\ENDTHEOREM
+\THEOREM WOSET\_TRANS\_LE WELLORDER
+|- !l. woset l ==> (!x y z. l(x,y) /\ less l(y,z) ==> less l(x,z))
+\ENDTHEOREM
+\THEOREM WOSET\_TRANS\_LESS WELLORDER
+|- !l. woset l ==> (!x y z. less l(x,y) /\ l(y,z) ==> less l(x,z))
+\ENDTHEOREM
+\THEOREM WOSET\_WELL\_CONTRAPOS WELLORDER
+|- !l.
+ woset l ==>
+ (!P.
+ (!x. P x ==> fl l x) /\ (?x. P x) ==>
+ (?y. P y /\ (!z. less l(z,y) ==> ~P z)))
+\ENDTHEOREM
+\section{Main theorems}\THEOREM HP WELLORDER
|- !l.
poset l ==>
(?P. chain l P /\ (!Q. chain l Q /\ P subset Q ==> (Q = P)))
--- hol88-2.02.19940316.orig/Library/wellorder/Manual/Makefile
+++ hol88-2.02.19940316/Library/wellorder/Manual/Makefile
@@ -14,26 +14,26 @@ all:; make clean; make tex; make wellord
clean:; \
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \
- echo "\begin{theindex}" >index.tex; \
- echo "\mbox{}" >>index.tex; \
- echo "\end{theindex}" >>index.tex
+ printf '\\begin{theindex}' >index.tex; \
+ printf '\\mbox{}' >>index.tex; \
+ printf '\\end{theindex}' >>index.tex
tex: theorems ids
ids:; \
- echo "\chapter{ML Functions in the wellorder Library}" >entries.tex;\
- echo "\label{entries}" >>entries.tex; \
- echo "\input{entries-intro}" >>entries.tex; \
+ printf '\\chapter{ML Functions in the wellorder Library}' >entries.tex;\
+ printf '\\label{entries}' >>entries.tex; \
+ printf '\\input{entries-intro}' >>entries.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:; \
- echo "\chapter{Pre-proved Theorems}" >theorems.tex; \
- echo "\input{theorems-intro}" >>theorems.tex; \
- echo "\section{Basic definitions}" >>theorems.tex; \
+ printf '\\chapter{Pre-proved Theorems}' >theorems.tex; \
+ printf '\\input{theorems-intro}' >>theorems.tex; \
+ printf '\\section{Basic definitions}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/defs theorems.tex; \
- echo "\section{Miscellaneous lemmas}" >>theorems.tex; \
+ printf '\\section{Miscellaneous lemmas}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/lemmas theorems.tex;\
- echo "\section{Main theorems}" >>theorems.tex; \
+ printf '\\section{Main theorems}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/main theorems.tex
wellorder:; \
--- hol88-2.02.19940316.orig/Library/reduce/Manual/Makefile
+++ hol88-2.02.19940316/Library/reduce/Manual/Makefile
@@ -15,13 +15,13 @@ all:; make clean; make ids; make reduce;
clean:; \
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \
- echo "\begin{theindex}" >index.tex; \
- echo "\mbox{}" >>index.tex; \
- echo "\end{theindex}" >>index.tex
+ printf '\\begin{theindex}' >index.tex; \
+ printf '\\mbox{}' >>index.tex; \
+ printf '\\end{theindex}' >>index.tex
ids:; \
- echo "\chapter{ML Functions in the reduce Library}" >entries.tex; \
- echo "\input{entries-intro}" >>entries.tex; \
+ printf '\\chapter{ML Functions in the reduce Library}' >entries.tex; \
+ printf '\\input{entries-intro}' >>entries.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
index:; \
--- hol88-2.02.19940316.orig/Library/finite_sets/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/finite_sets/Manual/theorems.tex
@@ -1,7 +1,4 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\section{The type definition}
-\THEOREM FINITE\_SET\_DEF finite\_sets
+\chapter{Pre-proved Theorems}\input{theorems-intro}\section{The type definition}\THEOREM FINITE\_SET\_DEF finite\_sets
|- (!x. ~x IN {}) /\
(!x y s. x IN (y INSERT s) = (x = y) \/ x IN s) /\
(!x s. x INSERT (x INSERT s) = x INSERT s) /\
@@ -18,8 +15,7 @@
\THEOREM set\_TY\_DEF finite\_sets
|- ?rep. TYPE_DEFINITION IS_SET_REP rep
\ENDTHEOREM
-\section{Basic properties of {\tt EMPTY}, {\tt INSERT}, and {\tt IN}}
-\THEOREM ABSORPTION finite\_sets
+\section{Basic properties of {\tt EMPTY}, {\tt INSERT}, and {\tt IN}}\THEOREM ABSORPTION finite\_sets
|- !x s. x IN s = (x INSERT s = s)
\ENDTHEOREM
\THEOREM COMPONENT finite\_sets
@@ -31,15 +27,15 @@
\THEOREM EXTENSION finite\_sets
|- !s t. (s = t) = (!x. x IN s = x IN t)
\ENDTHEOREM
+\THEOREM IN\_INSERT finite\_sets
+|- !x y s. x IN (y INSERT s) = (x = y) \/ x IN s
+\ENDTHEOREM
\THEOREM INSERT\_COMM finite\_sets
|- !x y s. x INSERT (y INSERT s) = y INSERT (x INSERT s)
\ENDTHEOREM
\THEOREM INSERT\_INSERT finite\_sets
|- !x s. x INSERT (x INSERT s) = x INSERT s
\ENDTHEOREM
-\THEOREM IN\_INSERT finite\_sets
-|- !x y s. x IN (y INSERT s) = (x = y) \/ x IN s
-\ENDTHEOREM
\THEOREM MEMBER\_NOT\_EMPTY finite\_sets
|- !s. (?x. x IN s) = ~(s = {})
\ENDTHEOREM
@@ -49,12 +45,12 @@
\THEOREM NOT\_EQUAL\_SETS finite\_sets
|- !s t. ~(s = t) = (?x. x IN t = ~x IN s)
\ENDTHEOREM
-\THEOREM NOT\_INSERT\_EMPTY finite\_sets
-|- !x s. ~(x INSERT s = {})
-\ENDTHEOREM
\THEOREM NOT\_IN\_EMPTY finite\_sets
|- !x. ~x IN {}
\ENDTHEOREM
+\THEOREM NOT\_INSERT\_EMPTY finite\_sets
+|- !x s. ~(x INSERT s = {})
+\ENDTHEOREM
\THEOREM NUM\_SET\_WOP finite\_sets
|- !s. (?n. n IN s) = (?n. n IN s /\ (!m. m IN s ==> n <= m))
\ENDTHEOREM
@@ -68,8 +64,7 @@
\THEOREM SET\_MINIMUM finite\_sets
|- !s M. (?x. x IN s) = (?x. x IN s /\ (!y. y IN s ==> (M x) <= (M y)))
\ENDTHEOREM
-\section{Set inclusion}
-\THEOREM EMPTY\_SUBSET finite\_sets
+\section{Set inclusion}\THEOREM EMPTY\_SUBSET finite\_sets
|- !s. {} SUBSET s
\ENDTHEOREM
\THEOREM INSERT\_SUBSET finite\_sets
@@ -111,13 +106,15 @@
\THEOREM SUBSET\_TRANS finite\_sets
|- !s t u. s SUBSET t /\ t SUBSET u ==> s SUBSET u
\ENDTHEOREM
-\section{Intersection and union}
-\THEOREM DELETE\_INTER finite\_sets
+\section{Intersection and union}\THEOREM DELETE\_INTER finite\_sets
|- !s t x. (s DELETE x) INTER t = (s INTER t) DELETE x
\ENDTHEOREM
\THEOREM EMPTY\_UNION finite\_sets
|- !s t. (s UNION t = {}) = (s = {}) /\ (t = {})
\ENDTHEOREM
+\THEOREM IN\_INTER finite\_sets
+|- !s t x. x IN (s INTER t) = x IN s /\ x IN t
+\ENDTHEOREM
\THEOREM INSERT\_INTER finite\_sets
|- !x s t.
(x INSERT s) INTER t = (x IN t => x INSERT (s INTER t) | s INTER t)
@@ -147,21 +144,18 @@
\THEOREM INTER\_SUBSET finite\_sets
|- (!s t. (s INTER t) SUBSET s) /\ (!s t. (t INTER s) SUBSET s)
\ENDTHEOREM
-\THEOREM IN\_INTER finite\_sets
-|- !s t x. x IN (s INTER t) = x IN s /\ x IN t
-\ENDTHEOREM
\THEOREM IN\_UNION finite\_sets
|- !s t x. x IN (s UNION t) = x IN s \/ x IN t
\ENDTHEOREM
\THEOREM SUBSET\_INTER\_ABSORPTION finite\_sets
|- !s t. s SUBSET t = (s INTER t = s)
\ENDTHEOREM
-\THEOREM SUBSET\_UNION finite\_sets
-|- (!s t. s SUBSET (s UNION t)) /\ (!s t. s SUBSET (t UNION s))
-\ENDTHEOREM
\THEOREM SUBSET\_UNION\_ABSORPTION finite\_sets
|- !s t. s SUBSET t = (s UNION t = t)
\ENDTHEOREM
+\THEOREM SUBSET\_UNION finite\_sets
+|- (!s t. s SUBSET (s UNION t)) /\ (!s t. s SUBSET (t UNION s))
+\ENDTHEOREM
\THEOREM UNION\_ASSOC finite\_sets
|- !s t u. (s UNION t) UNION u = s UNION (t UNION u)
\ENDTHEOREM
@@ -177,8 +171,7 @@
\THEOREM UNION\_OVER\_INTER finite\_sets
|- !s t u. s INTER (t UNION u) = (s INTER t) UNION (s INTER u)
\ENDTHEOREM
-\section{Set difference}
-\THEOREM DIFF\_DIFF finite\_sets
+\section{Set difference}\THEOREM DIFF\_DIFF finite\_sets
|- !s t. (s DIFF t) DIFF t = s DIFF t
\ENDTHEOREM
\THEOREM DIFF\_EMPTY finite\_sets
@@ -193,8 +186,7 @@
\THEOREM IN\_DIFF finite\_sets
|- !s t x. x IN (s DIFF t) = x IN s /\ ~x IN t
\ENDTHEOREM
-\section{Deletion of an element}
-\THEOREM DELETE\_COMM finite\_sets
+\section{Deletion of an element}\THEOREM DELETE\_COMM finite\_sets
|- !x y s. (s DELETE x) DELETE y = (s DELETE y) DELETE x
\ENDTHEOREM
\THEOREM DELETE\_DEF finite\_sets
@@ -220,9 +212,6 @@
\THEOREM EMPTY\_DELETE finite\_sets
|- !x. {} DELETE x = {}
\ENDTHEOREM
-\THEOREM INSERT\_DELETE finite\_sets
-|- !x s. x IN s ==> (x INSERT (s DELETE x) = s)
-\ENDTHEOREM
\THEOREM IN\_DELETE finite\_sets
|- !s x y. x IN (s DELETE y) = x IN s /\ ~(x = y)
\ENDTHEOREM
@@ -230,14 +219,16 @@
|- !s x x'.
(x IN s = x' IN s) = (x IN (s DELETE x') = x' IN (s DELETE x))
\ENDTHEOREM
+\THEOREM INSERT\_DELETE finite\_sets
+|- !x s. x IN s ==> (x INSERT (s DELETE x) = s)
+\ENDTHEOREM
\THEOREM SUBSET\_DELETE finite\_sets
|- !x s t. s SUBSET (t DELETE x) = ~x IN s /\ s SUBSET t
\ENDTHEOREM
\THEOREM SUBSET\_INSERT\_DELETE finite\_sets
|- !x s t. s SUBSET (x INSERT t) = (s DELETE x) SUBSET t
\ENDTHEOREM
-\section{Disjoint sets}
-\THEOREM DISJOINT\_DEF finite\_sets
+\section{Disjoint sets}\THEOREM DISJOINT\_DEF finite\_sets
|- !s t. DISJOINT s t = (s INTER t = {})
\ENDTHEOREM
\THEOREM DISJOINT\_DELETE\_SYM finite\_sets
@@ -261,8 +252,7 @@
\THEOREM IN\_DISJOINT finite\_sets
|- !s t. DISJOINT s t = ~(?x. x IN s /\ x IN t)
\ENDTHEOREM
-\section{The {\tt CHOICE} and {\tt REST} functions}
-\THEOREM CHOICE\_DEF finite\_sets
+\section{The {\tt CHOICE} and {\tt REST} functions}\THEOREM CHOICE\_DEF finite\_sets
|- !s. ~(s = {}) ==> (CHOICE s) IN s
\ENDTHEOREM
\THEOREM CHOICE\_INSERT\_REST finite\_sets
@@ -289,8 +279,7 @@
\THEOREM SING\_IFF\_EMPTY\_REST finite\_sets
|- !s. SING s = ~(s = {}) /\ (REST s = {})
\ENDTHEOREM
-\section{Image of a function on a set}
-\THEOREM IMAGE\_COMPOSE finite\_sets
+\section{Image of a function on a set}\THEOREM IMAGE\_COMPOSE finite\_sets
|- !f g s. IMAGE(f o g)s = IMAGE f(IMAGE g s)
\ENDTHEOREM
\THEOREM IMAGE\_DELETE finite\_sets
@@ -323,8 +312,7 @@
\THEOREM IN\_IMAGE finite\_sets
|- !f s y. y IN (IMAGE f s) = (?x. (y = f x) /\ x IN s)
\ENDTHEOREM
-\section{Mappings between sets}
-\THEOREM BIJ\_COMPOSE finite\_sets
+\section{Mappings between sets}\THEOREM BIJ\_COMPOSE finite\_sets
|- !f g s t u. BIJ f s t /\ BIJ g t u ==> BIJ(g o f)s u
\ENDTHEOREM
\THEOREM BIJ\_DEF finite\_sets
@@ -375,8 +363,7 @@
\THEOREM SURJ\_ID finite\_sets
|- !s. SURJ(\x. x)s s
\ENDTHEOREM
-\section{Singleton sets}
-\THEOREM DELETE\_EQ\_SING finite\_sets
+\section{Singleton sets}\THEOREM DELETE\_EQ\_SING finite\_sets
|- !s x. x IN s ==> ((s DELETE x = {}) = (s = {x}))
\ENDTHEOREM
\THEOREM DISJOINT\_SING\_EMPTY finite\_sets
@@ -397,17 +384,16 @@
\THEOREM NOT\_SING\_EMPTY finite\_sets
|- !x. ~({x} = {})
\ENDTHEOREM
-\THEOREM SING finite\_sets
-|- !x. SING{x}
-\ENDTHEOREM
\THEOREM SING\_DEF finite\_sets
|- !s. SING s = (?x. s = {x})
\ENDTHEOREM
\THEOREM SING\_DELETE finite\_sets
|- !x. {x} DELETE x = {}
\ENDTHEOREM
-\section{Cardinality of sets}
-\THEOREM CARD\_DEF finite\_sets
+\THEOREM SING finite\_sets
+|- !x. SING{x}
+\ENDTHEOREM
+\section{Cardinality of sets}\THEOREM CARD\_DEF finite\_sets
|- (CARD{} = 0) /\
(!s x. CARD(x INSERT s) = (x IN s => CARD s | SUC(CARD s)))
\ENDTHEOREM
--- hol88-2.02.19940316.orig/Library/finite_sets/Manual/Makefile
+++ hol88-2.02.19940316/Library/finite_sets/Manual/Makefile
@@ -26,45 +26,45 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: theorems ids
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the Library}">entries.tex
- @echo "\label{entries}">>entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the Library}'>entries.tex
+ @printf '\\label{entries}'>>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{The type definition}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{The type definition}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/sdef theorems.tex
- @echo "\section{Basic properties of {\tt EMPTY}, {\tt INSERT}, and {\tt IN}}">>theorems.tex
+ @printf '\\section{Basic properties of {\\tt EMPTY}, {\\tt INSERT}, and {\\tt IN}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/basic theorems.tex
- @echo "\section{Set inclusion}">>theorems.tex
+ @printf '\\section{Set inclusion}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/subs theorems.tex
- @echo "\section{Intersection and union}">>theorems.tex
+ @printf '\\section{Intersection and union}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/unin theorems.tex
- @echo "\section{Set difference}">>theorems.tex
+ @printf '\\section{Set difference}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/diff theorems.tex
- @echo "\section{Deletion of an element}">>theorems.tex
+ @printf '\\section{Deletion of an element}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/del theorems.tex
- @echo "\section{Disjoint sets}">>theorems.tex
+ @printf '\\section{Disjoint sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/disj theorems.tex
- @echo "\section{The {\tt CHOICE} and {\tt REST} functions}">>theorems.tex
+ @printf '\\section{The {\\tt CHOICE} and {\\tt REST} functions}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/chre theorems.tex
- @echo "\section{Image of a function on a set}">>theorems.tex
+ @printf '\\section{Image of a function on a set}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/image theorems.tex
- @echo "\section{Mappings between sets}">>theorems.tex
+ @printf '\\section{Mappings between sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/fun theorems.tex
- @echo "\section{Singleton sets}">>theorems.tex
+ @printf '\\section{Singleton sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/sing theorems.tex
- @echo "\section{Cardinality of sets}">>theorems.tex
+ @printf '\\section{Cardinality of sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/card theorems.tex
index:
--- hol88-2.02.19940316.orig/Library/finite_sets/Manual/entries.tex
+++ hol88-2.02.19940316/Library/finite_sets/Manual/entries.tex
@@ -1,7 +1,4 @@
-\chapter{ML Functions in the Library}
-\label{entries}
-\input{entries-intro}
-\DOC{DELETE\_CONV}
+\chapter{ML Functions in the Library}\label{entries}\input{entries-intro}\DOC{DELETE\_CONV}
\TYPE {\small\verb%DELETE_CONV : conv -> conv%}\egroup
@@ -171,6 +168,84 @@ for some {\small\verb%ri%}.
\ENDDOC
+\DOC{IN\_CONV}
+
+\TYPE {\small\verb%IN_CONV : conv -> conv%}\egroup
+
+\SYNOPSIS
+Decision procedure for membership in finite sets.
+
+\DESCRIBE
+The function {\small\verb%IN_CONV%} is a parameterized conversion for proving or disproving
+membership assertions of the general form:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ "t IN {t1,...,tn}"
+\end{verbatim}
+}
+\noindent where {\small\verb%{t1,...,tn}%} is a set of type {\small\verb%(ty)set%} and {\small\verb%t%} is a value
+of the base type {\small\verb%ty%}. The first argument to {\small\verb%IN_CONV%} is expected to be a
+conversion that decides equality between values of the base type {\small\verb%ty%}. Given
+an equation {\small\verb%"e1 = e2"%}, where {\small\verb%e1%} and {\small\verb%e2%} are terms of type {\small\verb%ty%}, this
+conversion should return the theorem {\small\verb%|- (e1 = e2) = T%} or the theorem
+{\small\verb%|- (e1 = e2) = F%}, as appropriate.
+
+Given such a conversion, the function {\small\verb%IN_CONV%} returns a conversion that
+maps a term of the form {\small\verb%"t IN {t1,...,tn}"%} to the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- t IN {t1,...,tn} = T
+\end{verbatim}
+}
+
+\noindent if {\small\verb%t%} is alpha-equivalent to any {\small\verb%ti%}, or if the supplied conversion
+proves {\small\verb%|- (t = ti) = T%} for any {\small\verb%ti%}. If the supplied conversion proves
+{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}, then the result is the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- t IN {t1,...,tn} = F
+\end{verbatim}
+}
+\noindent In all other cases, {\small\verb%IN_CONV%} will fail.
+
+\EXAMPLE
+In the following example, the conversion {\small\verb%num_EQ_CONV%} is supplied as a
+parameter and used to test equality of the candidate element {\small\verb%1%} with the
+actual elements of the given set.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #IN_CONV num_EQ_CONV "2 IN {0,SUC 1,3}";;
+ |- 2 IN {0,SUC 1,3} = T
+\end{verbatim}
+}
+\noindent The result is {\small\verb%T%} because {\small\verb%num_EQ_CONV%} is able to prove that {\small\verb%2%} is
+equal to {\small\verb%SUC 1%}. An example of a negative result is:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #IN_CONV num_EQ_CONV "1 IN {0,2,3}";;
+ |- 1 IN {0,2,3} = F
+\end{verbatim}
+}
+\noindent Finally the behaviour of the supplied conversion is irrelevant when
+the value to be tested for membership is alpha-equivalent to an actual element:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #IN_CONV NO_CONV "1 IN {3,2,1}";;
+ |- 1 IN {3,2,1} = T
+\end{verbatim}
+}
+\noindent The conversion {\small\verb%NO_CONV%} always fails, but {\small\verb%IN_CONV%} is nontheless
+able in this case to prove the required result.
+
+\FAILURE
+{\small\verb%IN_CONV conv%} fails if applied to a term that is not of the form {\small\verb%"t IN
+{t1,...,tn}"%}. A call {\small\verb%IN_CONV conv "t IN {t1,...,tn}"%} fails unless the
+term {\small\verb%t%} is alpha-equivalent to some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
+{\small\verb%|- (t = ti) = T%} for some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
+{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}.
+
+\ENDDOC
+
\DOC{INSERT\_CONV}
\TYPE {\small\verb%INSERT_CONV : conv -> conv%}\egroup
@@ -257,84 +332,6 @@ DELETE_CONV.
\ENDDOC
-\DOC{IN\_CONV}
-
-\TYPE {\small\verb%IN_CONV : conv -> conv%}\egroup
-
-\SYNOPSIS
-Decision procedure for membership in finite sets.
-
-\DESCRIBE
-The function {\small\verb%IN_CONV%} is a parameterized conversion for proving or disproving
-membership assertions of the general form:
-{\par\samepage\setseps\small
-\begin{verbatim}
- "t IN {t1,...,tn}"
-\end{verbatim}
-}
-\noindent where {\small\verb%{t1,...,tn}%} is a set of type {\small\verb%(ty)set%} and {\small\verb%t%} is a value
-of the base type {\small\verb%ty%}. The first argument to {\small\verb%IN_CONV%} is expected to be a
-conversion that decides equality between values of the base type {\small\verb%ty%}. Given
-an equation {\small\verb%"e1 = e2"%}, where {\small\verb%e1%} and {\small\verb%e2%} are terms of type {\small\verb%ty%}, this
-conversion should return the theorem {\small\verb%|- (e1 = e2) = T%} or the theorem
-{\small\verb%|- (e1 = e2) = F%}, as appropriate.
-
-Given such a conversion, the function {\small\verb%IN_CONV%} returns a conversion that
-maps a term of the form {\small\verb%"t IN {t1,...,tn}"%} to the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- t IN {t1,...,tn} = T
-\end{verbatim}
-}
-
-\noindent if {\small\verb%t%} is alpha-equivalent to any {\small\verb%ti%}, or if the supplied conversion
-proves {\small\verb%|- (t = ti) = T%} for any {\small\verb%ti%}. If the supplied conversion proves
-{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}, then the result is the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- t IN {t1,...,tn} = F
-\end{verbatim}
-}
-\noindent In all other cases, {\small\verb%IN_CONV%} will fail.
-
-\EXAMPLE
-In the following example, the conversion {\small\verb%num_EQ_CONV%} is supplied as a
-parameter and used to test equality of the candidate element {\small\verb%1%} with the
-actual elements of the given set.
-{\par\samepage\setseps\small
-\begin{verbatim}
- #IN_CONV num_EQ_CONV "2 IN {0,SUC 1,3}";;
- |- 2 IN {0,SUC 1,3} = T
-\end{verbatim}
-}
-\noindent The result is {\small\verb%T%} because {\small\verb%num_EQ_CONV%} is able to prove that {\small\verb%2%} is
-equal to {\small\verb%SUC 1%}. An example of a negative result is:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #IN_CONV num_EQ_CONV "1 IN {0,2,3}";;
- |- 1 IN {0,2,3} = F
-\end{verbatim}
-}
-\noindent Finally the behaviour of the supplied conversion is irrelevant when
-the value to be tested for membership is alpha-equivalent to an actual element:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #IN_CONV NO_CONV "1 IN {3,2,1}";;
- |- 1 IN {3,2,1} = T
-\end{verbatim}
-}
-\noindent The conversion {\small\verb%NO_CONV%} always fails, but {\small\verb%IN_CONV%} is nontheless
-able in this case to prove the required result.
-
-\FAILURE
-{\small\verb%IN_CONV conv%} fails if applied to a term that is not of the form {\small\verb%"t IN
-{t1,...,tn}"%}. A call {\small\verb%IN_CONV conv "t IN {t1,...,tn}"%} fails unless the
-term {\small\verb%t%} is alpha-equivalent to some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
-{\small\verb%|- (t = ti) = T%} for some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
-{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}.
-
-\ENDDOC
-
\DOC{SET\_INDUCT\_TAC}
\TYPE {\small\verb%SET_INDUCT_TAC : tactic%}\egroup
--- hol88-2.02.19940316.orig/Library/pair/Manual/Makefile
+++ hol88-2.02.19940316/Library/pair/Manual/Makefile
@@ -26,19 +26,19 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex theorems.tex; \
- echo "\begin{theindex}" >index.tex; \
- echo "\mbox{}" >>index.tex; \
- echo "\end{theindex}" >>index.tex
+ printf '\\begin{theindex}' >index.tex; \
+ printf '\\mbox{}' >>index.tex; \
+ printf '\\end{theindex}' >>index.tex
ids:
- echo "\chapter{ML Functions in the pair Library}" >entries.tex; \
- echo "\input{entries-intro}" >>entries.tex; \
+ printf '\\chapter{ML Functions in the pair Library}' >entries.tex; \
+ printf '\\input{entries-intro}' >>entries.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{Theorems}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{Theorems}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms theorems.tex
index:
--- hol88-2.02.19940316.orig/Library/window/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/window/Manual/theorems.tex
@@ -1,11 +1,7 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\section{Definitions}
-\THEOREM PMI\_DEF win
+\chapter{Pre-proved Theorems}\input{theorems-intro}\section{Definitions}\THEOREM PMI\_DEF win
|- !a b. a <== b = b ==> a
\ENDTHEOREM
-\section{Theorems}
-\THEOREM IMP\_REFL\_THM win
+\section{Theorems}\THEOREM IMP\_REFL\_THM win
|- !x. x ==> x
\ENDTHEOREM
\THEOREM IMP\_TRANS\_THM win
--- hol88-2.02.19940316.orig/Library/window/Manual/Makefile
+++ hol88-2.02.19940316/Library/window/Manual/Makefile
@@ -26,24 +26,24 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex *.bak; \
- echo "\begin{theindex}" >index.tex; \
- echo "\mbox{}" >>index.tex; \
- echo "\end{theindex}" >>index.tex
+ printf '\\begin{theindex}' >index.tex; \
+ printf '\\mbox{}' >>index.tex; \
+ printf '\\end{theindex}' >>index.tex
tex: ids theorems
@echo "TeX files makde"
ids:
- echo "\chapter{ML Functions in the window Library}" >entries.tex; \
- echo "\input{entries-intro}" >>entries.tex; \
+ printf '\\chapter{ML Functions in the window Library}' >entries.tex; \
+ printf '\\input{entries-intro}' >>entries.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{Definitions}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{Definitions}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/defs theorems.tex
- @echo "\section{Theorems}">>theorems.tex
+ @printf '\\section{Theorems}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms theorems.tex
index:
--- hol88-2.02.19940316.orig/Library/parser/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/parser/Manual/theorems.tex
@@ -1 +1 @@
-\chapter{Pre-proved Theorems}
+\chapter{Pre-proved Theorems}
\ No newline at end of file
--- hol88-2.02.19940316.orig/Library/parser/Manual/Makefile
+++ hol88-2.02.19940316/Library/parser/Manual/Makefile
@@ -25,20 +25,20 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids theorems
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the parser Library}">entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the parser Library}'>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
index:
${MAKEINDEX} parser.idx index.tex
--- hol88-2.02.19940316.orig/Library/parser/Manual/entries.tex
+++ hol88-2.02.19940316/Library/parser/Manual/entries.tex
@@ -1,6 +1,4 @@
-\chapter{ML Functions in the parser Library}
-\input{entries-intro}
-\DOC{parse}
+\chapter{ML Functions in the parser Library}\input{entries-intro}\DOC{parse}
\TYPE {\small\verb%parse : (* -> void)%}\egroup
--- hol88-2.02.19940316.orig/Library/record_proof/Manual/Makefile
+++ hol88-2.02.19940316/Library/record_proof/Manual/Makefile
@@ -27,17 +27,17 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: functions
@echo "TeX files made"
functions:
- @echo "\chapter{ML Functions in the {\tt record\_proof} Library}">entries.tex
- @echo "\label{entries}">>entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the {\\tt record\\_proof} Library}'>entries.tex
+ @printf '\\label{entries}'>>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help} entries.tex
index:
--- hol88-2.02.19940316.orig/Library/record_proof/Manual/entries.tex
+++ hol88-2.02.19940316/Library/record_proof/Manual/entries.tex
@@ -1,3 +1 @@
-\chapter{ML Functions in the {\tt record\_proof} Library}
-\label{entries}
-\input{entries-intro}
+\chapter{ML Functions in the {\tt record\_proof} Library}\label{entries}\input{entries-intro}
\ No newline at end of file
--- hol88-2.02.19940316.orig/Library/word/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/word/Manual/theorems.tex
@@ -1,7 +1,4 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\section{The theory {\tt word\_base}}
-\THEOREM BIT0 word\_base
+\chapter{Pre-proved Theorems}\input{theorems-intro}\section{The theory {\tt word\_base}}\THEOREM BIT0 word\_base
|- !b. BIT 0(WORD[b]) = b
\ENDTHEOREM
\THEOREM BIT\_DEF word\_base
@@ -33,20 +30,17 @@
!m k j.
(m + k) <= n ==> j < m ==> (BIT j(WSEG m k w) = BIT(j + k)w)
\ENDTHEOREM
-\THEOREM LSB word\_base
-|- !n. !w :: PWORDLEN n. 0 < n ==> (LSB w = BIT 0 w)
-\ENDTHEOREM
\THEOREM LSB\_DEF word\_base
|- !l. LSB(WORD l) = LAST l
\ENDTHEOREM
-\THEOREM MSB word\_base
-|- !n. !w :: PWORDLEN n. 0 < n ==> (MSB w = BIT(PRE n)w)
+\THEOREM LSB word\_base
+|- !n. !w :: PWORDLEN n. 0 < n ==> (LSB w = BIT 0 w)
\ENDTHEOREM
\THEOREM MSB\_DEF word\_base
|- !l. MSB(WORD l) = HD l
\ENDTHEOREM
-\THEOREM PWORDLEN word\_base
-|- !n w. PWORDLEN n w = (WORDLEN w = n)
+\THEOREM MSB word\_base
+|- !n. !w :: PWORDLEN n. 0 < n ==> (MSB w = BIT(PRE n)w)
\ENDTHEOREM
\THEOREM PWORDLEN0 word\_base
|- !w. PWORDLEN 0 w ==> (w = WORD[])
@@ -57,6 +51,9 @@
\THEOREM PWORDLEN\_DEF word\_base
|- !n l. PWORDLEN n(WORD l) = (n = LENGTH l)
\ENDTHEOREM
+\THEOREM PWORDLEN word\_base
+|- !n w. PWORDLEN n w = (WORDLEN w = n)
+\ENDTHEOREM
\THEOREM WCAT0 word\_base
|- !w. (WCAT(WORD[],w) = w) /\ (WCAT(w,WORD[]) = w)
\ENDTHEOREM
@@ -84,26 +81,6 @@
(m1 + (m2 + k)) <= n ==>
(WCAT(WSEG m2(m1 + k)w,WSEG m1 k w) = WSEG(m1 + m2)k w)
\ENDTHEOREM
-\THEOREM WORDLEN\_DEF word\_base
-|- !l. WORDLEN(WORD l) = LENGTH l
-\ENDTHEOREM
-\THEOREM WORDLEN\_SUC\_WCAT word\_base
-|- !n w.
- PWORDLEN(SUC n)w ==>
- (?b :: PWORDLEN 1. ?w' :: PWORDLEN n. w = WCAT(b,w'))
-\ENDTHEOREM
-\THEOREM WORDLEN\_SUC\_WCAT\_BIT\_WSEG word\_base
-|- !n. !w :: PWORDLEN(SUC n). w = WCAT(WORD[BIT n w],WSEG n 0 w)
-\ENDTHEOREM
-\THEOREM WORDLEN\_SUC\_WCAT\_BIT\_WSEG\_RIGHT word\_base
-|- !n. !w :: PWORDLEN(SUC n). w = WCAT(WSEG n 1 w,WORD[BIT 0 w])
-\ENDTHEOREM
-\THEOREM WORDLEN\_SUC\_WCAT\_WSEG\_WSEG word\_base
-|- !w :: PWORDLEN(SUC n). w = WCAT(WSEG 1 n w,WSEG n 0 w)
-\ENDTHEOREM
-\THEOREM WORDLEN\_SUC\_WCAT\_WSEG\_WSEG\_RIGHT word\_base
-|- !w :: PWORDLEN(SUC n). w = WCAT(WSEG n 1 w,WSEG 1 0 w)
-\ENDTHEOREM
\THEOREM WORD\_11 word\_base
|- !l l'. (WORD l = WORD l') = (l = l')
\ENDTHEOREM
@@ -128,6 +105,26 @@
TRP(\v tl. (?l. v = l) /\ (LENGTH tl = 0))r =
(REP_word(ABS_word r) = r))
\ENDTHEOREM
+\THEOREM WORDLEN\_DEF word\_base
+|- !l. WORDLEN(WORD l) = LENGTH l
+\ENDTHEOREM
+\THEOREM WORDLEN\_SUC\_WCAT\_BIT\_WSEG word\_base
+|- !n. !w :: PWORDLEN(SUC n). w = WCAT(WORD[BIT n w],WSEG n 0 w)
+\ENDTHEOREM
+\THEOREM WORDLEN\_SUC\_WCAT\_BIT\_WSEG\_RIGHT word\_base
+|- !n. !w :: PWORDLEN(SUC n). w = WCAT(WSEG n 1 w,WORD[BIT 0 w])
+\ENDTHEOREM
+\THEOREM WORDLEN\_SUC\_WCAT word\_base
+|- !n w.
+ PWORDLEN(SUC n)w ==>
+ (?b :: PWORDLEN 1. ?w' :: PWORDLEN n. w = WCAT(b,w'))
+\ENDTHEOREM
+\THEOREM WORDLEN\_SUC\_WCAT\_WSEG\_WSEG word\_base
+|- !w :: PWORDLEN(SUC n). w = WCAT(WSEG 1 n w,WSEG n 0 w)
+\ENDTHEOREM
+\THEOREM WORDLEN\_SUC\_WCAT\_WSEG\_WSEG\_RIGHT word\_base
+|- !w :: PWORDLEN(SUC n). w = WCAT(WSEG n 1 w,WSEG 1 0 w)
+\ENDTHEOREM
\THEOREM WORD\_PARTITION word\_base
|- (!n. !w :: PWORDLEN n. !m. m <= n ==> (WCAT(WSPLIT m w) = w)) /\
(!n m.
@@ -162,15 +159,6 @@
|- !n1 n2.
!w1 :: PWORDLEN n1. !w2 :: PWORDLEN n2. WSEG n2 0(WCAT(w1,w2)) = w2
\ENDTHEOREM
-\THEOREM WSEG\_WCAT\_WSEG word\_base
-|- !n1 n2.
- !w1 :: PWORDLEN n1.
- !w2 :: PWORDLEN n2.
- !m k.
- (m + k) <= (n1 + n2) /\ k < n2 /\ n2 <= (m + k) ==>
- (WSEG m k(WCAT(w1,w2)) =
- WCAT(WSEG((m + k) - n2)0 w1,WSEG(n2 - k)k w2))
-\ENDTHEOREM
\THEOREM WSEG\_WCAT\_WSEG1 word\_base
|- !n1 n2.
!w1 :: PWORDLEN n1.
@@ -184,6 +172,15 @@
!w2 :: PWORDLEN n2.
!m k. (m + k) <= n2 ==> (WSEG m k(WCAT(w1,w2)) = WSEG m k w2)
\ENDTHEOREM
+\THEOREM WSEG\_WCAT\_WSEG word\_base
+|- !n1 n2.
+ !w1 :: PWORDLEN n1.
+ !w2 :: PWORDLEN n2.
+ !m k.
+ (m + k) <= (n1 + n2) /\ k < n2 /\ n2 <= (m + k) ==>
+ (WSEG m k(WCAT(w1,w2)) =
+ WCAT(WSEG((m + k) - n2)0 w1,WSEG(n2 - k)k w2))
+\ENDTHEOREM
\THEOREM WSEG\_WORDLEN word\_base
|- !n.
!w :: PWORDLEN n. !m k. (m + k) <= n ==> (WORDLEN(WSEG m k w) = m)
@@ -208,11 +205,6 @@
m <= n ==>
PWORDLEN(n - m)(FST(WSPLIT m w)) /\ PWORDLEN m(SND(WSPLIT m w))
\ENDTHEOREM
-\THEOREM WSPLIT\_WSEG word\_base
-|- !n.
- !w :: PWORDLEN n.
- !k. k <= n ==> (WSPLIT k w = WSEG(n - k)k w,WSEG k 0 w)
-\ENDTHEOREM
\THEOREM WSPLIT\_WSEG1 word\_base
|- !n.
!w :: PWORDLEN n. !k. k <= n ==> (FST(WSPLIT k w) = WSEG(n - k)k w)
@@ -220,13 +212,17 @@
\THEOREM WSPLIT\_WSEG2 word\_base
|- !n. !w :: PWORDLEN n. !k. k <= n ==> (SND(WSPLIT k w) = WSEG k 0 w)
\ENDTHEOREM
-\section{The theory {\tt word\_bitop}}
-\THEOREM EXISTSABIT word\_bitop
-|- !n. !w :: PWORDLEN n. !P. EXISTSABIT P w = (?k. k < n /\ P(BIT k w))
+\THEOREM WSPLIT\_WSEG word\_base
+|- !n.
+ !w :: PWORDLEN n.
+ !k. k <= n ==> (WSPLIT k w = WSEG(n - k)k w,WSEG k 0 w)
\ENDTHEOREM
-\THEOREM EXISTSABIT\_DEF word\_bitop
+\section{The theory {\tt word\_bitop}}\THEOREM EXISTSABIT\_DEF word\_bitop
|- !P l. EXISTSABIT P(WORD l) = SOME_EL P l
\ENDTHEOREM
+\THEOREM EXISTSABIT word\_bitop
+|- !n. !w :: PWORDLEN n. !P. EXISTSABIT P w = (?k. k < n /\ P(BIT k w))
+\ENDTHEOREM
\THEOREM EXISTSABIT\_WCAT word\_bitop
|- !w1 w2 P.
EXISTSABIT P(WCAT(w1,w2)) = EXISTSABIT P w1 \/ EXISTSABIT P w2
@@ -237,12 +233,12 @@
!m k.
(m + k) <= n ==> (!P. EXISTSABIT P(WSEG m k w) ==> EXISTSABIT P w)
\ENDTHEOREM
-\THEOREM FORALLBITS word\_bitop
-|- !n. !w :: PWORDLEN n. !P. FORALLBITS P w = (!k. k < n ==> P(BIT k w))
-\ENDTHEOREM
\THEOREM FORALLBITS\_DEF word\_bitop
|- !P l. FORALLBITS P(WORD l) = ALL_EL P l
\ENDTHEOREM
+\THEOREM FORALLBITS word\_bitop
+|- !n. !w :: PWORDLEN n. !P. FORALLBITS P w = (!k. k < n ==> P(BIT k w))
+\ENDTHEOREM
\THEOREM FORALLBITS\_WCAT word\_bitop
|- !w1 w2 P.
FORALLBITS P(WCAT(w1,w2)) = FORALLBITS P w1 /\ FORALLBITS P w2
@@ -316,6 +312,16 @@
BIT(PRE(WORDLEN w))w,
WCAT(WSEG(PRE(WORDLEN w))0 w,(f => WSEG 1 0 w | WORD[b]))
\ENDTHEOREM
+\THEOREM SHL\_WSEG\_1F word\_bitop
+|- !n.
+ !w :: PWORDLEN n.
+ !m k.
+ (m + k) <= n ==>
+ 0 < m ==>
+ (!b.
+ SHL F(WSEG m k w)b =
+ BIT(k + (m - 1))w,WCAT(WSEG(m - 1)k w,WORD[b]))
+\ENDTHEOREM
\THEOREM SHL\_WSEG word\_bitop
|- !n.
!w :: PWORDLEN n.
@@ -329,16 +335,6 @@
WCAT(WSEG(m - 1)k w,WSEG 1 k w) |
WCAT(WSEG(m - 1)k w,WORD[b])))
\ENDTHEOREM
-\THEOREM SHL\_WSEG\_1F word\_bitop
-|- !n.
- !w :: PWORDLEN n.
- !m k.
- (m + k) <= n ==>
- 0 < m ==>
- (!b.
- SHL F(WSEG m k w)b =
- BIT(k + (m - 1))w,WCAT(WSEG(m - 1)k w,WORD[b]))
-\ENDTHEOREM
\THEOREM SHL\_WSEG\_NF word\_bitop
|- !n.
!w :: PWORDLEN n.
@@ -356,26 +352,26 @@
((f => WSEG 1(PRE(WORDLEN w))w | WORD[b]),WSEG(PRE(WORDLEN w))1 w),
BIT 0 w
\ENDTHEOREM
-\THEOREM SHR\_WSEG word\_bitop
+\THEOREM SHR\_WSEG\_1F word\_bitop
|- !n.
!w :: PWORDLEN n.
!m k.
(m + k) <= n ==>
0 < m ==>
- (!f b.
- SHR f b(WSEG m k w) =
- (f =>
- WCAT(WSEG 1(k + (m - 1))w,WSEG(m - 1)(k + 1)w) |
- WCAT(WORD[b],WSEG(m - 1)(k + 1)w)),BIT k w)
+ (!b.
+ SHR F b(WSEG m k w) = WCAT(WORD[b],WSEG(m - 1)(k + 1)w),BIT k w)
\ENDTHEOREM
-\THEOREM SHR\_WSEG\_1F word\_bitop
+\THEOREM SHR\_WSEG word\_bitop
|- !n.
!w :: PWORDLEN n.
!m k.
(m + k) <= n ==>
0 < m ==>
- (!b.
- SHR F b(WSEG m k w) = WCAT(WORD[b],WSEG(m - 1)(k + 1)w),BIT k w)
+ (!f b.
+ SHR f b(WSEG m k w) =
+ (f =>
+ WCAT(WSEG 1(k + (m - 1))w,WSEG(m - 1)(k + 1)w) |
+ WCAT(WORD[b],WSEG(m - 1)(k + 1)w)),BIT k w)
\ENDTHEOREM
\THEOREM SHR\_WSEG\_NF word\_bitop
|- !n.
@@ -413,13 +409,6 @@
!m k.
(m + k) <= n ==> (!f. WMAP f(WSEG m k w) = WSEG m k(WMAP f w))
\ENDTHEOREM
-\THEOREM WSEG\_SHL word\_bitop
-|- !n.
- !w :: PWORDLEN(SUC n).
- !m k.
- 0 < k /\ (m + k) <= (SUC n) ==>
- (!b. WSEG m k(SND(SHL f w b)) = WSEG m(k - 1)w)
-\ENDTHEOREM
\THEOREM WSEG\_SHL\_0 word\_bitop
|- !n.
!w :: PWORDLEN(SUC n).
@@ -428,15 +417,21 @@
(WSEG m 0(SND(SHL f w b)) =
WCAT(WSEG(m - 1)0 w,(f => WSEG 1 0 w | WORD[b])))
\ENDTHEOREM
-\section{The theory {\tt word\_num}}
+\THEOREM WSEG\_SHL word\_bitop
+|- !n.
+ !w :: PWORDLEN(SUC n).
+ !m k.
+ 0 < k /\ (m + k) <= (SUC n) ==>
+ (!b. WSEG m k(SND(SHL f w b)) = WSEG m(k - 1)w)
+\ENDTHEOREM
+\section{The theory {\tt word\_num}}\THEOREM LVAL\_DEF word\_num
+|- !f b l. LVAL f b l = FOLDL(\e x. (b * e) + (f x))0 l
+\ENDTHEOREM
\THEOREM LVAL word\_num
|- (!f b. LVAL f b[] = 0) /\
(!l f b x.
LVAL f b(CONS x l) = ((f x) * (b EXP (LENGTH l))) + (LVAL f b l))
\ENDTHEOREM
-\THEOREM LVAL\_DEF word\_num
-|- !f b l. LVAL f b l = FOLDL(\e x. (b * e) + (f x))0 l
-\ENDTHEOREM
\THEOREM LVAL\_MAX word\_num
|- !l f b. (!x. (f x) < b) ==> (LVAL f b l) < (b EXP (LENGTH l))
\ENDTHEOREM
@@ -461,14 +456,6 @@
|- !f b.
(!x. (f x) < b) ==> (!n. !w :: PWORDLEN n. (NVAL f b w) < (b EXP n))
\ENDTHEOREM
-\THEOREM NVAL\_WCAT word\_num
-|- !n m.
- !w1 :: PWORDLEN n.
- !w2 :: PWORDLEN m.
- !f b.
- NVAL f b(WCAT(w1,w2)) =
- ((NVAL f b w1) * (b EXP m)) + (NVAL f b w2)
-\ENDTHEOREM
\THEOREM NVAL\_WCAT1 word\_num
|- !w f b x. NVAL f b(WCAT(w,WORD[x])) = ((NVAL f b w) * b) + (f x)
\ENDTHEOREM
@@ -478,6 +465,14 @@
!f b x.
NVAL f b(WCAT(WORD[x],w)) = ((f x) * (b EXP n)) + (NVAL f b w)
\ENDTHEOREM
+\THEOREM NVAL\_WCAT word\_num
+|- !n m.
+ !w1 :: PWORDLEN n.
+ !w2 :: PWORDLEN m.
+ !f b.
+ NVAL f b(WCAT(w1,w2)) =
+ ((NVAL f b w1) * (b EXP m)) + (NVAL f b w2)
+\ENDTHEOREM
\THEOREM NVAL\_WORDLEN\_0 word\_num
|- !w :: PWORDLEN 0. !fv r. NVAL fv r w = 0
\ENDTHEOREM
@@ -490,8 +485,7 @@
\THEOREM NWORD\_PWORDLEN word\_num
|- !n f b m. PWORDLEN n(NWORD n f b m)
\ENDTHEOREM
-\section{The theory {\tt bword\_bitop}}
-\THEOREM PBITBOP\_WAND bword\_bitop
+\section{The theory {\tt bword\_bitop}}\THEOREM PBITBOP\_WAND bword\_bitop
|- PBITBOP $WAND
\ENDTHEOREM
\THEOREM PBITBOP\_WOR bword\_bitop
@@ -523,8 +517,7 @@
\THEOREM WXOR\_DEF bword\_bitop
|- !l1 l2. (WORD l1) WXOR (WORD l2) = WORD(MAP2(\x y. ~(x = y))l1 l2)
\ENDTHEOREM
-\section{The theory {\tt bword\_num}}
-\THEOREM ADD\_BNVAL\_LEFT bword\_num
+\section{The theory {\tt bword\_num}}\THEOREM ADD\_BNVAL\_LEFT bword\_num
|- !n.
!w1 w2 :: PWORDLEN(SUC n).
(BNVAL w1) + (BNVAL w2) =
@@ -570,12 +563,6 @@
\THEOREM BNVAL\_ONTO bword\_num
|- !w. ?n. BNVAL w = n
\ENDTHEOREM
-\THEOREM BNVAL\_WCAT bword\_num
-|- !n m.
- !w1 :: PWORDLEN n.
- !w2 :: PWORDLEN m.
- BNVAL(WCAT(w1,w2)) = ((BNVAL w1) * (2 EXP m)) + (BNVAL w2)
-\ENDTHEOREM
\THEOREM BNVAL\_WCAT1 bword\_num
|- !n.
!w :: PWORDLEN n.
@@ -586,6 +573,12 @@
!w :: PWORDLEN n.
!x. BNVAL(WCAT(WORD[x],w)) = ((BV x) * (2 EXP n)) + (BNVAL w)
\ENDTHEOREM
+\THEOREM BNVAL\_WCAT bword\_num
+|- !n m.
+ !w1 :: PWORDLEN n.
+ !w2 :: PWORDLEN m.
+ BNVAL(WCAT(w1,w2)) = ((BNVAL w1) * (2 EXP m)) + (BNVAL w2)
+\ENDTHEOREM
\THEOREM BV\_DEF bword\_num
|- !b. BV b = (b => SUC 0 | 0)
\ENDTHEOREM
@@ -667,8 +660,7 @@
\THEOREM ZERO\_WORD\_VAL bword\_num
|- !n. !w :: PWORDLEN n. (w = NBWORD n 0) = (BNVAL w = 0)
\ENDTHEOREM
-\section{The theory {\tt bword\_arith}}
-\THEOREM ACARRY\_ACARRY\_WSEG bword\_arith
+\section{The theory {\tt bword\_arith}}\THEOREM ACARRY\_ACARRY\_WSEG bword\_arith
|- !n.
!w1 w2 :: PWORDLEN n.
!cin m k1 k2.
--- hol88-2.02.19940316.orig/Library/word/Manual/Makefile
+++ hol88-2.02.19940316/Library/word/Manual/Makefile
@@ -27,33 +27,33 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: theorems functions
@echo "TeX files made"
functions:
- @echo "\chapter{ML Functions in the {\tt word} Library}">entries.tex
- @echo "\label{entries}">>entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the {\\tt word} Library}'>entries.tex
+ @printf '\\label{entries}'>>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{The theory {\tt word\_base}}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{The theory {\\tt word\\_base}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/word_base theorems.tex
- @echo "\section{The theory {\tt word\_bitop}}">>theorems.tex
+ @printf '\\section{The theory {\\tt word\\_bitop}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/word_bitop theorems.tex
- @echo "\section{The theory {\tt word\_num}}">>theorems.tex
+ @printf '\\section{The theory {\\tt word\\_num}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/word_num theorems.tex
- @echo "\section{The theory {\tt bword\_bitop}}">>theorems.tex
+ @printf '\\section{The theory {\\tt bword\\_bitop}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/bword_bitop theorems.tex
- @echo "\section{The theory {\tt bword\_num}}">>theorems.tex
+ @printf '\\section{The theory {\\tt bword\\_num}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/bword_num theorems.tex
- @echo "\section{The theory {\tt bword\_arith}}">>theorems.tex
+ @printf '\\section{The theory {\\tt bword\\_arith}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/bword_arith theorems.tex
index:
--- hol88-2.02.19940316.orig/Library/word/Manual/entries.tex
+++ hol88-2.02.19940316/Library/word/Manual/entries.tex
@@ -1,7 +1,4 @@
-\chapter{ML Functions in the {\tt word} Library}
-\label{entries}
-\input{entries-intro}
-\DOC{BIT\_CONV}
+\chapter{ML Functions in the {\tt word} Library}\label{entries}\input{entries-intro}\DOC{BIT\_CONV}
\TYPE {\small\verb%BIT_CONV : conv%}\egroup
--- hol88-2.02.19940316.orig/Library/pred_sets/Manual/Makefile
+++ hol88-2.02.19940316/Library/pred_sets/Manual/Makefile
@@ -25,47 +25,47 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: theorems ids
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the Library}">entries.tex
- @echo "\label{entries}">>entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the Library}'>entries.tex
+ @printf '\\label{entries}'>>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{Membership, equality, and set specifications}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{Membership, equality, and set specifications}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/mem theorems.tex
- @echo "\section{The empty and universal sets}">>theorems.tex
+ @printf '\\section{The empty and universal sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/emuniv theorems.tex
- @echo "\section{Set inclusion}">>theorems.tex
+ @printf '\\section{Set inclusion}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/subs theorems.tex
- @echo "\section{Intersection and union}">>theorems.tex
+ @printf '\\section{Intersection and union}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/unin theorems.tex
- @echo "\section{Set difference}">>theorems.tex
+ @printf '\\section{Set difference}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/diff theorems.tex
- @echo "\section{Disjoint sets}">>theorems.tex
+ @printf '\\section{Disjoint sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/disj theorems.tex
- @echo "\section{Insertion and deletion of an element}">>theorems.tex
+ @printf '\\section{Insertion and deletion of an element}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/insdel theorems.tex
- @echo "\section{The {\tt CHOICE} and {\tt REST} functions}">>theorems.tex
+ @printf '\\section{The {\\tt CHOICE} and {\\tt REST} functions}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/chre theorems.tex
- @echo "\section{Image of a function on a set}">>theorems.tex
+ @printf '\\section{Image of a function on a set}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/image theorems.tex
- @echo "\section{Mappings between sets}">>theorems.tex
+ @printf '\\section{Mappings between sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/fun theorems.tex
- @echo "\section{Singleton sets}">>theorems.tex
+ @printf '\\section{Singleton sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/sing theorems.tex
- @echo "\section{Finite and infinite sets}">>theorems.tex
+ @printf '\\section{Finite and infinite sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/fin theorems.tex
- @echo "\section{Cardinality of sets}">>theorems.tex
+ @printf '\\section{Cardinality of sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/card theorems.tex
index:
--- hol88-2.02.19940316.orig/Library/pred_sets/Manual/entries.tex
+++ hol88-2.02.19940316/Library/pred_sets/Manual/entries.tex
@@ -1,7 +1,4 @@
-\chapter{ML Functions in the Library}
-\label{entries}
-\input{entries-intro}
-\DOC{DELETE\_CONV}
+\chapter{ML Functions in the Library}\label{entries}\input{entries-intro}\DOC{DELETE\_CONV}
\TYPE {\small\verb%DELETE_CONV : conv -> conv%}\egroup
@@ -204,6 +201,84 @@ for some {\small\verb%ri%}.
\ENDDOC
+\DOC{IN\_CONV}
+
+\TYPE {\small\verb%IN_CONV : conv -> conv%}\egroup
+
+\SYNOPSIS
+Decision procedure for membership in finite sets.
+
+\DESCRIBE
+The function {\small\verb%IN_CONV%} is a parameterized conversion for proving or disproving
+membership assertions of the general form:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ "t IN {t1,...,tn}"
+\end{verbatim}
+}
+\noindent where {\small\verb%{t1,...,tn}%} is a set of type {\small\verb%ty->bool%} and {\small\verb%t%} is a value
+of the base type {\small\verb%ty%}. The first argument to {\small\verb%IN_CONV%} is expected to be a
+conversion that decides equality between values of the base type {\small\verb%ty%}. Given
+an equation {\small\verb%"e1 = e2"%}, where {\small\verb%e1%} and {\small\verb%e2%} are terms of type {\small\verb%ty%}, this
+conversion should return the theorem {\small\verb%|- (e1 = e2) = T%} or the theorem
+{\small\verb%|- (e1 = e2) = F%}, as appropriate.
+
+Given such a conversion, the function {\small\verb%IN_CONV%} returns a conversion that
+maps a term of the form {\small\verb%"t IN {t1,...,tn}"%} to the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- t IN {t1,...,tn} = T
+\end{verbatim}
+}
+
+\noindent if {\small\verb%t%} is alpha-equivalent to any {\small\verb%ti%}, or if the supplied conversion
+proves {\small\verb%|- (t = ti) = T%} for any {\small\verb%ti%}. If the supplied conversion proves
+{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}, then the result is the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- t IN {t1,...,tn} = F
+\end{verbatim}
+}
+\noindent In all other cases, {\small\verb%IN_CONV%} will fail.
+
+\EXAMPLE
+In the following example, the conversion {\small\verb%num_EQ_CONV%} is supplied as a
+parameter and used to test equality of the candidate element {\small\verb%1%} with the
+actual elements of the given set.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #IN_CONV num_EQ_CONV "2 IN {0,SUC 1,3}";;
+ |- 2 IN {0,SUC 1,3} = T
+\end{verbatim}
+}
+\noindent The result is {\small\verb%T%} because {\small\verb%num_EQ_CONV%} is able to prove that {\small\verb%2%} is
+equal to {\small\verb%SUC 1%}. An example of a negative result is:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #IN_CONV num_EQ_CONV "1 IN {0,2,3}";;
+ |- 1 IN {0,2,3} = F
+\end{verbatim}
+}
+\noindent Finally the behaviour of the supplied conversion is irrelevant when
+the value to be tested for membership is alpha-equivalent to an actual element:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #IN_CONV NO_CONV "1 IN {3,2,1}";;
+ |- 1 IN {3,2,1} = T
+\end{verbatim}
+}
+\noindent The conversion {\small\verb%NO_CONV%} always fails, but {\small\verb%IN_CONV%} is nontheless
+able in this case to prove the required result.
+
+\FAILURE
+{\small\verb%IN_CONV conv%} fails if applied to a term that is not of the form {\small\verb%"t IN
+{t1,...,tn}"%}. A call {\small\verb%IN_CONV conv "t IN {t1,...,tn}"%} fails unless the
+term {\small\verb%t%} is alpha-equivalent to some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
+{\small\verb%|- (t = ti) = T%} for some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
+{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}.
+
+\ENDDOC
+
\DOC{INSERT\_CONV}
\TYPE {\small\verb%INSERT_CONV : conv -> conv%}\egroup
@@ -290,84 +365,6 @@ DELETE_CONV.
\ENDDOC
-\DOC{IN\_CONV}
-
-\TYPE {\small\verb%IN_CONV : conv -> conv%}\egroup
-
-\SYNOPSIS
-Decision procedure for membership in finite sets.
-
-\DESCRIBE
-The function {\small\verb%IN_CONV%} is a parameterized conversion for proving or disproving
-membership assertions of the general form:
-{\par\samepage\setseps\small
-\begin{verbatim}
- "t IN {t1,...,tn}"
-\end{verbatim}
-}
-\noindent where {\small\verb%{t1,...,tn}%} is a set of type {\small\verb%ty->bool%} and {\small\verb%t%} is a value
-of the base type {\small\verb%ty%}. The first argument to {\small\verb%IN_CONV%} is expected to be a
-conversion that decides equality between values of the base type {\small\verb%ty%}. Given
-an equation {\small\verb%"e1 = e2"%}, where {\small\verb%e1%} and {\small\verb%e2%} are terms of type {\small\verb%ty%}, this
-conversion should return the theorem {\small\verb%|- (e1 = e2) = T%} or the theorem
-{\small\verb%|- (e1 = e2) = F%}, as appropriate.
-
-Given such a conversion, the function {\small\verb%IN_CONV%} returns a conversion that
-maps a term of the form {\small\verb%"t IN {t1,...,tn}"%} to the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- t IN {t1,...,tn} = T
-\end{verbatim}
-}
-
-\noindent if {\small\verb%t%} is alpha-equivalent to any {\small\verb%ti%}, or if the supplied conversion
-proves {\small\verb%|- (t = ti) = T%} for any {\small\verb%ti%}. If the supplied conversion proves
-{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}, then the result is the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- t IN {t1,...,tn} = F
-\end{verbatim}
-}
-\noindent In all other cases, {\small\verb%IN_CONV%} will fail.
-
-\EXAMPLE
-In the following example, the conversion {\small\verb%num_EQ_CONV%} is supplied as a
-parameter and used to test equality of the candidate element {\small\verb%1%} with the
-actual elements of the given set.
-{\par\samepage\setseps\small
-\begin{verbatim}
- #IN_CONV num_EQ_CONV "2 IN {0,SUC 1,3}";;
- |- 2 IN {0,SUC 1,3} = T
-\end{verbatim}
-}
-\noindent The result is {\small\verb%T%} because {\small\verb%num_EQ_CONV%} is able to prove that {\small\verb%2%} is
-equal to {\small\verb%SUC 1%}. An example of a negative result is:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #IN_CONV num_EQ_CONV "1 IN {0,2,3}";;
- |- 1 IN {0,2,3} = F
-\end{verbatim}
-}
-\noindent Finally the behaviour of the supplied conversion is irrelevant when
-the value to be tested for membership is alpha-equivalent to an actual element:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #IN_CONV NO_CONV "1 IN {3,2,1}";;
- |- 1 IN {3,2,1} = T
-\end{verbatim}
-}
-\noindent The conversion {\small\verb%NO_CONV%} always fails, but {\small\verb%IN_CONV%} is nontheless
-able in this case to prove the required result.
-
-\FAILURE
-{\small\verb%IN_CONV conv%} fails if applied to a term that is not of the form {\small\verb%"t IN
-{t1,...,tn}"%}. A call {\small\verb%IN_CONV conv "t IN {t1,...,tn}"%} fails unless the
-term {\small\verb%t%} is alpha-equivalent to some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
-{\small\verb%|- (t = ti) = T%} for some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
-{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}.
-
-\ENDDOC
-
\DOC{SET\_INDUCT\_TAC}
\TYPE {\small\verb%SET_INDUCT_TAC : tactic%}\egroup
--- hol88-2.02.19940316.orig/Library/reals/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/reals/Manual/theorems.tex
@@ -1,18 +1,15 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\section{HRAT}
-\THEOREM hrat\_1 HRAT
+\chapter{Pre-proved Theorems}\input{theorems-intro}\section{HRAT}\THEOREM hrat\_1 HRAT
|- hrat_1 = mk_hrat($trat_eq trat_1)
\ENDTHEOREM
+\THEOREM HRAT\_ADD\_ASSOC HRAT
+|- !h i j. h hrat_add (i hrat_add j) = (h hrat_add i) hrat_add j
+\ENDTHEOREM
\THEOREM hrat\_add HRAT
|- !g00014 g00015.
g00014 hrat_add g00015 =
mk_hrat
($trat_eq(($@(dest_hrat g00014)) trat_add ($@(dest_hrat g00015))))
\ENDTHEOREM
-\THEOREM HRAT\_ADD\_ASSOC HRAT
-|- !h i j. h hrat_add (i hrat_add j) = (h hrat_add i) hrat_add j
-\ENDTHEOREM
\THEOREM HRAT\_ADD\_SYM HRAT
|- !h i. h hrat_add i = i hrat_add h
\ENDTHEOREM
@@ -30,15 +27,15 @@
|- !h i j.
h hrat_mul (i hrat_add j) = (h hrat_mul i) hrat_add (h hrat_mul j)
\ENDTHEOREM
+\THEOREM HRAT\_MUL\_ASSOC HRAT
+|- !h i j. h hrat_mul (i hrat_mul j) = (h hrat_mul i) hrat_mul j
+\ENDTHEOREM
\THEOREM hrat\_mul HRAT
|- !g00016 g00017.
g00016 hrat_mul g00017 =
mk_hrat
($trat_eq(($@(dest_hrat g00016)) trat_mul ($@(dest_hrat g00017))))
\ENDTHEOREM
-\THEOREM HRAT\_MUL\_ASSOC HRAT
-|- !h i j. h hrat_mul (i hrat_mul j) = (h hrat_mul i) hrat_mul j
-\ENDTHEOREM
\THEOREM HRAT\_MUL\_LID HRAT
|- !h. hrat_1 hrat_mul h = h
\ENDTHEOREM
@@ -51,13 +48,13 @@
\THEOREM HRAT\_NOZERO HRAT
|- !h i. ~(h hrat_add i = h)
\ENDTHEOREM
+\THEOREM hrat\_sucint HRAT
+|- !g00018. hrat_sucint g00018 = mk_hrat($trat_eq(trat_sucint g00018))
+\ENDTHEOREM
\THEOREM HRAT\_SUCINT HRAT
|- (hrat_sucint 0 = hrat_1) /\
(!n. hrat_sucint(SUC n) = (hrat_sucint n) hrat_add hrat_1)
\ENDTHEOREM
-\THEOREM hrat\_sucint HRAT
-|- !g00018. hrat_sucint g00018 = mk_hrat($trat_eq(trat_sucint g00018))
-\ENDTHEOREM
\THEOREM hrat\_tybij HRAT
|- (!a. mk_hrat(dest_hrat a) = a) /\
(!r. (\c. ?x. c = $trat_eq x)r = (dest_hrat(mk_hrat r) = r))
@@ -68,16 +65,16 @@
\THEOREM trat\_1 HRAT
|- trat_1 = 0,0
\ENDTHEOREM
+\THEOREM TRAT\_ADD\_ASSOC HRAT
+|- !h i j.
+ (h trat_add (i trat_add j)) trat_eq ((h trat_add i) trat_add j)
+\ENDTHEOREM
\THEOREM trat\_add HRAT
|- !x y x' y'.
(x,y) trat_add (x',y') =
PRE(((SUC x) * (SUC y')) + ((SUC x') * (SUC y))),
PRE((SUC y) * (SUC y'))
\ENDTHEOREM
-\THEOREM TRAT\_ADD\_ASSOC HRAT
-|- !h i j.
- (h trat_add (i trat_add j)) trat_eq ((h trat_add i) trat_add j)
-\ENDTHEOREM
\THEOREM TRAT\_ADD\_SYM HRAT
|- !h i. (h trat_add i) trat_eq (i trat_add h)
\ENDTHEOREM
@@ -90,24 +87,24 @@
(?d. h trat_eq (i trat_add d)) \/
(?d. i trat_eq (h trat_add d))
\ENDTHEOREM
-\THEOREM TRAT\_ADD\_WELLDEFINED HRAT
-|- !p q r. p trat_eq q ==> (p trat_add r) trat_eq (q trat_add r)
-\ENDTHEOREM
\THEOREM TRAT\_ADD\_WELLDEFINED2 HRAT
|- !p1 p2 q1 q2.
p1 trat_eq p2 /\ q1 trat_eq q2 ==>
(p1 trat_add q1) trat_eq (p2 trat_add q2)
\ENDTHEOREM
+\THEOREM TRAT\_ADD\_WELLDEFINED HRAT
+|- !p q r. p trat_eq q ==> (p trat_add r) trat_eq (q trat_add r)
+\ENDTHEOREM
\THEOREM TRAT\_ARCH HRAT
|- !h. ?n d. (trat_sucint n) trat_eq (h trat_add d)
\ENDTHEOREM
+\THEOREM TRAT\_EQ\_AP HRAT
+|- !p q. (p = q) ==> p trat_eq q
+\ENDTHEOREM
\THEOREM trat\_eq HRAT
|- !x y x' y'.
(x,y) trat_eq (x',y') = ((SUC x) * (SUC y') = (SUC x') * (SUC y))
\ENDTHEOREM
-\THEOREM TRAT\_EQ\_AP HRAT
-|- !p q. (p = q) ==> p trat_eq q
-\ENDTHEOREM
\THEOREM TRAT\_EQ\_EQUIV HRAT
|- !p q. p trat_eq q = ($trat_eq p = $trat_eq q)
\ENDTHEOREM
@@ -131,15 +128,15 @@
(h trat_mul (i trat_add j)) trat_eq
((h trat_mul i) trat_add (h trat_mul j))
\ENDTHEOREM
+\THEOREM TRAT\_MUL\_ASSOC HRAT
+|- !h i j.
+ (h trat_mul (i trat_mul j)) trat_eq ((h trat_mul i) trat_mul j)
+\ENDTHEOREM
\THEOREM trat\_mul HRAT
|- !x y x' y'.
(x,y) trat_mul (x',y') =
PRE((SUC x) * (SUC x')),PRE((SUC y) * (SUC y'))
\ENDTHEOREM
-\THEOREM TRAT\_MUL\_ASSOC HRAT
-|- !h i j.
- (h trat_mul (i trat_mul j)) trat_eq ((h trat_mul i) trat_mul j)
-\ENDTHEOREM
\THEOREM TRAT\_MUL\_LID HRAT
|- !h. (trat_1 trat_mul h) trat_eq h
\ENDTHEOREM
@@ -152,30 +149,29 @@
\THEOREM TRAT\_MUL\_SYM\_EQ HRAT
|- !h i. h trat_mul i = i trat_mul h
\ENDTHEOREM
-\THEOREM TRAT\_MUL\_WELLDEFINED HRAT
-|- !p q r. p trat_eq q ==> (p trat_mul r) trat_eq (q trat_mul r)
-\ENDTHEOREM
\THEOREM TRAT\_MUL\_WELLDEFINED2 HRAT
|- !p1 p2 q1 q2.
p1 trat_eq p2 /\ q1 trat_eq q2 ==>
(p1 trat_mul q1) trat_eq (p2 trat_mul q2)
\ENDTHEOREM
+\THEOREM TRAT\_MUL\_WELLDEFINED HRAT
+|- !p q r. p trat_eq q ==> (p trat_mul r) trat_eq (q trat_mul r)
+\ENDTHEOREM
\THEOREM TRAT\_NOZERO HRAT
|- !h i. ~(h trat_add i) trat_eq h
\ENDTHEOREM
-\THEOREM TRAT\_SUCINT HRAT
-|- (trat_sucint 0) trat_eq trat_1 /\
- (!n. (trat_sucint(SUC n)) trat_eq ((trat_sucint n) trat_add trat_1))
+\THEOREM TRAT\_SUCINT\_0 HRAT
+|- !n. (trat_sucint n) trat_eq (n,0)
\ENDTHEOREM
\THEOREM trat\_sucint HRAT
|- (trat_sucint 0 = trat_1) /\
(!n. trat_sucint(SUC n) = (trat_sucint n) trat_add trat_1)
\ENDTHEOREM
-\THEOREM TRAT\_SUCINT\_0 HRAT
-|- !n. (trat_sucint n) trat_eq (n,0)
+\THEOREM TRAT\_SUCINT HRAT
+|- (trat_sucint 0) trat_eq trat_1 /\
+ (!n. (trat_sucint(SUC n)) trat_eq ((trat_sucint n) trat_add trat_1))
\ENDTHEOREM
-\section{HREAL}
-\THEOREM CUT\_BOUNDED HREAL
+\section{HREAL}\THEOREM CUT\_BOUNDED HREAL
|- !X. ?x. ~cut X x
\ENDTHEOREM
\THEOREM CUT\_DOWN HREAL
@@ -208,12 +204,12 @@
\THEOREM EQUAL\_CUTS HREAL
|- !X Y. (cut X = cut Y) ==> (X = Y)
\ENDTHEOREM
-\THEOREM HRAT\_DOWN HREAL
-|- !x. ?y. y hrat_lt x
-\ENDTHEOREM
\THEOREM HRAT\_DOWN2 HREAL
|- !x y. ?z. z hrat_lt x /\ z hrat_lt y
\ENDTHEOREM
+\THEOREM HRAT\_DOWN HREAL
+|- !x. ?y. y hrat_lt x
+\ENDTHEOREM
\THEOREM HRAT\_EQ\_LADD HREAL
|- !x y z. (x hrat_add y = x hrat_add z) = (y = z)
\ENDTHEOREM
@@ -229,9 +225,6 @@
\THEOREM HRAT\_INV\_MUL HREAL
|- !x y. hrat_inv(x hrat_mul y) = (hrat_inv x) hrat_mul (hrat_inv y)
\ENDTHEOREM
-\THEOREM hrat\_lt HREAL
-|- !x y. x hrat_lt y = (?d. y = x hrat_add d)
-\ENDTHEOREM
\THEOREM HRAT\_LT\_ADD2 HREAL
|- !u v x y.
u hrat_lt x /\ v hrat_lt y ==> (u hrat_add v) hrat_lt (x hrat_add y)
@@ -245,6 +238,9 @@
\THEOREM HRAT\_LT\_ANTISYM HREAL
|- !x y. ~(x hrat_lt y /\ y hrat_lt x)
\ENDTHEOREM
+\THEOREM hrat\_lt HREAL
+|- !x y. x hrat_lt y = (?d. y = x hrat_add d)
+\ENDTHEOREM
\THEOREM HRAT\_LT\_GT HREAL
|- !x y. x hrat_lt y ==> ~y hrat_lt x
\ENDTHEOREM
@@ -254,12 +250,12 @@
\THEOREM HRAT\_LT\_LADD HREAL
|- !x y z. (z hrat_add x) hrat_lt (z hrat_add y) = x hrat_lt y
\ENDTHEOREM
-\THEOREM HRAT\_LT\_LMUL HREAL
-|- !x y z. (z hrat_mul x) hrat_lt (z hrat_mul y) = x hrat_lt y
-\ENDTHEOREM
\THEOREM HRAT\_LT\_LMUL1 HREAL
|- !x y. (x hrat_mul y) hrat_lt y = x hrat_lt hrat_1
\ENDTHEOREM
+\THEOREM HRAT\_LT\_LMUL HREAL
+|- !x y z. (z hrat_mul x) hrat_lt (z hrat_mul y) = x hrat_lt y
+\ENDTHEOREM
\THEOREM HRAT\_LT\_MUL2 HREAL
|- !u v x y.
u hrat_lt x /\ v hrat_lt y ==> (u hrat_mul v) hrat_lt (x hrat_mul y)
@@ -276,12 +272,12 @@
\THEOREM HRAT\_LT\_REFL HREAL
|- !x. ~x hrat_lt x
\ENDTHEOREM
-\THEOREM HRAT\_LT\_RMUL HREAL
-|- !x y z. (x hrat_mul z) hrat_lt (y hrat_mul z) = x hrat_lt y
-\ENDTHEOREM
\THEOREM HRAT\_LT\_RMUL1 HREAL
|- !x y. (x hrat_mul y) hrat_lt x = y hrat_lt hrat_1
\ENDTHEOREM
+\THEOREM HRAT\_LT\_RMUL HREAL
+|- !x y z. (x hrat_mul z) hrat_lt (y hrat_mul z) = x hrat_lt y
+\ENDTHEOREM
\THEOREM HRAT\_LT\_TOTAL HREAL
|- !x y. (x = y) \/ x hrat_lt y \/ y hrat_lt x
\ENDTHEOREM
@@ -307,14 +303,14 @@
\THEOREM hreal\_1 HREAL
|- hreal_1 = hreal(cut_of_hrat hrat_1)
\ENDTHEOREM
+\THEOREM HREAL\_ADD\_ASSOC HREAL
+|- !X Y Z. X hreal_add (Y hreal_add Z) = (X hreal_add Y) hreal_add Z
+\ENDTHEOREM
\THEOREM hreal\_add HREAL
|- !X Y.
X hreal_add Y =
hreal(\w. ?x y. (w = x hrat_add y) /\ cut X x /\ cut Y y)
\ENDTHEOREM
-\THEOREM HREAL\_ADD\_ASSOC HREAL
-|- !X Y Z. X hreal_add (Y hreal_add Z) = (X hreal_add Y) hreal_add Z
-\ENDTHEOREM
\THEOREM HREAL\_ADD\_ISACUT HREAL
|- !X Y. isacut(\w. ?x y. (w = x hrat_add y) /\ cut X x /\ cut Y y)
\ENDTHEOREM
@@ -342,26 +338,26 @@
X hreal_mul (Y hreal_add Z) =
(X hreal_mul Y) hreal_add (X hreal_mul Z)
\ENDTHEOREM
-\THEOREM HREAL\_LT HREAL
-|- !X Y. X hreal_lt Y = (?D. Y = X hreal_add D)
-\ENDTHEOREM
\THEOREM hreal\_lt HREAL
|- !X Y. X hreal_lt Y = ~(X = Y) /\ (!x. cut X x ==> cut Y x)
\ENDTHEOREM
+\THEOREM HREAL\_LT HREAL
+|- !X Y. X hreal_lt Y = (?D. Y = X hreal_add D)
+\ENDTHEOREM
\THEOREM HREAL\_LT\_LEMMA HREAL
|- !X Y. X hreal_lt Y ==> (?x. ~cut X x /\ cut Y x)
\ENDTHEOREM
\THEOREM HREAL\_LT\_TOTAL HREAL
|- !X Y. (X = Y) \/ X hreal_lt Y \/ Y hreal_lt X
\ENDTHEOREM
+\THEOREM HREAL\_MUL\_ASSOC HREAL
+|- !X Y Z. X hreal_mul (Y hreal_mul Z) = (X hreal_mul Y) hreal_mul Z
+\ENDTHEOREM
\THEOREM hreal\_mul HREAL
|- !X Y.
X hreal_mul Y =
hreal(\w. ?x y. (w = x hrat_mul y) /\ cut X x /\ cut Y y)
\ENDTHEOREM
-\THEOREM HREAL\_MUL\_ASSOC HREAL
-|- !X Y Z. X hreal_mul (Y hreal_mul Z) = (X hreal_mul Y) hreal_mul Z
-\ENDTHEOREM
\THEOREM HREAL\_MUL\_ISACUT HREAL
|- !X Y. isacut(\w. ?x y. (w = x hrat_mul y) /\ cut X x /\ cut Y y)
\ENDTHEOREM
@@ -377,24 +373,24 @@
\THEOREM HREAL\_NOZERO HREAL
|- !X Y. ~(X hreal_add Y = X)
\ENDTHEOREM
-\THEOREM hreal\_sub HREAL
-|- !Y X. Y hreal_sub X = hreal(\w. ?x. ~cut X x /\ cut Y(x hrat_add w))
-\ENDTHEOREM
\THEOREM HREAL\_SUB\_ADD HREAL
|- !X Y. X hreal_lt Y ==> ((Y hreal_sub X) hreal_add X = Y)
\ENDTHEOREM
+\THEOREM hreal\_sub HREAL
+|- !Y X. Y hreal_sub X = hreal(\w. ?x. ~cut X x /\ cut Y(x hrat_add w))
+\ENDTHEOREM
\THEOREM HREAL\_SUB\_ISACUT HREAL
|- !X Y.
X hreal_lt Y ==> isacut(\w. ?x. ~cut X x /\ cut Y(x hrat_add w))
\ENDTHEOREM
+\THEOREM hreal\_sup HREAL
+|- !P. hreal_sup P = hreal(\w. ?X. P X /\ cut X w)
+\ENDTHEOREM
\THEOREM HREAL\_SUP HREAL
|- !P.
(?X. P X) /\ (?Y. !X. P X ==> X hreal_lt Y) ==>
(!Y. (?X. P X /\ Y hreal_lt X) = Y hreal_lt (hreal_sup P))
\ENDTHEOREM
-\THEOREM hreal\_sup HREAL
-|- !P. hreal_sup P = hreal(\w. ?X. P X /\ cut X w)
-\ENDTHEOREM
\THEOREM HREAL\_SUP\_ISACUT HREAL
|- !P.
(?X. P X) /\ (?Y. !X. P X ==> X hreal_lt Y) ==>
@@ -417,8 +413,7 @@
\THEOREM ISACUT\_HRAT HREAL
|- !h. isacut(cut_of_hrat h)
\ENDTHEOREM
-\section{REALAX}
-\THEOREM HREAL\_EQ\_ADDL REALAX
+\section{REALAX}\THEOREM HREAL\_EQ\_ADDL REALAX
|- !x y. ~(x = x hreal_add y)
\ENDTHEOREM
\THEOREM HREAL\_EQ\_ADDR REALAX
@@ -470,15 +465,15 @@
\THEOREM REAL\_10 REALAX
|- ~(r1 = r0)
\ENDTHEOREM
+\THEOREM REAL\_ADD\_ASSOC REALAX
+|- !x y z. x + (y + z) = (x + y) + z
+\ENDTHEOREM
\THEOREM real\_add REALAX
|- !g00025 g00026.
g00025 + g00026 =
mk_real
($treal_eq(($@(dest_real g00025)) treal_add ($@(dest_real g00026))))
\ENDTHEOREM
-\THEOREM REAL\_ADD\_ASSOC REALAX
-|- !x y z. x + (y + z) = (x + y) + z
-\ENDTHEOREM
\THEOREM REAL\_ADD\_LID REALAX
|- !x. r0 + x = x
\ENDTHEOREM
@@ -518,15 +513,15 @@
\THEOREM REAL\_LT\_TRANS REALAX
|- !x y z. x < y /\ y < z ==> x < z
\ENDTHEOREM
+\THEOREM REAL\_MUL\_ASSOC REALAX
+|- !x y z. x * (y * z) = (x * y) * z
+\ENDTHEOREM
\THEOREM real\_mul REALAX
|- !g00027 g00028.
g00027 * g00028 =
mk_real
($treal_eq(($@(dest_real g00027)) treal_mul ($@(dest_real g00028))))
\ENDTHEOREM
-\THEOREM REAL\_MUL\_ASSOC REALAX
-|- !x y z. x * (y * z) = (x * y) * z
-\ENDTHEOREM
\THEOREM REAL\_MUL\_LID REALAX
|- !x. r1 * x = x
\ENDTHEOREM
@@ -578,19 +573,19 @@
\THEOREM treal\_0 REALAX
|- treal_0 = hreal_1,hreal_1
\ENDTHEOREM
+\THEOREM TREAL\_10 REALAX
+|- ~treal_1 treal_eq treal_0
+\ENDTHEOREM
\THEOREM treal\_1 REALAX
|- treal_1 = hreal_1 hreal_add hreal_1,hreal_1
\ENDTHEOREM
-\THEOREM TREAL\_10 REALAX
-|- ~treal_1 treal_eq treal_0
+\THEOREM TREAL\_ADD\_ASSOC REALAX
+|- !x y z. x treal_add (y treal_add z) = (x treal_add y) treal_add z
\ENDTHEOREM
\THEOREM treal\_add REALAX
|- !x1 y1 x2 y2.
(x1,y1) treal_add (x2,y2) = x1 hreal_add x2,y1 hreal_add y2
\ENDTHEOREM
-\THEOREM TREAL\_ADD\_ASSOC REALAX
-|- !x y z. x treal_add (y treal_add z) = (x treal_add y) treal_add z
-\ENDTHEOREM
\THEOREM TREAL\_ADD\_LID REALAX
|- !x. (treal_0 treal_add x) treal_eq x
\ENDTHEOREM
@@ -617,13 +612,13 @@
\THEOREM TREAL\_BIJ\_WELLDEF REALAX
|- !h i. h treal_eq i ==> (hreal_of_treal h = hreal_of_treal i)
\ENDTHEOREM
+\THEOREM TREAL\_EQ\_AP REALAX
+|- !p q. (p = q) ==> p treal_eq q
+\ENDTHEOREM
\THEOREM treal\_eq REALAX
|- !x1 y1 x2 y2.
(x1,y1) treal_eq (x2,y2) = (x1 hreal_add y2 = x2 hreal_add y1)
\ENDTHEOREM
-\THEOREM TREAL\_EQ\_AP REALAX
-|- !p q. (p = q) ==> p treal_eq q
-\ENDTHEOREM
\THEOREM TREAL\_EQ\_EQUIV REALAX
|- !p q. p treal_eq q = ($treal_eq p = $treal_eq q)
\ENDTHEOREM
@@ -656,14 +651,14 @@
x treal_mul (y treal_add z) =
(x treal_mul y) treal_add (x treal_mul z)
\ENDTHEOREM
+\THEOREM TREAL\_LT\_ADD REALAX
+|- !x y z. y treal_lt z ==> (x treal_add y) treal_lt (x treal_add z)
+\ENDTHEOREM
\THEOREM treal\_lt REALAX
|- !x1 y1 x2 y2.
(x1,y1) treal_lt (x2,y2) =
(x1 hreal_add y2) hreal_lt (x2 hreal_add y1)
\ENDTHEOREM
-\THEOREM TREAL\_LT\_ADD REALAX
-|- !x y z. y treal_lt z ==> (x treal_add y) treal_lt (x treal_add z)
-\ENDTHEOREM
\THEOREM TREAL\_LT\_MUL REALAX
|- !x y.
treal_0 treal_lt x /\ treal_0 treal_lt y ==>
@@ -689,15 +684,15 @@
\THEOREM TREAL\_LT\_WELLDEFR REALAX
|- !x1 x2 y. x1 treal_eq x2 ==> (x1 treal_lt y = x2 treal_lt y)
\ENDTHEOREM
+\THEOREM TREAL\_MUL\_ASSOC REALAX
+|- !x y z. x treal_mul (y treal_mul z) = (x treal_mul y) treal_mul z
+\ENDTHEOREM
\THEOREM treal\_mul REALAX
|- !x1 y1 x2 y2.
(x1,y1) treal_mul (x2,y2) =
(x1 hreal_mul x2) hreal_add (y1 hreal_mul y2),
(x1 hreal_mul y2) hreal_add (y1 hreal_mul x2)
\ENDTHEOREM
-\THEOREM TREAL\_MUL\_ASSOC REALAX
-|- !x y z. x treal_mul (y treal_mul z) = (x treal_mul y) treal_mul z
-\ENDTHEOREM
\THEOREM TREAL\_MUL\_LID REALAX
|- !x. (treal_1 treal_mul x) treal_eq x
\ENDTHEOREM
@@ -726,11 +721,7 @@
\THEOREM treal\_of\_hreal REALAX
|- !x. treal_of_hreal x = x hreal_add hreal_1,hreal_1
\ENDTHEOREM
-\section{REAL}
-\THEOREM abs REAL
-|- !x. abs x = ((& 0) <= x => x | -- x)
-\ENDTHEOREM
-\THEOREM REAL\_ABS\_0 REAL
+\section{REAL}\THEOREM REAL\_ABS\_0 REAL
|- abs(& 0) = & 0
\ENDTHEOREM
\THEOREM REAL\_ABS\_1 REAL
@@ -739,9 +730,6 @@
\THEOREM REAL\_ABS\_ABS REAL
|- !x. abs(abs x) = abs x
\ENDTHEOREM
-\THEOREM REAL\_ABS\_BETWEEN REAL
-|- !x y d. (& 0) < d /\ (x - d) < y /\ y < (x + d) = (abs(y - x)) < d
-\ENDTHEOREM
\THEOREM REAL\_ABS\_BETWEEN1 REAL
|- !x y z. x < z /\ (abs(y - x)) < (z - x) ==> y < z
\ENDTHEOREM
@@ -752,6 +740,9 @@
(abs(y - y0)) < ((y0 - x0) / (& 2)) ==>
x < y
\ENDTHEOREM
+\THEOREM REAL\_ABS\_BETWEEN REAL
+|- !x y d. (& 0) < d /\ (x - d) < y /\ y < (x + d) = (abs(y - x)) < d
+\ENDTHEOREM
\THEOREM REAL\_ABS\_BOUND REAL
|- !x y d. (abs(x - y)) < d ==> y < (x + d)
\ENDTHEOREM
@@ -767,6 +758,9 @@
\THEOREM REAL\_ABS\_DIV REAL
|- !y. ~(y = & 0) ==> (!x. abs(x / y) = (abs x) / (abs y))
\ENDTHEOREM
+\THEOREM abs REAL
+|- !x. abs x = ((& 0) <= x => x | -- x)
+\ENDTHEOREM
\THEOREM REAL\_ABS\_INV REAL
|- !x. ~(x = & 0) ==> (abs(inv x) = inv(abs x))
\ENDTHEOREM
@@ -797,21 +791,21 @@
\THEOREM REAL\_ABS\_REFL REAL
|- !x. (abs x = x) = (& 0) <= x
\ENDTHEOREM
-\THEOREM REAL\_ABS\_SIGN REAL
-|- !x y. (abs(x - y)) < y ==> (& 0) < x
-\ENDTHEOREM
\THEOREM REAL\_ABS\_SIGN2 REAL
|- !x y. (abs(x - y)) < (-- y) ==> x < (& 0)
\ENDTHEOREM
+\THEOREM REAL\_ABS\_SIGN REAL
+|- !x y. (abs(x - y)) < y ==> (& 0) < x
+\ENDTHEOREM
\THEOREM REAL\_ABS\_STILLNZ REAL
|- !x y. (abs(x - y)) < (abs y) ==> ~(x = & 0)
\ENDTHEOREM
-\THEOREM REAL\_ABS\_SUB REAL
-|- !x y. abs(x - y) = abs(y - x)
-\ENDTHEOREM
\THEOREM REAL\_ABS\_SUB\_ABS REAL
|- !x y. (abs((abs x) - (abs y))) <= (abs(x - y))
\ENDTHEOREM
+\THEOREM REAL\_ABS\_SUB REAL
+|- !x y. abs(x - y) = abs(y - x)
+\ENDTHEOREM
\THEOREM ABS\_SUM REAL
|- !f m n. (abs(Sum(m,n)f)) <= (Sum(m,n)(\n'. abs(f n')))
\ENDTHEOREM
@@ -821,9 +815,6 @@
\THEOREM REAL\_ABS\_ZERO REAL
|- !x. (abs x = & 0) = (x = & 0)
\ENDTHEOREM
-\THEOREM pow REAL
-|- (!x. x pow 0 = & 1) /\ (!x n. x pow (SUC n) = x * (x pow n))
-\ENDTHEOREM
\THEOREM POW\_0 REAL
|- !n. (& 0) pow (SUC n) = & 0
\ENDTHEOREM
@@ -845,6 +836,9 @@
\THEOREM POW\_ADD REAL
|- !c m n. c pow (m num_add n) = (c pow m) * (c pow n)
\ENDTHEOREM
+\THEOREM pow REAL
+|- (!x. x pow 0 = & 1) /\ (!x n. x pow (SUC n) = x * (x pow n))
+\ENDTHEOREM
\THEOREM POW\_INV REAL
|- !c. ~(c = & 0) ==> (!n. inv(c pow n) = (inv c) pow n)
\ENDTHEOREM
@@ -872,20 +866,14 @@
\THEOREM POW\_POS\_LT REAL
|- !x n. (& 0) < x ==> (& 0) < (x pow (SUC n))
\ENDTHEOREM
-\THEOREM REAL REAL
-|- !n. &(SUC n) = (& n) + (& 1)
-\ENDTHEOREM
\THEOREM REAL\_0 REAL
|- r0 = & 0
\ENDTHEOREM
-\THEOREM REAL\_1 REAL
-|- r1 = & 1
-\ENDTHEOREM
\THEOREM REAL\_10 REAL
|- ~(& 1 = & 0)
\ENDTHEOREM
-\THEOREM REAL\_ADD REAL
-|- !m n. (& m) + (& n) = &(m num_add n)
+\THEOREM REAL\_1 REAL
+|- r1 = & 1
\ENDTHEOREM
\THEOREM REAL\_ADD2\_SUB2 REAL
|- !a b c d. (a + b) - (c + d) = (a - c) + (b - d)
@@ -893,6 +881,9 @@
\THEOREM REAL\_ADD\_ASSOC REAL
|- !x y z. x + (y + z) = (x + y) + z
\ENDTHEOREM
+\THEOREM REAL\_ADD REAL
+|- !m n. (& m) + (& n) = &(m num_add n)
+\ENDTHEOREM
\THEOREM REAL\_ADD\_LID REAL
|- !x. (& 0) + x = x
\ENDTHEOREM
@@ -911,12 +902,12 @@
\THEOREM REAL\_ADD\_RINV REAL
|- !x. x + (-- x) = & 0
\ENDTHEOREM
-\THEOREM REAL\_ADD\_SUB REAL
-|- !x y. (x + y) - x = y
-\ENDTHEOREM
\THEOREM REAL\_ADD\_SUB2 REAL
|- !x y. x - (x + y) = -- y
\ENDTHEOREM
+\THEOREM REAL\_ADD\_SUB REAL
+|- !x y. (x + y) - x = y
+\ENDTHEOREM
\THEOREM REAL\_ADD\_SYM REAL
|- !x y. x + y = y + x
\ENDTHEOREM
@@ -949,15 +940,18 @@
\THEOREM REAL\_DIV\_RMUL REAL
|- !x y. ~(y = & 0) ==> ((x / y) * y = x)
\ENDTHEOREM
+\THEOREM REAL REAL
+|- !n. &(SUC n) = (& n) + (& 1)
+\ENDTHEOREM
\THEOREM REAL\_DOUBLE REAL
|- !x. x + x = (& 2) * x
\ENDTHEOREM
-\THEOREM REAL\_DOWN REAL
-|- !x. (& 0) < x ==> (?y. (& 0) < y /\ y < x)
-\ENDTHEOREM
\THEOREM REAL\_DOWN2 REAL
|- !x y. (& 0) < x /\ (& 0) < y ==> (?z. (& 0) < z /\ z < x /\ z < y)
\ENDTHEOREM
+\THEOREM REAL\_DOWN REAL
+|- !x. (& 0) < x ==> (?y. (& 0) < y /\ y < x)
+\ENDTHEOREM
\THEOREM REAL\_ENTIRE REAL
|- !x y. (x * y = & 0) = (x = & 0) \/ (y = & 0)
\ENDTHEOREM
@@ -967,12 +961,12 @@
\THEOREM REAL\_EQ\_LADD REAL
|- !x y z. (x + y = x + z) = (y = z)
\ENDTHEOREM
-\THEOREM REAL\_EQ\_LMUL REAL
-|- !x y z. (x * y = x * z) = (x = & 0) \/ (y = z)
-\ENDTHEOREM
\THEOREM REAL\_EQ\_LMUL2 REAL
|- !x y z. ~(x = & 0) ==> ((y = z) = (x * y = x * z))
\ENDTHEOREM
+\THEOREM REAL\_EQ\_LMUL REAL
+|- !x y z. (x * y = x * z) = (x = & 0) \/ (y = z)
+\ENDTHEOREM
\THEOREM REAL\_EQ\_LMUL\_IMP REAL
|- !x y z. ~(x = & 0) /\ (x * y = x * z) ==> (y = z)
\ENDTHEOREM
@@ -1012,12 +1006,12 @@
\THEOREM REAL\_INV1 REAL
|- inv(& 1) = & 1
\ENDTHEOREM
-\THEOREM REAL\_INVINV REAL
-|- !x. ~(x = & 0) ==> (inv(inv x) = x)
-\ENDTHEOREM
\THEOREM REAL\_INV\_1OVER REAL
|- !x. inv x = (& 1) / x
\ENDTHEOREM
+\THEOREM REAL\_INVINV REAL
+|- !x. ~(x = & 0) ==> (inv(inv x) = x)
+\ENDTHEOREM
\THEOREM REAL\_INV\_LT1 REAL
|- !x. (& 0) < x /\ x < (& 1) ==> (& 1) < (inv x)
\ENDTHEOREM
@@ -1033,39 +1027,18 @@
\THEOREM REAL\_LDISTRIB REAL
|- !x y z. x * (y + z) = (x * y) + (x * z)
\ENDTHEOREM
-\THEOREM REAL\_LE REAL
-|- !m n. (& m) <= (& n) = m num_le n
-\ENDTHEOREM
-\THEOREM real\_le REAL
-|- !x y. x <= y = ~y < x
+\THEOREM REAL\_LE\_01 REAL
+|- (& 0) <= (& 1)
\ENDTHEOREM
\THEOREM REAL\_LE1\_POW2 REAL
|- !x. (& 1) <= x ==> (& 1) <= (x pow 2)
\ENDTHEOREM
-\THEOREM REAL\_LET\_ADD REAL
-|- !x y. (& 0) <= x /\ (& 0) < y ==> (& 0) < (x + y)
-\ENDTHEOREM
-\THEOREM REAL\_LET\_ADD2 REAL
-|- !w x y z. w <= x /\ y < z ==> (w + y) < (x + z)
-\ENDTHEOREM
-\THEOREM REAL\_LET\_ANTISYM REAL
-|- !x y. ~(x < y /\ y <= x)
-\ENDTHEOREM
-\THEOREM REAL\_LET\_TOTAL REAL
-|- !x y. x <= y \/ y < x
-\ENDTHEOREM
-\THEOREM REAL\_LET\_TRANS REAL
-|- !x y z. x <= y /\ y < z ==> x < z
-\ENDTHEOREM
-\THEOREM REAL\_LE\_01 REAL
-|- (& 0) <= (& 1)
+\THEOREM REAL\_LE\_ADD2 REAL
+|- !w x y z. w <= x /\ y <= z ==> (w + y) <= (x + z)
\ENDTHEOREM
\THEOREM REAL\_LE\_ADD REAL
|- !x y. (& 0) <= x /\ (& 0) <= y ==> (& 0) <= (x + y)
\ENDTHEOREM
-\THEOREM REAL\_LE\_ADD2 REAL
-|- !w x y z. w <= x /\ y <= z ==> (w + y) <= (x + z)
-\ENDTHEOREM
\THEOREM REAL\_LE\_ADDL REAL
|- !x y. y <= (x + y) = (& 0) <= x
\ENDTHEOREM
@@ -1075,7 +1048,13 @@
\THEOREM REAL\_LE\_ANTISYM REAL
|- !x y. x <= y /\ y <= x = (x = y)
\ENDTHEOREM
-\THEOREM REAL\_LE\_DOUBLE REAL
+\THEOREM real\_le REAL
+|- !x y. x <= y = ~y < x
+\ENDTHEOREM
+\THEOREM REAL\_LE REAL
+|- !m n. (& m) <= (& n) = m num_le n
+\ENDTHEOREM
+\THEOREM REAL\_LE\_DOUBLE REAL
|- !x. (& 0) <= (x + x) = (& 0) <= x
\ENDTHEOREM
\THEOREM REAL\_LE\_LADD REAL
@@ -1093,14 +1072,14 @@
\THEOREM REAL\_LE\_LT REAL
|- !x y. x <= y = x < y \/ (x = y)
\ENDTHEOREM
-\THEOREM REAL\_LE\_MUL REAL
-|- !x y. (& 0) <= x /\ (& 0) <= y ==> (& 0) <= (x * y)
-\ENDTHEOREM
\THEOREM REAL\_LE\_MUL2 REAL
|- !x1 x2 y1 y2.
(& 0) <= x1 /\ (& 0) <= y1 /\ x1 <= x2 /\ y1 <= y2 ==>
(x1 * y1) <= (x2 * y2)
\ENDTHEOREM
+\THEOREM REAL\_LE\_MUL REAL
+|- !x y. (& 0) <= x /\ (& 0) <= y ==> (& 0) <= (x * y)
+\ENDTHEOREM
\THEOREM REAL\_LE\_NEG REAL
|- !x y. (-- x) <= (-- y) = y <= x
\ENDTHEOREM
@@ -1140,47 +1119,41 @@
\THEOREM REAL\_LE\_SUB\_RADD REAL
|- !x y z. (x - y) <= z = x <= (z + y)
\ENDTHEOREM
+\THEOREM REAL\_LET\_ADD2 REAL
+|- !w x y z. w <= x /\ y < z ==> (w + y) < (x + z)
+\ENDTHEOREM
+\THEOREM REAL\_LET\_ADD REAL
+|- !x y. (& 0) <= x /\ (& 0) < y ==> (& 0) < (x + y)
+\ENDTHEOREM
+\THEOREM REAL\_LET\_ANTISYM REAL
+|- !x y. ~(x < y /\ y <= x)
+\ENDTHEOREM
\THEOREM REAL\_LE\_TOTAL REAL
|- !x y. x <= y \/ y <= x
\ENDTHEOREM
\THEOREM REAL\_LE\_TRANS REAL
|- !x y z. x <= y /\ y <= z ==> x <= z
\ENDTHEOREM
+\THEOREM REAL\_LET\_TOTAL REAL
+|- !x y. x <= y \/ y < x
+\ENDTHEOREM
+\THEOREM REAL\_LET\_TRANS REAL
+|- !x y z. x <= y /\ y < z ==> x < z
+\ENDTHEOREM
\THEOREM REAL\_LINV\_UNIQ REAL
|- !x y. (x * y = & 1) ==> (x = inv y)
\ENDTHEOREM
\THEOREM REAL\_LNEG\_UNIQ REAL
|- !x y. (x + y = & 0) = (x = -- y)
\ENDTHEOREM
-\THEOREM REAL\_LT REAL
-|- !m n. (& m) < (& n) = m num_lt n
-\ENDTHEOREM
-\THEOREM REAL\_LT1\_POW2 REAL
-|- !x. (& 1) < x ==> (& 1) < (x pow 2)
-\ENDTHEOREM
-\THEOREM REAL\_LTE\_ADD REAL
-|- !x y. (& 0) < x /\ (& 0) <= y ==> (& 0) < (x + y)
-\ENDTHEOREM
-\THEOREM REAL\_LTE\_ADD2 REAL
-|- !w x y z. w < x /\ y <= z ==> (w + y) < (x + z)
-\ENDTHEOREM
-\THEOREM REAL\_LTE\_ANTSYM REAL
-|- !x y. ~(x <= y /\ y < x)
-\ENDTHEOREM
-\THEOREM REAL\_LTE\_TOTAL REAL
-|- !x y. x < y \/ y <= x
-\ENDTHEOREM
-\THEOREM REAL\_LTE\_TRANS REAL
-|- !x y z. x < y /\ y <= z ==> x < z
-\ENDTHEOREM
\THEOREM REAL\_LT\_01 REAL
|- (& 0) < (& 1)
\ENDTHEOREM
\THEOREM REAL\_LT\_1 REAL
|- !x y. (& 0) <= x /\ x < y ==> (x / y) < (& 1)
\ENDTHEOREM
-\THEOREM REAL\_LT\_ADD REAL
-|- !x y. (& 0) < x /\ (& 0) < y ==> (& 0) < (x + y)
+\THEOREM REAL\_LT1\_POW2 REAL
+|- !x. (& 1) < x ==> (& 1) < (x pow 2)
\ENDTHEOREM
\THEOREM REAL\_LT\_ADD1 REAL
|- !x y. x <= y ==> x < (y + (& 1))
@@ -1188,15 +1161,18 @@
\THEOREM REAL\_LT\_ADD2 REAL
|- !w x y z. w < x /\ y < z ==> (w + y) < (x + z)
\ENDTHEOREM
+\THEOREM REAL\_LT\_ADD REAL
+|- !x y. (& 0) < x /\ (& 0) < y ==> (& 0) < (x + y)
+\ENDTHEOREM
\THEOREM REAL\_LT\_ADDL REAL
|- !x y. y < (x + y) = (& 0) < x
\ENDTHEOREM
-\THEOREM REAL\_LT\_ADDNEG REAL
-|- !x y z. y < (x + (-- z)) = (y + z) < x
-\ENDTHEOREM
\THEOREM REAL\_LT\_ADDNEG2 REAL
|- !x y z. (x + (-- y)) < z = x < (z + y)
\ENDTHEOREM
+\THEOREM REAL\_LT\_ADDNEG REAL
+|- !x y z. y < (x + (-- z)) = (y + z) < x
+\ENDTHEOREM
\THEOREM REAL\_LT\_ADDR REAL
|- !x y. x < (x + y) = (& 0) < y
\ENDTHEOREM
@@ -1206,12 +1182,30 @@
\THEOREM REAL\_LT\_ANTISYM REAL
|- !x y. ~(x < y /\ y < x)
\ENDTHEOREM
-\THEOREM REAL\_LT\_FRACTION REAL
-|- !n d. 1 num_lt n ==> ((d / (& n)) < d = (& 0) < d)
+\THEOREM REAL\_LT REAL
+|- !m n. (& m) < (& n) = m num_lt n
+\ENDTHEOREM
+\THEOREM REAL\_LTE\_ADD2 REAL
+|- !w x y z. w < x /\ y <= z ==> (w + y) < (x + z)
+\ENDTHEOREM
+\THEOREM REAL\_LTE\_ADD REAL
+|- !x y. (& 0) < x /\ (& 0) <= y ==> (& 0) < (x + y)
+\ENDTHEOREM
+\THEOREM REAL\_LTE\_ANTSYM REAL
+|- !x y. ~(x <= y /\ y < x)
+\ENDTHEOREM
+\THEOREM REAL\_LTE\_TOTAL REAL
+|- !x y. x < y \/ y <= x
+\ENDTHEOREM
+\THEOREM REAL\_LTE\_TRANS REAL
+|- !x y z. x < y /\ y <= z ==> x < z
\ENDTHEOREM
\THEOREM REAL\_LT\_FRACTION\_0 REAL
|- !n d. ~(n = 0) ==> ((& 0) < (d / (& n)) = (& 0) < d)
\ENDTHEOREM
+\THEOREM REAL\_LT\_FRACTION REAL
+|- !n d. 1 num_lt n ==> ((d / (& n)) < d = (& 0) < d)
+\ENDTHEOREM
\THEOREM REAL\_LT\_GT REAL
|- !x y. x < y ==> ~y < x
\ENDTHEOREM
@@ -1239,23 +1233,23 @@
\THEOREM REAL\_LT\_LE REAL
|- !x y. x < y = x <= y /\ ~(x = y)
\ENDTHEOREM
-\THEOREM REAL\_LT\_LMUL REAL
-|- !x y z. (& 0) < x ==> ((x * y) < (x * z) = y < z)
-\ENDTHEOREM
\THEOREM REAL\_LT\_LMUL\_0 REAL
|- !x y. (& 0) < x ==> ((& 0) < (x * y) = (& 0) < y)
\ENDTHEOREM
+\THEOREM REAL\_LT\_LMUL REAL
+|- !x y z. (& 0) < x ==> ((x * y) < (x * z) = y < z)
+\ENDTHEOREM
\THEOREM REAL\_LT\_LMUL\_IMP REAL
|- !x y z. y < z /\ (& 0) < x ==> (x * y) < (x * z)
\ENDTHEOREM
-\THEOREM REAL\_LT\_MUL REAL
-|- !x y. (& 0) < x /\ (& 0) < y ==> (& 0) < (x * y)
-\ENDTHEOREM
\THEOREM REAL\_LT\_MUL2 REAL
|- !x1 x2 y1 y2.
(& 0) <= x1 /\ (& 0) <= y1 /\ x1 < x2 /\ y1 < y2 ==>
(x1 * y1) < (x2 * y2)
\ENDTHEOREM
+\THEOREM REAL\_LT\_MUL REAL
+|- !x y. (& 0) < x /\ (& 0) < y ==> (& 0) < (x * y)
+\ENDTHEOREM
\THEOREM REAL\_LT\_MULTIPLE REAL
|- !n d. 1 num_lt n ==> (d < ((& n) * d) = (& 0) < d)
\ENDTHEOREM
@@ -1271,21 +1265,21 @@
\THEOREM REAL\_LT\_RADD REAL
|- !x y z. (x + z) < (y + z) = x < y
\ENDTHEOREM
-\THEOREM REAL\_LT\_RDIV REAL
-|- !x y z. (& 0) < z ==> ((x / z) < (y / z) = x < y)
-\ENDTHEOREM
\THEOREM REAL\_LT\_RDIV\_0 REAL
|- !y z. (& 0) < z ==> ((& 0) < (y / z) = (& 0) < y)
\ENDTHEOREM
+\THEOREM REAL\_LT\_RDIV REAL
+|- !x y z. (& 0) < z ==> ((x / z) < (y / z) = x < y)
+\ENDTHEOREM
\THEOREM REAL\_LT\_REFL REAL
|- !x. ~x < x
\ENDTHEOREM
-\THEOREM REAL\_LT\_RMUL REAL
-|- !x y z. (& 0) < z ==> ((x * z) < (y * z) = x < y)
-\ENDTHEOREM
\THEOREM REAL\_LT\_RMUL\_0 REAL
|- !x y. (& 0) < y ==> ((& 0) < (x * y) = (& 0) < x)
\ENDTHEOREM
+\THEOREM REAL\_LT\_RMUL REAL
+|- !x y z. (& 0) < z ==> ((x * z) < (y * z) = x < y)
+\ENDTHEOREM
\THEOREM REAL\_LT\_RMUL\_IMP REAL
|- !x y z. x < y /\ (& 0) < z ==> (x * z) < (y * z)
\ENDTHEOREM
@@ -1304,12 +1298,12 @@
\THEOREM REAL\_MEAN REAL
|- !x y. x < y ==> (?z. x < z /\ z < y)
\ENDTHEOREM
-\THEOREM REAL\_MUL REAL
-|- !m n. (& m) * (& n) = &(m num_mul n)
-\ENDTHEOREM
\THEOREM REAL\_MUL\_ASSOC REAL
|- !x y z. x * (y * z) = (x * y) * z
\ENDTHEOREM
+\THEOREM REAL\_MUL REAL
+|- !m n. (& m) * (& n) = &(m num_mul n)
+\ENDTHEOREM
\THEOREM REAL\_MUL\_LID REAL
|- !x. (& 1) * x = x
\ENDTHEOREM
@@ -1331,21 +1325,18 @@
\THEOREM REAL\_MUL\_SYM REAL
|- !x y. x * y = y * x
\ENDTHEOREM
-\THEOREM REAL\_NEGNEG REAL
-|- !x. --(-- x) = x
-\ENDTHEOREM
\THEOREM REAL\_NEG\_0 REAL
|- --(& 0) = & 0
\ENDTHEOREM
\THEOREM REAL\_NEG\_ADD REAL
|- !x y. --(x + y) = (-- x) + (-- y)
\ENDTHEOREM
-\THEOREM REAL\_NEG\_EQ REAL
-|- !x y. (-- x = y) = (x = -- y)
-\ENDTHEOREM
\THEOREM REAL\_NEG\_EQ0 REAL
|- !x. (-- x = & 0) = (x = & 0)
\ENDTHEOREM
+\THEOREM REAL\_NEG\_EQ REAL
+|- !x y. (-- x = y) = (x = -- y)
+\ENDTHEOREM
\THEOREM REAL\_NEG\_GE0 REAL
|- !x. (& 0) <= (-- x) = x <= (& 0)
\ENDTHEOREM
@@ -1370,6 +1361,9 @@
\THEOREM REAL\_NEG\_MUL2 REAL
|- !x y. (-- x) * (-- y) = x * y
\ENDTHEOREM
+\THEOREM REAL\_NEGNEG REAL
+|- !x. --(-- x) = x
+\ENDTHEOREM
\THEOREM REAL\_NEG\_RMUL REAL
|- !x y. --(x * y) = x * (-- y)
\ENDTHEOREM
@@ -1412,20 +1406,20 @@
\THEOREM REAL\_RNEG\_UNIQ REAL
|- !x y. (x + y = & 0) = (y = -- x)
\ENDTHEOREM
-\THEOREM real\_sub REAL
-|- !x y. x - y = x + (-- y)
-\ENDTHEOREM
\THEOREM REAL\_SUB\_0 REAL
|- !x y. (x - y = & 0) = (x = y)
\ENDTHEOREM
\THEOREM REAL\_SUB\_ABS REAL
|- !x y. ((abs x) - (abs y)) <= (abs(x - y))
\ENDTHEOREM
+\THEOREM REAL\_SUB\_ADD2 REAL
+|- !x y. y + (x - y) = x
+\ENDTHEOREM
\THEOREM REAL\_SUB\_ADD REAL
|- !x y. (x - y) + y = x
\ENDTHEOREM
-\THEOREM REAL\_SUB\_ADD2 REAL
-|- !x y. y + (x - y) = x
+\THEOREM real\_sub REAL
+|- !x y. x - y = x + (-- y)
\ENDTHEOREM
\THEOREM REAL\_SUB\_INV2 REAL
|- !x y.
@@ -1461,28 +1455,28 @@
\THEOREM REAL\_SUB\_RZERO REAL
|- !x. x - (& 0) = x
\ENDTHEOREM
-\THEOREM REAL\_SUB\_SUB REAL
-|- !x y. (x - y) - x = -- y
-\ENDTHEOREM
\THEOREM REAL\_SUB\_SUB2 REAL
|- !x y. x - (x - y) = y
\ENDTHEOREM
+\THEOREM REAL\_SUB\_SUB REAL
+|- !x y. (x - y) - x = -- y
+\ENDTHEOREM
\THEOREM REAL\_SUB\_TRIANGLE REAL
|- !a b c. (a - b) + (b - c) = a - c
\ENDTHEOREM
\THEOREM REAL\_SUMSQ REAL
|- !x y. ((x * x) + (y * y) = & 0) = (x = & 0) /\ (y = & 0)
\ENDTHEOREM
-\THEOREM REAL\_SUP REAL
-|- !P.
- (?x. P x) /\ (?z. !x. P x ==> x < z) ==>
- (!y. (?x. P x /\ y < x) = y < (sup P))
-\ENDTHEOREM
\THEOREM REAL\_SUP\_ALLPOS REAL
|- !P.
(!x. P x ==> (& 0) < x) /\ (?x. P x) /\ (?z. !x. P x ==> x < z) ==>
(?s. !y. (?x. P x /\ y < x) = y < s)
\ENDTHEOREM
+\THEOREM REAL\_SUP REAL
+|- !P.
+ (?x. P x) /\ (?z. !x. P x ==> x < z) ==>
+ (!y. (?x. P x /\ y < x) = y < (sup P))
+\ENDTHEOREM
\THEOREM REAL\_SUP\_EXISTS REAL
|- !P.
(?x. P x) /\ (?z. !x. P x ==> x < z) ==>
@@ -1511,13 +1505,6 @@
(?x. P x) /\ (?z. !x. P x ==> x <= z) =
(?x. P x) /\ (?z. !x. P x ==> x < z)
\ENDTHEOREM
-\THEOREM Sum REAL
-|- (Sum(n,0)f = & 0) /\ (Sum(n,SUC m)f = (Sum(n,m)f) + (f(n num_add m)))
-\ENDTHEOREM
-\THEOREM sum REAL
-|- (!n f. sum n 0 f = & 0) /\
- (!n m f. sum n(SUC m)f = (sum n m f) + (f(n num_add m)))
-\ENDTHEOREM
\THEOREM SUM\_0 REAL
|- !m n. Sum(m,n)(\r. & 0) = & 0
\ENDTHEOREM
@@ -1550,6 +1537,13 @@
\THEOREM SUM\_DIFF REAL
|- !f m n. Sum(m,n)f = (Sum(0,m num_add n)f) - (Sum(0,m)f)
\ENDTHEOREM
+\THEOREM sum REAL
+|- (!n f. sum n 0 f = & 0) /\
+ (!n m f. sum n(SUC m)f = (sum n m f) + (f(n num_add m)))
+\ENDTHEOREM
+\THEOREM Sum REAL
+|- (Sum(n,0)f = & 0) /\ (Sum(n,SUC m)f = (Sum(n,m)f) + (f(n num_add m)))
+\ENDTHEOREM
\THEOREM SUM\_EQ REAL
|- !N. (!n. N num_le n ==> (f n = g n)) ==> (!n. Sum(N,n)f = Sum(N,n)g)
\ENDTHEOREM
@@ -1615,8 +1609,7 @@
\THEOREM SUP\_LEMMA3 REAL
|- !d. (?z. !x. P x ==> x < z) ==> (?z. !x. (\x. P(x + d))x ==> x < z)
\ENDTHEOREM
-\section{TOPOLOGY}
-\THEOREM ball TOPOLOGY
+\section{TOPOLOGY}\THEOREM ball TOPOLOGY
|- !m x e. B m(x,e) = (\y. (dist m(x,y)) < e)
\ENDTHEOREM
\THEOREM BALL\_NEIGH TOPOLOGY
@@ -1689,9 +1682,6 @@
\THEOREM METRIC\_ZERO TOPOLOGY
|- !m x y. (dist m(x,y) = & 0) = (x = y)
\ENDTHEOREM
-\THEOREM mr1 TOPOLOGY
-|- mr1 = metric(\(x,y). abs(y - x))
-\ENDTHEOREM
\THEOREM MR1\_ADD TOPOLOGY
|- !x d. dist mr1(x,x + d) = abs d
\ENDTHEOREM
@@ -1707,6 +1697,9 @@
\THEOREM MR1\_DEF TOPOLOGY
|- !x y. dist mr1(x,y) = abs(y - x)
\ENDTHEOREM
+\THEOREM mr1 TOPOLOGY
+|- mr1 = metric(\(x,y). abs(y - x))
+\ENDTHEOREM
\THEOREM MR1\_LIMPT TOPOLOGY
|- !x. limpt(mtop mr1)x universe
\ENDTHEOREM
@@ -1759,12 +1752,12 @@
\THEOREM OPEN\_UNOPEN TOPOLOGY
|- !S top. open top S = (Union(\P. open top P /\ P subset S) = S)
\ENDTHEOREM
-\THEOREM subset TOPOLOGY
-|- !P Q. P subset Q = (!x. P x ==> Q x)
-\ENDTHEOREM
\THEOREM SUBSET\_ANTISYM TOPOLOGY
|- !P Q. P subset Q /\ Q subset P = (P = Q)
\ENDTHEOREM
+\THEOREM subset TOPOLOGY
+|- !P Q. P subset Q = (!x. P x ==> Q x)
+\ENDTHEOREM
\THEOREM SUBSET\_REFL TOPOLOGY
|- !S. S subset S
\ENDTHEOREM
@@ -1788,17 +1781,16 @@
\THEOREM TOPOLOGY\_UNION TOPOLOGY
|- !L P. P subset (open L) ==> open L(Union P)
\ENDTHEOREM
-\THEOREM Union TOPOLOGY
-|- !S. Union S = (\x. ?s. S s /\ s x)
-\ENDTHEOREM
\THEOREM union\_def TOPOLOGY
|- !P Q. P union Q = (\x. P x \/ Q x)
\ENDTHEOREM
+\THEOREM Union TOPOLOGY
+|- !S. Union S = (\x. ?s. S s /\ s x)
+\ENDTHEOREM
\THEOREM universe TOPOLOGY
|- universe = (\x. T)
\ENDTHEOREM
-\section{NETS}
-\THEOREM bounded NETS
+\section{NETS}\THEOREM bounded NETS
|- !m g f.
bounded(m,g)f =
(?k x N. g N N /\ (!n. g n N ==> (dist m(f n,x)) real_lt k))
@@ -1823,7 +1815,7 @@
\THEOREM DORDER\_TENDSTO NETS
|- !m x. dorder(tendsto(m,x))
\ENDTHEOREM
-\THEOREM LIM\_TENDS NETS
+\THEOREM LIM\_TENDS2 NETS
|- !m1 m2 f x0 y0.
limpt(mtop m1)x0 universe ==>
((f tends y0)(mtop m2,tendsto(m1,x0)) =
@@ -1833,10 +1825,10 @@
(real_of_num 0) real_lt d /\
(!x.
(real_of_num 0) real_lt (dist m1(x,x0)) /\
- (dist m1(x,x0)) real_le d ==>
+ (dist m1(x,x0)) real_lt d ==>
(dist m2(f x,y0)) real_lt e))))
\ENDTHEOREM
-\THEOREM LIM\_TENDS2 NETS
+\THEOREM LIM\_TENDS NETS
|- !m1 m2 f x0 y0.
limpt(mtop m1)x0 universe ==>
((f tends y0)(mtop m2,tendsto(m1,x0)) =
@@ -1846,7 +1838,7 @@
(real_of_num 0) real_lt d /\
(!x.
(real_of_num 0) real_lt (dist m1(x,x0)) /\
- (dist m1(x,x0)) real_lt d ==>
+ (dist m1(x,x0)) real_le d ==>
(dist m2(f x,y0)) real_lt e))))
\ENDTHEOREM
\THEOREM MR1\_BOUNDED NETS
@@ -1931,11 +1923,6 @@
(x tends x0)(mtop mr1,g) =
((\n. real_neg(x n)) tends (real_neg x0))(mtop mr1,g))
\ENDTHEOREM
-\THEOREM NET\_NULL NETS
-|- !g x x0.
- (x tends x0)(mtop mr1,g) =
- ((\n. (x n) real_sub x0) tends (real_of_num 0))(mtop mr1,g)
-\ENDTHEOREM
\THEOREM NET\_NULL\_ADD NETS
|- !g.
dorder g ==>
@@ -1949,6 +1936,11 @@
(x tends (real_of_num 0))(mtop mr1,g) ==>
((\n. k real_mul (x n)) tends (real_of_num 0))(mtop mr1,g)
\ENDTHEOREM
+\THEOREM NET\_NULL NETS
+|- !g x x0.
+ (x tends x0)(mtop mr1,g) =
+ ((\n. (x n) real_sub x0) tends (real_of_num 0))(mtop mr1,g)
+\ENDTHEOREM
\THEOREM NET\_NULL\_MUL NETS
|- !g.
dorder g ==>
@@ -1981,8 +1973,7 @@
(real_of_num 0) real_lt (dist m(x,y)) /\
(dist m(x,y)) real_le (dist m(x,z))
\ENDTHEOREM
-\section{LIM}
-\THEOREM CHAIN\_LEMMA1 LIM
+\section{LIM}\THEOREM CHAIN\_LEMMA1 LIM
|- !f g x h.
((f(g(x + h))) - (f(g x))) / h =
(((f(g(x + h))) - (f(g x))) / ((g(x + h)) - (g x))) *
@@ -1991,27 +1982,21 @@
\THEOREM CHAIN\_LEMMA2 LIM
|- !x y d. (abs(x - y)) < d ==> (abs x) < ((abs y) + d)
\ENDTHEOREM
-\THEOREM contl LIM
-|- !f x. f contl x = ((\h. f(x + h)) --> (f x))(& 0)
-\ENDTHEOREM
-\THEOREM CONTL\_LIM LIM
-|- !f x. f contl x = (f --> (f x))x
-\ENDTHEOREM
\THEOREM CONT\_ADD LIM
|- !x. f contl x /\ g contl x ==> (\x. (f x) + (g x)) contl x
\ENDTHEOREM
-\THEOREM CONT\_ATTAINS LIM
+\THEOREM CONT\_ATTAINS2 LIM
|- !f a b.
a <= b /\ (!x. a <= x /\ x <= b ==> f contl x) ==>
(?M.
- (!x. a <= x /\ x <= b ==> (f x) <= M) /\
+ (!x. a <= x /\ x <= b ==> M <= (f x)) /\
(?x. a <= x /\ x <= b /\ (f x = M)))
\ENDTHEOREM
-\THEOREM CONT\_ATTAINS2 LIM
+\THEOREM CONT\_ATTAINS LIM
|- !f a b.
a <= b /\ (!x. a <= x /\ x <= b ==> f contl x) ==>
(?M.
- (!x. a <= x /\ x <= b ==> M <= (f x)) /\
+ (!x. a <= x /\ x <= b ==> (f x) <= M) /\
(?x. a <= x /\ x <= b /\ (f x = M)))
\ENDTHEOREM
\THEOREM CONT\_BOUNDED LIM
@@ -2037,6 +2022,12 @@
\THEOREM CONT\_INV LIM
|- !x. f contl x /\ ~(f x = & 0) ==> (\x. inv(f x)) contl x
\ENDTHEOREM
+\THEOREM contl LIM
+|- !f x. f contl x = ((\h. f(x + h)) --> (f x))(& 0)
+\ENDTHEOREM
+\THEOREM CONTL\_LIM LIM
+|- !f x. f contl x = (f --> (f x))x
+\ENDTHEOREM
\THEOREM CONT\_MUL LIM
|- !x. f contl x /\ g contl x ==> (\x. (f x) * (g x)) contl x
\ENDTHEOREM
@@ -2046,12 +2037,6 @@
\THEOREM CONT\_SUB LIM
|- !x. f contl x /\ g contl x ==> (\x. (f x) - (g x)) contl x
\ENDTHEOREM
-\THEOREM differentiable LIM
-|- !f x. f differentiable x = (?l. (f diffl l)x)
-\ENDTHEOREM
-\THEOREM diffl LIM
-|- !f l x. (f diffl l)x = ((\h. ((f(x + h)) - (f x)) / h) --> l)(& 0)
-\ENDTHEOREM
\THEOREM DIFF\_ADD LIM
|- !f g l m x.
(f diffl l)x /\ (g diffl m)x ==>
@@ -2077,11 +2062,17 @@
(((l * (g x)) - (m * (f x))) / ((g x) pow 2)))
x
\ENDTHEOREM
+\THEOREM differentiable LIM
+|- !f x. f differentiable x = (?l. (f diffl l)x)
+\ENDTHEOREM
\THEOREM DIFF\_INV LIM
|- !f l x.
(f diffl l)x /\ ~(f x = & 0) ==>
((\x. inv(f x)) diffl (--(l / ((f x) pow 2))))x
\ENDTHEOREM
+\THEOREM DIFF\_ISCONST\_ALL LIM
+|- !f. (!x. (f diffl (& 0))x) ==> (!x y. f x = f y)
+\ENDTHEOREM
\THEOREM DIFF\_ISCONST LIM
|- !f a b.
a < b /\
@@ -2089,9 +2080,6 @@
(!x. a < x /\ x < b ==> (f diffl (& 0))x) ==>
(!x. a <= x /\ x <= b ==> (f x = f a))
\ENDTHEOREM
-\THEOREM DIFF\_ISCONST\_ALL LIM
-|- !f. (!x. (f diffl (& 0))x) ==> (!x y. f x = f y)
-\ENDTHEOREM
\THEOREM DIFF\_ISCONST\_END LIM
|- !f a b.
a < b /\
@@ -2110,6 +2098,9 @@
(f diffl l)x /\ l < (& 0) ==>
(?d. (& 0) < d /\ (!h. (& 0) < h /\ h < d ==> (f x) < (f(x - h))))
\ENDTHEOREM
+\THEOREM diffl LIM
+|- !f l x. (f diffl l)x = ((\h. ((f(x + h)) - (f x)) / h) --> l)(& 0)
+\ENDTHEOREM
\THEOREM DIFF\_LINC LIM
|- !f x l.
(f diffl l)x /\ (& 0) < l ==>
@@ -2164,27 +2155,20 @@
a < x /\ x < b ==>
(?d. (& 0) < d /\ (!y. (abs(x - y)) < d ==> a <= y /\ y <= b))
\ENDTHEOREM
-\THEOREM IVT LIM
+\THEOREM IVT2 LIM
|- !f a b y.
a <= b /\
- ((f a) <= y /\ y <= (f b)) /\
+ ((f b) <= y /\ y <= (f a)) /\
(!x. a <= x /\ x <= b ==> f contl x) ==>
(?x. a <= x /\ x <= b /\ (f x = y))
\ENDTHEOREM
-\THEOREM IVT2 LIM
+\THEOREM IVT LIM
|- !f a b y.
a <= b /\
- ((f b) <= y /\ y <= (f a)) /\
+ ((f a) <= y /\ y <= (f b)) /\
(!x. a <= x /\ x <= b ==> f contl x) ==>
(?x. a <= x /\ x <= b /\ (f x = y))
\ENDTHEOREM
-\THEOREM IVT\_SUPLEMMA LIM
-|- a <= b /\
- ((f a) <= y /\ y <= (f b)) /\
- (!x. a <= x /\ x <= b ==> f contl x) ==>
- (?x. (\x. a <= x /\ x <= b /\ (f x) <= y)x) /\
- (?z. !x. (\x. a <= x /\ x <= b /\ (f x) <= y)x ==> x <= z)
-\ENDTHEOREM
\THEOREM IVT\_SUPLEMMA2 LIM
|- a <= b /\
((f a) <= y /\ y <= (f b)) /\
@@ -2192,16 +2176,12 @@
a <= (sup(\x. a <= x /\ x <= b /\ (f x) <= y)) /\
(sup(\x. a <= x /\ x <= b /\ (f x) <= y)) <= b
\ENDTHEOREM
-\THEOREM LIM LIM
-|- !f y0 x0.
- (f --> y0)x0 =
- (!e.
- (& 0) < e ==>
- (?d.
- (& 0) < d /\
- (!x.
- (& 0) < (abs(x - x0)) /\ (abs(x - x0)) < d ==>
- (abs((f x) - y0)) < e)))
+\THEOREM IVT\_SUPLEMMA LIM
+|- a <= b /\
+ ((f a) <= y /\ y <= (f b)) /\
+ (!x. a <= x /\ x <= b ==> f contl x) ==>
+ (?x. (\x. a <= x /\ x <= b /\ (f x) <= y)x) /\
+ (?z. !x. (\x. a <= x /\ x <= b /\ (f x) <= y)x ==> x <= z)
\ENDTHEOREM
\THEOREM LIM\_ADD LIM
|- !f g l m.
@@ -2221,6 +2201,17 @@
(f --> l)x /\ (g --> m)x /\ ~(m = & 0) ==>
((\x. (f x) / (g x)) --> (l / m))x
\ENDTHEOREM
+\THEOREM LIM LIM
+|- !f y0 x0.
+ (f --> y0)x0 =
+ (!e.
+ (& 0) < e ==>
+ (?d.
+ (& 0) < d /\
+ (!x.
+ (& 0) < (abs(x - x0)) /\ (abs(x - x0)) < d ==>
+ (abs((f x) - y0)) < e)))
+\ENDTHEOREM
\THEOREM LIM\_EQUAL LIM
|- !f g l x0.
(!x. ~(x = x0) ==> (f x = g x)) ==> ((f --> l)x0 = (g --> l)x0)
@@ -2289,8 +2280,7 @@
\THEOREM tends\_real\_real LIM
|- !f l x0. (f --> l)x0 = (f tends l)(mtop mr1,tendsto(mr1,x0))
\ENDTHEOREM
-\section{SEQ}
-\THEOREM ABS\_NEG\_LEMMA SEQ
+\section{SEQ}\THEOREM ABS\_NEG\_LEMMA SEQ
|- !c. c <= (& 0) ==> (!x y. (abs x) <= (c * (abs y)) ==> (x = & 0))
\ENDTHEOREM
\THEOREM cauchy SEQ
@@ -2326,11 +2316,6 @@
\THEOREM MONO\_SUC SEQ
|- !f. mono f = (!n. (f(SUC n)) >= (f n)) \/ (!n. (f(SUC n)) <= (f n))
\ENDTHEOREM
-\THEOREM SEQ SEQ
-|- !x x0.
- x --> x0 =
- (!e. (& 0) < e ==> (?N. !n. n num_ge N ==> (abs((x n) - x0)) < e))
-\ENDTHEOREM
\THEOREM SEQ\_ABS SEQ
|- !f. (\n. abs(f n)) --> (& 0) = f --> (& 0)
\ENDTHEOREM
@@ -2364,18 +2349,23 @@
x --> x0 /\ y --> y0 /\ ~(y0 = & 0) ==>
(\n. (x n) / (y n)) --> (x0 / y0)
\ENDTHEOREM
+\THEOREM SEQ SEQ
+|- !x x0.
+ x --> x0 =
+ (!e. (& 0) < e ==> (?N. !n. n num_ge N ==> (abs((x n) - x0)) < e))
+\ENDTHEOREM
\THEOREM SEQ\_ICONV SEQ
|- !f.
bounded(mr1,$num_ge)f /\ (!m n. m num_ge n ==> (f m) >= (f n)) ==>
convergent f
\ENDTHEOREM
-\THEOREM SEQ\_INV SEQ
-|- !x x0. x --> x0 /\ ~(x0 = & 0) ==> (\n. inv(x n)) --> (inv x0)
-\ENDTHEOREM
\THEOREM SEQ\_INV0 SEQ
|- !f.
(!y. ?N. !n. n num_ge N ==> (f n) > y) ==> (\n. inv(f n)) --> (& 0)
\ENDTHEOREM
+\THEOREM SEQ\_INV SEQ
+|- !x x0. x --> x0 /\ ~(x0 = & 0) ==> (\n. inv(x n)) --> (inv x0)
+\ENDTHEOREM
\THEOREM SEQ\_LE SEQ
|- !f g l m.
f --> l /\ g --> m /\ (?N. !n. n num_ge N ==> (f n) <= (g n)) ==>
@@ -2391,21 +2381,21 @@
|- !x x0 y y0.
x --> x0 /\ y --> y0 ==> (\n. (x n) * (y n)) --> (x0 * y0)
\ENDTHEOREM
-\THEOREM SEQ\_NEG SEQ
-|- !x x0. x --> x0 = (\n. --(x n)) --> (-- x0)
-\ENDTHEOREM
\THEOREM SEQ\_NEG\_BOUNDED SEQ
|- !f. bounded(mr1,$num_ge)(\n. --(f n)) = bounded(mr1,$num_ge)f
\ENDTHEOREM
\THEOREM SEQ\_NEG\_CONV SEQ
|- !f. convergent f = convergent(\n. --(f n))
\ENDTHEOREM
-\THEOREM SEQ\_POWER SEQ
-|- !c. (abs c) < (& 1) ==> (\n. c pow n) --> (& 0)
+\THEOREM SEQ\_NEG SEQ
+|- !x x0. x --> x0 = (\n. --(x n)) --> (-- x0)
\ENDTHEOREM
\THEOREM SEQ\_POWER\_ABS SEQ
|- !c. (abs c) < (& 1) ==> (\n. (abs c) pow n) --> (& 0)
\ENDTHEOREM
+\THEOREM SEQ\_POWER SEQ
+|- !c. (abs c) < (& 1) ==> (\n. c pow n) --> (& 0)
+\ENDTHEOREM
\THEOREM SEQ\_SBOUNDED SEQ
|- !s f. bounded(mr1,$num_ge)s ==> bounded(mr1,$num_ge)(\n. s(f n))
\ENDTHEOREM
@@ -2447,31 +2437,31 @@
\THEOREM SER\_CMUL SEQ
|- !x x0 c. x sums x0 ==> (\n. c * (x n)) sums (c * x0)
\ENDTHEOREM
-\THEOREM SER\_COMPAR SEQ
+\THEOREM SER\_COMPARA SEQ
|- !f g.
(?N. !n. n num_ge N ==> (abs(f n)) <= (g n)) /\ summable g ==>
- summable f
+ summable(\k. abs(f k))
\ENDTHEOREM
-\THEOREM SER\_COMPARA SEQ
+\THEOREM SER\_COMPAR SEQ
|- !f g.
(?N. !n. n num_ge N ==> (abs(f n)) <= (g n)) /\ summable g ==>
- summable(\k. abs(f k))
+ summable f
\ENDTHEOREM
\THEOREM SER\_GROUP SEQ
|- !f k.
summable f /\ 0 num_lt k ==>
(\n. Sum(n num_mul k,k)f) sums (suminf f)
\ENDTHEOREM
-\THEOREM SER\_LE SEQ
-|- !f g.
- (!n. (f n) <= (g n)) /\ summable f /\ summable g ==>
- (suminf f) <= (suminf g)
-\ENDTHEOREM
\THEOREM SER\_LE2 SEQ
|- !f g.
(!n. (abs(f n)) <= (g n)) /\ summable g ==>
summable f /\ (suminf f) <= (suminf g)
\ENDTHEOREM
+\THEOREM SER\_LE SEQ
+|- !f g.
+ (!n. (f n) <= (g n)) /\ summable f /\ summable g ==>
+ (suminf f) <= (suminf g)
+\ENDTHEOREM
\THEOREM SER\_NEG SEQ
|- !x x0. x sums x0 ==> (\n. --(x n)) sums (-- x0)
\ENDTHEOREM
@@ -2542,8 +2532,7 @@
\THEOREM tends\_num\_real SEQ
|- !x x0. x --> x0 = (x tends x0)(mtop mr1,$num_ge)
\ENDTHEOREM
-\section{POWSER}
-\THEOREM diffs POWSER
+\section{POWSER}\THEOREM diffs POWSER
|- !c. diffs c = (\n. (&(SUC n)) * (c(SUC n)))
\ENDTHEOREM
\THEOREM DIFFS\_EQUIV POWSER
@@ -2552,18 +2541,18 @@
(\n. (& n) * ((c n) * (x pow (n num_sub 1)))) sums
(suminf(\n. (diffs c n) * (x pow n)))
\ENDTHEOREM
-\THEOREM DIFFS\_LEMMA POWSER
-|- !n c x.
- Sum(0,n)(\n'. (diffs c n') * (x pow n')) =
- (Sum(0,n)(\n'. (& n') * ((c n') * (x pow (n' num_sub 1))))) +
- ((& n) * ((c n) * (x pow (n num_sub 1))))
-\ENDTHEOREM
\THEOREM DIFFS\_LEMMA2 POWSER
|- !n c x.
Sum(0,n)(\n. (& n) * ((c n) * (x pow (n num_sub 1)))) =
(Sum(0,n)(\n. (diffs c n) * (x pow n))) -
((& n) * ((c n) * (x pow (n num_sub 1))))
\ENDTHEOREM
+\THEOREM DIFFS\_LEMMA POWSER
+|- !n c x.
+ Sum(0,n)(\n'. (diffs c n') * (x pow n')) =
+ (Sum(0,n)(\n'. (& n') * ((c n') * (x pow (n' num_sub 1))))) +
+ ((& n) * ((c n) * (x pow (n num_sub 1))))
+\ENDTHEOREM
\THEOREM DIFFS\_NEG POWSER
|- !c. diffs(\n. --(c n)) = (\n. --(diffs c n))
\ENDTHEOREM
@@ -2582,15 +2571,15 @@
Sum(0,SUC n)(\p. (x pow p) * (y pow (n num_sub p))) =
Sum(0,SUC n)(\p. (x pow (n num_sub p)) * (y pow p))
\ENDTHEOREM
-\THEOREM POWSER\_INSIDE POWSER
+\THEOREM POWSER\_INSIDEA POWSER
|- !f x z.
summable(\n. (f n) * (x pow n)) /\ (abs z) < (abs x) ==>
- summable(\n. (f n) * (z pow n))
+ summable(\n. (abs(f n)) * (z pow n))
\ENDTHEOREM
-\THEOREM POWSER\_INSIDEA POWSER
+\THEOREM POWSER\_INSIDE POWSER
|- !f x z.
summable(\n. (f n) * (x pow n)) /\ (abs z) < (abs x) ==>
- summable(\n. (abs(f n)) * (z pow n))
+ summable(\n. (f n) * (z pow n))
\ENDTHEOREM
\THEOREM TERMDIFF POWSER
|- !c K.
@@ -2649,69 +2638,58 @@
(!n. (abs(g h n)) <= ((f n) * (abs h)))) ==>
((\h. suminf(g h)) tends_real_real (& 0))(& 0)
\ENDTHEOREM
-\section{TRANSC}
-\THEOREM ACS TRANSC
+\section{TRANSC}\THEOREM ACS\_BOUNDS TRANSC
|- !y.
- (--(& 1)) <= y /\ y <= (& 1) ==>
- (& 0) <= (acs y) /\ (acs y) <= pi /\ (cos(acs y) = y)
+ (--(& 1)) <= y /\ y <= (& 1) ==> (& 0) <= (acs y) /\ (acs y) <= pi
+\ENDTHEOREM
+\THEOREM ACS\_COS TRANSC
+|- !y. (--(& 1)) <= y /\ y <= (& 1) ==> (cos(acs y) = y)
\ENDTHEOREM
\THEOREM acs TRANSC
|- !y. acs y = (@x. (& 0) <= x /\ x <= pi /\ (cos x = y))
\ENDTHEOREM
-\THEOREM ACS\_BOUNDS TRANSC
+\THEOREM ACS TRANSC
|- !y.
- (--(& 1)) <= y /\ y <= (& 1) ==> (& 0) <= (acs y) /\ (acs y) <= pi
-\ENDTHEOREM
-\THEOREM ACS\_COS TRANSC
-|- !y. (--(& 1)) <= y /\ y <= (& 1) ==> (cos(acs y) = y)
+ (--(& 1)) <= y /\ y <= (& 1) ==>
+ (& 0) <= (acs y) /\ (acs y) <= pi /\ (cos(acs y) = y)
\ENDTHEOREM
-\THEOREM ASN TRANSC
+\THEOREM ASN\_BOUNDS TRANSC
|- !y.
(--(& 1)) <= y /\ y <= (& 1) ==>
- (--(pi / (& 2))) <= (asn y) /\
- (asn y) <= (pi / (& 2)) /\
- (sin(asn y) = y)
+ (--(pi / (& 2))) <= (asn y) /\ (asn y) <= (pi / (& 2))
\ENDTHEOREM
\THEOREM asn TRANSC
|- !y.
asn y =
(@x. (--(pi / (& 2))) <= x /\ x <= (pi / (& 2)) /\ (sin x = y))
\ENDTHEOREM
-\THEOREM ASN\_BOUNDS TRANSC
+\THEOREM ASN TRANSC
|- !y.
(--(& 1)) <= y /\ y <= (& 1) ==>
- (--(pi / (& 2))) <= (asn y) /\ (asn y) <= (pi / (& 2))
+ (--(pi / (& 2))) <= (asn y) /\
+ (asn y) <= (pi / (& 2)) /\
+ (sin(asn y) = y)
\ENDTHEOREM
\THEOREM ASN\_SIN TRANSC
|- !y. (--(& 1)) <= y /\ y <= (& 1) ==> (sin(asn y) = y)
\ENDTHEOREM
-\THEOREM ATN TRANSC
-|- !y.
- (--(pi / (& 2))) < (atn y) /\
- (atn y) < (pi / (& 2)) /\
- (tan(atn y) = y)
+\THEOREM ATN\_BOUNDS TRANSC
+|- !y. (--(pi / (& 2))) < (atn y) /\ (atn y) < (pi / (& 2))
\ENDTHEOREM
\THEOREM atn TRANSC
|- !y.
atn y =
(@x. (--(pi / (& 2))) < x /\ x < (pi / (& 2)) /\ (tan x = y))
\ENDTHEOREM
-\THEOREM ATN\_BOUNDS TRANSC
-|- !y. (--(pi / (& 2))) < (atn y) /\ (atn y) < (pi / (& 2))
+\THEOREM ATN TRANSC
+|- !y.
+ (--(pi / (& 2))) < (atn y) /\
+ (atn y) < (pi / (& 2)) /\
+ (tan(atn y) = y)
\ENDTHEOREM
\THEOREM ATN\_TAN TRANSC
|- !y. tan(atn y) = y
\ENDTHEOREM
-\THEOREM cos TRANSC
-|- !x.
- cos x =
- suminf
- (\n.
- ((\n'.
- (EVEN n' => ((--(& 1)) pow (n' DIV 2)) / (&(FACT n')) | & 0))
- n) *
- (x pow n))
-\ENDTHEOREM
\THEOREM COS\_0 TRANSC
|- cos(& 0) = & 1
\ENDTHEOREM
@@ -2737,6 +2715,16 @@
(x pow n)) sums
(cos x)
\ENDTHEOREM
+\THEOREM cos TRANSC
+|- !x.
+ cos x =
+ suminf
+ (\n.
+ ((\n'.
+ (EVEN n' => ((--(& 1)) pow (n' DIV 2)) / (&(FACT n')) | & 0))
+ n) *
+ (x pow n))
+\ENDTHEOREM
\THEOREM COS\_DOUBLE TRANSC
|- !x. cos((& 2) * x) = ((cos x) pow 2) - ((sin x) pow 2)
\ENDTHEOREM
@@ -2772,18 +2760,18 @@
\THEOREM COS\_PERIODIC\_PI TRANSC
|- !x. cos(x + pi) = --(cos x)
\ENDTHEOREM
-\THEOREM COS\_PI TRANSC
-|- cos pi = --(& 1)
-\ENDTHEOREM
\THEOREM COS\_PI2 TRANSC
|- cos(pi / (& 2)) = & 0
\ENDTHEOREM
-\THEOREM COS\_POS\_PI TRANSC
-|- !x. (--(pi / (& 2))) < x /\ x < (pi / (& 2)) ==> (& 0) < (cos x)
+\THEOREM COS\_PI TRANSC
+|- cos pi = --(& 1)
\ENDTHEOREM
\THEOREM COS\_POS\_PI2 TRANSC
|- !x. (& 0) < x /\ x < (pi / (& 2)) ==> (& 0) < (cos x)
\ENDTHEOREM
+\THEOREM COS\_POS\_PI TRANSC
+|- !x. (--(pi / (& 2))) < x /\ x < (pi / (& 2)) ==> (& 0) < (cos x)
+\ENDTHEOREM
\THEOREM COS\_SIN TRANSC
|- !x. cos x = sin((pi / (& 2)) - x)
\ENDTHEOREM
@@ -2815,9 +2803,6 @@
\THEOREM DIFF\_TAN TRANSC
|- !x. ~(cos x = & 0) ==> (tan diffl (inv((cos x) pow 2)))x
\ENDTHEOREM
-\THEOREM exp TRANSC
-|- !x. exp x = suminf(\n. ((\n'. inv(&(FACT n')))n) * (x pow n))
-\ENDTHEOREM
\THEOREM EXP\_0 TRANSC
|- exp(& 0) = & 1
\ENDTHEOREM
@@ -2830,6 +2815,9 @@
\THEOREM EXP\_CONVERGES TRANSC
|- !x. (\n. ((\n. inv(&(FACT n)))n) * (x pow n)) sums (exp x)
\ENDTHEOREM
+\THEOREM exp TRANSC
+|- !x. exp x = suminf(\n. ((\n'. inv(&(FACT n')))n) * (x pow n))
+\ENDTHEOREM
\THEOREM EXP\_FDIFF TRANSC
|- diffs(\n. inv(&(FACT n))) = (\n. inv(&(FACT n)))
\ENDTHEOREM
@@ -2860,12 +2848,12 @@
\THEOREM EXP\_NEG TRANSC
|- !x. exp(-- x) = inv(exp x)
\ENDTHEOREM
-\THEOREM EXP\_NEG\_MUL TRANSC
-|- !x. (exp x) * (exp(-- x)) = & 1
-\ENDTHEOREM
\THEOREM EXP\_NEG\_MUL2 TRANSC
|- !x. (exp(-- x)) * (exp x) = & 1
\ENDTHEOREM
+\THEOREM EXP\_NEG\_MUL TRANSC
+|- !x. (exp x) * (exp(-- x)) = & 1
+\ENDTHEOREM
\THEOREM EXP\_NZ TRANSC
|- !x. ~(exp x = & 0)
\ENDTHEOREM
@@ -2885,15 +2873,15 @@
|- !y.
(& 1) <= y ==> (?x. (& 0) <= x /\ x <= (y - (& 1)) /\ (exp x = y))
\ENDTHEOREM
-\THEOREM ln TRANSC
-|- !x. ln x = (@u. exp u = x)
-\ENDTHEOREM
\THEOREM LN\_1 TRANSC
|- ln(& 1) = & 0
\ENDTHEOREM
\THEOREM LN\_DIV TRANSC
|- !x. (& 0) < x /\ (& 0) < y ==> (ln(x / y) = (ln x) - (ln y))
\ENDTHEOREM
+\THEOREM ln TRANSC
+|- !x. ln x = (@u. exp u = x)
+\ENDTHEOREM
\THEOREM LN\_EXP TRANSC
|- !x. ln(exp x) = x
\ENDTHEOREM
@@ -2915,27 +2903,27 @@
\THEOREM LN\_POW TRANSC
|- !n x. (& 0) < x ==> (ln(x pow n) = (& n) * (ln x))
\ENDTHEOREM
-\THEOREM pi TRANSC
-|- pi = (& 2) * (@x. (& 0) <= x /\ x <= (& 2) /\ (cos x = & 0))
+\THEOREM PI2\_BOUNDS TRANSC
+|- (& 0) < (pi / (& 2)) /\ (pi / (& 2)) < (& 2)
\ENDTHEOREM
\THEOREM PI2 TRANSC
|- pi / (& 2) = (@x. (& 0) <= x /\ x <= (& 2) /\ (cos x = & 0))
\ENDTHEOREM
-\THEOREM PI2\_BOUNDS TRANSC
-|- (& 0) < (pi / (& 2)) /\ (pi / (& 2)) < (& 2)
+\THEOREM pi TRANSC
+|- pi = (& 2) * (@x. (& 0) <= x /\ x <= (& 2) /\ (cos x = & 0))
\ENDTHEOREM
\THEOREM PI\_POS TRANSC
|- (& 0) < pi
\ENDTHEOREM
-\THEOREM root TRANSC
-|- !n x. root n x = (@u. ((& 0) < x ==> (& 0) < u) /\ (u pow n = x))
-\ENDTHEOREM
\THEOREM ROOT\_0 TRANSC
|- !n. root(SUC n)(& 0) = & 0
\ENDTHEOREM
\THEOREM ROOT\_1 TRANSC
|- !n. root(SUC n)(& 1) = & 1
\ENDTHEOREM
+\THEOREM root TRANSC
+|- !n x. root n x = (@u. ((& 0) < x ==> (& 0) < u) /\ (u pow n = x))
+\ENDTHEOREM
\THEOREM ROOT\_LN TRANSC
|- !n x. (& 0) < x ==> (!n. root(SUC n)x = exp((ln x) / (&(SUC n))))
\ENDTHEOREM
@@ -2945,18 +2933,6 @@
\THEOREM ROOT\_POW\_POS TRANSC
|- !n x. (& 0) <= x ==> ((root(SUC n)x) pow (SUC n) = x)
\ENDTHEOREM
-\THEOREM sin TRANSC
-|- !x.
- sin x =
- suminf
- (\n.
- ((\n'.
- (EVEN n' =>
- & 0 |
- ((--(& 1)) pow ((n' num_sub 1) DIV 2)) / (&(FACT n'))))
- n) *
- (x pow n))
-\ENDTHEOREM
\THEOREM SIN\_0 TRANSC
|- sin(& 0) = & 0
\ENDTHEOREM
@@ -2986,20 +2962,32 @@
(x pow n)) sums
(sin x)
\ENDTHEOREM
-\THEOREM SIN\_COS TRANSC
-|- !x. sin x = cos((pi / (& 2)) - x)
-\ENDTHEOREM
\THEOREM SIN\_COS\_ADD TRANSC
|- !x y.
(((sin(x + y)) - (((sin x) * (cos y)) + ((cos x) * (sin y)))) pow 2) +
(((cos(x + y)) - (((cos x) * (cos y)) - ((sin x) * (sin y)))) pow 2) =
& 0
\ENDTHEOREM
+\THEOREM SIN\_COS TRANSC
+|- !x. sin x = cos((pi / (& 2)) - x)
+\ENDTHEOREM
\THEOREM SIN\_COS\_NEG TRANSC
|- !x.
(((sin(-- x)) + (sin x)) pow 2) + (((cos(-- x)) - (cos x)) pow 2) =
& 0
\ENDTHEOREM
+\THEOREM sin TRANSC
+|- !x.
+ sin x =
+ suminf
+ (\n.
+ ((\n'.
+ (EVEN n' =>
+ & 0 |
+ ((--(& 1)) pow ((n' num_sub 1) DIV 2)) / (&(FACT n'))))
+ n) *
+ (x pow n))
+\ENDTHEOREM
\THEOREM SIN\_DOUBLE TRANSC
|- !x. sin((& 2) * x) = (& 2) * ((sin x) * (cos x))
\ENDTHEOREM
@@ -3043,21 +3031,21 @@
\THEOREM SIN\_PERIODIC\_PI TRANSC
|- !x. sin(x + pi) = --(sin x)
\ENDTHEOREM
-\THEOREM SIN\_PI TRANSC
-|- sin pi = & 0
-\ENDTHEOREM
\THEOREM SIN\_PI2 TRANSC
|- sin(pi / (& 2)) = & 1
\ENDTHEOREM
+\THEOREM SIN\_PI TRANSC
+|- sin pi = & 0
+\ENDTHEOREM
\THEOREM SIN\_POS TRANSC
|- !x. (& 0) < x /\ x < (& 2) ==> (& 0) < (sin x)
\ENDTHEOREM
-\THEOREM SIN\_POS\_PI TRANSC
-|- !x. (& 0) < x /\ x < pi ==> (& 0) < (sin x)
-\ENDTHEOREM
\THEOREM SIN\_POS\_PI2 TRANSC
|- !x. (& 0) < x /\ x < (pi / (& 2)) ==> (& 0) < (sin x)
\ENDTHEOREM
+\THEOREM SIN\_POS\_PI TRANSC
+|- !x. (& 0) < x /\ x < pi ==> (& 0) < (sin x)
+\ENDTHEOREM
\THEOREM SIN\_TOTAL TRANSC
|- !y.
(--(& 1)) <= y /\ y <= (& 1) ==>
@@ -3074,21 +3062,18 @@
(& 0) <= x /\ (sin x = & 0) ==>
(?n. EVEN n /\ (x = (& n) * (pi / (& 2))))
\ENDTHEOREM
-\THEOREM sqrt TRANSC
-|- !x. sqrt x = root 2 x
-\ENDTHEOREM
\THEOREM SQRT\_0 TRANSC
|- sqrt(& 0) = & 0
\ENDTHEOREM
\THEOREM SQRT\_1 TRANSC
|- sqrt(& 1) = & 1
\ENDTHEOREM
+\THEOREM sqrt TRANSC
+|- !x. sqrt x = root 2 x
+\ENDTHEOREM
\THEOREM SQRT\_POW2 TRANSC
|- !x. ((sqrt x) pow 2 = x) = (& 0) <= x
\ENDTHEOREM
-\THEOREM tan TRANSC
-|- !x. tan x = (sin x) / (cos x)
-\ENDTHEOREM
\THEOREM TAN\_0 TRANSC
|- tan(& 0) = & 0
\ENDTHEOREM
@@ -3100,6 +3085,9 @@
\THEOREM TAN\_ATN TRANSC
|- !x. (--(pi / (& 2))) < x /\ x < (pi / (& 2)) ==> (atn(tan x) = x)
\ENDTHEOREM
+\THEOREM tan TRANSC
+|- !x. tan x = (sin x) / (cos x)
+\ENDTHEOREM
\THEOREM TAN\_DOUBLE TRANSC
|- !x.
~(cos x = & 0) /\ ~(cos((& 2) * x) = & 0) ==>
--- hol88-2.02.19940316.orig/Library/reals/Manual/Makefile
+++ hol88-2.02.19940316/Library/reals/Manual/Makefile
@@ -15,34 +15,34 @@ all:; make clean; make tex; make reals;
clean:; \
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg; \
- echo "\begin{theindex}" >index.tex; \
- echo "\mbox{}" >>index.tex; \
- echo "\end{theindex}" >>index.tex
+ printf '\\begin{theindex}' >index.tex; \
+ printf '\\mbox{}' >>index.tex; \
+ printf '\\end{theindex}' >>index.tex
tex: theorems
theorems:; \
- echo "\chapter{Pre-proved Theorems}" >theorems.tex; \
- echo "\input{theorems-intro}" >>theorems.tex; \
- echo "\section{HRAT}" >>theorems.tex; \
+ printf '\\chapter{Pre-proved Theorems}' >theorems.tex; \
+ printf '\\input{theorems-intro}' >>theorems.tex; \
+ printf '\\section{HRAT}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/HRAT theorems.tex; \
- echo "\section{HREAL}" >>theorems.tex; \
+ printf '\\section{HREAL}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/HREAL theorems.tex; \
- echo "\section{REALAX}" >>theorems.tex; \
+ printf '\\section{REALAX}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/REALAX theorems.tex; \
- echo "\section{REAL}" >>theorems.tex; \
+ printf '\\section{REAL}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/REAL theorems.tex; \
- echo "\section{TOPOLOGY}" >>theorems.tex; \
+ printf '\\section{TOPOLOGY}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/TOPOLOGY theorems.tex; \
- echo "\section{NETS}" >>theorems.tex; \
+ printf '\\section{NETS}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/NETS theorems.tex; \
- echo "\section{LIM}" >>theorems.tex; \
+ printf '\\section{LIM}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/LIM theorems.tex; \
- echo "\section{SEQ}" >>theorems.tex; \
+ printf '\\section{SEQ}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/SEQ theorems.tex; \
- echo "\section{POWSER}" >>theorems.tex; \
+ printf '\\section{POWSER}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/POWSER theorems.tex; \
- echo "\section{TRANSC}" >>theorems.tex; \
+ printf '\\section{TRANSC}' >>theorems.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/TRANSC theorems.tex
reals:; \
--- hol88-2.02.19940316.orig/Library/prettyp/Manual/Makefile
+++ hol88-2.02.19940316/Library/prettyp/Manual/Makefile
@@ -26,16 +26,16 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the prettyp Library}">entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the prettyp Library}'>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
index:
--- hol88-2.02.19940316.orig/Library/prettyp/Manual/entries.tex
+++ hol88-2.02.19940316/Library/prettyp/Manual/entries.tex
@@ -1,6 +1,4 @@
-\chapter{ML Functions in the prettyp Library}
-\input{entries-intro}
-\DOC{Address}
+\chapter{ML Functions in the prettyp Library}\input{entries-intro}\DOC{Address}
\TYPE {\small\verb%Address : (int list -> address)%}\egroup
@@ -831,57 +829,6 @@ function to include no type information
Hidden_types, Useful_types, All_types, term_to_print_tree.
\ENDDOC
-\DOC{pp}
-
-{\small
-\begin{verbatim}
-pp : (print_rule_function -> string -> (string # int) list ->
- print_tree -> void)
-\end{verbatim}
-}\egroup
-
-\SYNOPSIS
-One of the main pretty-printing functions. For use with the standard HOL
-pretty-printer.
-
-\DESCRIBE
-{\small\verb%pp%} invokes the pretty-printer. It can be used for merging output with text
-produced by the standard HOL pretty-printer. Instead of ending each line of
-text by printing a new-line, it sends its output to the standard HOL printer
-in the form of a pretty-printing block. The arguments to the function are:
-(1) pretty-printing rules expressed as a function, (2) the initial context,
-(3) initial parameters, (4) tree to be printed. {\small\verb%pp%} uses as its maximum width
-the width for the standard HOL printer, as specified by the function
-{\small\verb%set_margin%}. The initial offset from the left margin is taken to be zero.
-
-\FAILURE
-Failure or incorrect behaviour can be caused by mistakes in the pretty-printing
-rules or by inappropriate arguments to the printing function. The most common
-errors are use of uninitialised parameters and reference to unknown
-metavariables. The latter are due to metavariables appearing in the format of a
-rule, but not in the pattern. Errors also occur if a metavariable is used in a
-place inappropriate for the value it is bound to. An example of this is an
-attempt to compare a string with a metavariable that is bound to a tree rather
-than a node-name.
-
-Use of negative indentations in formats may cause text to overflow the left
-margin, and an exception to be raised. Any user defined function may also
-cause a run-time error.
-
-The printing functions have been designed to trap exceptions and to print
-{\small\verb%*error*%}. This does not indicate what caused the error, but it may give some
-indication of where the error occurred. However, this is not the main reason
-for trapping exceptions. The ML directive {\small\verb%top_print%} installs a user print
-function. If an exception is raised within this function, it does not appear
-at the top-level of ML. Instead, an obscure Lisp error is produced. Since the
-pretty-printing functions are normally used with {\small\verb%top_print%}, it is best to
-avoid raising exceptions. For this reason the printing functions display
-{\small\verb%*error*%} instead.
-
-\SEEALSO
-pretty_print, pp_write.
-
-\ENDDOC
\DOC{pp\_convert\_all\_thm}
\TYPE {\small\verb%pp_convert_all_thm : (thm -> print_tree)%}\egroup
@@ -991,6 +938,57 @@ Never fails.
type_to_print_tree, pp_convert_term, pp_convert_thm, pp_convert_all_thm.
\ENDDOC
+\DOC{pp}
+
+{\small
+\begin{verbatim}
+pp : (print_rule_function -> string -> (string # int) list ->
+ print_tree -> void)
+\end{verbatim}
+}\egroup
+
+\SYNOPSIS
+One of the main pretty-printing functions. For use with the standard HOL
+pretty-printer.
+
+\DESCRIBE
+{\small\verb%pp%} invokes the pretty-printer. It can be used for merging output with text
+produced by the standard HOL pretty-printer. Instead of ending each line of
+text by printing a new-line, it sends its output to the standard HOL printer
+in the form of a pretty-printing block. The arguments to the function are:
+(1) pretty-printing rules expressed as a function, (2) the initial context,
+(3) initial parameters, (4) tree to be printed. {\small\verb%pp%} uses as its maximum width
+the width for the standard HOL printer, as specified by the function
+{\small\verb%set_margin%}. The initial offset from the left margin is taken to be zero.
+
+\FAILURE
+Failure or incorrect behaviour can be caused by mistakes in the pretty-printing
+rules or by inappropriate arguments to the printing function. The most common
+errors are use of uninitialised parameters and reference to unknown
+metavariables. The latter are due to metavariables appearing in the format of a
+rule, but not in the pattern. Errors also occur if a metavariable is used in a
+place inappropriate for the value it is bound to. An example of this is an
+attempt to compare a string with a metavariable that is bound to a tree rather
+than a node-name.
+
+Use of negative indentations in formats may cause text to overflow the left
+margin, and an exception to be raised. Any user defined function may also
+cause a run-time error.
+
+The printing functions have been designed to trap exceptions and to print
+{\small\verb%*error*%}. This does not indicate what caused the error, but it may give some
+indication of where the error occurred. However, this is not the main reason
+for trapping exceptions. The ML directive {\small\verb%top_print%} installs a user print
+function. If an exception is raised within this function, it does not appear
+at the top-level of ML. Instead, an obscure Lisp error is produced. Since the
+pretty-printing functions are normally used with {\small\verb%top_print%}, it is best to
+avoid raising exceptions. For this reason the printing functions display
+{\small\verb%*error*%} instead.
+
+\SEEALSO
+pretty_print, pp_write.
+
+\ENDDOC
\DOC{pp\_print\_all\_thm}
\TYPE {\small\verb%pp_print_all_thm : (thm -> void)%}\egroup
--- hol88-2.02.19940316.orig/Library/taut/Manual/Makefile
+++ hol88-2.02.19940316/Library/taut/Manual/Makefile
@@ -26,16 +26,16 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the taut Library}">entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the taut Library}'>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
index:
--- hol88-2.02.19940316.orig/Library/taut/Manual/entries.tex
+++ hol88-2.02.19940316/Library/taut/Manual/entries.tex
@@ -1,6 +1,4 @@
-\chapter{ML Functions in the taut Library}
-\input{entries-intro}
-\DOC{PTAUT\_CONV}
+\chapter{ML Functions in the taut Library}\input{entries-intro}\DOC{PTAUT\_CONV}
\TYPE {\small\verb%PTAUT_CONV : conv%}\egroup
--- hol88-2.02.19940316.orig/Library/sets/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/sets/Manual/theorems.tex
@@ -1,22 +1,18 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\section{The type definition}
-\THEOREM set\_ISO\_DEF sets
+\chapter{Pre-proved Theorems}\input{theorems-intro}\section{The type definition}\THEOREM set\_ISO\_DEF sets
|- (!a. SPEC(CHF a) = a) /\ (!r. (\p. T)r = (CHF(SPEC r) = r))
\ENDTHEOREM
\THEOREM set\_TY\_DEF sets
|- ?rep. TYPE_DEFINITION(\p. T)rep
\ENDTHEOREM
-\section{Membership, equality, and set specifications}
-\THEOREM EXTENSION sets
+\section{Membership, equality, and set specifications}\THEOREM EXTENSION sets
|- !s t. (s = t) = (!x. x IN s = x IN t)
\ENDTHEOREM
-\THEOREM GSPECIFICATION sets
-|- !f v. v IN (GSPEC f) = (?x. v,T = f x)
-\ENDTHEOREM
\THEOREM GSPEC\_DEF sets
|- !f. GSPEC f = SPEC(\y. ?x. y,T = f x)
\ENDTHEOREM
+\THEOREM GSPECIFICATION sets
+|- !f v. v IN (GSPEC f) = (?x. v,T = f x)
+\ENDTHEOREM
\THEOREM IN\_DEF sets
|- !x s. x IN s = CHF s x
\ENDTHEOREM
@@ -32,8 +28,7 @@
\THEOREM SPECIFICATION sets
|- !P x. x IN (SPEC P) = P x
\ENDTHEOREM
-\section{The empty and universal sets}
-\THEOREM EMPTY\_DEF sets
+\section{The empty and universal sets}\THEOREM EMPTY\_DEF sets
|- {} = SPEC(\x. F)
\ENDTHEOREM
\THEOREM EMPTY\_NOT\_UNIV sets
@@ -57,8 +52,7 @@
\THEOREM UNIV\_NOT\_EMPTY sets
|- ~(UNIV = {})
\ENDTHEOREM
-\section{Set inclusion}
-\THEOREM EMPTY\_SUBSET sets
+\section{Set inclusion}\THEOREM EMPTY\_SUBSET sets
|- !s. {} SUBSET s
\ENDTHEOREM
\THEOREM NOT\_PSUBSET\_EMPTY sets
@@ -103,10 +97,12 @@
\THEOREM UNIV\_SUBSET sets
|- !s. UNIV SUBSET s = (s = UNIV)
\ENDTHEOREM
-\section{Intersection and union}
-\THEOREM EMPTY\_UNION sets
+\section{Intersection and union}\THEOREM EMPTY\_UNION sets
|- !s t. (s UNION t = {}) = (s = {}) /\ (t = {})
\ENDTHEOREM
+\THEOREM IN\_INTER sets
+|- !s t x. x IN (s INTER t) = x IN s /\ x IN t
+\ENDTHEOREM
\THEOREM INTER\_ASSOC sets
|- !s t u. (s INTER t) INTER u = s INTER (t INTER u)
\ENDTHEOREM
@@ -131,21 +127,18 @@
\THEOREM INTER\_UNIV sets
|- (!s. UNIV INTER s = s) /\ (!s. s INTER UNIV = s)
\ENDTHEOREM
-\THEOREM IN\_INTER sets
-|- !s t x. x IN (s INTER t) = x IN s /\ x IN t
-\ENDTHEOREM
\THEOREM IN\_UNION sets
|- !s t x. x IN (s UNION t) = x IN s \/ x IN t
\ENDTHEOREM
\THEOREM SUBSET\_INTER\_ABSORPTION sets
|- !s t. s SUBSET t = (s INTER t = s)
\ENDTHEOREM
-\THEOREM SUBSET\_UNION sets
-|- (!s t. s SUBSET (s UNION t)) /\ (!s t. s SUBSET (t UNION s))
-\ENDTHEOREM
\THEOREM SUBSET\_UNION\_ABSORPTION sets
|- !s t. s SUBSET t = (s UNION t = t)
\ENDTHEOREM
+\THEOREM SUBSET\_UNION sets
+|- (!s t. s SUBSET (s UNION t)) /\ (!s t. s SUBSET (t UNION s))
+\ENDTHEOREM
\THEOREM UNION\_ASSOC sets
|- !s t u. (s UNION t) UNION u = s UNION (t UNION u)
\ENDTHEOREM
@@ -167,8 +160,7 @@
\THEOREM UNION\_UNIV sets
|- (!s. UNIV UNION s = UNIV) /\ (!s. s UNION UNIV = UNIV)
\ENDTHEOREM
-\section{Set difference}
-\THEOREM DIFF\_DEF sets
+\section{Set difference}\THEOREM DIFF\_DEF sets
|- !s t. s DIFF t = {x | x IN s /\ ~x IN t}
\ENDTHEOREM
\THEOREM DIFF\_DIFF sets
@@ -189,8 +181,7 @@
\THEOREM IN\_DIFF sets
|- !s t x. x IN (s DIFF t) = x IN s /\ ~x IN t
\ENDTHEOREM
-\section{Disjoint sets}
-\THEOREM DISJOINT\_DEF sets
+\section{Disjoint sets}\THEOREM DISJOINT\_DEF sets
|- !s t. DISJOINT s t = (s INTER t = {})
\ENDTHEOREM
\THEOREM DISJOINT\_DELETE\_SYM sets
@@ -212,8 +203,7 @@
\THEOREM IN\_DISJOINT sets
|- !s t. DISJOINT s t = ~(?x. x IN s /\ x IN t)
\ENDTHEOREM
-\section{Insertion and deletion of an element}
-\THEOREM ABSORPTION sets
+\section{Insertion and deletion of an element}\THEOREM ABSORPTION sets
|- !x s. x IN s = (x INSERT s = s)
\ENDTHEOREM
\THEOREM COMPONENT sets
@@ -254,6 +244,16 @@
\THEOREM EMPTY\_DELETE sets
|- !x. {} DELETE x = {}
\ENDTHEOREM
+\THEOREM IN\_DELETE sets
+|- !s x y. x IN (s DELETE y) = x IN s /\ ~(x = y)
+\ENDTHEOREM
+\THEOREM IN\_DELETE\_EQ sets
+|- !s x x'.
+ (x IN s = x' IN s) = (x IN (s DELETE x') = x' IN (s DELETE x))
+\ENDTHEOREM
+\THEOREM IN\_INSERT sets
+|- !x y s. x IN (y INSERT s) = (x = y) \/ x IN s
+\ENDTHEOREM
\THEOREM INSERT\_COMM sets
|- !x y s. x INSERT (y INSERT s) = y INSERT (x INSERT s)
\ENDTHEOREM
@@ -287,16 +287,6 @@
\THEOREM INSERT\_UNIV sets
|- !x. x INSERT UNIV = UNIV
\ENDTHEOREM
-\THEOREM IN\_DELETE sets
-|- !s x y. x IN (s DELETE y) = x IN s /\ ~(x = y)
-\ENDTHEOREM
-\THEOREM IN\_DELETE\_EQ sets
-|- !s x x'.
- (x IN s = x' IN s) = (x IN (s DELETE x') = x' IN (s DELETE x))
-\ENDTHEOREM
-\THEOREM IN\_INSERT sets
-|- !x y s. x IN (y INSERT s) = (x = y) \/ x IN s
-\ENDTHEOREM
\THEOREM NOT\_EMPTY\_INSERT sets
|- !x s. ~({} = x INSERT s)
\ENDTHEOREM
@@ -312,14 +302,13 @@
\THEOREM SUBSET\_DELETE sets
|- !x s t. s SUBSET (t DELETE x) = ~x IN s /\ s SUBSET t
\ENDTHEOREM
-\THEOREM SUBSET\_INSERT sets
-|- !x s. ~x IN s ==> (!t. s SUBSET (x INSERT t) = s SUBSET t)
-\ENDTHEOREM
\THEOREM SUBSET\_INSERT\_DELETE sets
|- !x s t. s SUBSET (x INSERT t) = (s DELETE x) SUBSET t
\ENDTHEOREM
-\section{The {\tt CHOICE} and {\tt REST} functions}
-\THEOREM CHOICE\_DEF sets
+\THEOREM SUBSET\_INSERT sets
+|- !x s. ~x IN s ==> (!t. s SUBSET (x INSERT t) = s SUBSET t)
+\ENDTHEOREM
+\section{The {\tt CHOICE} and {\tt REST} functions}\THEOREM CHOICE\_DEF sets
|- !s. ~(s = {}) ==> (CHOICE s) IN s
\ENDTHEOREM
\THEOREM CHOICE\_INSERT\_REST sets
@@ -346,8 +335,7 @@
\THEOREM SING\_IFF\_EMPTY\_REST sets
|- !s. SING s = ~(s = {}) /\ (REST s = {})
\ENDTHEOREM
-\section{Image of a function on a set}
-\THEOREM IMAGE\_COMPOSE sets
+\section{Image of a function on a set}\THEOREM IMAGE\_COMPOSE sets
|- !f g s. IMAGE(f o g)s = IMAGE f(IMAGE g s)
\ENDTHEOREM
\THEOREM IMAGE\_DEF sets
@@ -383,8 +371,7 @@
\THEOREM IN\_IMAGE sets
|- !y s f. y IN (IMAGE f s) = (?x. (y = f x) /\ x IN s)
\ENDTHEOREM
-\section{Mappings between sets}
-\THEOREM BIJ\_COMPOSE sets
+\section{Mappings between sets}\THEOREM BIJ\_COMPOSE sets
|- !f g s t u. BIJ f s t /\ BIJ g t u ==> BIJ(g o f)s u
\ENDTHEOREM
\THEOREM BIJ\_DEF sets
@@ -435,8 +422,7 @@
\THEOREM SURJ\_ID sets
|- !s. SURJ(\x. x)s s
\ENDTHEOREM
-\section{Singleton sets}
-\THEOREM DELETE\_EQ\_SING sets
+\section{Singleton sets}\THEOREM DELETE\_EQ\_SING sets
|- !s x. x IN s ==> ((s DELETE x = {}) = (s = {x}))
\ENDTHEOREM
\THEOREM DISJOINT\_SING\_EMPTY sets
@@ -460,20 +446,19 @@
\THEOREM NOT\_SING\_EMPTY sets
|- !x. ~({x} = {})
\ENDTHEOREM
-\THEOREM SING sets
-|- !x. SING{x}
-\ENDTHEOREM
\THEOREM SING\_DEF sets
|- !s. SING s = (?x. s = {x})
\ENDTHEOREM
\THEOREM SING\_DELETE sets
|- !x. {x} DELETE x = {}
\ENDTHEOREM
+\THEOREM SING sets
+|- !x. SING{x}
+\ENDTHEOREM
\THEOREM SING\_FINITE sets
|- !s. SING s ==> FINITE s
\ENDTHEOREM
-\section{Finite and infinite sets}
-\THEOREM FINITE\_DEF sets
+\section{Finite and infinite sets}\THEOREM FINITE\_DEF sets
|- !s.
FINITE s = (!P. P{} /\ (!s'. P s' ==> (!e. P(e INSERT s'))) ==> P s)
\ENDTHEOREM
@@ -531,12 +516,12 @@
|- INFINITE (UNIV:(*)set) =
(?f:*->*. (!x y. (f x = f y) ==> (x = y)) /\ (?y. !x. ~(f x = y)))
\ENDTHEOREM
-\THEOREM INTER\_FINITE sets
-|- !s. FINITE s ==> (!t. FINITE(s INTER t))
-\ENDTHEOREM
\THEOREM IN\_INFINITE\_NOT\_FINITE sets
|- !s t. INFINITE s /\ FINITE t ==> (?x. x IN s /\ ~x IN t)
\ENDTHEOREM
+\THEOREM INTER\_FINITE sets
+|- !s. FINITE s ==> (!t. FINITE(s INTER t))
+\ENDTHEOREM
\THEOREM NOT\_IN\_FINITE sets
|- INFINITE UNIV = (!s. FINITE s ==> (?x. ~x IN s))
\ENDTHEOREM
@@ -546,8 +531,7 @@
\THEOREM SUBSET\_FINITE sets
|- !s. FINITE s ==> (!t. t SUBSET s ==> FINITE t)
\ENDTHEOREM
-\section{Cardinality of sets}
-\THEOREM CARD\_DEF sets
+\section{Cardinality of sets}\THEOREM CARD\_DEF sets
|- (CARD{} = 0) /\
(!s.
FINITE s ==>
--- hol88-2.02.19940316.orig/Library/sets/Manual/Makefile
+++ hol88-2.02.19940316/Library/sets/Manual/Makefile
@@ -26,49 +26,49 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: theorems ids
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the sets Library}">entries.tex
- @echo "\label{entries}">>entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the sets Library}'>entries.tex
+ @printf '\\label{entries}'>>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{The type definition}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{The type definition}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/sdef theorems.tex
- @echo "\section{Membership, equality, and set specifications}">>theorems.tex
+ @printf '\\section{Membership, equality, and set specifications}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/mem theorems.tex
- @echo "\section{The empty and universal sets}">>theorems.tex
+ @printf '\\section{The empty and universal sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/emuniv theorems.tex
- @echo "\section{Set inclusion}">>theorems.tex
+ @printf '\\section{Set inclusion}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/subs theorems.tex
- @echo "\section{Intersection and union}">>theorems.tex
+ @printf '\\section{Intersection and union}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/unin theorems.tex
- @echo "\section{Set difference}">>theorems.tex
+ @printf '\\section{Set difference}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/diff theorems.tex
- @echo "\section{Disjoint sets}">>theorems.tex
+ @printf '\\section{Disjoint sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/disj theorems.tex
- @echo "\section{Insertion and deletion of an element}">>theorems.tex
+ @printf '\\section{Insertion and deletion of an element}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/insdel theorems.tex
- @echo "\section{The {\tt CHOICE} and {\tt REST} functions}">>theorems.tex
+ @printf '\\section{The {\\tt CHOICE} and {\\tt REST} functions}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/chre theorems.tex
- @echo "\section{Image of a function on a set}">>theorems.tex
+ @printf '\\section{Image of a function on a set}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/image theorems.tex
- @echo "\section{Mappings between sets}">>theorems.tex
+ @printf '\\section{Mappings between sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/fun theorems.tex
- @echo "\section{Singleton sets}">>theorems.tex
+ @printf '\\section{Singleton sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/sing theorems.tex
- @echo "\section{Finite and infinite sets}">>theorems.tex
+ @printf '\\section{Finite and infinite sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/fin theorems.tex
- @echo "\section{Cardinality of sets}">>theorems.tex
+ @printf '\\section{Cardinality of sets}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/card theorems.tex
index:
--- hol88-2.02.19940316.orig/Library/sets/Manual/entries.tex
+++ hol88-2.02.19940316/Library/sets/Manual/entries.tex
@@ -1,7 +1,4 @@
-\chapter{ML Functions in the sets Library}
-\label{entries}
-\input{entries-intro}
-\DOC{DELETE\_CONV}
+\chapter{ML Functions in the sets Library}\label{entries}\input{entries-intro}\DOC{DELETE\_CONV}
\TYPE {\small\verb%DELETE_CONV : conv -> conv%}\egroup
@@ -204,6 +201,84 @@ for some {\small\verb%ri%}.
\ENDDOC
+\DOC{IN\_CONV}
+
+\TYPE {\small\verb%IN_CONV : conv -> conv%}\egroup
+
+\SYNOPSIS
+Decision procedure for membership in finite sets.
+
+\DESCRIBE
+The function {\small\verb%IN_CONV%} is a parameterized conversion for proving or disproving
+membership assertions of the general form:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ "t IN {t1,...,tn}"
+\end{verbatim}
+}
+\noindent where {\small\verb%{t1,...,tn}%} is a set of type {\small\verb%(ty)set%} and {\small\verb%t%} is a value
+of the base type {\small\verb%ty%}. The first argument to {\small\verb%IN_CONV%} is expected to be a
+conversion that decides equality between values of the base type {\small\verb%ty%}. Given
+an equation {\small\verb%"e1 = e2"%}, where {\small\verb%e1%} and {\small\verb%e2%} are terms of type {\small\verb%ty%}, this
+conversion should return the theorem {\small\verb%|- (e1 = e2) = T%} or the theorem
+{\small\verb%|- (e1 = e2) = F%}, as appropriate.
+
+Given such a conversion, the function {\small\verb%IN_CONV%} returns a conversion that
+maps a term of the form {\small\verb%"t IN {t1,...,tn}"%} to the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- t IN {t1,...,tn} = T
+\end{verbatim}
+}
+
+\noindent if {\small\verb%t%} is alpha-equivalent to any {\small\verb%ti%}, or if the supplied conversion
+proves {\small\verb%|- (t = ti) = T%} for any {\small\verb%ti%}. If the supplied conversion proves
+{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}, then the result is the theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ |- t IN {t1,...,tn} = F
+\end{verbatim}
+}
+\noindent In all other cases, {\small\verb%IN_CONV%} will fail.
+
+\EXAMPLE
+In the following example, the conversion {\small\verb%num_EQ_CONV%} is supplied as a
+parameter and used to test equality of the candidate element {\small\verb%1%} with the
+actual elements of the given set.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #IN_CONV num_EQ_CONV "2 IN {0,SUC 1,3}";;
+ |- 2 IN {0,SUC 1,3} = T
+\end{verbatim}
+}
+\noindent The result is {\small\verb%T%} because {\small\verb%num_EQ_CONV%} is able to prove that {\small\verb%2%} is
+equal to {\small\verb%SUC 1%}. An example of a negative result is:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #IN_CONV num_EQ_CONV "1 IN {0,2,3}";;
+ |- 1 IN {0,2,3} = F
+\end{verbatim}
+}
+\noindent Finally the behaviour of the supplied conversion is irrelevant when
+the value to be tested for membership is alpha-equivalent to an actual element:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #IN_CONV NO_CONV "1 IN {3,2,1}";;
+ |- 1 IN {3,2,1} = T
+\end{verbatim}
+}
+\noindent The conversion {\small\verb%NO_CONV%} always fails, but {\small\verb%IN_CONV%} is nontheless
+able in this case to prove the required result.
+
+\FAILURE
+{\small\verb%IN_CONV conv%} fails if applied to a term that is not of the form {\small\verb%"t IN
+{t1,...,tn}"%}. A call {\small\verb%IN_CONV conv "t IN {t1,...,tn}"%} fails unless the
+term {\small\verb%t%} is alpha-equivalent to some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
+{\small\verb%|- (t = ti) = T%} for some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
+{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}.
+
+\ENDDOC
+
\DOC{INSERT\_CONV}
\TYPE {\small\verb%INSERT_CONV : conv -> conv%}\egroup
@@ -290,84 +365,6 @@ DELETE_CONV.
\ENDDOC
-\DOC{IN\_CONV}
-
-\TYPE {\small\verb%IN_CONV : conv -> conv%}\egroup
-
-\SYNOPSIS
-Decision procedure for membership in finite sets.
-
-\DESCRIBE
-The function {\small\verb%IN_CONV%} is a parameterized conversion for proving or disproving
-membership assertions of the general form:
-{\par\samepage\setseps\small
-\begin{verbatim}
- "t IN {t1,...,tn}"
-\end{verbatim}
-}
-\noindent where {\small\verb%{t1,...,tn}%} is a set of type {\small\verb%(ty)set%} and {\small\verb%t%} is a value
-of the base type {\small\verb%ty%}. The first argument to {\small\verb%IN_CONV%} is expected to be a
-conversion that decides equality between values of the base type {\small\verb%ty%}. Given
-an equation {\small\verb%"e1 = e2"%}, where {\small\verb%e1%} and {\small\verb%e2%} are terms of type {\small\verb%ty%}, this
-conversion should return the theorem {\small\verb%|- (e1 = e2) = T%} or the theorem
-{\small\verb%|- (e1 = e2) = F%}, as appropriate.
-
-Given such a conversion, the function {\small\verb%IN_CONV%} returns a conversion that
-maps a term of the form {\small\verb%"t IN {t1,...,tn}"%} to the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- t IN {t1,...,tn} = T
-\end{verbatim}
-}
-
-\noindent if {\small\verb%t%} is alpha-equivalent to any {\small\verb%ti%}, or if the supplied conversion
-proves {\small\verb%|- (t = ti) = T%} for any {\small\verb%ti%}. If the supplied conversion proves
-{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}, then the result is the theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- |- t IN {t1,...,tn} = F
-\end{verbatim}
-}
-\noindent In all other cases, {\small\verb%IN_CONV%} will fail.
-
-\EXAMPLE
-In the following example, the conversion {\small\verb%num_EQ_CONV%} is supplied as a
-parameter and used to test equality of the candidate element {\small\verb%1%} with the
-actual elements of the given set.
-{\par\samepage\setseps\small
-\begin{verbatim}
- #IN_CONV num_EQ_CONV "2 IN {0,SUC 1,3}";;
- |- 2 IN {0,SUC 1,3} = T
-\end{verbatim}
-}
-\noindent The result is {\small\verb%T%} because {\small\verb%num_EQ_CONV%} is able to prove that {\small\verb%2%} is
-equal to {\small\verb%SUC 1%}. An example of a negative result is:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #IN_CONV num_EQ_CONV "1 IN {0,2,3}";;
- |- 1 IN {0,2,3} = F
-\end{verbatim}
-}
-\noindent Finally the behaviour of the supplied conversion is irrelevant when
-the value to be tested for membership is alpha-equivalent to an actual element:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #IN_CONV NO_CONV "1 IN {3,2,1}";;
- |- 1 IN {3,2,1} = T
-\end{verbatim}
-}
-\noindent The conversion {\small\verb%NO_CONV%} always fails, but {\small\verb%IN_CONV%} is nontheless
-able in this case to prove the required result.
-
-\FAILURE
-{\small\verb%IN_CONV conv%} fails if applied to a term that is not of the form {\small\verb%"t IN
-{t1,...,tn}"%}. A call {\small\verb%IN_CONV conv "t IN {t1,...,tn}"%} fails unless the
-term {\small\verb%t%} is alpha-equivalent to some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
-{\small\verb%|- (t = ti) = T%} for some {\small\verb%ti%}, or {\small\verb%conv "t = ti"%} returns
-{\small\verb%|- (t = ti) = F%} for every {\small\verb%ti%}.
-
-\ENDDOC
-
\DOC{SET\_INDUCT\_TAC}
\TYPE {\small\verb%SET_INDUCT_TAC : tactic%}\egroup
--- hol88-2.02.19940316.orig/Library/unwind/Manual/Makefile
+++ hol88-2.02.19940316/Library/unwind/Manual/Makefile
@@ -26,16 +26,16 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the unwind Library}">entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the unwind Library}'>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
index:
--- hol88-2.02.19940316.orig/Library/unwind/Manual/entries.tex
+++ hol88-2.02.19940316/Library/unwind/Manual/entries.tex
@@ -1,6 +1,4 @@
-\chapter{ML Functions in the unwind Library}
-\input{entries-intro}
-\DOC{CONJ\_FORALL\_CONV}
+\chapter{ML Functions in the unwind Library}\input{entries-intro}\DOC{CONJ\_FORALL\_CONV}
\TYPE {\small\verb%CONJ_FORALL_CONV : conv%}\egroup
--- hol88-2.02.19940316.orig/Library/abs_theory/Manual/Makefile
+++ hol88-2.02.19940316/Library/abs_theory/Manual/Makefile
@@ -15,13 +15,13 @@ all:; make clean; make ids; make abs_the
clean:; \
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg entries.tex; \
- echo "\begin{theindex}" >index.tex; \
- echo "\mbox{}" >>index.tex; \
- echo "\end{theindex}" >>index.tex
+ printf '\\begin{theindex}' >index.tex; \
+ printf '\\mbox{}' >>index.tex; \
+ printf '\\end{theindex}' >>index.tex
ids:; \
- echo "\chapter{ML Functions in the {\tt abs\_theory} Library}" >entries.tex; \
- echo "\input{entries-intro}" >>entries.tex; \
+ printf '\\chapter{ML Functions in the {\\tt abs\\_theory} Library}' >entries.tex; \
+ printf '\\input{entries-intro}' >>entries.tex; \
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
index:; \
--- hol88-2.02.19940316.orig/Library/arith/Manual/Makefile
+++ hol88-2.02.19940316/Library/arith/Manual/Makefile
@@ -26,16 +26,16 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the arith Library}">entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the arith Library}'>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
index:
--- hol88-2.02.19940316.orig/Library/arith/Manual/entries.tex
+++ hol88-2.02.19940316/Library/arith/Manual/entries.tex
@@ -1,6 +1,4 @@
-\chapter{ML Functions in the arith Library}
-\input{entries-intro}
-\DOC{ARITH\_CONV}
+\chapter{ML Functions in the arith Library}\input{entries-intro}\DOC{ARITH\_CONV}
\TYPE {\small\verb%ARITH_CONV : conv%}\egroup
--- hol88-2.02.19940316.orig/Library/res_quan/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/res_quan/Manual/theorems.tex
@@ -1,6 +1,4 @@
-\chapter{Pre-proved Theorems}
-\input{theorems-intro}
-\THEOREM DISJ\_RESQ\_EXISTS\_DIST res\_quan
+\chapter{Pre-proved Theorems}\input{theorems-intro}\THEOREM DISJ\_RESQ\_EXISTS\_DIST res\_quan
|- !P Q R.
(?i :: \i. P i \/ Q i. R i) = (?i :: P. R i) \/ (?i :: Q. R i)
\ENDTHEOREM
--- hol88-2.02.19940316.orig/Library/res_quan/Manual/Makefile
+++ hol88-2.02.19940316/Library/res_quan/Manual/Makefile
@@ -27,22 +27,22 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: theorems functions
@echo "TeX files made"
functions:
- @echo "\chapter{ML Functions in the {\tt res\_quan} Library}">entries.tex
- @echo "\label{entries}">>entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the {\\tt res\\_quan} Library}'>entries.tex
+ @printf '\\label{entries}'>>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms theorems.tex
index:
--- hol88-2.02.19940316.orig/Library/res_quan/Manual/entries.tex
+++ hol88-2.02.19940316/Library/res_quan/Manual/entries.tex
@@ -1,6 +1,142 @@
-\chapter{ML Functions in the {\tt res\_quan} Library}
-\label{entries}
-\input{entries-intro}
+\chapter{ML Functions in the {\tt res\_quan} Library}\label{entries}\input{entries-intro}\DOC{COND\_REWR\_CANON}
+
+\TYPE {\small\verb%COND_REWR_CANON : thm -> thm%}\egroup
+
+\SYNOPSIS
+Transform a theorem into a form accepted by {\small\verb%COND_REWR_TAC%}.
+
+\DESCRIBE
+{\small\verb%COND_REWR_CANON%} transforms a theorem into a form accepted by {\small\verb%COND_REWR_TAC%}.
+The input theorem should be an implication of the following form
+{\par\samepage\setseps\small
+\begin{verbatim}
+ !x1 ... xn. P1[xi] ==> ... ==> !y1 ... ym. Pr[xi,yi] ==>
+ (!z1 ... zk. u[xi,yi,zi] = v[xi,yi,zi])
+\end{verbatim}
+}
+\noindent where each antecedent {\small\verb%Pi%} itself may be a conjunction or
+disjunction. The output theorem will have all universal quantifications
+moved to the outer most level with possible renaming to prevent
+variable capture, and have all antecedents which are a conjunction
+transformed to implications. The output theorem will be in the
+following form
+{\par\samepage\setseps\small
+\begin{verbatim}
+ !x1 ... xn y1 ... ym z1 ... zk.
+ P11[xi] ==> ... ==> P1p[xi] ==> ... ==>
+ Pr1[xi,yi] ==> ... ==> Prq[x1,yi] ==> (u[xi,yi,zi] = v[xi,yi,zi])
+\end{verbatim}
+}
+
+\FAILURE
+This function fails if the input theorem is not in the correct form.
+
+\EXAMPLE
+{\small\verb%COND_REWR_CANON%} transforms the built-in theorem {\small\verb%CANCL_SUB%} into the
+form for conditional rewriting:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #COND_REWR_CANON CANCEL_SUB;;
+ Theorem CANCEL_SUB autoloading from theory `arithmetic` ...
+ CANCEL_SUB = |- !p n m. p <= n /\ p <= m ==> ((n - p = m - p) = (n = m))
+
+ |- !p n m. p <= n ==> p <= m ==> ((n - p = m - p) = (n = m))
+\end{verbatim}
+}
+
+\SEEALSO
+COND_REWRITE1_TAC, COND_REWR_TAC, COND_REWRITE1_CONV, COND_REWR_CONV,
+search_top_down.
+
+\ENDDOC
+
+\DOC{COND\_REWR\_CONV}
+
+{\small
+\begin{verbatim}
+COND_REWR_CONV : ((term -> term ->
+ ((term # term) list # (type # type) list) list) -> thm -> conv)
+\end{verbatim}
+}\egroup
+
+\SYNOPSIS
+A lower level conversion implementing simple conditional rewriting.
+
+\DESCRIBE
+{\small\verb%COND_REWR_CONV%} is one of the basic building blocks for the
+implementation of the simple conditional rewriting conversions in the
+HOL system. In particular, the conditional term replacement or
+rewriting done by all the conditional
+rewriting conversions in this library is ultimately done by applications of
+{\small\verb%COND_REWR_CONV%}. The description given here for {\small\verb%COND_REWR_CONV%} may
+therefore be taken as a specification of the atomic action of
+replacing equals by equals in a term under certain conditions that
+are used in all these higher level conditional rewriting conversions.
+
+The first argument to {\small\verb%COND_REWR_CONV%} is expected to be a function
+which returns a list of matches. Each of these matches is in the form
+of the value returned by the built-in function {\small\verb%match%}. It is used to
+search the input term for instances which may be rewritten.
+
+The second argument to {\small\verb%COND_REWR_CONV%} is expected to be an
+implicative theorem in the following form:
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- !x1 ... xn. P1 ==> ... Pm ==> (Q[x1,...,xn] = R[x1,...,xn])
+\end{verbatim}
+}
+\noindent where {\small\verb%x1%}, ..., {\small\verb%xn%} are all the variables that occur free in the
+left hand side of the conclusion of the theorem but do not occur free in the
+assumptions.
+
+The last argument to {\small\verb%COND_REWR_CONV%} is the term to be rewritten.
+
+If {\small\verb%fn%} is a function and {\small\verb%th%} is an implicative theorem of the kind
+shown above, then {\small\verb%COND_REWR_CONV fn th%} will be a conversion.
+When applying to a term {\small\verb%tm%}, it will return a theorem
+{\par\samepage\setseps\small
+\begin{verbatim}
+ P1', ..., Pm' |- tm = tm[R'/Q']
+\end{verbatim}
+}
+\noindent if evaluating {\small\verb%fn Q[x1,...,xn] tm%} returns a
+non-empty list of matches.
+The assumptions of the resulting theorem are instances of the
+antecedents of the input theorem {\small\verb%th%}. The right hand side of the
+equation is obtained by rewriting the input term {\small\verb%tm%} with instances of
+the conclusion of the input theorem.
+
+\FAILURE
+{\small\verb%COND_REWR_CONV fn th%} fails if {\small\verb%th%} is not an implication of the form
+described above. If {\small\verb%th%} is such an equation, but the function {\small\verb%fn%}
+returns a null list of matches, or the function {\small\verb%fn%} returns a
+non-empty list of matches, but the term or type instantiation fails.
+
+\EXAMPLE
+The following example illustrates a straightforward use of {\small\verb%COND_REWR_CONV%}.
+We use the built-in theorem {\small\verb%LESS_MOD%} as the input theorem, and the function
+{\small\verb%search_top_down%} as the search function.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ #LESS_MOD;;
+ Theorem LESS_MOD autoloading from theory `arithmetic` ...
+ LESS_MOD = |- !n k. k < n ==> (k MOD n = k)
+
+ |- !n k. k < n ==> (k MOD n = k)
+
+ #search_top_down;;
+ - : (term -> term -> ((term # term) list # (type # type) list) list)
+
+ #COND_REWR_CONV search_top_down LESS_MOD "2 MOD 3";;
+ 2 < 3 |- 2 MOD 3 = 2
+\end{verbatim}
+}
+
+\SEEALSO
+COND_REWR_TAC, COND_REWRITE1_TAC, COND_REWRITE1_CONV, COND_REWR_CANON,
+search_top_down.
+
+\ENDDOC
\DOC{COND\_REWRITE1\_CONV}
\TYPE {\small\verb%COND_REWRITE1_CONV : (thm list -> thm -> conv)%}\egroup
@@ -147,145 +283,6 @@ COND_REWR_CANON, search_top_down.
\ENDDOC
-\DOC{COND\_REWR\_CANON}
-
-\TYPE {\small\verb%COND_REWR_CANON : thm -> thm%}\egroup
-
-\SYNOPSIS
-Transform a theorem into a form accepted by {\small\verb%COND_REWR_TAC%}.
-
-\DESCRIBE
-{\small\verb%COND_REWR_CANON%} transforms a theorem into a form accepted by {\small\verb%COND_REWR_TAC%}.
-The input theorem should be an implication of the following form
-{\par\samepage\setseps\small
-\begin{verbatim}
- !x1 ... xn. P1[xi] ==> ... ==> !y1 ... ym. Pr[xi,yi] ==>
- (!z1 ... zk. u[xi,yi,zi] = v[xi,yi,zi])
-\end{verbatim}
-}
-\noindent where each antecedent {\small\verb%Pi%} itself may be a conjunction or
-disjunction. The output theorem will have all universal quantifications
-moved to the outer most level with possible renaming to prevent
-variable capture, and have all antecedents which are a conjunction
-transformed to implications. The output theorem will be in the
-following form
-{\par\samepage\setseps\small
-\begin{verbatim}
- !x1 ... xn y1 ... ym z1 ... zk.
- P11[xi] ==> ... ==> P1p[xi] ==> ... ==>
- Pr1[xi,yi] ==> ... ==> Prq[x1,yi] ==> (u[xi,yi,zi] = v[xi,yi,zi])
-\end{verbatim}
-}
-
-\FAILURE
-This function fails if the input theorem is not in the correct form.
-
-\EXAMPLE
-{\small\verb%COND_REWR_CANON%} transforms the built-in theorem {\small\verb%CANCL_SUB%} into the
-form for conditional rewriting:
-{\par\samepage\setseps\small
-\begin{verbatim}
- #COND_REWR_CANON CANCEL_SUB;;
- Theorem CANCEL_SUB autoloading from theory `arithmetic` ...
- CANCEL_SUB = |- !p n m. p <= n /\ p <= m ==> ((n - p = m - p) = (n = m))
-
- |- !p n m. p <= n ==> p <= m ==> ((n - p = m - p) = (n = m))
-\end{verbatim}
-}
-
-\SEEALSO
-COND_REWRITE1_TAC, COND_REWR_TAC, COND_REWRITE1_CONV, COND_REWR_CONV,
-search_top_down.
-
-\ENDDOC
-
-\DOC{COND\_REWR\_CONV}
-
-{\small
-\begin{verbatim}
-COND_REWR_CONV : ((term -> term ->
- ((term # term) list # (type # type) list) list) -> thm -> conv)
-\end{verbatim}
-}\egroup
-
-\SYNOPSIS
-A lower level conversion implementing simple conditional rewriting.
-
-\DESCRIBE
-{\small\verb%COND_REWR_CONV%} is one of the basic building blocks for the
-implementation of the simple conditional rewriting conversions in the
-HOL system. In particular, the conditional term replacement or
-rewriting done by all the conditional
-rewriting conversions in this library is ultimately done by applications of
-{\small\verb%COND_REWR_CONV%}. The description given here for {\small\verb%COND_REWR_CONV%} may
-therefore be taken as a specification of the atomic action of
-replacing equals by equals in a term under certain conditions that
-are used in all these higher level conditional rewriting conversions.
-
-The first argument to {\small\verb%COND_REWR_CONV%} is expected to be a function
-which returns a list of matches. Each of these matches is in the form
-of the value returned by the built-in function {\small\verb%match%}. It is used to
-search the input term for instances which may be rewritten.
-
-The second argument to {\small\verb%COND_REWR_CONV%} is expected to be an
-implicative theorem in the following form:
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- !x1 ... xn. P1 ==> ... Pm ==> (Q[x1,...,xn] = R[x1,...,xn])
-\end{verbatim}
-}
-\noindent where {\small\verb%x1%}, ..., {\small\verb%xn%} are all the variables that occur free in the
-left hand side of the conclusion of the theorem but do not occur free in the
-assumptions.
-
-The last argument to {\small\verb%COND_REWR_CONV%} is the term to be rewritten.
-
-If {\small\verb%fn%} is a function and {\small\verb%th%} is an implicative theorem of the kind
-shown above, then {\small\verb%COND_REWR_CONV fn th%} will be a conversion.
-When applying to a term {\small\verb%tm%}, it will return a theorem
-{\par\samepage\setseps\small
-\begin{verbatim}
- P1', ..., Pm' |- tm = tm[R'/Q']
-\end{verbatim}
-}
-\noindent if evaluating {\small\verb%fn Q[x1,...,xn] tm%} returns a
-non-empty list of matches.
-The assumptions of the resulting theorem are instances of the
-antecedents of the input theorem {\small\verb%th%}. The right hand side of the
-equation is obtained by rewriting the input term {\small\verb%tm%} with instances of
-the conclusion of the input theorem.
-
-\FAILURE
-{\small\verb%COND_REWR_CONV fn th%} fails if {\small\verb%th%} is not an implication of the form
-described above. If {\small\verb%th%} is such an equation, but the function {\small\verb%fn%}
-returns a null list of matches, or the function {\small\verb%fn%} returns a
-non-empty list of matches, but the term or type instantiation fails.
-
-\EXAMPLE
-The following example illustrates a straightforward use of {\small\verb%COND_REWR_CONV%}.
-We use the built-in theorem {\small\verb%LESS_MOD%} as the input theorem, and the function
-{\small\verb%search_top_down%} as the search function.
-{\par\samepage\setseps\small
-\begin{verbatim}
- #LESS_MOD;;
- Theorem LESS_MOD autoloading from theory `arithmetic` ...
- LESS_MOD = |- !n k. k < n ==> (k MOD n = k)
-
- |- !n k. k < n ==> (k MOD n = k)
-
- #search_top_down;;
- - : (term -> term -> ((term # term) list # (type # type) list) list)
-
- #COND_REWR_CONV search_top_down LESS_MOD "2 MOD 3";;
- 2 < 3 |- 2 MOD 3 = 2
-\end{verbatim}
-}
-
-\SEEALSO
-COND_REWR_TAC, COND_REWRITE1_TAC, COND_REWRITE1_CONV, COND_REWR_CANON,
-search_top_down.
-
-\ENDDOC
\DOC{COND\_REWR\_TAC}
{\small
@@ -553,6 +550,36 @@ choice quantification.
mk_resq_select, is_resq_select, strip_resq_select.
\ENDDOC
+\DOC{GQSPEC\_ALL}
+
+\TYPE {\small\verb%GQSPEC_ALL : (thm -> thm)%}\egroup
+
+\SYNOPSIS
+Specializes the conclusion of a theorem with its own quantified variables.
+
+\DESCRIBE
+When applied to a theorem whose conclusion has zero or more
+ordinary or restricted universal quantifications,
+the inference rule {\small\verb%GQSPEC_ALL%} returns a theorem which is the result
+of specializing the quantified variables with its own variables. If this
+will cause name clashes, a variant of the variable is used instead.
+Normally {\small\verb%xi'%} is just {\small\verb%xi%}, in which case {\small\verb%GQSPEC_ALL%} simply removes
+all universal quantifiers.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- !x1::P1. ...!xk. ... !xn::Pn. t
+ ------------------------------------------------------ GQSPEC_ALL
+ A,P1 x1,...,Pn xn |- t[x1'/x1]...[xk'/xk]...[xn'/xn]
+\end{verbatim}
+}
+\FAILURE
+Never fails.
+
+\SEEALSO
+GQSPEC, GQSPECL, SPEC, SPECL, SPEC_ALL, RESQ_GEN, RESQ_GENL,
+RESQ_GEN_ALL, RESQ_GEN_TAC, RESQ_SPEC, RESQ_SPECL, RESQ_SPEC_ALL.
+
+\ENDDOC
\DOC{GQSPECL}
\TYPE {\small\verb%GQSPECL : (term list -> thm -> thm)%}\egroup
@@ -588,36 +615,6 @@ GQSPEC, GQSPEC_ALL, SPECL, GENL, RESQ_GE
RESQ_GEN_TAC, RESQ_SPEC, RESQ_SPECL, RESQ_SPEC_ALL.
\ENDDOC
-\DOC{GQSPEC\_ALL}
-
-\TYPE {\small\verb%GQSPEC_ALL : (thm -> thm)%}\egroup
-
-\SYNOPSIS
-Specializes the conclusion of a theorem with its own quantified variables.
-
-\DESCRIBE
-When applied to a theorem whose conclusion has zero or more
-ordinary or restricted universal quantifications,
-the inference rule {\small\verb%GQSPEC_ALL%} returns a theorem which is the result
-of specializing the quantified variables with its own variables. If this
-will cause name clashes, a variant of the variable is used instead.
-Normally {\small\verb%xi'%} is just {\small\verb%xi%}, in which case {\small\verb%GQSPEC_ALL%} simply removes
-all universal quantifiers.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- !x1::P1. ...!xk. ... !xn::Pn. t
- ------------------------------------------------------ GQSPEC_ALL
- A,P1 x1,...,Pn xn |- t[x1'/x1]...[xk'/xk]...[xn'/xn]
-\end{verbatim}
-}
-\FAILURE
-Never fails.
-
-\SEEALSO
-GQSPEC, GQSPECL, SPEC, SPECL, SPEC_ALL, RESQ_GEN, RESQ_GENL,
-RESQ_GEN_ALL, RESQ_GEN_TAC, RESQ_SPEC, RESQ_SPECL, RESQ_SPEC_ALL.
-
-\ENDDOC
\DOC{IMP\_RESQ\_FORALL\_CONV}
\TYPE {\small\verb%IMP_RESQ_FORALL_CONV : conv%}\egroup
@@ -1216,6 +1213,31 @@ Fails if applied to a term not of the co
RESQ_FORALL_CONV.
\ENDDOC
+\DOC{RESQ\_GEN\_ALL}
+
+\TYPE {\small\verb%RESQ_GEN_ALL : (thm -> thm)%}\egroup
+
+\SYNOPSIS
+Generalizes the conclusion of a theorem over its own assumptions.
+
+\DESCRIBE
+When applied to a theorem {\small\verb%A |- t%}, the inference rule {\small\verb%RESQ_GEN_ALL%} returns
+the theorem {\small\verb%A' |- !x1::P1. ...!xn::Pn. t%}, where the {\small\verb%Pi xi%} are in the
+assumptions.
+{\par\samepage\setseps\small
+\begin{verbatim}
+ A |- t
+ ------------------------------------------------ RESQ_GEN_ALL
+ A - (P1 x1,...,Pn xn) |- !x1::P1. ... !xn::Pn. t
+\end{verbatim}
+}
+\FAILURE
+Never fails.
+
+\SEEALSO
+RESQ_GEN, RESQ_GENL, GEN_ALL, RESQ_SPEC, RESQ_SPECL, RESQ_SPEC_ALL.
+
+\ENDDOC
\DOC{RESQ\_GEN}
\TYPE {\small\verb%RESQ_GEN : ((term # term) -> thm -> thm)%}\egroup
@@ -1274,31 +1296,6 @@ free in the assumption list except in {\
RESQ_GEN, RESQ_GEN_ALL, RESQ_GEN_TAC, RESQ_SPEC, RESQ_SPECL, RESQ_SPEC_ALL.
\ENDDOC
-\DOC{RESQ\_GEN\_ALL}
-
-\TYPE {\small\verb%RESQ_GEN_ALL : (thm -> thm)%}\egroup
-
-\SYNOPSIS
-Generalizes the conclusion of a theorem over its own assumptions.
-
-\DESCRIBE
-When applied to a theorem {\small\verb%A |- t%}, the inference rule {\small\verb%RESQ_GEN_ALL%} returns
-the theorem {\small\verb%A' |- !x1::P1. ...!xn::Pn. t%}, where the {\small\verb%Pi xi%} are in the
-assumptions.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- t
- ------------------------------------------------ RESQ_GEN_ALL
- A - (P1 x1,...,Pn xn) |- !x1::P1. ... !xn::Pn. t
-\end{verbatim}
-}
-\FAILURE
-Never fails.
-
-\SEEALSO
-RESQ_GEN, RESQ_GENL, GEN_ALL, RESQ_SPEC, RESQ_SPECL, RESQ_SPEC_ALL.
-
-\ENDDOC
\DOC{RESQ\_GEN\_TAC}
\TYPE {\small\verb%RESQ_GEN_TAC : tactic%}\egroup
@@ -1571,6 +1568,40 @@ RESQ_IMP_RES_TAC, RESQ_IMP_RES_THEN, RES
IMP_RES_THEN, IMP_RES_TAC, MATCH_MP, RES_CANON, RES_TAC, RES_THEN.
\ENDDOC
+\DOC{RESQ\_REWR\_CANON}
+
+\TYPE {\small\verb%RESQ_REWR_CANON : thm -> thm%}\egroup
+
+\SYNOPSIS
+Transform a theorem into a form accepted for rewriting.
+
+\DESCRIBE
+{\small\verb%RESQ_REWR_CANON%} transforms a theorem into a form accepted by {\small\verb%COND_REWR_TAC%}.
+The input theorem should be headed by a series of restricted universal
+quantifications in the following form
+{\par\samepage\setseps\small
+\begin{verbatim}
+ !x1::P1. ... !xn::Pn. u[xi] = v[xi])
+\end{verbatim}
+}
+\noindent Other variables occurring in {\small\verb%u%} and {\small\verb%v%} may be universally quantified.
+The output theorem will have all ordinary universal quantifications
+moved to the outer most level with possible renaming to prevent
+variable capture, and have all restricted universal quantifications
+converted to implications. The output theorem will be in the
+form accepted by {\small\verb%COND_REWR_TAC%}.
+
+\FAILURE
+This function fails is the input theorem is not in the correct form.
+
+
+\SEEALSO
+RESQ_REWRITE1_TAC, RESQ_REWRITE1_CONV,
+COND_REWR_CANON, COND_REWR_TAC, COND_REWR_CONV,.
+
+
+\ENDDOC
+
\DOC{RESQ\_REWRITE1\_CONV}
\TYPE {\small\verb%RESQ_REWRITE1_CONV : thm list -> thm -> conv%}\egroup
@@ -1656,40 +1687,38 @@ COND_REWRITE1_CONV, COND_REWR_CONV, COND
\ENDDOC
-\DOC{RESQ\_REWR\_CANON}
+\DOC{RESQ\_SPEC\_ALL}
-\TYPE {\small\verb%RESQ_REWR_CANON : thm -> thm%}\egroup
+\TYPE {\small\verb%RESQ_SPEC_ALL : (thm -> thm)%}\egroup
\SYNOPSIS
-Transform a theorem into a form accepted for rewriting.
+Specializes the conclusion of a theorem with its own restricted
+quantified variables.
\DESCRIBE
-{\small\verb%RESQ_REWR_CANON%} transforms a theorem into a form accepted by {\small\verb%COND_REWR_TAC%}.
-The input theorem should be headed by a series of restricted universal
-quantifications in the following form
+When applied to a theorem {\small\verb%A |- !x1::P1. ...!xn::Pn. t%},
+the inference rule {\small\verb%RESQ_SPEC_ALL%}
+returns the theorem {\small\verb%A,P1 x1',...,Pn xn' |- t[x1'/x1]...[xn'/xn]%}
+ where the {\small\verb%xi'%} are distinct
+variants of the corresponding {\small\verb%xi%}, chosen to avoid clashes with any variables
+free in the assumption list and with the names of constants. Normally {\small\verb%xi'%} is
+just {\small\verb%xi%}, in which case {\small\verb%RESQ_SPEC_ALL%} simply removes all restricted
+ universal quantifiers.
{\par\samepage\setseps\small
\begin{verbatim}
- !x1::P1. ... !xn::Pn. u[xi] = v[xi])
+ A |- !x1::P1. ... !xn::Pn. t
+ ------------------------------------------- RESQ_SPEC_ALL
+ A,P1 x1,...,Pn xn |- t[x1'/x1]...[xn'/xn]
\end{verbatim}
}
-\noindent Other variables occurring in {\small\verb%u%} and {\small\verb%v%} may be universally quantified.
-The output theorem will have all ordinary universal quantifications
-moved to the outer most level with possible renaming to prevent
-variable capture, and have all restricted universal quantifications
-converted to implications. The output theorem will be in the
-form accepted by {\small\verb%COND_REWR_TAC%}.
\FAILURE
-This function fails is the input theorem is not in the correct form.
-
+Never fails.
\SEEALSO
-RESQ_REWRITE1_TAC, RESQ_REWRITE1_CONV,
-COND_REWR_CANON, COND_REWR_TAC, COND_REWR_CONV,.
-
+RESQ_GEN, RESQ_GENL, RESQ_GEN_ALL, RESQ_GEN_TAC, RESQ_SPEC, RESQ_SPECL.
\ENDDOC
-
\DOC{RESQ\_SPEC}
\TYPE {\small\verb%RESQ_SPEC : (term -> thm -> thm)%}\egroup
@@ -1769,38 +1798,6 @@ restricted universally quantified variab
RESQ_GEN, RESQ_GENL, RESQ_GEN_ALL, RESQ_GEN_TAC, RESQ_SPEC, RESQ_SPEC_ALL.
\ENDDOC
-\DOC{RESQ\_SPEC\_ALL}
-
-\TYPE {\small\verb%RESQ_SPEC_ALL : (thm -> thm)%}\egroup
-
-\SYNOPSIS
-Specializes the conclusion of a theorem with its own restricted
-quantified variables.
-
-\DESCRIBE
-When applied to a theorem {\small\verb%A |- !x1::P1. ...!xn::Pn. t%},
-the inference rule {\small\verb%RESQ_SPEC_ALL%}
-returns the theorem {\small\verb%A,P1 x1',...,Pn xn' |- t[x1'/x1]...[xn'/xn]%}
- where the {\small\verb%xi'%} are distinct
-variants of the corresponding {\small\verb%xi%}, chosen to avoid clashes with any variables
-free in the assumption list and with the names of constants. Normally {\small\verb%xi'%} is
-just {\small\verb%xi%}, in which case {\small\verb%RESQ_SPEC_ALL%} simply removes all restricted
- universal quantifiers.
-{\par\samepage\setseps\small
-\begin{verbatim}
- A |- !x1::P1. ... !xn::Pn. t
- ------------------------------------------- RESQ_SPEC_ALL
- A,P1 x1,...,Pn xn |- t[x1'/x1]...[xn'/xn]
-\end{verbatim}
-}
-
-\FAILURE
-Never fails.
-
-\SEEALSO
-RESQ_GEN, RESQ_GENL, RESQ_GEN_ALL, RESQ_GEN_TAC, RESQ_SPEC, RESQ_SPECL.
-
-\ENDDOC
\DOC{search\_top\_down}
{\small
--- hol88-2.02.19940316.orig/Library/more_arithmetic/Manual/theorems.tex
+++ hol88-2.02.19940316/Library/more_arithmetic/Manual/theorems.tex
@@ -1,7 +1,4 @@
-\chapter{Pre-proved Theorems}\label{thms}
-\input{theorems-intro}
-\section{Theorems about Inequalities}
-\THEOREM GEN\_INDUCTION ineq
+\chapter{Pre-proved Theorems}\label{thms}\input{theorems-intro}\section{Theorems about Inequalities}\THEOREM GEN\_INDUCTION ineq
|- !P. P 0 /\ (!n. (!m. m < n ==> P m) ==> P n) ==> (!n. P n)
\ENDTHEOREM
\THEOREM GREATER\_EQ\_ANTISYM ineq
@@ -19,8 +16,7 @@
\THEOREM NOT\_LESS\_AND\_GREATER ineq
|- !n m. n < m ==> ~m < n
\ENDTHEOREM
-\section{Theorems about {\tt 0}}
-\THEOREM GREATER\_NOT\_ZERO zero\_ineq
+\section{Theorems about {\tt 0}}\THEOREM GREATER\_NOT\_ZERO zero\_ineq
|- !x. 0 < x ==> ~(x = 0)
\ENDTHEOREM
\THEOREM LESS1EQ0 zero\_ineq
@@ -38,8 +34,7 @@
\THEOREM NOT\_EQ\_0 zero\_ineq
|- !m. ~(m = 0) ==> m >= 1
\ENDTHEOREM
-\section{Theorems about {\tt SUC}}
-\THEOREM LESS\_EQ\_LESS\_SUC suc
+\section{Theorems about {\tt SUC}}\THEOREM LESS\_EQ\_LESS\_SUC suc
|- !m n. m <= n = m < (SUC n)
\ENDTHEOREM
\THEOREM NOT\_0\_GREATER\_EQ\_SUC suc
@@ -63,8 +58,7 @@
\THEOREM SUC\_NOT\_0 suc
|- !n. ~(SUC n = 0)
\ENDTHEOREM
-\section{Theorems about {\tt PRE}}
-\THEOREM LESS\_IMP\_LESS\_EQ\_PRE pre
+\section{Theorems about {\tt PRE}}\THEOREM LESS\_IMP\_LESS\_EQ\_PRE pre
|- !m n. 0 < n ==> (m < n = m <= (PRE n))
\ENDTHEOREM
\THEOREM PRE\_ADD pre
@@ -94,31 +88,30 @@
\THEOREM SUC\_PRE pre
|- !n. 0 < n ==> (SUC(PRE n) = n)
\ENDTHEOREM
-\section{Theorems about Addition}
+\section{Theorems about Addition}\THEOREM ADD\_EQ\_LESS\_EQ add
+|- !m n p. (m + n = p) ==> m <= p
+\ENDTHEOREM
+\THEOREM ADD\_EQ\_LESS\_IMP\_LESS add
+|- !n m k l. (k + m = l + n) /\ k < l ==> n < m
+\ENDTHEOREM
+\THEOREM ADD\_GREATER\_EQ add
+|- !m n. (m + n) >= m
+\ENDTHEOREM
\THEOREM ADDL\_GREATER add
|- !m n p. m < n ==> m < (p + n)
\ENDTHEOREM
\THEOREM ADDL\_GREATER\_EQ add
|- !m n p. m <= n ==> m <= (p + n)
\ENDTHEOREM
+\THEOREM ADD\_MONO\_LESS add
+|- !m n p. (m + p) < (m + n) = p < n
+\ENDTHEOREM
\THEOREM ADDR\_GREATER add
|- !m n p. m < n ==> m < (n + p)
\ENDTHEOREM
\THEOREM ADDR\_GREATER\_EQ add
|- !m n p. m <= n ==> m <= (n + p)
\ENDTHEOREM
-\THEOREM ADD\_EQ\_LESS\_EQ add
-|- !m n p. (m + n = p) ==> m <= p
-\ENDTHEOREM
-\THEOREM ADD\_EQ\_LESS\_IMP\_LESS add
-|- !n m k l. (k + m = l + n) /\ k < l ==> n < m
-\ENDTHEOREM
-\THEOREM ADD\_GREATER\_EQ add
-|- !m n. (m + n) >= m
-\ENDTHEOREM
-\THEOREM ADD\_MONO\_LESS add
-|- !m n p. (m + p) < (m + n) = p < n
-\ENDTHEOREM
\THEOREM ADD\_SUC\_0 add
|- !m. SUC m = (SUC 0) + m
\ENDTHEOREM
@@ -174,8 +167,7 @@
\THEOREM SUM\_LESS add
|- !m n p. (m + n) < p ==> m < p /\ n < p
\ENDTHEOREM
-\section{Theorems about Subtraction}
-\THEOREM ADD\_EQ\_IMP\_SUB\_EQ sub
+\section{Theorems about Subtraction}\THEOREM ADD\_EQ\_IMP\_SUB\_EQ sub
|- !a b c. (a = b + c) ==> (a - b = c)
\ENDTHEOREM
\THEOREM ADD\_LESS\_EQ\_SUB sub
@@ -253,6 +245,9 @@
\THEOREM SUB\_GREATER\_EQ\_ADD sub
|- !n m p. p >= n ==> ((p - n) >= m = p >= (n + m))
\ENDTHEOREM
+\THEOREM SUB\_LE\_ADD sub
+|- !n m p. n <= p ==> (m <= (p - n) = (n + m) <= p)
+\ENDTHEOREM
\THEOREM SUB\_LESS\_BOTH\_SIDES sub
|- !m n p. p <= m /\ m < n ==> (m - p) < (n - p)
\ENDTHEOREM
@@ -268,9 +263,6 @@
\THEOREM SUB\_LESS\_TO\_LESS\_ADDR sub
|- !m n p. p <= m ==> ((m - p) < n = m < (n + p))
\ENDTHEOREM
-\THEOREM SUB\_LE\_ADD sub
-|- !n m p. n <= p ==> (m <= (p - n) = (n + m) <= p)
-\ENDTHEOREM
\THEOREM SUB\_PRE\_SUB\_1 sub
|- !a b. 0 < b ==> ((a - (PRE b)) - 1 = a - b)
\ENDTHEOREM
@@ -288,8 +280,7 @@
(m < n ==> ((SUC m) - n = 0)) /\
(~m < n ==> ((SUC m) - n = SUC(m - n)))
\ENDTHEOREM
-\section{Theorems about Multiplication and Exponential Functions}
-\THEOREM EXP1 mult
+\section{Theorems about Multiplication and Exponential Functions}\THEOREM EXP1 mult
|- !n. n EXP 1 = n
\ENDTHEOREM
\THEOREM LESS\_MONO\_MULT1 mult
@@ -310,8 +301,7 @@
\THEOREM ZERO\_LESS\_TWO\_EXP mult
|- !n. 0 < (2 EXP n)
\ENDTHEOREM
-\section{Theorems about Division}
-\THEOREM ADD\_DIV\_ADD\_DIV div\_mod
+\section{Theorems about Division}\THEOREM ADD\_DIV\_ADD\_DIV div\_mod
|- !n. 0 < n ==> (!x r. ((x * n) + r) DIV n = x + (r DIV n))
\ENDTHEOREM
\THEOREM ADD\_DIV\_SUC\_DIV div\_mod
@@ -349,8 +339,7 @@
\THEOREM SUC\_MOD\_SELF div\_mod
|- !n. (SUC n) MOD (SUC n) = 0
\ENDTHEOREM
-\section{Theorems about Maximum and Minimum}
-\THEOREM MAX\_0 min\_max
+\section{Theorems about Maximum and Minimum}\THEOREM MAX\_0 min\_max
|- !n. MAX 0 n = n
\ENDTHEOREM
\THEOREM MAX\_DEF min\_max
@@ -386,8 +375,7 @@
\THEOREM SUC\_MIN min\_max
|- !n p. MIN(SUC n)(SUC p) = SUC(MIN n p)
\ENDTHEOREM
-\section{Theorems about Odd and Even Numbers}
-\THEOREM EVEN\_MULT odd\_even
+\section{Theorems about Odd and Even Numbers}\THEOREM EVEN\_MULT odd\_even
|- !n m. EVEN n \/ EVEN m ==> EVEN(n * m)
\ENDTHEOREM
\THEOREM EVEN\_ODD\_0 odd\_even
--- hol88-2.02.19940316.orig/Library/more_arithmetic/Manual/Makefile
+++ hol88-2.02.19940316/Library/more_arithmetic/Manual/Makefile
@@ -26,40 +26,40 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids theorems
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the more\_arithmetic Library}">entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the more\\_arithmetic Library}'>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}\label{thms}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{Theorems about Inequalities}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}\\label{thms}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{Theorems about Inequalities}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/ineq theorems.tex
- @echo "\section{Theorems about {\tt 0}}">>theorems.tex
+ @printf '\\section{Theorems about {\\tt 0}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/zero_ineq theorems.tex
- @echo "\section{Theorems about {\tt SUC}}">>theorems.tex
+ @printf '\\section{Theorems about {\\tt SUC}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/suc theorems.tex
- @echo "\section{Theorems about {\tt PRE}}">>theorems.tex
+ @printf '\\section{Theorems about {\\tt PRE}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/pre theorems.tex
- @echo "\section{Theorems about Addition}">>theorems.tex
+ @printf '\\section{Theorems about Addition}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/add theorems.tex
- @echo "\section{Theorems about Subtraction}">>theorems.tex
+ @printf '\\section{Theorems about Subtraction}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/sub theorems.tex
- @echo "\section{Theorems about Multiplication and Exponential Functions}">>theorems.tex
+ @printf '\\section{Theorems about Multiplication and Exponential Functions}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/mult theorems.tex
- @echo "\section{Theorems about Division}">>theorems.tex
+ @printf '\\section{Theorems about Division}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/div_mod theorems.tex
- @echo "\section{Theorems about Maximum and Minimum}">>theorems.tex
+ @printf '\\section{Theorems about Maximum and Minimum}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/min_max theorems.tex
- @echo "\section{Theorems about Odd and Even Numbers}">>theorems.tex
+ @printf '\\section{Theorems about Odd and Even Numbers}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/thms/odd_even theorems.tex
index:
--- hol88-2.02.19940316.orig/Library/more_arithmetic/Manual/entries.tex
+++ hol88-2.02.19940316/Library/more_arithmetic/Manual/entries.tex
@@ -1,6 +1,4 @@
-\chapter{ML Functions in the more\_arithmetic Library}
-\input{entries-intro}
-\DOC{GEN\_INDUCT\_RULE}
+\chapter{ML Functions in the more\_arithmetic Library}\input{entries-intro}\DOC{GEN\_INDUCT\_RULE}
\TYPE {\small\verb%GEN_INDUCT_RULE : (thm -> thm -> thm)%}\egroup
--- hol88-2.02.19940316.orig/Library/trs/Manual/Makefile
+++ hol88-2.02.19940316/Library/trs/Manual/Makefile
@@ -26,16 +26,16 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: ids
@echo "TeX files made"
ids:
- @echo "\chapter{ML Functions in the trs Library}">entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the trs Library}'>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/entries entries.tex
index:
--- hol88-2.02.19940316.orig/Library/trs/Manual/entries.tex
+++ hol88-2.02.19940316/Library/trs/Manual/entries.tex
@@ -1,6 +1,4 @@
-\chapter{ML Functions in the trs Library}
-\input{entries-intro}
-\DOC{Ancestors}
+\chapter{ML Functions in the trs Library}\input{entries-intro}\DOC{Ancestors}
\TYPE {\small\verb%Ancestors : ((string list # string list) -> searchpath)%}\egroup
--- hol88-2.02.19940316.orig/contrib/wordn/Manual/Makefile
+++ hol88-2.02.19940316/contrib/wordn/Manual/Makefile
@@ -26,27 +26,27 @@ default:
# ---------------------------------------------------------------------
clean:
rm -f *.dvi *.aux *.toc *.log *.idx *.ilg
- @echo "\begin{theindex}" > index.tex
- @echo "\mbox{}" >> index.tex
- @echo "\end{theindex}" >> index.tex
+ @printf '\\begin{theindex}' > index.tex
+ @printf '\\mbox{}' >> index.tex
+ @printf '\\end{theindex}' >> index.tex
tex: entries theorems
@echo "TeX files made"
entries:
- @echo "\chapter{ML Functions in the wordn Library}">entries.tex
- @echo "\label{entries}">>entries.tex
- @echo "\input{entries-intro}" >> entries.tex
+ @printf '\\chapter{ML Functions in the wordn Library}'>entries.tex
+ @printf '\\label{entries}'>>entries.tex
+ @printf '\\input{entries-intro}' >> entries.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/ENTRIES entries.tex
theorems:
- @echo "\chapter{Pre-proved Theorems}" > theorems.tex
- @echo "\input{theorems-intro}" >> theorems.tex
- @echo "\section{The theory {\tt wordn\_base}}">>theorems.tex
+ @printf '\\chapter{Pre-proved Theorems}' > theorems.tex
+ @printf '\\input{theorems-intro}' >> theorems.tex
+ @printf '\\section{The theory {\\tt wordn\\_base}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/THEOREMS/base theorems.tex
- @echo "\section{The theory {\tt wordn\_bitops}}">>theorems.tex
+ @printf '\\section{The theory {\\tt wordn\\_bitops}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/THEOREMS/bitops theorems.tex
- @echo "\section{The theory {\tt wordn\_num}}">>theorems.tex
+ @printf '\\section{The theory {\\tt wordn\\_num}}'>>theorems.tex
/bin/sh ${DOCTOTEX} ${DOCTOTEXSED} ${Help}/THEOREMS/num theorems.tex
index:
|