research-article

Semantics column

Author:

Michael MisloveAuthors Info & Claims

ACM SIGLOG News, Volume 2, Issue 2

Pages 14 - 15

https://doi.org/10.1145/2766189.2766192

Published: 22 April 2015 Publication History

Get Access

Abstract

This quarter's column is by ALEXANDRA SILVA, who works on coalgebras, among other things. Alexandra provides us with an introduction to coalgebras and their role in computational models, and uses them to analyze a fascinating illustrative example: Brzozowski's Algorithm, which takes as input a finite state automaton, and as if by magic, produces the minimal automaton accepting the same language. Unraveling this algorithm and revealing its underlying mechanism is a lovely example of coalgebras at work, and indeed, the results that Alexandra describes have been the topic of an invited lecture at LICS [Panangaden 2013].

References

[1]

P. Aczel. 1998 Non-well-founded Sets. CSLI Lecture Notes 14, Stanford, CA: Stanford University, Center for the Study of Language and Information, pp. xx+137.

Google Scholar

[2]

P. Aczel and M. Mendler. 1989 A final coalgebra theorem. Lecture Notes in Computer Science 389 (1989), pp 357--365.

Digital Library

Google Scholar

[3]

J. Barwise and J. Etchemendy. 1987 The Liar. Oxford University Press (1987).

Google Scholar

[4]

M. Boffa. 1968 Les ensembles extraordinaires. Bulletin de la Societe Mathematique de Belgique XX: 3--15 (1968).

Google Scholar

[5]

M. Forti and F. Honsell. 1983 Set theory with free construction principles. Ann. Scuola Norm. Sup. Pisa, Cl. Sci. 10 (1983), pp. 493522.

Google Scholar

[6]

M. Mislove, L. S. Moss, and F. J. Oles. 1991 Non-well-founded sets as ideal fixed points. Information and Computation 93 (1991), pp. 1654.

Digital Library

Google Scholar

[7]

P. Panangaden. 2013 Duality in Logic and Computation. Logic in Computer Science Symposium, plenary lecture, June 2013.

Digital Library

Google Scholar

[8]

J. Rutten. 1992 Processes as terms: non-well-founded models for bisimulation. Mathematical Structures in Computer Science 2 (1992), pp. 257--275.

Crossref

Google Scholar

[9]

D. Scott. 1960 A different kind of model for set theory. Unpublished paper, talk given at the 1960 Stanford Congress of Logic, Methodology and Philosophy of Science.

Google Scholar

Index Terms

Semantics column
1. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

Semantics column

This quarter's Semantics column is devoted to a survey of BI-Logic - the logic of bunched implications - by David Pym. BI-Logics have a broad range of applications, including program verification. In particular they underpin Separation Logic which has ...
Semantics column

In this quarter's column, Stephen Brookes and Peter O'Hearn describe how Concurrent Separation Logic (CSL) arose, including a little about the soundness proof and a discussion of later developments that arose from CSL. The column is especially timely, ...
Session details: Semantics column

It's a special pleasure to introduce this quarter's Semantics Column. The author is Prakash Panangaden, a longtime friend and leader in the theoretical community who needs no introduction to the SIGLOG community. His hard work was fundamental for the ...

Comments

Information & Contributors

Information

Published In

ACM SIGLOG News Volume 2, Issue 2

April 2015

36 pages

EISSN:2372-3491

DOI:10.1145/2766189

Editor:
Andrzej Murawski
University of Warwick

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 April 2015

Published in SIGLOG Volume 2, Issue 2

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
27
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Index Terms

Recommendations