File: Subsumption_of_Induction_Candidates_in_App_Example.html

package info (click to toggle)
acl2 3.1-1
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 36,712 kB
  • ctags: 38,396
  • sloc: lisp: 464,023; makefile: 5,470; sh: 86; csh: 47; cpp: 25; ansic: 22
file content (24 lines) | stat: -rw-r--r-- 764 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
<html>
<head><title>Subsumption_of_Induction_Candidates_in_App_Example.html  --  ACL2 Version 3.1</title></head>
<body text=#000000 bgcolor="#FFFFFF">
<h2>Subsumption of Induction Candidates in App Example</h2>
<p>
After collecting induction suggestions from these three terms

<pre>
(app <b>a</B> b)<p>

(app <b>b</B> c)<p>

(app <b>a</B> (app b c))
</pre>

the system notices that the first and last suggest the same decomposition
of <code>a</code>.  So we are left with two ideas about how to induct:<p>

Decompose <b>a</B> as we would to unwind (app <b>a</B> b).<p>

Decompose <b>b</B> as we would to unwind (app <b>b</B> c).
<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>