home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.functional
- Path: sparky!uunet!snorkelwacker.mit.edu!ai-lab!cs.tu-berlin.de!wg
- From: wg@opal.cs.tu-berlin.de (Wolfgang Grieskamp)
- Subject: Re: Is efficient backtracking feasible in functional languages?
- Message-ID: <1992Nov16.230209.1022@cs.tu-berlin.de>
- Followup-To: comp.lang.functional
- Sender: news@cs.tu-berlin.de
- Reply-To: wg@cs.tu-berlin.de
- Organization: Technical University of Berlin
- References: <1992Nov11.171742.18783@eua.ericsson.se> <lg3071INN8m1@exodus.Eng.Sun.COM> <1992Nov12.220621.14143@cs.tu-berlin.de> <RABIN.92Nov14170933@nuthatch.CS.Yale.Edu>
- Date: Mon, 16 Nov 1992 23:02:09 GMT
- Lines: 20
-
- rabin@CS.Yale.Edu (Dan Rabin) writes:
-
- >Wolfgang Grieskamp refers to a scheme for converting a stream into an
- >efficient imperative counter.
- >
- >Readers of this newsgroup may wish to compare this work with the work
- >of Dick Waters [1], which has been implemented in both Lisp and Pascal
- >environments. A Lisp interface to such a facility is documented in
- >[2], Appendix A, pp. 923-955.
-
- I unfortunately have to point out that comparsion is not possible
- since the work I referred to is unpublished. The references I gave
- describe the general framework in which the mentioned scheme can be
- easily embeded as I believe.
-
- Just to avoid misunderstandings.
-
- --
- Wolfgang Grieskamp
- wg@cs.tu-berlin.de
-