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
|
<html>
<head><title>MISCELLANEOUS.html -- ACL2 Version 3.1</title></head>
<body text=#000000 bgcolor="#FFFFFF">
<h1>MISCELLANEOUS</h1>a miscellany of documented functions and concepts
<code> </code> (often cited in more accessible <a href="DOCUMENTATION.html">documentation</a>)
<pre>Major Section: <a href="acl2-doc-major-topics.html">ACL2 Documentation</a>
</pre><p>
<p>
<ul>
<li><h3><a href="ABORT_bang_.html">ABORT!</a> -- to return to the top-level of ACL2's command loop
</h3>
</li>
<li><h3><a href="ACCUMULATED-PERSISTENCE.html">ACCUMULATED-PERSISTENCE</a> -- to get statistics on which <a href="RUNE.html">rune</a>s are being tried
</h3>
</li>
<li><h3><a href="ACKNOWLEDGMENTS.html">ACKNOWLEDGMENTS</a> -- some contributors to the well-being of ACL2
</h3>
</li>
<li><h3><a href="ACL2-COUNT.html">ACL2-COUNT</a> -- a commonly used measure for justifying recursion
</h3>
</li>
<li><h3><a href="ACL2-CUSTOMIZATION.html">ACL2-CUSTOMIZATION</a> -- file of initial commands for ACL2 to run at <a href="STARTUP.html">startup</a>
</h3>
</li>
<li><h3><a href="APROPOS.html">APROPOS</a> -- searching <code>:</code><code><a href="DOC.html">doc</a></code> and <code>:</code><code><a href="MORE-DOC.html">more-doc</a></code> text
</h3>
</li>
<li><h3><a href="ARRAYS.html">ARRAYS</a> -- an introduction to ACL2 arrays
</h3>
</li>
<li><h3><a href="BACKCHAIN-LIMIT.html">BACKCHAIN-LIMIT</a> -- limiting the effort expended on relieving hypotheses
</h3>
</li>
<li><h3><a href="BIBLIOGRAPHY.html">BIBLIOGRAPHY</a> -- reports about ACL2
</h3>
</li>
<li><h3><a href="BIND-FREE.html">BIND-FREE</a> -- to bind free variables of a rewrite or linear rule
</h3>
</li>
<li><h3><a href="BREAKS.html">BREAKS</a> -- Common Lisp breaks
</h3>
</li>
<li><h3><a href="BY.html">BY</a> -- hints keyword <code>:BY</code>
</h3>
</li>
<li><h3><a href="CASE-SPLIT.html">CASE-SPLIT</a> -- like force but immediately splits the top-level goal on the hypothesis
</h3>
</li>
<li><h3><a href="CASE-SPLIT-LIMITATIONS.html">CASE-SPLIT-LIMITATIONS</a> -- a list of two ``numbers'' limiting the number of cases produced at once
</h3>
</li>
<li><h3><a href="CASES.html">CASES</a> -- hints keyword <code>:CASES</code>
</h3>
</li>
<li><h3><a href="CHECK-SUM.html">CHECK-SUM</a> -- assigning ``often unique'' integers to files and objects
</h3>
</li>
<li><h3><a href="CLAUSE-IDENTIFIER.html">CLAUSE-IDENTIFIER</a> -- the internal form of a <a href="GOAL-SPEC.html">goal-spec</a>
</h3>
</li>
<li><h3><a href="COMMAND.html">COMMAND</a> -- forms you type at the top-level, but...
</h3>
</li>
<li><h3><a href="COMMAND-DESCRIPTOR.html">COMMAND-DESCRIPTOR</a> -- an object describing a particular <a href="COMMAND.html">command</a> typed by the user
</h3>
</li>
<li><h3><a href="COMPUTED-HINTS.html">COMPUTED-HINTS</a> -- computing advice to the theorem proving process
</h3>
</li>
<li><h3><a href="CONSTRAINT.html">CONSTRAINT</a> -- restrictions on certain functions introduced in <code><a href="ENCAPSULATE.html">encapsulate</a></code> <a href="EVENTS.html">events</a>
</h3>
</li>
<li><h3><a href="COPYRIGHT.html">COPYRIGHT</a> -- ACL2 copyright, license, sponsorship
</h3>
</li>
<li><h3><a href="COROLLARY.html">COROLLARY</a> -- the corollary formula of a <a href="RUNE.html">rune</a>
</h3>
</li>
<li><h3><a href="CURRENT-PACKAGE.html">CURRENT-PACKAGE</a> -- the package used for reading and printing
</h3>
</li>
<li><h3><a href="DEFAULT-BACKCHAIN-LIMIT.html">DEFAULT-BACKCHAIN-LIMIT</a> -- specifying the backchain limit for a rule
</h3>
</li>
<li><h3><a href="DEFAULT-DEFUN-MODE.html">DEFAULT-DEFUN-MODE</a> -- the default <a href="DEFUN-MODE.html">defun-mode</a> of <code><a href="DEFUN.html">defun</a></code>'d functions
</h3>
</li>
<li><h3><a href="DEFAULT-HINTS.html">DEFAULT-HINTS</a> -- a list of hints added to every proof attempt
</h3>
</li>
<li><h3><a href="DEFAULT-PRINT-PROMPT.html">DEFAULT-PRINT-PROMPT</a> -- the default <a href="PROMPT.html">prompt</a> printed by <code><a href="LD.html">ld</a></code>
</h3>
</li>
<li><h3><a href="DEFUN-MODE.html">DEFUN-MODE</a> -- determines whether a function definition is a logical act
</h3>
</li>
<li><h3><a href="DEFUN-MODE-CAVEAT.html">DEFUN-MODE-CAVEAT</a> -- functions with <a href="DEFUN-MODE.html">defun-mode</a> of <code>:</code><code><a href="PROGRAM.html">program</a></code> considered unsound
</h3>
</li>
<li><h3><a href="DEFUNS.html">DEFUNS</a> -- an alternative to <code><a href="MUTUAL-RECURSION.html">mutual-recursion</a></code>
</h3>
</li>
<li><h3><a href="DISABLE-FORCING.html">DISABLE-FORCING</a> -- to disallow <code><a href="FORCE.html">force</a></code>d <code><a href="CASE-SPLIT.html">case-split</a></code>s
</h3>
</li>
<li><h3><a href="DISABLE-IMMEDIATE-FORCE-MODEP.html">DISABLE-IMMEDIATE-FORCE-MODEP</a> -- <a href="FORCE.html">force</a>d hypotheses are not attacked immediately
</h3>
</li>
<li><h3><a href="DISABLEDP.html">DISABLEDP</a> -- determine whether a given name or rune is disabled
</h3>
</li>
<li><h3><a href="DO-NOT.html">DO-NOT</a> -- hints keyword <code>:DO-NOT</code>
</h3>
</li>
<li><h3><a href="DO-NOT-INDUCT.html">DO-NOT-INDUCT</a> -- hints keyword <code>:DO-NOT-INDUCT</code>
</h3>
</li>
<li><h3><a href="DOUBLE-REWRITE.html">DOUBLE-REWRITE</a> -- cause a term to be rewritten twice
</h3>
</li>
<li><h3><a href="EMBEDDED-EVENT-FORM.html">EMBEDDED-EVENT-FORM</a> -- forms that may be embedded in other <a href="EVENTS.html">events</a>
</h3>
</li>
<li><h3><a href="ENABLE-FORCING.html">ENABLE-FORCING</a> -- to allow <code><a href="FORCE.html">force</a></code>d <code><a href="CASE.html">split</a></code>s
</h3>
</li>
<li><h3><a href="ENABLE-IMMEDIATE-FORCE-MODEP.html">ENABLE-IMMEDIATE-FORCE-MODEP</a> -- <a href="FORCE.html">force</a>d hypotheses are attacked immediately
</h3>
</li>
<li><h3><a href="ENTER-BOOT-STRAP-MODE.html">ENTER-BOOT-STRAP-MODE</a> -- The first millisecond of the Big Bang
</h3>
</li>
<li><h3><a href="ESCAPE-TO-COMMON-LISP.html">ESCAPE-TO-COMMON-LISP</a> -- escaping to Common Lisp
</h3>
</li>
<li><h3><a href="EVISCERATE-HIDE-TERMS.html">EVISCERATE-HIDE-TERMS</a> -- to print <code>(hide ...)</code> as <code><hidden></code>
</h3>
</li>
<li><h3><a href="EXECUTABLE-COUNTERPART.html">EXECUTABLE-COUNTERPART</a> -- a rule for computing the value of a function
</h3>
</li>
<li><h3><a href="EXIT-BOOT-STRAP-MODE.html">EXIT-BOOT-STRAP-MODE</a> -- the end of pre-history
</h3>
</li>
<li><h3><a href="EXPAND.html">EXPAND</a> -- hints keyword <code>:EXPAND</code>
</h3>
</li>
<li><h3><a href="EXTENDED-METAFUNCTIONS.html">EXTENDED-METAFUNCTIONS</a> -- state and context sensitive metafunctions
</h3>
</li>
<li><h3><a href="FAILED-FORCING.html">FAILED-FORCING</a> -- how to deal with a proof <a href="FAILURE.html">failure</a> in a forcing round
</h3>
</li>
<li><h3><a href="FAILURE.html">FAILURE</a> -- how to deal with a proof failure
</h3>
</li>
<li><h3><a href="FIND-RULES-OF-RUNE.html">FIND-RULES-OF-RUNE</a> -- find the rules named rune
</h3>
</li>
<li><h3><a href="FORCE.html">FORCE</a> -- identity function used to force a hypothesis
</h3>
</li>
<li><h3><a href="FORCING-ROUND.html">FORCING-ROUND</a> -- a section of a proof dealing with <a href="FORCE.html">force</a>d assumptions
</h3>
</li>
<li><h3><a href="GC$.html">GC$</a> -- invoke the garbage collector
</h3>
</li>
<li><h3><a href="GCL.html">GCL</a> -- tips on building and using ACL2 based on Gnu Common Lisp
</h3>
</li>
<li><h3><a href="GENERALIZED-BOOLEANS.html">GENERALIZED-BOOLEANS</a> -- potential soundness issues related to ACL2 predicates
</h3>
</li>
<li><h3><a href="GOAL-SPEC.html">GOAL-SPEC</a> -- to indicate where a hint is to be used
</h3>
</li>
<li><h3><a href="GUARD.html">GUARD</a> -- restricting the domain of a function
</h3>
</li>
<li><h3><a href="GUARD-HINTS.html">GUARD-HINTS</a> -- xargs keyword <code>:GUARD-HINTS</code>
</h3>
</li>
<li><h3><a href="HANDS-OFF.html">HANDS-OFF</a> -- hints keyword <code>:HANDS-OFF</code>
</h3>
</li>
<li><h3><a href="HIDE.html">HIDE</a> -- hide a term from the rewriter
</h3>
</li>
<li><h3><a href="HINTS.html">HINTS</a> -- advice to the theorem proving process
</h3>
</li>
<li><h3><a href="I-AM-HERE.html">I-AM-HERE</a> -- a convenient marker for use with <code><a href="REBUILD.html">rebuild</a></code>
</h3>
</li>
<li><h3><a href="IMMEDIATE-FORCE-MODEP.html">IMMEDIATE-FORCE-MODEP</a> -- when executable counterpart is <a href="ENABLE.html">enable</a>d,
<br><code> </code> <a href="FORCE.html">force</a>d hypotheses are attacked immediately
</h3>
</li>
<li><h3><a href="INDUCT.html">INDUCT</a> -- hints keyword <code>:INDUCT</code>
</h3>
</li>
<li><h3><a href="KEYWORD-COMMANDS.html">KEYWORD-COMMANDS</a> -- how keyword commands are processed
</h3>
</li>
<li><h3><a href="LAMBDA.html">LAMBDA</a> -- See <a href="TERM.html">term</a>.
</h3>
</li>
<li><h3><a href="LD-ERROR-ACTION.html">LD-ERROR-ACTION</a> -- determines <code><a href="LD.html">ld</a></code>'s response to an error
</h3>
</li>
<li><h3><a href="LD-ERROR-TRIPLES.html">LD-ERROR-TRIPLES</a> -- determines whether a form caused an error during <code><a href="LD.html">ld</a></code>
</h3>
</li>
<li><h3><a href="LD-EVISC-TUPLE.html">LD-EVISC-TUPLE</a> -- determines whether <code><a href="LD.html">ld</a></code> suppresses details when printing
</h3>
</li>
<li><h3><a href="LD-KEYWORD-ALIASES.html">LD-KEYWORD-ALIASES</a> -- allows the abbreviation of some keyword commands
</h3>
</li>
<li><h3><a href="LD-POST-EVAL-PRINT.html">LD-POST-EVAL-PRINT</a> -- determines whether and how <code><a href="LD.html">ld</a></code> prints the result of evaluation
</h3>
</li>
<li><h3><a href="LD-PRE-EVAL-FILTER.html">LD-PRE-EVAL-FILTER</a> -- determines which forms <code><a href="LD.html">ld</a></code> evaluates
</h3>
</li>
<li><h3><a href="LD-PRE-EVAL-PRINT.html">LD-PRE-EVAL-PRINT</a> -- determines whether <code><a href="LD.html">ld</a></code> prints the forms to be <code>eval</code>'d
</h3>
</li>
<li><h3><a href="LD-PROMPT.html">LD-PROMPT</a> -- determines the <a href="PROMPT.html">prompt</a> printed by <code><a href="LD.html">ld</a></code>
</h3>
</li>
<li><h3><a href="LD-QUERY-CONTROL-ALIST.html">LD-QUERY-CONTROL-ALIST</a> -- how to default answers to queries
</h3>
</li>
<li><h3><a href="LD-REDEFINITION-ACTION.html">LD-REDEFINITION-ACTION</a> -- to allow redefinition without undoing
</h3>
</li>
<li><h3><a href="LD-SKIP-PROOFSP.html">LD-SKIP-PROOFSP</a> -- how carefully ACL2 processes your <a href="COMMAND.html">command</a>s
</h3>
</li>
<li><h3><a href="LD-VERBOSE.html">LD-VERBOSE</a> -- determines whether <code><a href="LD.html">ld</a></code> prints ``ACL2 Loading ...''
</h3>
</li>
<li><h3><a href="LEMMA-INSTANCE.html">LEMMA-INSTANCE</a> -- an object denoting an instance of a theorem
</h3>
</li>
<li><h3><a href="LINEAR-ARITHMETIC.html">LINEAR-ARITHMETIC</a> -- A description of the linear arithmetic decision procedure
</h3>
</li>
<li><h3><a href="LOCAL-INCOMPATIBILITY.html">LOCAL-INCOMPATIBILITY</a> -- when non-local <a href="EVENTS.html">events</a> won't replay in isolation
</h3>
</li>
<li><h3><a href="LOGICAL-NAME.html">LOGICAL-NAME</a> -- a name created by a logical event
</h3>
</li>
<li><h3><a href="LOOP-STOPPER.html">LOOP-STOPPER</a> -- limit application of permutative rewrite rules
</h3>
</li>
<li><h3><a href="LP.html">LP</a> -- the Common Lisp entry to ACL2
</h3>
</li>
<li><h3><a href="MACRO-ARGS.html">MACRO-ARGS</a> -- the formals list of a macro definition
</h3>
</li>
<li><h3><a href="MEASURE.html">MEASURE</a> -- xargs keyword <code>:MEASURE</code>
</h3>
</li>
<li><h3><a href="MODE.html">MODE</a> -- xargs keyword <code>:MODE</code>
</h3>
</li>
<li><h3><a href="NAME.html">NAME</a> -- syntactic rules on logical names
</h3>
</li>
<li><h3><a href="NON-EXECUTABLE.html">NON-EXECUTABLE</a> -- xargs keyword <code>:NON-EXECUTABLE</code>
</h3>
</li>
<li><h3><a href="NON-LINEAR-ARITHMETIC.html">NON-LINEAR-ARITHMETIC</a> -- Non-linear Arithmetic
</h3>
</li>
<li><h3><a href="NONLINEARP.html">NONLINEARP</a> -- hints keyword <code>:NONLINEARP</code>
</h3>
</li>
<li><h3><a href="NORMALIZE.html">NORMALIZE</a> -- xargs keyword <code>:NORMALIZE</code>
</h3>
</li>
<li><h3><a href="NU-REWRITER.html">NU-REWRITER</a> -- rewriting <code>NTH</code>/<code>UPDATE-NTH</code> expressions
</h3>
</li>
<li><h3><a href="OBDD.html">OBDD</a> -- ordered binary decision diagrams with rewriting
</h3>
</li>
<li><h3><a href="ORDINALS.html">ORDINALS</a> -- ordinals in ACL2
</h3>
</li>
<li><h3><a href="OTF-FLG.html">OTF-FLG</a> -- pushing all the initial subgoals
</h3>
</li>
<li><h3><a href="PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS.html">PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS</a> -- re-defining undone <code><a href="DEFPKG.html">defpkg</a></code>s
</h3>
</li>
<li><h3><a href="PRINT-DOC-START-COLUMN.html">PRINT-DOC-START-COLUMN</a> -- printing the one-liner
</h3>
</li>
<li><h3><a href="PROMPT.html">PROMPT</a> -- the prompt printed by <code><a href="LD.html">ld</a></code>
</h3>
</li>
<li><h3><a href="PROOF-OF-WELL-FOUNDEDNESS.html">PROOF-OF-WELL-FOUNDEDNESS</a> -- a proof that <code><a href="O_lt_.html">o<</a></code> is well-founded on <code><a href="O-P.html">o-p</a></code>s
</h3>
</li>
<li><h3><a href="PSEUDO-TERMP.html">PSEUDO-TERMP</a> -- a predicate for recognizing term-like s-expressions
</h3>
</li>
<li><h3><a href="REDEF.html">REDEF</a> -- a common way to set <a href="LD-REDEFINITION-ACTION.html">ld-redefinition-action</a>
</h3>
</li>
<li><h3><a href="REDEF_bang_.html">REDEF!</a> -- system hacker's redefinition <a href="COMMAND.html">command</a>
</h3>
</li>
<li><h3><a href="REDEFINED-NAMES.html">REDEFINED-NAMES</a> -- to collect the names that have been redefined
</h3>
</li>
<li><h3><a href="REDUNDANT-EVENTS.html">REDUNDANT-EVENTS</a> -- allowing a name to be introduced ``twice''
</h3>
</li>
<li><h3><a href="RESTRICT.html">RESTRICT</a> -- hints keyword <code>:RESTRICT</code>
</h3>
</li>
<li><h3><a href="REWRITE-STACK-LIMIT.html">REWRITE-STACK-LIMIT</a> -- limiting the stack depth of the ACL2 rewriter
</h3>
</li>
<li><h3><a href="SAVING-AND-RESTORING.html">SAVING-AND-RESTORING</a> -- saving and restoring your logical state
</h3>
</li>
<li><h3><a href="SHOW-BODIES.html">SHOW-BODIES</a> -- show the potential definition bodies
</h3>
</li>
<li><h3><a href="SIGNATURE.html">SIGNATURE</a> -- how to specify the arity of a constrained function
</h3>
</li>
<li><h3><a href="SIMPLE.html">SIMPLE</a> -- <code>:</code><code><a href="DEFINITION.html">definition</a></code> and <code>:</code><code><a href="REWRITE.html">rewrite</a></code> rules used in preprocessing
</h3>
</li>
<li><h3><a href="SPECIOUS-SIMPLIFICATION.html">SPECIOUS-SIMPLIFICATION</a> -- nonproductive proof steps
</h3>
</li>
<li><h3><a href="STATE.html">STATE</a> -- the von Neumannesque ACL2 state object
</h3>
</li>
<li><h3><a href="STOBJS.html">STOBJS</a> -- xargs keyword <code>:STOBJS</code>
</h3>
</li>
<li><h3><a href="SUBVERSIVE-INDUCTIONS.html">SUBVERSIVE-INDUCTIONS</a> -- why we restrict <a href="ENCAPSULATE.html">encapsulate</a>d recursive functions
</h3>
</li>
<li><h3><a href="SUBVERSIVE-RECURSIONS.html">SUBVERSIVE-RECURSIONS</a> -- why we restrict <a href="ENCAPSULATE.html">encapsulate</a>d recursive functions
</h3>
</li>
<li><h3><a href="SYNTAX.html">SYNTAX</a> -- the syntax of ACL2 is that of Common Lisp
</h3>
</li>
<li><h3><a href="SYNTAXP.html">SYNTAXP</a> -- attach a heuristic filter on a <code>:</code><code><a href="REWRITE.html">rewrite</a></code>, <code>:</code><code><a href="META.html">meta</a></code>, or <code>:</code><code><a href="LINEAR.html">linear</a></code> rule
</h3>
</li>
<li><h3><a href="TERM.html">TERM</a> -- the three senses of well-formed ACL2 expressions or formulas
</h3>
</li>
<li><h3><a href="TERM-ORDER.html">TERM-ORDER</a> -- the ordering relation on terms used by ACL2
</h3>
</li>
<li><h3><a href="THE-METHOD.html">THE-METHOD</a> -- how to find proofs
</h3>
</li>
<li><h3><a href="TTAGS-SEEN.html">TTAGS-SEEN</a> -- list some declared trust tags (ttags)
</h3>
</li>
<li><h3><a href="TTREE.html">TTREE</a> -- tag trees
</h3>
</li>
<li><h3><a href="TYPE-SET.html">TYPE-SET</a> -- how type information is encoded in ACL2
</h3>
</li>
<li><h3><a href="UNTRANSLATE.html">UNTRANSLATE</a> -- See <a href="USER-DEFINED-FUNCTIONS-TABLE.html">user-defined-functions-table</a>.
</h3>
</li>
<li><h3><a href="USE.html">USE</a> -- hints keyword <code>:USE</code>
</h3>
</li>
<li><h3><a href="USING-COMPUTED-HINTS.html">USING-COMPUTED-HINTS</a> -- how to use computed hints
</h3>
</li>
<li><h3><a href="USING-COMPUTED-HINTS-1.html">USING-COMPUTED-HINTS-1</a> -- Driving Home the Basics
</h3>
</li>
<li><h3><a href="USING-COMPUTED-HINTS-2.html">USING-COMPUTED-HINTS-2</a> -- One Hint to Every Top-Level Goal in a Forcing Round
</h3>
</li>
<li><h3><a href="USING-COMPUTED-HINTS-3.html">USING-COMPUTED-HINTS-3</a> -- Hints as a Function of the Goal (not its Name)
</h3>
</li>
<li><h3><a href="USING-COMPUTED-HINTS-4.html">USING-COMPUTED-HINTS-4</a> -- Computing the Hints
</h3>
</li>
<li><h3><a href="USING-COMPUTED-HINTS-5.html">USING-COMPUTED-HINTS-5</a> -- Debugging Computed Hints
</h3>
</li>
<li><h3><a href="USING-COMPUTED-HINTS-6.html">USING-COMPUTED-HINTS-6</a> -- Using the computed-hint-replacement feature
</h3>
</li>
<li><h3><a href="USING-COMPUTED-HINTS-7.html">USING-COMPUTED-HINTS-7</a> -- Using the <code>stable-under-simplificationp</code> flag
</h3>
</li>
<li><h3><a href="USING-COMPUTED-HINTS-8.html">USING-COMPUTED-HINTS-8</a> -- Some Final Comments
</h3>
</li>
<li><h3><a href="VERSION.html">VERSION</a> -- ACL2 Version Number
</h3>
</li>
<li><h3><a href="WHY-BRR.html">WHY-BRR</a> -- an explanation of why ACL2 has an explicit <code><a href="BRR.html">brr</a></code> mode
</h3>
</li>
<li><h3><a href="WORLD.html">WORLD</a> -- ACL2 property lists and the ACL2 logical data base
</h3>
</li>
<li><h3><a href="WORMHOLE.html">WORMHOLE</a> -- <code><a href="LD.html">ld</a></code> without <code><a href="STATE.html">state</a></code> -- a short-cut to a parallel universe
</h3>
</li>
<li><h3><a href="WORMHOLE-P.html">WORMHOLE-P</a> -- predicate to determine if you are inside a <code><a href="WORMHOLE.html">wormhole</a></code>
</h3>
</li>
<li><h3><a href="XARGS.html">XARGS</a> -- giving <a href="HINTS.html">hints</a> to <code><a href="DEFUN.html">defun</a></code>
</h3>
</li>
</ul>
Perhaps as the system matures this section will become more
structured.
<br><br><br><a href="acl2-doc.html"><img src="llogo.gif"></a> <a href="acl2-doc-index.html"><img src="index.gif"></a>
</body>
</html>
|
