
Received: from scaup.cl.cam.ac.uk by Steve.CL.Cam.AC.UK
          with SMTP/TCP/IP over Ethernet id a006847; 19 Oct 88 18:12 BST
Via:  uk.ac.ucl.cs.nss; 19 Oct 88 17:09 GMT  (UK.AC.Cam.Cl.scaup)
Received: from clover.ucdavis.edu by NSS.Cs.Ucl.AC.UK   via Satnet with SMTP
           id aa05929; 19 Oct 88 17:28 BST
Received: from cheetah.ucdavis.edu by clover.ucdavis.edu (5.59/UCD.EECS.1.0)
        id AA25563; Wed, 19 Oct 88 09:27:35 PDT
Received: by cheetah.ucdavis.edu (AIX  2.2/3.14)
        id AA01059; Wed, 19 Oct 88 09:33:47 PDT
Message-Id: <8810191633.AA01059@cheetah.ucdavis.edu>
Qotw: In any organization, there will always be one person who knows
      what is going on; eventually, this person will be fired.
Pointers: (916) 752-7324/3168
To: info-hol@edu.ucdavis.clover
Subject: vgrind def for HOL
Date: Wed, 19 Oct 88 09:33:46 -0800
From: Phil Windley <windley@edu.ucdavis.cheetah>
Sender: windley <windley%edu.ucdavis.cheetah@edu.ucdavis.clover>
Status: RO


This message includes a vgrind definition for HOL.  If you use a UNIX
system, there is probably a program called vgrind that is used for nicely
formatting program listings.  Vgrind requires a definition file so that it
knows what the keywords are, what characters start comments, etc.  You can
save this definition in a file and use it for printing HOL listings.  Ask
your system administrator for help if you have problems.

Please let me know about any improvements that you make so that I can
include them.

--phil--

Phil Windley                          |  windley@iris.ucdavis.edu
Division of Computer Science          |  ucbvax!ucdavis!iris!windley
College of Engineering                |  (916) 752-7324 (or 3168)
University of California, Davis       |  Davis, CA 95616


--------------------------- cut here ---------------------------------

hol|hol|HOL:\
        :pb=(^\dnew_theory\d`\p`;;)|(^\dextend_theory\d`\p`;;):\
        :bb=\(|[:\
        :be=\)|]:\
        :cb=%:ce=%:\
        :sb=`:se=`:\
        :tl:\
        :kw=
             abstype \
             and \
             axiom \
             axioms\
             begin \
             binders \
             close_theory \
             constants \
             definition \
             definitions \
             do \
             else \
             end \
             extend_theory\
             failwith \
             hd \
             if \
             in \
             infixes \
             it \
             let \
             letrec \
             letref\
             load_theory \
             loop \
             new_axiom \
             new_binder \
             new_binder_definition \
             new_constant \
             new_definition \
             new_infix \
             new_infix_definition \
             new_parent \
             new_prim_rec_definition \
             new_theory \
             new_type \
             not\
             null\
             or \
             parents \
             print_theory \
             prove_thm \
             rectype \
             then \
             theorem \
             tl \
             type \
             typeabbrev \
             types \
             where \
             while \
             with \
        :
