Return-Path: <John.Harrison-request@cl.cam.ac.uk>
Delivery-Date: 
Received: from leopard.cs.byu.edu (no rfc931) by swan.cl.cam.ac.uk 
          with SMTP (PP-6.5) outside ac.uk; Fri, 15 Apr 1994 17:58:57 +0100
Received: by leopard.cs.byu.edu (1.37.109.8/16.2) id AA21526;
          Fri, 15 Apr 1994 10:38:36 -0600
Sender: info-hol-request@lal.cs.byu.edu
Errors-To: info-hol-request@lal.cs.byu.edu
Precedence: bulk
Received: from swan.cl.cam.ac.uk by leopard.cs.byu.edu 
          with SMTP (1.37.109.8/16.2) id AA21522;
          Fri, 15 Apr 1994 10:38:33 -0600
Received: from dunlin.cl.cam.ac.uk (user lcp (rfc931)) by swan.cl.cam.ac.uk 
          with SMTP (PP-6.5) to cl; Fri, 15 Apr 1994 17:38:42 +0100
To: info-hol@leopard.cs.byu.edu
Subject: HOL tutorial
Date: Fri, 15 Apr 94 17:38:38 +0100
From: Lawrence C Paulson <Larry.Paulson@cl.cam.ac.uk>
Message-Id: <"swan.cl.cam.:060470:940415163846"@cl.cam.ac.uk>


Can anybody suggest a clear, concise tutorial on higher-order logic?  A survey
article or book chapter would be ideal.

				Lawrence C Paulson, University Lecturer

				Computer Laboratory, University of Cambridge,
				Pembroke Street, Cambridge CB2 3QG, England
				Tel: +44(0)223 334623    Fax: +44(0)223 334678


