Journal Information
ISSN / EISSN : 2372-3491 / 2372-3491
Total articles ≅ 215
Current Coverage

Latest articles in this journal

Sandra Alves, Sandra Kiefer, Ana Sokolova
ACM SIGLOG News, Volume 9, pp 31-33;

This report follows the two latest editions of the International Workshop for Women in Logic (WiL), which took place on June 30 th in 2020 and June 27 th in 2021, respectively. Due to the Corona virus pandemic, both events were held virtually, with significant success. The 4 th Women in Logic workshop (WiL'20) was part of "Paris Nord Summer of LoVe 2020" , a joint event on LOgic and VErification at Université Paris 13, made of Petri Nets 2020, IJCAR 2020, FSCD 2020, and more than 20 satellite events. The 5 th edition of the workshop (WiL'21) was a satellite event of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'21). Both editions were conducted via Zoom, and the 2020 edition was partially streamed on YouTube (unfortunately, the stream was dropped due to an unsubstantiated complaint and only tardily restored).
Michael Mislove
ACM SIGLOG News, Volume 9, pp 3-6;

After an extended hiatus, the Semantics column is returning with this issue of the Newsletter. The subject of this quarter's column is Call-By-Push-Value , written by Paul B. Levy. CBPV is Paul's invention, and it's an interesting and powerful calculus that incorporates both the Call-By-Value and Call-By-Name calculi. Moreover, it's also simpler to describe, as Paul's column demonstrates. After a short introduction to set the stage, and an outline of relevant components of the pure functional programming -- i.e., the simply-typed lambda calculus, Paul describes CBPV and how it incorporates a wide range of computational effects. He then indicates how CBN and CBV each can be translated into CBPV.
Paul Blain Levy
ACM SIGLOG News, Volume 9, pp 7-29;

Call-by-push-value (CBPV) is a form of typed λ-calculus that plays a fundamental role in the study of computational effects. This article is intended to be an accessible introduction. I thank Mike Mislove and SIGLOG for inviting me to expound one of my favourite subjects.
Jorge A Pérez
ACM SIGLOG News, Volume 9, pp 30-30;

In this installment, Sandra Alves (University of Porto), Sandra Kiefer (RWTH Aachen University/University of Warsaw), and Ana Sokolova (University of Salzburg) report on the 2020 and 2021 editions of the International Workshop for Women in Logic (WiL). 1
Ranko Lazić
ACM SIGLOG News, Volume 9, pp 5-5;

In this highly readable article, Aiswarya takes a novel approach and reminds us of deep links between verification and the study of classes of graphs based on notions such as treewidth. Starting gently and providing ample examples, we are led to the state of the art and interesting open questions.
C Aiswarya
ACM SIGLOG News, Volume 9, pp 6-21;

Treewidth, or similar measures, have been a quite useful technique in the verification of infinite state systems. We illustrate, through examples, how such measures help in analyzing a system.
Jorge A. Pérez
ACM SIGLOG News, Volume 9, pp 22-22;

In this new installment, Niccolò Veltri (Tallinn University of Technology) reports on the 23rd International Symposium on Principles and Practice of Declarative Programming (PPDP 2021) and the 31st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2021), two co-located symposia for which he served as general chair.
Back to Top Top