Return-Path: Return-Path: Received: from ted.cs.uidaho.edu by swan.cl.cam.ac.uk with SMTP (PP-6.0) id <29570-0@swan.cl.cam.ac.uk>; Thu, 16 Jan 1992 21:39:39 +0000 Received: by ted.cs.uidaho.edu. (16.6/1.34) id AA24071; Thu, 16 Jan 92 13:19:56 -0800 Sender: info-hol-request@edu.uidaho.cs.ted Errors-To: info-hol-request@edu.uidaho.cs.ted Received: from panther.cs.uidaho.edu by ted.cs.uidaho.edu. (16.6/1.34) id AA24067; Thu, 16 Jan 92 13:19:53 -0800 Received: from localhost by panther.cs.uidaho.edu with SMTP id AA00911 (5.65c/IDA-1.4.4 for info-hol@ted.cs.uidaho.edu); Thu, 16 Jan 1992 13:24:47 -0800 Message-Id: <199201162124.AA00911@panther.cs.uidaho.edu> To: info-hol@edu.uidaho.cs.ted Subject: "What's out there?" questions Date: Thu, 16 Jan 92 13:24:47 -0800 From: Phil Windley X-Mts: smtp [ This came to me, but I assume it was meant for the list --- PJW ] -------------------------------------------------------------------- From: shb@sparta.oracorp.com Here are some questions on what people have already written in terms of automatic packages and how much of it I can get hold of. First, what about the team from IMEC in the HOL 1991 workshop that wrote a package that provided a convenient form of recursion in well-founded structures? Is it available? Is it related to the new HOL90 "ind_def" library? Second, have people written decision/proof procedures for Presburger (sp?) arithmetic, or the theory of <=, or the theory of =, with only universal quantifiers? The Penelope and Eves provers have such things, and people here have found them very useful. Is something like them available for HOL88 and/or HOL90? Steve