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

From: Vassil Nikolov <vnikolov+usenet@xxxxxxxxx>
Date: Thu, 10 Jul 2008 18:25:13 -0400

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

---Vassil.

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

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
- 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: John Thingstad

Prev by Date: Lisp Application Server
Next by Date: Re: Lisp Application Server
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

Relevant Pages

Re: Formal and informal type systems?
... >> matching has little to to with grammar based pattern matching of ... I meant argument pattern matching. ... > probably too much of a change to Ada. ... > This avoids the tedious definition of record types for simple pairs. ...
(comp.lang.ada)
Re: Lisp pattern matching libraries & difference between unification and pattern matching
... I started first with cl-unification, ... pattern matching and not full blown unification (although UNIFY:UNIFY ... write the SICP Prolog interpreter with them. ...
(comp.lang.lisp)
Re: Lisp pattern matching libraries & difference between unification and pattern matching
... different version than the one used in "structure matching". ... ML style pattern matching is designed to integrate ... cl-unification, for example: ... Deep down in OCaml there is a unification algorithm (unless some magic ...
(comp.lang.lisp)
Ada95 =>ciphertext only attack=>pattern matching...help!!!!
... and i want to conduct pattern matching on ... it, i have a dictionary in an array, with a parallel array running ... in the dictionary array (the ciphertext is stored in a string of 7000 ...
(comp.programming)
Re: SBCL is now faster than Java, as fast as Ocaml, and getting better
... | I think my point was that there are many types of pattern matching. ...
(comp.lang.lisp)