[Lift] Re: 1st draft of response to Martin's code challenge for scalable componentized lambda evaluator

Derek, Thanks! An engine is a natural next step! ;-) Best wishes, --greg On Wed, May 6, 2009 at 12:21 PM, Derek Chen-Becker wrote: > I'm not an expert at archetypes by any means, but I did kinda/sorta figure > out some basics when I put together the JPA archetypes. I'd be happy to help > if I

[Lift] Re: 1st draft of response to Martin's code challenge for scalable componentized lambda evaluator

I'm not an expert at archetypes by any means, but I did kinda/sorta figure out some basics when I put together the JPA archetypes. I'd be happy to help if I can. Going one further, I wonder if there would be a way to just make a single engine that could dynamically generate the artifacts it needs o

[Lift] Re: 1st draft of response to Martin's code challenge for scalable componentized lambda evaluator

Derek, et al, Thanks for all the kind feedback. i could use a little help with one thing. In addition to this project, i've also got - A project exploring how a relational query language is generated from a DSL describing typed sets of tuples - A pro

[Lift] Re: 1st draft of response to Martin's code challenge for scalable componentized lambda evaluator

We just can't be half-assed about anything, can we? ;) Seriously, this is really, really cool. I'm looking forward to seeing how this grows. Derek On Mon, May 4, 2009 at 7:55 PM, Meredith Gregory wrote: > Lifted, Scalad and lasses, > > Recently Martin passed along a little code challenge regardi

[Lift] Re: 1st draft of response to Martin's code challenge for scalable componentized lambda evaluator

Right ... I always found combinator parsers a very nice fit for BNF. I agree these parser are not trivial but I still like them a lot :) Br's, Marius On May 5, 5:48 pm, Meredith Gregory wrote: > Marius, > > Thanks for the query. Yes, there is a not so subtle point. Take a look at > the > gramm

[Lift] Re: 1st draft of response to Martin's code challenge for scalable componentized lambda evaluator

Marius, Thanks for the query. Yes, there is a not so subtle point. Take a look at the grammar. To my way of thinking, these are it's advantages. - Readable (and therefore maintainable) - Targets the following la

[Lift] Re: 1st draft of response to Martin's code challenge for scalable componentized lambda evaluator

Any reason why not using Scala's combinator parsers? ... or this is beyond the point of the exercise? Br's Marius On May 5, 4:55 am, Meredith Gregory wrote: > Lifted, Scalad and lasses, > > Recently Martin passed along a little code challenge regarding scalable > abstractions for building a lit

[Lift] Re: 1st draft of response to Martin's code challenge for scalable componentized lambda evaluator

Wow - once again greg your mathematical mind astounds me! Cheers, Tim On May 5, 2:55 am, Meredith Gregory wrote: > Lifted, Scalad and lasses, > > Recently Martin passed along a little code challenge regarding scalable > abstractions for building a little lambda calculus evaluator. i've finally

[Lift] Re: 1st draft of response to Martin's code challenge for scalable componentized lambda evaluator

Um, wow. Very cool. Chas. Meredith Gregory wrote: > Lifted, Scalad and lasses, > > Recently Martin passed along a little code challenge regarding scalable > abstractions for building a little lambda calculus evaluator. i've > finally put together a 1st draft response. i've still got a lot of