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; Sun, 14 May 1995 06:16:29 +0100
Received: by leopard.cs.byu.edu (1.37.109.15/16.2) id AA168827506;
          Sat, 13 May 1995 22:58:26 -0600
Sender: info-hol-request@lal.cs.byu.edu
Errors-To: info-hol-request@lal.cs.byu.edu
Precedence: list
Received: from maui.cs.ucla.edu by leopard.cs.byu.edu 
          with SMTP (1.37.109.15/16.2) id AA168757504;
          Sat, 13 May 1995 22:58:24 -0600
Received: from LocalHost.cs.ucla.edu by maui.cs.ucla.edu (Sendmail 4.1/3.27) 
          id AA18615; Sat, 13 May 95 21:57:16 PDT
Message-Id: <9505140457.AA18615@maui.cs.ucla.edu>
To: info-hol@leopard.cs.byu.edu
Subject: Sequences
Date: Sat, 13 May 95 21:57:16 PDT
From: chou@cs.ucla.edu


Finite sequences can be represented by lists;
infinite sequences can be represented by functions with domain :num.
But has anyone developed a theory of sequences that can deal with
both finite and infinite sequences?

I'd appreciate any pointers!!!

- Ching Tsun