From @MCC.COM:bouler@mcc.com  Tue Feb 13 10:21:44 1990
Received: by iris.ucdavis.edu (5.57/UCD.EECS.2.0)
        id AA20092; Tue, 13 Feb 90 10:21:44 PST
Received: from MCC.COM by clover.ucdavis.edu (5.59/UCD.EECS.1.11)
        id AA27195; Tue, 13 Feb 90 10:26:20 PST
Received: from peano by MCC.COM with TCP/SMTP; Tue 13 Feb 90 12:08:47-CST
Date: Tue, 13 Feb 90 11:00:17 CST
From: bouler@mcc.com (Mark Bouler)
Posted-Date: Tue, 13 Feb 90 11:00:17 CST
Message-Id: <9002131700.AA04473@peano>
Received: by peano (4.0/ACTv4.1i)
        id AA04473; Tue, 13 Feb 90 11:00:17 CST
To: info-hol@clover.ucdavis.edu
Subject:  Tactics for arithmetical reasoning


I am using HOL to solve verification conditions generated by the
specification language ASLAN. Typically, these conditions are goals
which can be solved by simple arithmetic reasoning, for example

        ([],"((x_old > 0 ) /\ (x = x_old + 1)) => (x > 0)")

Does anyone have some tactics for doing such proofs (i.e., ones which rely on
simple arithmetic properties of the integers)? Phil Windley was kind enough to
give me some tactics which normalize arithmetic expressions. Any help would be
appreciated.
                                        Thanks,
                                        Mark Bouler
                                        bouler@mcc

