Lambda the Ultimate

Haskell-Coloured Petri Nets
started 5/17/2004; 5:45:02 AM - last post 5/18/2004; 12:01:30 PM

Andris Birkmanis - Haskell-Coloured Petri Nets

5/17/2004; 5:45:02 AM (reads: 162, responses: 4)

We have shown that Coloured Petri Nets with a functional inscription language can be embedded in the inscription language in a pleasingly simple way. Using this or a similar embedding, high-level Petri Nets can be used as a modelling tool by functional programmers.

More or less traditional EDSL.

But be prepared for this:

This offers the chance to close a significant gap in the use of functional languages -- the lack of a graphical specification language.

Don't post we-hate-UML replies, I already know that :-)

andrew cooke - Re: Haskell-Coloured Petri Nets

5/18/2004; 7:41:13 AM (reads: 121, responses: 0)

didn't you post this earlier? or a similar paper, that gives a foundation for graphical specification of functional languages and used petri nets as an example (it's somewhere on my to-read pile - i guess my questions is, if this is a different paper, which is better (more general))?

Andris Birkmanis - Re: Haskell-Coloured Petri Nets

5/18/2004; 8:54:02 AM (reads: 118, responses: 1)

didn't you post this earlier?

Hmm, the only paper I can remember was using graphical diagrams because it was from the category land... So I guess it's not the same. Either that, or I am loosing my memories :-(

andrew cooke - Re: Haskell-Coloured Petri Nets

5/18/2004; 11:52:14 AM (reads: 93, responses: 0)

i was thinking of this (which i still haven't read) http://user.cs.tu-berlin.de/~martti/fase2002.pdf

sorry, should have spent 30secs digging up the link before i first posted. it's not the same...

Andris Birkmanis - Re: Haskell-Coloured Petri Nets

5/18/2004; 12:01:30 PM (reads: 93, responses: 0)

Ah, that one was not about either graphics or functional languages, it was trying to unify different approaches to bringing modularity into some wide-spread formalisms. That unification means abstracting from the formalisms and even methods of modularization (or componentization), and focusing on universal, ehm, well, properties of these approaches. Very categorical in spirit, though not completely in letter.

I am currently on a (fading) Petri-net spree, so probably I overestimated PL value of some of the papers in that thread. Sorry about that... Though, on the other hand, you should be thankful I did not post all 30 Petri-net papers I've read during that spree :-) They could have made a separate department :-)