SIGACT News Logic Column 15 Riccardo Pucella Northeastern University Boston, MA 02115 USA riccardo@ccs.neu.edu Some comments about the last Logic Column, on nominal logic. Pierre Lescanne points out that the terminology de Bruijn levels was introduced in the paper Explicit Substitutions with de Bruijn s Levels, by Pierre Lescanne and Jocelyne Rouyer-Degli, presented at the 1995 RTA conference. He also points out that Stoy diagrams were probably invented by Stoy, but appear in work by Bourbaki as early as 1939 (published in 1954). Merci, Pierre. That article also initiated what is bound to be an interesting discussion. The critique of higherorder abstract syntax in that article prompted Karl Crary and Robert Harper to prepare a response to the leveled criticisms. The response should appear in an upcoming Column. In this issue, Alexander Kurz describes recent work on the topic of specifying properties of transition systems. It turns out that by giving a suitably abstract description of transition systems as coalgebras, we can derive logics for capturing properties of these transition systems in a rather elegant way. I will let you read the details below. I am always looking for contributions. If you have any suggestion concerning the content of the Logic Column, or if you would like to contribute by writing a column yourself, feel free to get in touch with me. Coalgebras and Their Logics1 Alexander Kurz University of Leicester, UK Introduction Transition systems pervade much of computer science. This article outlines the beginnings of a general theory of speci cation languages for transition systems. More speci cally, transition systems are generalised to coalgebras. Speci cation languages together with their proof systems, in the following called (logical or modal) calculi, are presented by the associated classes of algebras c Alexander Kurz, 2006. ACM SIGACT News June 2006 Vol. 37, No. 2
/lp/association-for-computing-machinery/sigact-news-logic-column-15-Rf5fBUquid