Re: [Haskell-cafe] DSL for task dependencies

I've always liked the semantics of Unity - they seem the right sort of thing to construct such a system on - they also permit concepts such as partial completion and recovery from failure. Used to use this as one of the concurrency models I taught - see http://www.amazon.com/Parallel-Program-Design-Mani-Chandy/dp/0201058669 . It is one of those friday afternoon thoughts about constructing distributed, fault tolerant systems that have formal semantics, can have a rich set of pre/post conditions so that 'average joe' could write script-lets in it and it could take over the monitoring and (normal) fault management of some of our distributed systems. On 18 Mar 2011, at 04:43, Conal Elliott wrote:

Speaking of which, for a while now I've been interested in designs of make-like systems that have precise & simple (denotational) semantics with pleasant properties. What Peter Landin called "denotative" (as opposed to functional-looking but semantically ill- defined or intractable).

Norman Ramsey (cc'd) pointed me to the Vesta system from DEC SRC. If anyone knows of other related experiments, I'd appreciate hearing.

- Conal

On Thu, Mar 17, 2011 at 1:31 PM, David Peixotto wrote: Hi Serge,

You may be thinking of the Shake DSL presented by Neil Mitchell at last years Haskell Implementers Workshop. Slides and video are available from: http://haskell.org/haskellwiki/HaskellImplementorsWorkshop/2010

Max Bolingbroke has an open source implementation available here: https://github.com/batterseapower/openshake

Hope that helps.

-David

On Mar 17, 2011, at 3:00 PM, Serge Le Huitouze wrote:

...

Hi Haskellers!

I think I remember reading a blog post or web page describing a EDSL to describe tasks and their dependencies "a la" make.

Can anyone point me to such published material?

Thanks in advance.

--serge

---

Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe