Copenhagen Programming Language Seminar
Categories with algebraic structure are well-known as models of concurrent computations for, e.g., formal grammars, Petri nets, and term rewriting. The approach, of obtaining concurrent computations by means of
an algebraic construction from a set of rules, can be generalised to graph transformation systems. The resulting computational model, a free double category with finite horizontal colimits, captures the established notion
of concurrency of DPO graph transformation.
Lars Birkedal. Administrative host:
Camilla Jensen. All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU and KVL.
COPLAS is sponsored by FIRST Graduate School.
To receive information about COPLAS talks by email, send a message to firstname.lastname@example.org with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see http://www.coplas.org