Kyle R. Burton on 23 Nov 2007 05:24:42 -0000

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

[philly-lambda] List Comprehensions in CL

  • From: "Kyle R. Burton" <>
  • To:
  • Subject: [philly-lambda] List Comprehensions in CL
  • Date: Fri, 23 Nov 2007 00:24:32 -0500
  • Authentication-results:; spf=pass ( domain of designates as permitted sender); dkim=pass (test mode)
  • Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed;; s=beta; h=domainkey-signature:received:received:message-id:date:from:to:subject:mime-version:content-type; bh=fyW4OAST/GtjUtMbaZK0yPvXxMD8ERjt2BmfNyPYMb8=; b=aSJmdLaWJGma4TomYT968iW6DTtS2+g16skFlID6pR0WzuwM1yxqv8/9TblP875HtCzZCS1xjh11kO67eECyKESTtkCQ8KefvfZIcWtVzTwzzgci9YyKkKaXcIEUQ0apRGRfk/ejSopwcNmoRsYpKOF0g1G2JOEi12PLT7cYuX0=
  • Mailing-list: list; contact
  • Reply-to:
  • Sender:

I just ran across this:

Playing around with it, it's less succinct than Erlang's list comprehensions, but for some reason playing with it in CL made it click a bit easier.

Has anyone else seen / used that library?  The Haskell-ish prelude functions?  The lazy defined, infinite lists from Haskell are intriguing...anyone know of a CL library out there that supports lazy evaluation?

What about the pattern matching libraries?


I also spent a bit of time playing with the library:

You received this message because you are subscribed to the Google Groups "Philly Lambda" group.
To unsubscribe from this group, send email to
For more options, visit this group at