Re: SBCL is now faster than Java, as fast as Ocaml, and getting better


On Fri, 11 Jul 2008 02:18:50 +0200, "John Thingstad" <jpthing@xxxxxxxxx> said:

| På Fri, 11 Jul 2008 00:25:13 +0200, skrev Vassil Nikolov
| <vnikolov+usenet@xxxxxxxxx>:

|| On Thu, 10 Jul 2008 16:52:41 +0200, "John Thingstad"
|| <jpthing@xxxxxxxxx> said:
||
|| |...
|| || BTW, what's exactly the difference between paren matching and pattern
|| || matching?
|| || ...
|| | pattern matching as in cl-ppcre, cl-yacc, cl-unify,...?
||
|| As in
||
|| f 0 = 0
|| f 1 = 1
|| f (n+2) = f n + f (n+1)
||
|| Unless we are talking about parent matching, that is...

| I think my point was that there are many types of pattern matching.
| Why should one be a part of the language and the others not?
| Seems to me to be pretty few places in the code where algebraic
| matching helps the code.

I did not follow up in disagreement with you...

---Vassil.


--
Peius melius est. ---Ricardus Gabriel.
.

Relevant Pages