Path: utzoo!attcan!uunet!husc6!bloom-beacon!BRILLIG.UMD.EDU!don
From: don@BRILLIG.UMD.EDU (Don Hopkins)
Newsgroups: comp.windows.x
Subject: Editor theorems
Message-ID: <8811170524.AA08756@brillig.umd.edu>
Date: 17 Nov 88 05:24:47 GMT
References: <1240@vsedev.VSE.COM>
Sender: daemon@bloom-beacon.MIT.EDU
Organization: The Internet
Lines: 17


   Date: 16 Nov 88 16:11:42 GMT
   From: vsedev!logan@uunet.uu.net  (James Logan III)

   In article <335@swbatl.UUCP> iso@swbatl.UUCP (SWBT Info Systems Guest Acct) writes:
   >I'm looking for pointers to info about editors (both character and
   >bit-mapped).  Things like best time/space complexity for screen
   >updates, inserts, deletes, and so on.  I'll be happy to summarize
   >to the net if there's enough interest.  In general, I'd like to
   >find out what theorems/proofs, if any, have been developed.

The Emacs screen display algorithm is described in the following:

Gosling, James A., "A Redisplay Algorithm,"
SIGPLAN Notices 16(6), pp. 123-129 (June 1981)

	-Don