Return-Path: <John.Harrison-request@cl.cam.ac.uk>
Delivery-Date: 
Received: from ted.cs.uidaho.edu (no rfc931) by swan.cl.cam.ac.uk 
          with SMTP (PP-6.5) outside ac.uk; Wed, 12 May 1993 02:25:56 +0100
Received: by ted.cs.uidaho.edu (16.6/1.34) id AA13132;
          Tue, 11 May 93 18:14:38 -0700
Sender: info-hol-request@ted.cs.uidaho.edu
Errors-To: info-hol-request@ted.cs.uidaho.edu
Precedence: bulk
Received: from Hana.CS.UCLA.EDU by ted.cs.uidaho.edu (16.6/1.34) id AA13127;
          Tue, 11 May 93 18:14:34 -0700
Received: by hana.cs.ucla.edu (Sendmail 5.61a+YP/2.27) id AA12655;
          Tue, 11 May 93 18:14:32 -0700
Date: Tue, 11 May 93 18:14:32 -0700
From: toal@cs.ucla.edu (Ray J. Toal)
Message-Id: <9305120114.AA12655@hana.cs.ucla.edu>
To: info-hol@ted.cs.uidaho.edu
Subject: define_type again


Hi,

  I have seen in the past how some have defined recursive types
  more general than those that can be defined by define_type,
  for example

  type T = Num num | Rec (T list)

  I was wondering if anyone has ever done something like this:

  type store = Val num | Proc (store -> store)

Ray Toal