![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Reconciling structural and nominal syntax in the language of diagrams
![]() Reconciling structural and nominal syntax in the language of diagramsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Paul Taylor. I present a new syntax for diagrams which combines the compositional style of combinators and the flat relational style of hardware languages such as Verilog or VHDL . The new syntax combines and subsumes the two styles and it has a simple sound and complete axiomatisation. (The speaker has had to postpone the talk to a later date.) This talk is part of the Theoretical computer science seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsType the title of a new list here Contemporary History Type the title of a new list hereOther talksTBA TBC TBA Hunt for an Earth-twin Life : it’s out there, but what and why ? The tragic destiny of Mileva Marić Einstein |