Coalgebras and their logics
- 1 June 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 37 (2) , 57-77
- https://doi.org/10.1145/1140612.1140628
Abstract
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.Keywords
This publication has 29 references indexed in Scilit:
- A modal proof theory for final polynomial coalgebrasTheoretical Computer Science, 2006
- A tutorial on coinductive stream calculus and signal flow graphsTheoretical Computer Science, 2005
- Synthetic Topology: of Data Types and Classical SpacesElectronic Notes in Theoretical Computer Science, 2004
- A coalgebraic view on positive modal logicTheoretical Computer Science, 2004
- A hierarchy of probabilistic system typesTheoretical Computer Science, 2004
- On Expressivity and Compositionality in Logics for CoalgebrasElectronic Notes in Theoretical Computer Science, 2003
- Specifying coalgebras with modal logicTheoretical Computer Science, 2001
- Universal coalgebra: a theory of systemsTheoretical Computer Science, 2000
- Operations and equations for coalgebrasMathematical Structures in Computer Science, 1999
- Duality beyond sober spaces: Topological spaces and observation framesTheoretical Computer Science, 1995