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

From: jon.harrop.ms.sharp@xxxxxxxxx
Date: Thu, 10 Jul 2008 07:19:30 -0700 (PDT)

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
.

Follow-Ups:
- Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
  - From: John Thingstad

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

Prev by Date: Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
Next by Date: Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
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):
- Date
- Thread