Path: news.daimi.aau.dk!news.uni-c.dk!sunic!trane.uninett.no!eunet.no!nuug!EU.net!howland.reston.ans.net!xlink.net!rz.uni-karlsruhe.de!ma2s3!haible
From: haible@ma2s2.mathematik.uni-karlsruhe.de (Bruno Haible)
Newsgroups: comp.lang.beta,comp.lang.lisp
Subject: Re: Comparison: Beta - Lisp
Date: 9 Sep 1994 15:50:06 GMT
Organization: University of Karlsruhe, Germany
Lines: 18
Message-ID: <34q07e$n16@nz12.rz.uni-karlsruhe.de>
References: <34n2qe$d74@nz12.rz.uni-karlsruhe.de> <RV.94Sep8102514@tahoe.cs.brown.edu>
NNTP-Posting-Host: ma2s3.mathematik.uni-karlsruhe.de
Mime-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Keywords: lisp, beta, pattern, closure, funarg
Originator: haible@ma2s3
Xref: news.daimi.aau.dk comp.lang.beta:20 comp.lang.lisp:13171

> 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.  

From the point of view of a Lisp programmer, a pattern consists of

* a specification of variables (call them "variables" or "closure variables"
  or "slots"), and

* a piece of code which is executed after the storage for the variables has
  been allocated (call it "initialization method" or simply "program").

But that's only one of many aspects of patterns...


                    Bruno Haible
                    haible@ma2s2.mathematik.uni-karlsruhe.de