Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!nntp.club.cc.cmu.edu!news.sei.cmu.edu!cis.ohio-state.edu!math.ohio-state.edu!howland.reston.ans.net!news.moneng.mei.com!sol.ctr.columbia.edu!news.msfc.nasa.gov!news.larc.nasa.gov!saimiri.primate.wisc.edu!aplcenmp!hall
From: hall@aplcenmp.apl.jhu.edu (Marty Hall)
Subject: Re: Quick Sort in LISP?
Message-ID: <CxB895.8nv@aplcenmp.apl.jhu.edu>
Organization: JHU/APL AI Lab, Hopkins P/T CS Faculty
References: <MARCOXA.94Oct4145138@mosaic.nyu.edu> <Cx79rK.LGB@aplcenmp.apl.jhu.edu> <hbakerCx9B5L.K4C@netcom.com>
Date: Fri, 7 Oct 1994 15:55:53 GMT
Lines: 19

In article <hbakerCx9B5L.K4C@netcom.com> hbaker@netcom.com (Henry G. Baker) writes:

>Both vector and list versions of Quicksort in Lisp are discussed in:
>
>"A 'Linear Logic' Quicksort".  ACM Sigplan Notices 29,2 (Feb. 1994), 13-18.
>
>Also available in my ftp directory in compressed Postscript (.ps.Z) form.
>
>      Henry Baker
>      Read ftp.netcom.com:/pub/hbaker/README for info on ftp-able papers.

I hadn't gotten to that paper yet, but I want to reiterate what an
earlier poster said, that the papers here are a great resource. I
highly recommend them. (Thanks!)
						- Marty
(proclaim '(inline skates))
hall@aplcenmp.apl.jhu.edu


