Newsgroups: comp.lang.beta,comp.lang.lisp
Path: news.daimi.aau.dk!news.uni-c.dk!sunic!pipex!howland.reston.ans.net!swrinde!sgiblab!brunix!cs!rv
From: rv@cs.brown.edu (rodrigo vanegas)
Subject: Re: Comparison: Beta - Lisp
In-Reply-To: haible@ma2s2.mathematik.uni-karlsruhe.de's message of 8 Sep 1994 13:15:58 GMT
Content-Type: text/plain
Message-ID: <RV.94Sep8102514@tahoe.cs.brown.edu>
Sender: news@cs.brown.edu
Organization: Dept. of Computer Science, Brown University
References: <34n2qe$d74@nz12.rz.uni-karlsruhe.de>
Mime-Version: 1.0
Date: Thu, 8 Sep 1994 15:25:14 GMT
Lines: 13
Xref: news.daimi.aau.dk comp.lang.beta:6 comp.lang.lisp:13132

In article <34n2qe$d74@nz12.rz.uni-karlsruhe.de>, haible@ma2s2.mathematik.uni-karlsruhe.de (Bruno Haible) writes:

> 4. PROGN, LET, Lisp closures, list objects, defstruct objects, CLOS instances
>    all correspond to "pattern"s.

So what are these "patterns" anyway?  It sounds as if they are very
close if not identical to lisp closures.  After all, can't each of the
above lisp stuff can be implemented as sugar for closures.  


rodrigo vanegas
rv@cs.brown.edu