Newsgroups: comp.lang.postscript,comp.lang.forth,comp.lang.lisp,comp.lang.scheme,comp.lang.misc,comp.arch
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!agate!trib.apple.com!amd!netcomsv!netcomsv!netcom.com!hbaker
From: hbaker@netcom.com (Henry G. Baker)
Subject: Paper on Stack Machines available in WWW hypertext format
Message-ID: <hbakerD189JA.JK9@netcom.com>
Organization: nil
Date: Thu, 22 Dec 1994 19:45:10 GMT
Lines: 29
Xref: glinda.oz.cs.cmu.edu comp.lang.postscript:29084 comp.lang.forth:19193 comp.lang.lisp:16161 comp.lang.scheme:11644 comp.lang.misc:19712 comp.arch:55519

My paper, "Linear Logic and Permutation Stacks--The Forth Shall Be
First", from ACM Computer Architecture News 22, 1 (March 1994), 34-43,
is now available on the net in WWW hypertext (html) format at

ftp://ftp.netcom.com/pub/hb/hbaker/ForthStack.html

Some topics addressed:

 * Linear objects and stack architectures (of a particular type) are
an excellent match

 * How to compile Lisp w/closures into Postscript (or Forth)

 * How the Y combinator can be used to implement recursion; the Y
combinator in Postscript!

 * Large bibliography on stack architectures

----

(Please ignore some of the broken hypertext links from this paper for
now; they are still under construction.)

Henry Baker
Read (192.100.81.1) ftp.netcom.com:/pub/hb/hbaker/README for ftp-able papers.
WWW archive: ftp://ftp.netcom.com/pub/hb/hbaker/home.html
************* Note change of address ^^^        ^^^^
(It _is_ accessible, but Netcom is loaded; keep trying.)

