Kyle R. Burton on 23 Nov 2007 05:24:42 -0000 |
I just ran across this: http://blog.superadditive.com/2007/11/09/list-comprehensions-in-common-lisp/ 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? Kyle I also spent a bit of time playing with the library: http://kyle-burton.livejournal.com/8219.html --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Philly Lambda" group. To unsubscribe from this group, send email to philly-lambda-unsubscribe@googlegroups.com For more options, visit this group at http://groups.google.com/group/philly-lambda?hl=en -~----------~----~----~----~------~----~------~--~---
|
|