Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: "John Thingstad" <jpthing@xxxxxxxxx>
- Date: Thu, 10 Jul 2008 16:52:41 +0200
På Thu, 10 Jul 2008 16:19:30 +0200, skrev <jon.harrop.ms.sharp@xxxxxxxxx>:
On 10 Lug, 15:19, Jon Harrop <j...@xxxxxxxxxxxxxxxxx> wrote:...
BTW, what's exactly the difference between paren matching and pattern
matching?
Maybe you all Common Lispers don't need the latter because you already
have the further one?
Jon Harrop
pattern matching as in cl-ppcre, cl-yacc, cl-unify,...?
--------------
John Thingstad
.
- Follow-Ups:
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: Vassil Nikolov
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: Jon Harrop
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- References:
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: Jon Harrop
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: jon . harrop . ms . sharp
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: Marco Antoniotti
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: Jon Harrop
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: Marco Antoniotti
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: Jon Harrop
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- From: jon . harrop . ms . sharp
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- Prev by Date: Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- Next by Date: Re: access closure variable
- Previous by thread: Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- Next by thread: Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
- Index(es):
Relevant Pages
|